Journal of Northeastern University Natural Science ›› 2014, Vol. 35 ›› Issue (7): 921-925.DOI: 10.12068/j.issn.1005-3026.2014.07.003

• Information & Control • Previous Articles     Next Articles

RangeFree Localization Algorithm Based on Estimated Distances

MENG Yinghui, WEN Yingyou, CHEN Jian, ZHAO Hong   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2013-08-26 Revised:2013-08-26 Online:2014-07-15 Published:2014-04-11
  • Contact: MENG Yinghui
  • About author:-
  • Supported by:
    -

Abstract: Due to the large localization error of rangefree localization algorithms, a rangefree localization algorithm based on estimated distances was proposed. Firstly, a linear function was designed by analyzing the relation between the distance of two neighbor nodes and the intersection area of them. The output was a distance parameter which could represent the distance of neighbor nodes. Then, estimated distances between nodes were calculated based on distances of anchor nodes. Finally, the estimated positions of nonanchor nodes were calculated based on estimated distances. Simulation results showed that the localization error of the proposed algorithm is smaller than that of the current rangefree algorithms in both regular and irregular areas.

Key words: rangefree, neighbor nodes, linear function, distance parameter, anchor nodes

CLC Number: