Abstract
In wireless sensor networks, node localization is the first operation after deployment, and the efficiency of localization can directly influence the performance of the wireless sensor network, so designing an efficient localization algorithm has been an important focus in wireless sensor network research. Currently, anchor-free algorithms are the focus of research in node localization because they have the advantages of flexible structure, low cost, high stability and good extensibility. In this article, related research studies of unique localization-, angle- and distance-obtaining methods are introduced, and existing algorithms are analysed. Based on the analysis of existing research, an anchor-free localization algorithm named ladder diffusion node localization algorithm is proposed, in which sensor nodes are located by directional diffused activation and acknowledgement packets with fixed energy. In ladder diffusion node localization algorithm, the time cost of localization is greatly reduced, the communication tasks in localization are allocated in a more balanced manner, and node locations are obtained mainly by rigorous computation instead of measurement, which can reduce transmission measurement error. Finally, the performance of ladder diffusion node localization algorithm is proved both in theory and by the simulation results of experiments.
Highlights
Wireless sensor networks (WSNs) are one of the most important technologies in information science and can improve the ability to obtain information in harsh environments,[1,2,3,4] and they have broad application prospects in armillary, agriculture, industry and so on.[5,6,7] In WSNs, there are one or a few sink nodes and many sensor nodes
A sink node will be deployed in a specified spot, and it has limitless energy and powerful calculation and transmission capabilities; sensor nodes are randomly deployed in the target area, and their energy and calculation are limited by their volume.[3,4,7]
To compare the performance of ladder diffusion node localization algorithm (LDLA) with other localization algorithms, a series of experiments is designed with a unified model of WSNs and a classical error generation method, and the comparisons used in these experiments are mainstream ones, such as average node residual energy, localization error and the ratio of activated nodes after a certain period
Summary
Wireless sensor networks (WSNs) are one of the most important technologies in information science and can improve the ability to obtain information in harsh environments,[1,2,3,4] and they have broad application prospects in armillary, agriculture, industry and so on.[5,6,7] In WSNs, there are one or a few sink nodes and many sensor nodes. The advantage of anchor-based algorithms is that they have high localization accuracy; these algorithms have an obvious defect in that the flexibility of WSN deployment is greatly reduced because anchor nodes restrict the target area scope. To resolve this problem, many anchor-free algorithms have been proposed. To compare the performance of LDLA with other localization algorithms, a series of experiments is designed with a unified model of WSNs and a classical error generation method, and the comparisons used in these experiments are mainstream ones, such as average node residual energy, localization error and the ratio of activated nodes after a certain period. The rest of this article is organized as follows: in section ‘Related works’, the related works are introduced; in section ‘The design of LDLA’, the design of LDLA is proposed in detail; in section ‘The proof of LDLA’s performance’, the performance of LDLA is proved in theory and compared with other algorithms by experiment; the contributions of this article are concluded
Sign-in/Register to view highlights & summary 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
