A Tree-based Energy-Efficient Algorithm for Data-CentricWireless Sensor Networks

The nature of wireless sensor networks make them suitable for a great variety of applications, especially over wide areas, or in remote or hostile locations; however, such environments make battery capacity an especially important concern, where replacing or recharging of batteries is in- feasible for one reason or another. Battery capacity restrictions on highly energy-constrained sensor networks can be mitigated, by adopting data-aggregation techniques and by managing the scheduling of nodes. These effectively reduce the overall amount of data transmitted, thereby conserving energy. In this paper, we address the construction of energy-efficient data-aggregation trees, an NP-problem, in different rounds of communication, seeking to maximize the lifetime of heterogeneous sensor networks. This problem is subject to constraints on such networks: battery capacity, data-sensing scheduling, and round calculation. We derive a near-optimal primal feasible solution using Lagrangean relaxation. The experimental results show that our proposed algorithm outperforms similar algorithms.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Ibrahim Korpeoglu,et al.  Power efficient data gathering and aggregation in wireless sensor networks , 2003, SGMD.

[3]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

[4]  Shu-Ping Lin,et al.  Efficient data-centric routing in wireless sensor networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[5]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .

[6]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[7]  Yean-Fu Wen,et al.  Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks , 2006, EUC.

[8]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[9]  Yean-Fu Wen,et al.  Optimal energy-efficient routing for wireless sensor networks , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[10]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[11]  Pei-Ling Chiu,et al.  A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks , 2005, IEEE Communications Letters.

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

[13]  Hong-Hsu Yen,et al.  Near-optimal tree-based access network design , 2005, Comput. Commun..

[14]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[15]  Yean-Fu Wen,et al.  Multi-sink data aggregation routing and scheduling with dynamic radii in WSNs , 2006, IEEE Communications Letters.

[16]  C. M. Shetty,et al.  Lagrangian Duality and Saddle Point Optimality Conditions , 2005 .

[17]  Shu-Ping Lin,et al.  Energy-Efficient Data-Centric Routing in Wireless Sensor Networks , 2005, IEICE Trans. Commun..

[18]  B. Krishnamachari,et al.  Analysis of energy-efficient, fair routing in wireless sensor networks through non-linear optimization , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).