This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
April 2009 (vol. 8 no. 4)
pp. 488-499
Rajiv Misra, Indian Institute of Technology, Kharagpur
Chittaranjan Mandal, Indian Institute of Technlogy, Kharagpur
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 (MIS)-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 \lfloor{\frac{\delta+1}{\beta(c+1)}}\rfloor-f, where \delta is the minimum node degree of G, \beta\leq 2, c\leq 11 is a constant for a unit disk graph (UDG), and the expected value of f is \epsilon\delta|V|, where \epsilon \ll 1 is a positive constant, and \delta \geq 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] I.F. Akyildiz , W. Su , Y. Sankarasubramaniam , and E. Cayirci , “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[2] B. Das , R. Sivakumar , and V. Bharghavan , “Routing in Ad Hoc Networks Using a Spine,” Proc. Sixth Int'l Conf. Computer Comm. and Networks (IC3N '97), p. 34, 1997.
[3] V. Bharghavan and B. Das , “Some Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC '97), pp. 376-380, Jan. 1997.
[4] D. Rakhmatov , S. Vrudhula , and D.A. Wallach , “Battery Lifetime Prediction for Energy-Aware Computing,” Proc. Int'l Symp. Low Power Electronics and Design (ISLPED '02), 2002.
[5] D. Rakhmatov and S. Vrudhula , “Energy Management for Battery-Powered Embedded Systems,” IEEE Trans. Embedded Computing Systems, vol. 2, no. 3, pp. 277-324, 2003.
[6] B.L. Hartnell and D.F. Rall , “Connected Domatic Number in Planar Graph,” Czechoslovak Math. J., vol. 126, no. 51, pp. 173-179, 2001.
[7] S.V. Pemmaraju and I.A. Pirwani , “Energy Conservation via Domatic Partitions,” Proc. ACM MobiHoc, pp. 143-154, 2006.
[8] U. Feige , M.M. Halldórsson , G. Kortsarz , and A. Srinivasan , “Approximating the Domatic Number,” SIAM J. Computing, vol. 32, no. 1, pp. 172-195, 2003.
[9] T.W. Haynes , S.T. Hedetniemi , and P.J. Slater , Fundamentals of Domination in Graphs. CRC Press, 1998.
[10] M. Cardei , D. Maccallum , M.X. Cheng , M. Min , X. Jia , D. Li , and D. Du , “Wireless Sensor Networks with Energy Efficient Organization,” J. Interconnection Networks, vol. 3, pp. 213-229, 2002.
[11] F. Kuhn , T. Moscibroda , and R. Wattenhofer , “On the Locality of Bounded Growth,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 60-68, 2005.
[12] W. Wu , H. Du , X. Jia , Y. Li , and S.C.H. Huang , “Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs,” Theoretical Computer Science, vol. 352, no. 1, pp.1-7, 2006.
[13] J. Blum , M. Ding , A. Thaeler , and X. Cheng , Connected Dominating Set in Sensor Networks and MANETs, pp. 329-369. Kluwer Academic Publishers, 2004.
[14] B. Zelinka , “Connected Domatic Number of a Graph,” Math. Slovaca, vol. 36, pp. 387-392, 1986.
[15] B.N. Clark , C.J. Colbourn , and D.S. Johnson , “Unit Disk Graphs,” Discrete Math., vol. 86, nos. 1-3, pp. 165-177, Jan. 1990.
[16] M.V. Marathe , H. Breu , H.B. Hunt III , S.S. Ravi , and D.J. Rosenkrantz , “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp. 59-68, 1995.
[17] P.-J. Wan , K.M. Alzoubi , and O. Frieder , “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, 2004.
[18] A.A. Abbasi and M. Younis , “A Survey on Clustering Algorithms for Wireless Sensor Networks,” Computer Comm., vol. 30, nos. 14-15, pp. 2826-2841, 2007.
[19] M. Cardei , M. Cheng , X. Cheng , and D. Du , “Connected Dominating Set in Ad Hoc Wireless Networks,” Proc. Sixth Int'l Conf. Computer Science and Informatics (CS&I), 2002.
[20] N.A. Lynch , Distributed Algorithms. Morgan Kaufmann, 1996.
[21] C. Bettstetter , “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. ACM MobiHoc, pp. 80-91, 2002.
[22] G. Simon , P. Volgyesi , M. Maroti , and A. Ledeczi , “Simulation-Based Optimization of Communication Protocols for Large-Scale Wireless Sensor Neworks,” Proc. IEEE Aerospace Conf., Mar. 2003.

Index Terms:
Connected dominating set (CDS), connected domatic partition (CDP), routing backbone, maximal independent set (MIS), proximity heuristics.
Citation:
Rajiv Misra, Chittaranjan Mandal, "Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 4, pp. 488-499, April 2009, doi:10.1109/TMC.2008.128
Usage of this product signifies your acceptance of the Terms of Use.