Anchor Adaptive Movement Algorithm for Mobile Nodes Localization

Authors

Zhou Fei, Chongqing Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing 400065, China;
Wennan Liu, Chongqing Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing 400065, China;

Abstract

Abstract: Location awareness is very important in mobile sensor networks. The existing methods mainly focus on the improvement based on the MCL (Monte Carlo Localization), few of them study the anchor path planning. However, anchors random movement usually causes the waste of energy and resource. Aiming at this deficiency, this paper adopts the grid benefit criterion and achieves anchors adaptive movement. Threshold instead of traversal method is used to reduce the amount of calculation and positioning time. In order to solve the anchors aggregation problem during adaptive movement, we divide the target area into four subareas and constrain part of the anchors moving in the subarea. By this method we improve the amount of localized unknown nodes obviously.

Recommended Citation

Fei, Zhou and Liu, Wennan (2019) "Anchor Adaptive Movement Algorithm for Mobile Nodes Localization," Journal of System Simulation: Vol. 30: Iss. 5, Article 34.
DOI: 10.16182/j.issn1004731x.joss.201805034
Available at: https://dc-china-simulation.researchcommons.org/journal/vol30/iss5/34

First Page

1885

Revised Date

2016-08-24

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201805034

Last Page

1892

CLC

TP212.9

Recommended Citation

Zhou Fei, Liu Wennan. Anchor Adaptive Movement Algorithm for Mobile Nodes Localization[J]. Journal of System Simulation, 2018, 30(5): 1885-1892.

DOI

10.16182/j.issn1004731x.joss.201805034