Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs

Authors:
Arda Cakiroglu;Cesim Erten
Affiliations:
Computer Science and Engineering, Işık University, Sile, Turkey 34980;Computer Engineering, Kadir Has University, Istanbul, Turkey 34083
Venue:
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Year:
2009

Citing 14
Cited 0

Conditions for unique graph realizations

SIAM Journal on Computing
LEDA: a platform for combinatorial and geometric computing

Communications of the ACM
Location Systems for Ubiquitous Computing

Computer
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid

Journal of Combinatorial Theory Series B
Localization for mobile sensor networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Robust distributed network localization with noisy range measurements

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Generic Global Rigidity

Discrete & Computational Geometry
Connected rigidity matroids and unique realizations of graphs

Journal of Combinatorial Theory Series B
Distributed localization using noisy distance and angle information

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Networking Wireless Sensors

Networking Wireless Sensors
Localization in sparse networks using sweeps

Proceedings of the 12th annual international conference on Mobile computing and networking
A Theory of Network Localization

IEEE Transactions on Mobile Computing
Wireless sensor network localization techniques

Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and applies unique localization primitives on it. These primitives are based on constructing a special order for multilaterating the nodes within the cluster. The proposed primitives are fully collaborative and thus the number of iterations required to compute the localization is fewer than that of the conventional iterative multilateration approaches. This further limits the messaging requirements. With relatively small clusters and iteration counts we can localize almost all the uniquely localizable nodes.