Energy-Aware Fair Routing in Wireless Sensor Networks with Maximum Data Collection
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 8, 3438-3443
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Distributed algorithms for maximum lifetime routing in wireless sensor networks2005
- Maximum lifetime routing in wireless ad-hoc networks2005
- Maximum Lifetime Routing in Wireless Sensor NetworksIEEE/ACM Transactions on Networking, 2004
- Simultaneous Routing and Resource Allocation Via Dual DecompositionIEEE Transactions on Communications, 2004
- Routing for network capacity maximization in energy-constrained ad-hoc networks2004
- Energy efficient routing in ad hoc disaster recovery networks2004
- Online power-aware routing in wireless Ad-hoc networks2001
- Fair end-to-end window-based congestion controlIEEE/ACM Transactions on Networking, 2000
- Nonlinear ProgrammingJournal of the Operational Research Society, 1997