Skip to Main Content
This paper considers the problem of routing in sensor networks from the point of view od data collection. That is, given the initial amount of battery energy in each node, the aim is to determine how much data can each source transmit until the network is partitioned (i. e., until the nodes cannot find end-to-end routes to their respective sinks). In addition, to respond to some specific applications' requirements, when determining such nodal data volume distribution, fairness among nodes is taken into account. The problem is formulated as a concave utility maximization and a sub-gradient algorithm is proposed to solve it distributively. Some numerical results are given and the convergence of the algorithm is discussed.