Balanced routing in ad-hoc networks

Ad-hoc networks, as we have seen, consist of a set of terminals which communicate with one another by adjusting the transmission power depending on the distance of the closest terminal(s).

The problem we want to solve here is that of setting the transmission power of each terminal so that all terminals remain alive as long as possible (i.e. their transmission power, which determines the battery life), and so that communication between each pair of terminals does not require more than a given number k of hops.

Definition:

  • n: number of terminals
  • x_i, y_i: Euclidean coordinates of terminal i at a given instance;
  • k: maximum number of hops on a path from source to destination;
  • f(d): the battery consumption required to transmit to a distance d;

Formulate and solve an Optimization model aimed at solving this problem for a set of time frames S=\{1,2\ldots, N\}, where the position of several terminals changes (although just a bit) from an instant to the other. Simulate the behavior of the system by ignoring the result of the Optimization process and having the terminals change their transmission power until a proper path, with less than k hops, can be established. Measure the corresponding battery life.

Note: terminals here probably don’t have to be modeled as queues.

The instance files for this project will be provided soon.