Optimal Routing and Data Aggregation for Maximizing Lifetime of Wireless Sensor Networks

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.

[1]  Özgür B. Akan,et al.  Spatio-temporal Characteristics of Point and Field Sources in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[2]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[3]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[4]  Cunqing Hua,et al.  Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks , 2008, IEEE/ACM Trans. Netw..

[5]  Baltasar Beferull-Lozano,et al.  On network correlated data gathering , 2004, IEEE INFOCOM 2004.

[6]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[7]  Ramesh Govindan,et al.  The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.

[8]  Ritesh Madan,et al.  Distributed algorithms for maximum lifetime routing in wireless sensor networks , 2006, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Teresa H. Y. Meng,et al.  Minimum energy mobile wireless networks , 1999, IEEE J. Sel. Areas Commun..

[10]  M. Teboulle,et al.  A smoothing technique for nondifferentiable optimization problems , 1988 .

[11]  Defeng Sun,et al.  Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems , 2002 .

[12]  R. Ahuja.  Algorithms for the minimax transportation problem , 1986 .

[13]  J. B. G. Frenk,et al.  Recursive Approximation of the High Dimensional Max Function , 2003, Oper. Res. Lett..

[14]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[15]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[16]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[17]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[18]  Özgür B. Akan,et al.  Spatio-temporal correlation: theory and applications for wireless sensor networks , 2004, Comput. Networks.

[19]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[20]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[21]  Roger Wattenhofer,et al.  Gathering correlated data in sensor networks , 2004, DIALM-POMC '04.

[22]  Li Xingsi,et al.  AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATION , 1992 .

[23]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[24]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[25]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[26]  Olvi L. Mangasarian,et al.  Smoothing methods for convex inequalities and linear complementarity problems , 1995, Math. Program..

[27]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[28]  Klara Nahrstedt,et al.  A Utility-based Distributed Maximum Lifetime Routing Algorithm forWireless Networks , 2005, QSHINE.

[29]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[30]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[31]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[32]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).