Abstract

In wireless sensor networks (WSN) localization of the nodes is relevant, especially for the task of identification of events that occur in the environment being monitored. Thus, positioning of the sensors is essential to satisfy such task. In WSN, sensors use techniques for self-localization based on some reference or anchor nodes (AN) that know their own position in advance. These ANs are fusion centers or nodes with more processing power. Assuming that the number of ANs given in the network is N, we carry out the localization algorithm to position sensors sequentially using those N ANs. Now, when a sensor has been localized, it becomes a new AN, and now, other sensors will use N + 1 ANs, this is repeated until all the sensors in the network have been localized. In this sequential localization algorithm, the positioning error (difference between true and estimated position) increases as the sensor to be located is farther away from the group of original ANs in the network. This error becomes critical when propagation issues such as multipath propagation and shadowing in indoor environments are considered. In this paper, we characterize statistically positioning error in WSN for one-dimensional indoor environments when sensors are deployed randomly. We also evaluate the performance of the localization algorithm and determine correcting factors based on the statistical characterization to minimize positioning error. We present results from simulations and measurements in an indoor environment.

Highlights

  • In 1996, the FCC made a statement requesting phone service providers to have a way to reach their customers for reasons of safety [1]

  • We introduce a position location technique based on RSS measurements and classical propagation models to estimate distance and combine references to obtain position of sensor nodes in a network

  • The localization algorithm that we propose, works under the theoretical foundation that it establishes that the received power or RSS is directly proportional to the transmission power and inversely proportional to the distance between receiver and transmitter with a path loss exponent (PLE) that was obtained experimentally by measuring in an indoor environment

Read more

Summary

Introduction

In 1996, the FCC made a statement requesting phone service providers to have a way to reach their customers for reasons of safety (a more efficient service to emergency calls) [1]. In wireless ad-hoc and sensor networks, there have been different algorithms in the literature that apply relational techniques in combination with distance estimation through RSS or time of arrival (TOA), e.g., see [4,5,6], some of those techniques use a reference grid [6], and distances are estimated in terms of hops in the routes connecting ANs and nodes of interest. These ideas have been extended to consider three-dimensional scenarios, see [7]. Location is obtained by averaging the positioning of those instances executed in the algorithm

Position Location Algorithm
Results
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.