Abstract
Constructing a communications topology with fault tolerance and effective coverage plays an important role in wireless sensor networks. This paper is aimed at constructing and maintaining a biconnected topology, while minimizing the movement distance of the nodes and maximizing the coverage of the field of interest. First, it presents a new model with the motion constraint. If the nodes move at distance within the limit value calculated by the model, the topology is always connected, whether the neighbors of nodes are dynamic or static. Secondly, it improves the coverage strategy based on the nearest neighbor rule (NNR) and finds a rule of nodes’ spreading so that the nodes are distributed evenly and the spacing of the adjacent nodes is controllable. In addition, the nodes move only when necessary according to the added judgment conditions. Consequently, the movement distance is reduced. The simulation results prove the feasibility and effectiveness of the Localized Topology Optimized Method (LTOM) proposed by this paper. The connected indicators of the system’s topology during implementing LTOM are consistent, and the transformation of topology by LTOM is symmetric. Compared with the other distributed algorithm, NNR, LTOM reduces the movement distance of nodes, improves the connected probability, and maximizes the coverage of the topological structures under the biconnected conditions.
Highlights
Wireless mobile sensor networks are applied in multiple areas, such as rescue, exploration, visitation and reconnaissance
Fail, the system can neither fill the coverage hole caused by the failure node nor reconstruct the Figure 11 shows that the average movement distance of Localized Topology Optimized Method (LTOM) is less than that of nearest neighbor rule (NNR) under the biconnected topology
When the number of nodes is large, the nodes are constrained by the area boundaries, the Figure 12 shows that the coverage rate of LTOM is smaller than that of NNR when the number movement distance no longer increases with the number of nodes
Summary
Wireless mobile sensor networks are applied in multiple areas, such as rescue, exploration, visitation and reconnaissance. In the literature [19], while maintaining the connectivity of the initial topological structure in the system, an iterative optimization algorithm was adopted to gradually move the nodes into the communications radius of the critical node This method only requires the local information of k-hop neighbor nodes, which expends the application range, but the temporary cluster heads or central nodes are still necessary for calculating and controlling the movement of other nodes. (3) It proposes a fully distributed approach for nodes moving autonomously to realize the multi objective optimization Through this method of iterative optimization, the system can build up and maintain a biconnected topological structure while minimizing the movement distance of the nodes and maximizing the coverage of the field of interest.
Sign-in/Register to view highlights & summary 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.
