GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th 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
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Range-Based localization in mobile sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Wireless sensor networks (WSNs) have been widely used in many applications. The highly correct location information of sensor nodes is crucial for these applications. Nowadays there are mainly two types of localization algorithms: Range-based localization algorithms and Range-free localization algorithms. The drawback of former type is strict requirements on the hardware configuration. The latter type is cost-effective alternative approach. However, this approach can achieve high accuracy only in some ideal scenarios, and some methods even require a lot of complex calculations. In this paper, we put forward a novel PAV-based Calibration localization method (PAVC) locating the unknown nodes. The Pool Adjacent Violators (PAV) algorithm can be used to calibrate the average distance per hop of hop-based positioning algorithm. PAVC improves the localization accuracy compared with previous hop-based algorithms, which is demonstrated by the simulation and testbed results.