An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Distributed online localization in sensor networks using a moving target
Proceedings of the 3rd international symposium on Information processing in sensor networks
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Localization and routing in sensor networks by local angle information
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed weighted-multidimensional scaling for node localization in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed obstacle localization in large wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
Scalable route selection for IPv6 multihomed sites
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
IEEE Communications Magazine
Hi-index | 0.00 |
We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. The algorithmis anchor-free and does not require particular network topology, rigidity of the underlying communication graph, or high average connectivity. The algorithmscales well to large and sparse networks with complex topologies and outperforms previous algorithms when the noise levels are high. The algorithmis simple to implement and is available, alongwith source code, executables, and experimental results, at http://msdr-d.cs.arizona.edu/.