The anatomy of a context-aware application
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
A two-dimensional interpolation function for irregularly-spaced data
ACM '68 Proceedings of the 1968 23rd ACM national conference
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Rendered path: range-free localization in anisotropic sensor networks with holes
IEEE/ACM Transactions on Networking (TON)
RSS-Based Location Estimation with Unknown Pathloss Model
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Hi-index | 0.00 |
Location information becomes critically essential and indispensable for wireless sensor networks (WSNs). To associate sensed data with locations making data spatially meaningful. Many network protocols and services, such as network routing, topology control, coverage, boundary detection, etc., are based on location information. According to the constraint of cost, the cost of localization should be low either. The fading environment makes this object difficult to achieve. We present and evaluate a methodology for low-cost robust location. Our approach uses an Inverse RSSI Weighting (IRW) algorithm that requires only simple RSSI measurement during the receiving of the packages. Because that such measurement is necessary for demodulation and decoding the information, the approach based on IRW is not require additional equipments on sensors. We tested our localization algorithm in two fading environments: tile walk area and wooded area. Comparing to three most popular localization algorithms, the IRW algorithm can alleviate the negative impact of noisy ranging measurement and is robust over the deep fading scenarios.