Construction and Maintenance of K-Hop CDS in Mobile Ad Hoc Networks

摘要

Since mobile ad hoc networks do not have fixedor predefined infrastructures, nodes need to frequently floodcontrol messages to discovery and maintain routes, whichcauses performance problems in traffic and energy consumption, contention, and collision. A general solution is to constructa virtual backbone as the basis of routing and broadcasting, and the Connected Dominating Set (CDS) has been widely used. This paper presents a distributed approach to constructingand maintaining a k-hop CDS. A unique characteristic thatdifferentiates the proposed approach from existing ones is that, any value can be specified for k, and a larger k contributesto a smaller CDS. If k is large enough, the resulting CDSwill contain only a single node. Simulation experiment resultsdemonstrate the effectiveness of the proposed approach.