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
The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
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
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
An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization
IEEE Transactions on Mobile Computing
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The expected uncertainty of range-free localization protocols in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
A distributed approach to passive localization for sensor networks
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Distributed sensor localization in random environments using minimal number of anchor nodes
IEEE Transactions on Signal Processing
Force-directed approaches to sensor localization
ACM Transactions on Sensor Networks (TOSN)
Network synchronization and localization based on stolen signals
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.00 |
We consider an anchor-free, relative localization and synchronization problem where a set of n receiver nodes and m wireless signal sources are independently, uniformly, and randomly distributed in a disk in the plane. The signals can be distinguished and their capture times can be measured. At the beginning neither the positions of the signal sources and receivers are known nor the sending moments of the signals. Now each receiver captures each signal after its constant speed journey over the unknown distance between signal source and receiver position. Given these nm capture times the task is to compute the relative distances between all synchronized receivers. In a more generalized setting the receiver nodes have no synchronized clocks and need to be synchronized from the capture times of the stolen signals. For unsynchronized receivers we can compute in time O(nm) an approximation of the positions and the clock offset within an absolute error of O(√logm/m) with probability 1 -m-c - e-c′n (for any c ∈ O(1) and some c 0). For synchronized receivers we can compute in time O(nm) an approximation of the correct relative positions within an absolute error margin of O(log2 m/m2) with probability 1 -m-c - e-c′n. This error bound holds also for unsynchronized receivers if we consider a normal distribution of the sound signals, or if the sound signals are randomly distributed in a surrounding larger disk. If the receiver nodes are connected via an ad hoc network we present a distributed algorithm which needs at most O(nm log n) messages in total to compute the approximate positions and clock offsets for the network within an absolute error of O(√logm/m) with probability 1-n-c if m n.