Journal of System Simulation ›› 2018, Vol. 30 ›› Issue (5): 1885-1892.doi: 10.16182/j.issn1004731x.joss.201805034

Previous Articles     Next Articles

Anchor Adaptive Movement Algorithm for Mobile Nodes Localization

Zhou Fei, Liu Wennan   

  1. Chongqing Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2016-07-04 Revised:2016-08-24 Online:2018-05-08 Published:2019-01-03

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.

Key words: mobile sensor networks, localization, anchor path planning, energy-efficient

CLC Number: