Research of localization algorithm for wireless sensor networks based on Amorphous
Li Dengao
Abstract
Li Dengao
Abstract
Wireless sensor networks(WSNs) are used in various fields.Node localization information is the most important.Among all the classical localization algorithms,Amorphous is one of the range-free localization algorithms,by acquiring hops between unknown nodes and anchor nodes,and estimate the distances between nodes,then calculate coordinate of nodes.The disadvantages of Amorphous localization algorithm is analyzed,hop numbers between nodes are corrected.Centroid algorithm weighting is used to propose improved algorithm model,simulation verifies this algorithm can obtain accurate localization results.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Wireless sensor networks(WSNs) are used in various fields.Node localization information is the most important.Among all the classical localization algorithms,Amorphous is one of the range-free localization algorithms,by acquiring hops between unknown nodes and anchor nodes,and estimate the distances between nodes,then calculate coordinate of nodes.The disadvantages of Amorphous localization algorithm is analyzed,hop numbers between nodes are corrected.Centroid algorithm weighting is used to propose improved algorithm model,simulation verifies this algorithm can obtain accurate localization results.
Key concepts: Wireless sensor network, Algorithm, Weighting, Centroid, Node (physics), Computer science, Wireless, Hop (telecommunications)