Stability analysis of analytical hierarchy process clustering protocol in mobile ad hoc networks
International Journal of Communication Networks and Distributed Systems
STAB-WIN: Self Organized, Topology Control Ability Backbone Node in Wireless Networks
Wireless Personal Communications: An International Journal
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)
Computers and Electrical Engineering
| Hi-index | 0.00 |
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.