An algorithm for drawing general undirected graphs
Information Processing Letters
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
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
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Distributed localization using noisy distance and angle information
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localization in wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Passive Localization: Large Size Sensor Network Localization Based on Environmental Events
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
Graphael: a system for generalized force-directed layouts
GD'04 Proceedings of the 12th international conference on Graph Drawing
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Network synchronization and localization based on stolen signals
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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 |
As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.