Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration

Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration

Blog Article

A low-cost yet effective localization scheme for wireless sensor networks (WSNs) is presented in this study.The proposed scheme uses MANUKA HONEY 250+MGO only two anchor nodes and uses bilateration to estimate the coordinates of unknown nodes.Many localization algorithms for WSNs require the installation of extra components, such as a GPS, ultrasonic transceiver, and unidirectional antenna, to sensors.The proposed localization scheme is range-free (i.e.

, not demanding any extra devices for the sensors).In this scheme, two anchor nodes are installed at the bottom-left corner (Sink X ) and the bottom-right corner (Sink Y ) of a square monitored region of the WSN.Sensors are identified with the same minimum hop counts pair to Sink X and Sink Y to form a Perfumes zone, and the estimated location of each unknown sensor is adjusted according to its relative position in the zone.This study compares the proposed scheme with the well-known DV-Hop method.Simulation results show that the proposed scheme outperforms the DV-Hop method in localization accuracy, communication cost, and computational complexity.