Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
