This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Timer-Based CDS Construction in Wireless Ad Hoc Networks
October 2011 (vol. 10 no. 10)
pp. 1388-1402
Kazuya Sakai, Ohio State University, Columbus
Scott C.-H. Huang, National Tsing Hua University, Taiwan
Wei-Shinn Ku, Auburn University, Auburn
Min-Te Sun, National Central University, Jhongli
Xiuzhen Cheng, The George Washington University, Washington D.C.
The connected dominating set (CDS) has been extensively used for routing and broadcast in wireless ad hoc networks. While existing CDS protocols are successful in constructing CDS of small size, they either require localized information beyond immediate neighbors, lack the mechanism to properly handle nodal mobility, or involve lengthy recovery procedure when CDS becomes corrupted. In this paper, we introduce the timer-based CDS protocols, which first elect a number of initiators distributively and then utilize timers to construct a CDS from initiators with the minimum localized information. We demonstrate that our CDS protocols are capable of maintaining CDS in the presence of changes of network topology. Depending on the number of initiators, there are two versions of our timer-based CDS protocols. The Single-Initiator (SI) generates the smallest CDS among protocols with mobility handling capability. Built on top of SI, the Multi-Initiator (MI) version removes the single point of failure at single-initiator and possesses most advantages of SI. We evaluate our protocols by both the ns-2 simulation and an analytical model. Compared with the other known CDS protocols, the simulation results demonstrate that both SI and MI produce and maintain CDS of very competitive size. The analytical model shows the expected convergence time and the number of messages required by SI and MI in the construction of CDS, which match closely to our simulation results. This helps to establish the validity of our simulation.

[1] J. Blum, M. Ding, A. Thaeler, and X. Cheng, "Connected Dominating Set in Sensor Networks and MANETs," Handbook of Combinatorial Optimization, pp. 329-369, Kluwer Academic Publishers, 2005.
[2] J. Wu, "Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 866-881, Sept. 2002.
[3] J. Cartigny, D. Simplot, and I. Stojmenovic, "Localized Minimum-Energy Broadcasting in Ad-Hoc Networks," Proc. IEEE INFOCOM, pp. 2210-2217, Mar. 2003.
[4] A. Helmy, S. Garg, P. Pamu, and N. Nahata, "CARD: A Contact-Based Architecture for Resource Discovery in Ad Hoc Networks," Mobile Networks and Applications, vol. 10, no. 1, pp. 99-113, 2004.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[6] F. Dai and J. Wu, "On Constructing k-Connected k-Dominating Set in Wireless Networks," Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2005.
[7] Y. Wu and Y. Li, "Construction Algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks," Proc. Ninth ACM MobiHoc, May 2008.
[8] Y. Wu, F. Wang, M.T. Thai, and Y. Li, "Constructing Algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks," Proc. IEEE Military Comm. Conf. (MILCOM), pp. 29-31, Oct. 2007.
[9] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks," Proc. ACM MobiCom, July 2001.
[10] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, "On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks," J. Comm. and Networks, vol. 4, no. 1, pp. 59-70, 2002.
[11] S. Yang, J. Wu, and F. Dai, "Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 12, pp. 1601-1613, Dec. 2008.
[12] J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), pp. 7-14, Aug. 1999.
[13] F. Dai and J. Wu, "An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[14] I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[15] D. Simplot-Ryl, I. Stojmenovic, and J. Wu, "Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks," Handbook of Sensor Networks: Algorithms and Architectures, pp. 343-379, Wiley, 2005.
[16] P.J. Wang, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 141-149, Apr. 2002.
[17] K.M. Alzoubi, P.-J. Wan, and O. Frieder, "Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 157-164, June 2002.
[18] P.-J. Wan, L. Wang, and F. Yao, "Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 337-344, June 2008.
[19] Y. Li, M.T. Thai, F. Wang, C.-W. Yi, P.-J. Wan, and D.-Z. Du, "On Greedy Construction of Connected Dominating Sets in Wireless Networks," Wireless Comm. and Mobile Computing, vol. 5, no. 8, pp. 927-932, 2005.
[20] C.R. Lin and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks," IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
[21] F.G. Nocetti, J.S. Gonzalez, and I. Stojmenovic, "Connectivity Based k-Hop Clustering in Wireless Networks," Telecomm. Systems, vol. 22, pp. 1-4, 2003.
[22] Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed., PWS Publishing Co., 1997.
[23] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[24] B.S. Baker, "Approximation Algorithms for NP-Complete Problems on Planar Graphs," J. ACM, vol. 41, no. 1, pp. 153-180, 1994.
[25] S. Basagni, M. Mastrogiovanni, A. Panconesi, and C. Petrioli, "Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 4, pp. 292-306, Apr. 2006.
[26] S. Basagni, M. Mastrogiovanni, and C. Petrioli, "A Performance Comparison of Protocols for Clustering and Backbone Formation in Large Scale Ad Hoc Networks," Proc. IEEE Conf. Mobile Ad-Hoc and Sensor Systems, pp. 70-79, Oct. 2004.
[27] K. Sakai, F. Shen, K.M. Kim, M.-T. Sun, and H. Okada, "Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm. (ICC), May 2008.
[28] "IEEE 802.11b Standard," http://standards.ieee.org/getieee802/download 802.11b-1999.pdf, 2011.
[29] D. Zhou, M.-T. Sun, and T. Lai, "A Timer-Based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks," Proc. Int'l Symp. Applications and the Internet (SAINT), pp. 2-8, Jan. 2005.
[30] "The Network Simulator (ns-2)," http://www.isi.edu/nsnamns/, 2011.
[31] W.-J. Hsu, K. Merchant, H.-W.S., C.-H. Hsu, and A. Helmy, "Weighted Waypoint Mobility Model and its Impact on Ad Hoc Networks," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 9, no. 1, pp. 59-63, 2005.
[32] "Mobilab: Community-Wide Library of Mobility and Wireless Networks Measurements," http://nile.usc.eduMobiLib/, 2009.

Index Terms:
Connected dominating set, virtual backbone, ad hoc networks, distributed algorithms.
Citation:
Kazuya Sakai, Scott C.-H. Huang, Wei-Shinn Ku, Min-Te Sun, Xiuzhen Cheng, "Timer-Based CDS Construction in Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 10, pp. 1388-1402, Oct. 2011, doi:10.1109/TMC.2010.244
Usage of this product signifies your acceptance of the Terms of Use.