Fundamentals of statistical signal processing: estimation theory
Fundamentals of statistical signal processing: estimation theory
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
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
Introduction to Algorithms
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Using proximity and quantized RSS for sensor localization in wireless networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
System architecture for wireless sensor networks
System architecture for wireless sensor networks
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Forwarding and positioning problems in ad hoc networks
Forwarding and positioning problems in ad hoc networks
SeRLoc: Robust localization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization
IEEE Transactions on Mobile Computing
Range-free localization and its impact on large scale sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Robust distributed node localization with error management
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localization in sparse networks using sweeps
Proceedings of the 12th annual international conference on Mobile computing and networking
Localization in wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
MSP: multi-sequence positioning of wireless sensor nodes
Proceedings of the 5th international conference on Embedded networked sensor systems
Sensor Node Localization Using Uncontrolled Events
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
On the error characteristics of multihop node localization in ad-hoc sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
A study of localization metrics: Evaluation of position errors in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
Although many localization algorithms have been proposed, few efforts have been devoted to theoretical analysis on accuracy of these algorithms. For range-based localization problems, the Cramer-Rao lower Bound (CRB) provides an algorithm-independent method to analytically compute a tight lower bound on the square of sensors' localization errors. However, for range-free localization algorithms there are little similar work. In this paper, based on geometric properties, we theoretically analyze bounds on accuracy for Region Based Localization (RBL) algorithms which can be classified as one type of range-free localization algorithms. Assume a sensor node p can lie at any point with equal probability in a deployment region R whose size is s. If in a RBL algorithm R is partitioned into k arbitrary subregions, then the expected localization error of p in worst case is bounded below by sk23@p and the expected localization error square of p in worst case is bounded below by sk12@p. The bounds are not theoretically tight; however our simulation results show that the gaps between these bounds and corresponding achievable values are small. The obtained results can be used to bound localization accuracy of RBL algorithms in a wireless sensor network. (The localization accuracy is defined as the average localization error of all nodes in the network.) Our simulation results show that the derived bound can effectively reflect the best localization accuracy RBL algorithms can achieve in randomly deployed sensor networks with enough large number of sensors. We also investigate the key factors that impact localization accuracy in RBL algorithms. With these results, we show by examples with simulation results how to set up guidelines in the design of RBL algorithms in order to achieve high localization accuracy.