Heuristic algorithms for real-time data aggregation in wireless sensor networks

In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best.

[1]  Ernst Althaus,et al.  Approximating k-hop minimum-spanning trees , 2005, Oper. Res. Lett..

[2]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[3]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[4]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees (extended abstract) , 1991, SCG '91.

[5]  Samir Khuller,et al.  Low-Degree Spanning Trees of Small Weight , 1996, SIAM J. Comput..

[6]  R. Ravi,et al.  Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.

[7]  D. Leang,et al.  Smart SensorDVB: sensor network development boards with smart antennas , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).

[8]  Laurent Alfandari,et al.  Approximating minimum spanning tree of depth 2 , 1999 .

[9]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

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

[11]  Jan M. Rabaey,et al.  Data funneling: routing with aggregation and compression for wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..