Conditions for unique graph realizations
SIAM Journal on Computing
An algorithm for two-dimensional rigidity percolation: the pebble game
Journal of Computational Physics
Handbook of discrete and computational geometry
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
Connected rigidity matroids and unique realizations of graphs
Journal of Combinatorial Theory Series B
Localization in sparse networks using sweeps
Proceedings of the 12th annual international conference on Mobile computing and networking
BeepBeep: a high accuracy acoustic ranging system using COTS mobile devices
Proceedings of the 5th international conference on Embedded networked sensor systems
Sea Depth Measurement with Restricted Floating Sensors
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Underground coal mine monitoring with wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Note: A sufficient connectivity condition for generic rigidity in the plane
Discrete Applied Mathematics
Canopy closure estimates with GreenOrbs: sustainable sensing in the forest
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Long-term large-scale sensing in the forest: recent advances and future directions of GreenOrbs
Frontiers of Computer Science in China
HLLS: A History information based Light Location Service for MANETs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Matrix-based pairwise key establishment for wireless mesh networks
Future Generation Computer Systems
Hi-index | 0.00 |
Location awareness is highly critical for wireless ad-hoc and sensor networks. Many efforts have been made to solve the problem of whether or not a network can be localized. Nevertheless, based on the data collected from a working sensor network, it is observed that the network is NOT always entirely localizable. Theoretical analyses also suggest that, in most cases, it is unlikely that all nodes in a network are localizable, although a (large) portion of the nodes can be uniquely located. Existing studies merely examine whether or not a network is localizable as a whole; yet two fundamental questions remain unaddressed: First, given a network configuration, whether or not a specific node is localizable? Second, how many nodes in a network can be located and which are them? In this study, we analyze the limitation of previous works and propose a novel concept of node localizability. By deriving the necessary and sufficient conditions for node localizability, for the first time, it is possible to analyze how many nodes one can expect to locate in sparsely or moderately connected networks. To validate this design, we implement our solution on a real-world system and the experimental results show that node localizability provides useful guidelines for network deployment and other location-based services.