Range-free mobile node localization using static anchor

Kaushik Mondal, Partha Sarathi Mandal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


In this paper we have proposed a deterministic, range-free, distributed localization algorithm for mobile sensor nodes with static anchors. Mobile node calculates its approximate line of movement and corresponding position based on received beacons from two different anchors. The positional error can be further reduced by updating the approximate line of movement on receiving beacons from more anchors. We also have incorporated irregular radio propagation in our model. We have compared performance of our algorithm with existing localization algorithms. Simulation results show 80% improvement in performance of our proposed algorithm over the existing algorithms in terms of positional accuracy.

Original languageEnglish
Title of host publicationWireless Algorithms, Systems, and Applications - 8th International Conference, WASA 2013, Proceedings
Number of pages16
StatePublished - 5 Aug 2013
Externally publishedYes
Event8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013 - Zhangjiajie, China
Duration: 7 Aug 201310 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7992 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013


  • Beacon point
  • Line of movement
  • Mobile sensor localization
  • Range-free

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Range-free mobile node localization using static anchor'. Together they form a unique fingerprint.

Cite this