Journal of Northeastern University ›› 2007, Vol. 28 ›› Issue (6): 801-804.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Self-localization algorithm for wireless sensor network

Liao, Xian-Lin (1); Geng, Na (1); Shi, Kai (1); Zhao, Lin-Liang (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-06-15 Published:2013-06-24
  • Contact: Liao, X.-L.
  • About author:-
  • Supported by:
    -

Abstract: In wireless sensor networks, the node self-localization is vital and promising to a wide scope of both military and civilian applications. In this respect there are two types of algorithms, i.e. range-based and range-irrelevant, either has its own advantages and disadvantages. Taking account of those of the two algorithms, a low-cost and practical algorithm is proposed, using RSSI (received signal strength indicator) for range measurement between nodes and propagating the cumulative range in meter in a multijetter network, then localizing nodes geometrically via maximum likelihood estimation. Simulation results showed that by the algorithm the average error is 10%, while the position error is about 20% of nodes' RF transmission range if the ratio of anchor nodes is 10%.

CLC Number: