An Algorithm to Construct Minimum Velocity Based Stable Connected Dominating Sets for MANETs using Strong Neighborhoods
Haili Zheng, Chuangen Gao, Yue Peng Yan, Baobao Chai · Procedia Computer Science · 2020
This paper investigates a stable connected dominating set (CDS) construction algorithm for mobile ad hoc networks(MANETs). The proposed algorithm is based on the node velocity using the notion of Strong Neighborhood determined by the Threshold Neighborhood Distance Ratio (TNDR) constraint, which contributes to a stable CDS without considering unstable edges in the network. If a node has the lowest speed in all competing nodes with at least one neighbor that has not been explored, it is selected as a dominator. When a node becomes a CDS node, we say that all its neighbors are explored and have the opportunities to participate in the next iteration. This process of selecting nodes continues until all nodes in the network are explored. The tradeoff is that the size of the nodes and edges in CDS are slightly larger.