Abstract
To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to construct MCDS, the best among which is adopting the two-stage idea, that is, to construct a maximum independent set (MIS) firstly and then realize the connectivity through the Steiner tree construction algorithm. For the first stage, this paper proposes an improved collaborative coverage algorithm for solving maximum independent set (IC-MIS), which expands the selection of the dominating point from two-hop neighbor to three-hop neighbor. The coverage efficiency has been improved under the condition of complete coverage. For the second stage, this paper respectively proposes an improved Kruskal–Steiner tree construction algorithm (IK–ST) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution. Finally, the simulation results show that the algorithm proposed in this paper is a great improvement over the previous algorithm in optimizing the scale of the connected dominating set (CDS).
Highlights
An ad hoc sensor network is a kind of network with features of large scale, self-organization, and freedom from support from infrastructure [1]
The connected dominant set (CDS) becomes the best choice for an ad hoc sensor network as the virtual backbone network [8,9,10], which guarantees the operation of the network by constructing the minimum connected dominant set (MCDS).The purpose of this paper is to ensure the connection of communication network links through different topological structure control, so as to improve the network performance and effectively increase the coverage of the network
Among all the approximation algorithms for distributed CDS construction in unit-disk graph (UDG), the most effective one is the one proposed by Rajiv Misra to construct the connected dominating set based on the heuristic algorithm of collaborative coverage
Summary
An ad hoc sensor network is a kind of network with features of large scale, self-organization, and freedom from support from infrastructure [1]. The connected dominant set (CDS) becomes the best choice for an ad hoc sensor network as the virtual backbone network [8,9,10], which guarantees the operation of the network by constructing the minimum connected dominant set (MCDS).The purpose of this paper is to ensure the connection of communication network links through different topological structure control, so as to improve the network performance and effectively increase the coverage of the network. Under the condition that all the requirements are met, the number of the connected dominating set nodes should be as small as possible so that more nodes can save energy by periodic dormancy It can reduce the size of the routing table, reduce the cost of computation, and maintain the cost of routing tables.
Sign-in/Register to view highlights & summary 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.
