A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes
IEEE Transactions on Computers
Coping with uncertainty in map learning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
An as-rigid-as-possible approach to sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
GPS-free directional localization via dual wireless radios
Computer Communications
Sensor network localization by eigenvector synchronization over the euclidean group
ACM Transactions on Sensor Networks (TOSN)
Reducing the number of flips in trilateration with noisy range measurements
Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess
| Hi-index | 0.00 |
The position-location problem is that of computing the coordinates of a set of objects in space (usually a plane) from a sparse set of distance measurements. Because the problem is analogous to that of constructing a pin-Jointed structure from rigid bars (of given respective lengths), it is intimately linked to problems of structural rigidity. In addition to its practical significance, the problem leads to a number of surprising results and intriguing theoretical problems in geometry, combinatorics, and algorithm design. This paper presents some of the theoretical algorithmic aspects of the position-location problem; its major objective is to attract researchers to complexity problems of structural rigidity. Among the major results presented is the discovery of a large class of geometrical decision problems, all of which are randomly decidable (i.e., decidable by a probabilistic polynomial-time algorithm), but many of which seem to be Intractable.