Maintaining CDS in Mobile Ad Hoc Networks

The connected dominating set (CDS) has been generally used for routing and broadcasting in mobile ad hoc networks (MANETs). To reduce the cost of routing table maintenance, it is preferred that the size of CDS to be as small as possible. A number of protocols have been proposed to construct CDS with competitive size, however only few are capable of maintaining CDS under topology changes. In this research, we propose a novel extended mobility handling algorithm which will not only shorten the recovery time of CDS mobility handling but also keep a competitive size of CDS. Our simulation results validate that the algorithm successfully achieves its design goals. In addition, we will introduce an analytical model for the convergence time and the number of messages required by the CDS construction.

[1]  Kazuya Sakai,et al.  Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks , 2008, 2008 IEEE International Conference on Communications.

[2]  Ahmed Helmy,et al.  Weighted waypoint mobility model and its impact on ad hoc networks , 2005, MOCO.

[3]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[4]  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.

[5]  Dong Zhou,et al.  A timer-based protocol for connected dominating set construction in IEEE 802.11 multihop mobile ad hoc networks , 2005, The 2005 Symposium on Applications and the Internet.

[6]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[7]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[9]  Ivan Stojmenovic,et al.  Localized minimum-energy broadcasting in ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).