Maintaining CDS in Mobile Ad Hoc Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Pervasive and Mobile Computing
The impact of delay in dominating set and neighbor elimination based broadcasting in ad hoc networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Energy-efficient dominating tree construction in wireless ad hoc and sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Fast connected dominating set construction in mobile ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Message-efficient CDS construction in MANETs
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Connected dominating set has been used widely in multi-hop ad hoc networks (MANET) by numerous routing, broadcast and collision avoidance protocols. Although computing minimum connected dominating set is known to be NP-hard, many protocols have been proposed to construct a sub-optimal dominating set. However, these protocols are either too complicated, needing non-local information, or not adaptive to topology changes. In this paper, we present a MAC-Layer Timer-based Connected Dominating Set Construction Protocol. In our protocol, candidate nodes set up a timer based on the number of uncovered neighbors and determines whether or not to join the dominating set when the timer expires. The protocol is simple, distributed, inexpensive, and adaptive to station mobility. The simulation results show that our protocol can construct connected dominating set using 35% to 60% less nodes than other distributed connected dominating set protocols.