Matrix analysis
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
The n-hop multilateration primitive for node localization problems
Mobile Networks and Applications
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Nonparametric belief propagation for self-calibration in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Localization from Connectivity in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
The bin-covering technique for thresholding random geometric graph properties
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Localization in wireless sensor networks
Proceedings of the 6th 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
From centralized to distributed sensor localization
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
CAUCHY localization: a distributed computation of WSNs
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
EV-Loc: integrating electronic and visual signals for accurate localization
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Refining hop-count for localisation in wireless sensor networks
International Journal of Sensor Networks
Robust localization from incomplete local information
IEEE/ACM Transactions on Networking (TON)
Relative localization for wireless sensor networks with linear topology
Computer Communications
Hi-index | 0.00 |
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the localization algorithm MDS-MAP proposed by Y. Shang et al. is able to localize sensors up to a bounded error decreasing at a rate inversely proportional to the radio range r. The main limitation of MDS-MAP is the assumption that the available connectivity information is processed in a centralized way. In this work we investigate a practically important question whether similar performance guarantees can be obtained in a distributed setting. In particular, we analyze the performance of the HOP-TERRAIN algorithm proposed by C. Savarese et al. This algorithm can be seen as a distributed version of the MDS-MAP algorithm. More precisely, assume that the radio range r=o(1) and that the network consists of n sensors positioned randomly on a d-dimensional unit cube and d+1 anchors in general positions. We show that when only connectivity information is available, for every unknown node i, the Euclidean distance between the estimate xi and the correct position xi is bounded by ||xi-xi|| 0/r + o(1), where r0=Cd (log n/ n)(1/d) for some constant Cd which only depends on d. Furthermore, we illustrate that a similar bound holds for the range-based model, when the approximate measurement for the distances is provided.