Activating the Hot Spot Problem by Switching Multiple Sinks in Wireless Sensor Networks

In many-to-one wireless sensor networks, there exists an unbalanced power consumption problem; that is, nodes near the data sink or base station, called hot spots, have a high probability of forwarding a high amount of packets and die early. Most of previous work is dedicated to constructing a long-lived aggregation tree, while leaving the hot spot problem unsolved. When the locations of sinks are given and thus fixed, this work attempts to alleviate the hot spot problem by exploiting techniques to balance power consumption for nodes in the tree by switching multiple fixed sinks. The first balancing technique is called manipulating multiple long-lived trees (MMLT), which constructs multiple long-lived data aggregation trees for multiple sinks, and cyclically switches a data aggregation tree to another, after a sink collects information for a predefined period of time. To reduce overhead, we further propose another technique which constructs only a single tree and shares it with all sink nodes. To evaluate the performance of these two balancing techniques, we run simulations with various setup environments and compare them with the balanced tree method.

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  Gianluca Mazzini,et al.  On the energy impact of four information delivery methods in wireless sensor networks , 2005, IEEE Communications Letters.

[3]  Gregory J. Pottie,et al.  Balanced aggregation trees for routing correlated data in wireless sensor networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[4]  Abraham O. Fapojuwo,et al.  A centralized energy-efficient routing protocol for wireless sensor networks , 2005, IEEE Communications Magazine.

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

[6]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[7]  Qing Zhao,et al.  On the lifetime of wireless sensor networks , 2005, IEEE Communications Letters.

[8]  Cem Ersoy,et al.  Multiple sink network design problem in large scale wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[9]  Xin Liu,et al.  Minimum energy accumulative routing in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[11]  Sangha Kim,et al.  A Energy Conservation Scheme to Maintain Data Aggregation Tree in Sensor Networks , 2005, 2005 Asia-Pacific Conference on Communications.

[12]  Martin Vetterli,et al.  Network correlated data gathering with explicit communication: NP-completeness and algorithms , 2006 .

[13]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[14]  Ki Jun Han,et al.  A power efficient routing protocol based on balanced tree in wireless sensor networks , 2005, First International Conference on Distributed Frameworks for Multimedia Applications.

[15]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

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

[17]  Zhao Cheng,et al.  On the problem of unbalanced load distribution in wireless sensor networks , 2004, IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004..

[18]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[19]  Katia Obraczka,et al.  The impact of timing in data aggregation for sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[20]  Leandros Tassiulas,et al.  Maximum lifetime routing in wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[21]  Braham Barkat,et al.  Signal processing techniques for landmine detection using impulse ground penetrating radar , 2002 .

[22]  Cristina V. Lopes,et al.  State-driven energy optimization in wireless sensor networks , 2005, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05).

[23]  Zongkai Yang,et al.  Energy aware data gathering based on adaptive modulation scaling in wireless sensor networks , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[24]  D. Agrawal,et al.  Tree based data aggregation in sensor networks using polynomial regression , 2005, 2005 7th International Conference on Information Fusion.

[25]  Fei Hu,et al.  Data Aggregation in Distributed Sensor Networks: Towards An Adaptive Timing Control , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).

[26]  Archan Misra,et al.  Minimum energy paths for reliable communication in multi-hop wireless networks , 2002, MobiHoc '02.

[27]  Mohamed F. Younis,et al.  A constrained shortest-path energy-aware routing algorithm for wireless sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[28]  Himanshu Gupta,et al.  Variable radii connected sensor cover in sensor networks , 2004, SECON.