An algorithm for drawing general undirected graphs
Information Processing Letters
Conditions for unique graph realizations
SIAM Journal on Computing
Graph drawing by force-directed placement
Software—Practice & Experience
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Some theoretical aspects of position-location problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed localization using noisy distance and angle information
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localization and routing in sensor networks by local angle information
ACM Transactions on Sensor Networks (TOSN)
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Force-directed approaches to sensor localization
ACM Transactions on Sensor Networks (TOSN)
MSDR-D network localization algorithm
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Considerations on quality metrics for self-localization algorithms
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Sensor network localization by eigenvector synchronization over the euclidean group
ACM Transactions on Sensor Networks (TOSN)
HD-GraphViz: highly distributed graph visualization on tiled displays
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Taxonomy of Fundamental Concepts of Localization in Cyber-Physical and Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, low-end systems or indoor systems, which cannot use GPS, must locate themselves based only on crude information available locally, such as inter-sensor distances. We show how a collection of sensors, capable only of measuring distances to close neighbors, can compute their locations in a purely distributed manner, i.e. where each sensor communicates only with its neighbors. This can be viewed as a distributed graph drawing algorithm. We experimentally show that our algorithm consistently produces good results under a variety of simulated real-world conditions, and is relatively robust to the presence of noise in the distance measurements.