원문정보
초록
영어
Localization of sensor nodes is a fundamental and a key technology in wireless sensor networks, it has been widely studied by many universities and research institutions in recent years and many localization algorithms have been put forward by scholars from diverse aspects. A new localization algorithm, which is based on the LDV-Hop algorithm, is proposed in this paper. Firstly, to reduce the localization error we modify the average one-hop distance between anchor nodes, and the average one-hop distance used for each unknown node's location is also modified through weighting the received average one-hop distance from anchor nodes. Then, to solve the problem of low localization coverage which is the main disadvantage of LDV-Hop localization algorithm, we regard regular node with newly estimated location as anchor node and utilize believable factor threshold to restrain the error accumulation brought by this method.
목차
1. Introduction
2. Related works
2.1. DV-Hop Localization Algorithm
2.2. Some Existing Improved DV-Hop Algorithm
2.3. The Limit DV-Hop Localization Algorithm
3. A New Improved Algorithm Based on LDV-Hop
3.1. Modify the Calculation of the Average Hop Distance of Unknown Nodes
3.2. The New Improved Algorithm
3.3. Process of the New Improved Algorithm
4. Simulation
4.1. Impact of the Number of Anchor Nodes
4.2. Impact of Believable Factor Threshold
5. Conclusion
Acknowledgements
References