Distributed Overlay Formation in Heterogeneous Wireless Sensor Networks

The scale and functional complexity of future-generation wireless sensor networks will call for a non-homogeneous architecture, in which different sensors play different logical roles or functions, or have different physical capabilities in terms of energy, computing power, or network bandwidth. When sensors of the same group need to communicate with each other, their communications often have to pass through other sensors, thus forming an overlay on top of the wireless sensor network. The topology of the overlay is critical. It must have a low diameter to reduce the communication latency between those sensors. It also needs to avoid using other sensors for relaying the communications as much as possible, so as to preserve the energy of other sensors. In this paper, we propose a distributed overlay formation protocol taking account of the above factors. Through simulation, we compare our protocol with two overlay formation protocols, one that generates a fully connected topology and the other a minimum spanning tree. The results show that our protocol can achieve better performance both in message latency and energy consumption.

[1]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[3]  Richard E. Neapolitan,et al.  Foundations of Algorithms Using C++ Pseudocode , 2003 .

[4]  Xiaoxing Guo,et al.  Broadcasting for network lifetime maximization in wireless sensor networks , 2004, SECON.

[5]  Richard E. Neapolitan,et al.  Foundations Of Algorithms Using Java Pseudocode , 2004 .

[6]  Yong Ma,et al.  System lifetime optimization for heterogeneous sensor networks with a hub-spoke technology , 2004, IEEE Transactions on Mobile Computing.

[7]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[8]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[9]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[10]  Catherine Rosenberg,et al.  A minimum cost heterogeneous sensor network with a lifetime constraint , 2005, IEEE Transactions on Mobile Computing.

[11]  Catherine Rosenberg,et al.  Homogeneous vs heterogeneous clustered sensor networks: a comparative study , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[12]  Nitin H. Vaidya,et al.  Minimizing energy consumption in sensor networks using a wakeup radio , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[13]  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).

[14]  Mitali Singh,et al.  A Hierarchical Model For Distributed Collaborative Computation In Wireless Sensor Networks , 2004, Int. J. Found. Comput. Sci..

[15]  Sanjay Jha,et al.  Optimising expanding ring search for multi-hop wireless networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[16]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.