Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks

A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can be used to disseminate topology update packets or route request packets, in which the flooding search space is reduced to the set, resulting in significant flooding overhead reduction in broadcast-related applications. In mobile ad hoc networks, a connected k-hop dominating set may become disconnected due to node mobility or switch-off, necessitating the reformation of the k-hop dominating set. In this paper, we identify a sufficient condition that guarantees the connectivity of the virtual backbone. The condition can be verified in a distributed manner by the node only having the link information of its neighbors2 . With the help of this condition, we propose a distributed algorithm to efficiently construct and maintain connected k-hop dominating sets in mobile ad hoc networks. Simulations show that our conn...

• Type: Journal
• Year: 2008
• Where: TMC
• Authors: Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
• Keywords: Connected K-hop, Dominating Set, Mobile Ad Hoc Network, TMC 2008