The Community for Technology Leaders
Green Image
ABSTRACT
A k-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-dominating set can be used to disseminate topology update packets or route request packets, in which the search space is reduced to the set. In mobile ad hoc networks, a connected k-dominating set may become disconnected due to node mobility or switch-off, necessitating the reformation of the k-dominating set. In this paper, we discuss a couple of sufficient conditions for the connectivity of a k-dominating set. Each condition can be verified in a distributed manner by a node that keeps only 2-hop neighborhood information. With the help of these conditions, we propose a distributed algorithm able to efficiently maintain a connected k-dominating set in mobile ad hoc networks. Simulations show that our connected k-dominating set is stable and needs little maintenance overhead in the Random-Walk Mobility and Gauss-Markov Mobility Models.
INDEX TERMS
Algorithm/Protocol Design and Analysis, mobile ad hoc network, Network topology, localized communication, routing protocols.
CITATION

C. Lin, H. Yang and M. Tsai, "Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks," in IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 444-457, 2007.
doi:10.1109/TMC.2007.70736
87 ms
(Ver 3.3 (11022016))