Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks

Wireless ad hoc and sensor networks (WSNs) often require a connected dominating set (CDS) as the underlying virtual backbone for efficient routing. Nodes in a CDS have extra computation and communication load for their role as dominator, subjecting them to an early exhaustion of their battery. A simple mechanism to address this problem is to switch from one CDS to another fresh CDS, rotating the active CDS through a disjoint set of CDSs. This gives rise to the connected domatic partition (CDP) problem, which essentially involves partitioning the nodes V(G) of a graph G into node disjoint CDSs. We have developed a distributed algorithm for constructing the CDP using our maximal independent set (MlS)-based proximity heuristics, which depends only on connectivity information and does not rely on geographic or geometric information. We show that the size of a CDP that is identified by our algorithm is at least [delta+1/beta(c+1)] - f, where delta is the minimum node degree of G, beta les 2, c les 11 is a constant for a unit disk graph (UDG), and the expected value of f is epsidelta|V|, where epsi Lt 1 is a positive constant, and delta ges 48. Results of varied testing of our algorithm are positive even for a network of a large number of sensor nodes. Our scheme also performs better than other related techniques such as the ID-based scheme.

[1]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[2]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[3]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[4]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[5]  Sarma B. K. Vrudhula,et al.  Battery lifetime prediction for energy-aware computing , 2002, ISLPED '02.

[6]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[7]  G. Simon,et al.  Simulation-based optimization of communication protocols for large-scale wireless sensor networks , 2003, 2003 IEEE Aerospace Conference Proceedings (Cat. No.03TH8652).

[8]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[9]  Sarma B. K. Vrudhula,et al.  Energy management for battery-powered embedded systems , 2003, TECS.

[10]  Makoto Takizawa,et al.  A Survey on Clustering Algorithms for Wireless Sensor Networks , 2010, 2010 13th International Conference on Network-Based Information Systems.

[11]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[12]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[13]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[14]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[15]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[16]  Uriel Feige,et al.  Approximating the domatic number , 2000, STOC '00.

[17]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[18]  Douglas F. Rall,et al.  Connected Domatic Number in Planar Graphs , 2001 .

[19]  Bohdan Zelinka,et al.  Connected domatic number of a graph , 1986 .

[20]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.