Optimal Routing and Data Aggregation for Maximizing Lifetime of Wireless Sensor Networks
Authors:
- 3 March 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 16 (4) , 892-903
Abstract
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data aggregation and routing. We adopt a model to integrate data aggregation with the underlying routing scheme and present a smoothing approximation function for the optimization problem. The necessary and sufficient conditions for achieving the optimality are derived and a distributed gradient algorithm is designed accordingly. We show that the proposed scheme can significantly reduce the data traffic and improve the network lifetime. The distributed algorithm can converge to the optimal value efficiently under all network configurations.Keywords
This publication has 25 references indexed in Scilit:
- Recursive approximation of the high dimensional max functionOperations Research Letters, 2005
- Spatio-temporal correlation: theory and applications for wireless sensor networksComputer Networks, 2004
- The impact of spatial correlation on routing with compression in wireless sensor networks2004
- Topology control for wireless sensor networks2003
- Localization from mere connectivity2003
- Protocols for self-organization of a wireless sensor networkIEEE Wireless Communications, 2000
- Smoothing methods for convex inequalities and linear complementarity problemsMathematical Programming, 1995
- AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATIONEngineering Optimization, 1992
- Algorithms for the minimax transportation problemNaval Research Logistics Quarterly, 1986
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977