Abstract
To improve the network performance and quality of service (QoS) requirement, a connected dominated subset of nodes in wireless network is selected to form a virtual backbone. However the backbone tends to be rather large for large-scaled wireless network. Thus, there is a need for effective approaches to construct d-hop connected dominating sets (d-CDS), so that the size of the dominating sets can be reduced greatly. In this paper, we design a scheme for d-CDS problem in unit disk graph (UDG). The main strategy is partition to clusters, from which the d-hop dominating sets (d-DS) is selected separately. Then d-DS selected are connected together to form d-CDS. Performance and detailed analysis are also provided.
Sign-in/Register to access full text options 
Free) 
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 call
