Gui, Linqing

Val, Thierry

Wei, Anne

International audienceLocalization of mobile nodes has been a fundamental issue for wireless sensor networks. The existing localization algorithms can be classified into two categories: range-based and range-free. Range-free scheme is more cost-effective than range-based scheme. This paper proposes double-level range-free algorithm for localization (DRAL), which consists of two methods. One is Mid-Perpendicular method, proposed for normal nodes which have at least three neighbor anchors. The other is Checkout DV-hop method, proposed for normal nodes which have less than three neighbor anchors. Simulation results show that the proposed algorithm DRAL has higher precision than the existing localization algorithms such as Centroid, CPE and DV-hop, while calculation cost only increases a little

Scientific Publications of the University of Toulouse II Le Mirail

A Two-level Range-free Localization Algorithm for Wireless Sensor Networks

A Two-level Range-free Localization Algorithm for Wireless Sensor Network

HAL-INSA Toulouse

Archive Ouverte en Sciences de l'Information et de la Communication

Hal-Diderot

HAL Descartes

https://hal.archives-ouvertes.fr/hal-01125910

A Two-level Range-free Localization Algorithm for Wireless Sensor Network

Abstract

Similar works

Full text

Available Versions

Scientific Publications of the University of Toulouse II Le Mirail

Scientific Publications of the University of Toulouse II Le Mirail

HAL-INSA Toulouse

Archive Ouverte en Sciences de l'Information et de la Communication

Hal-Diderot

HAL Descartes