Abstract
Node self-positioning is one of the supporting technologies for wireless sensor network applications. In this paper, a clustering localization algorithm is proposed for large-scale high-density wireless sensor networks. Firstly, the potential of the node is defined as the basis for the election of the cluster head. The distance between the nodes in the network is calculated indirectly by the relationship between the received signal strength and the communication radius. The topology information in each cluster is saved by the cluster head, and the linear programming method is used in the cluster head to implement the cluster internal relative positioning. Then, from the sink node, the inter-cluster location fusion is gradually implemented, and finally the absolute positioning of the whole network is realized. Compared with the centralized convex programming algorithm, the proposed algorithm has low computational complexity, small traffic, high positioning accuracy, and does not need to know the signal attenuation factor in the environment in advance, and there is anti-noise ability.
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 callMore From: International Journal of Mobile Computing and Multimedia Communications
Disclaimer: 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.
