Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Low-dimensional embedding with extra information
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed localization using noisy distance and angle information
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Map: medial axis based geometric routing in sensor networks
Wireless Networks
Self-healing sensor networks with distributed decision making
International Journal of Sensor Networks
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Reporter node determination of replicated node detection in wireless sensor networks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Proceedings of the 4th Annual International Conference on Wireless Internet
A low power framework for WLAN indoor positioning system
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Achieving range-free localization beyond connectivity
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Graphical properties of easily localizable sensor networks
Wireless Networks
Optimizing end to end routing performance in wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Mobile anchor-free localization for wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Good quality virtual realization of unit ball graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Deterministic robot-network localization is hard
IEEE Transactions on Robotics
A holistic approach to wireless sensor network routing in underground tunnel environments
Computer Communications
VRAC: virtual raw anchor coordinate routing in sensor networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Geographic routing with limited information in sensor networks
IEEE Transactions on Information Theory
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
Virtual raw anchor coordinates: a new localization paradigm
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
A holistic sensor network design for energy conservation and efficient data dissemination
Computer Networks: The International Journal of Computer and Telecommunications Networking
Consistency-Based on-line localization in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Research on the fault tolerance deployment in sensor networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
Virtual raw anchor coordinates: A new localization paradigm
Theoretical Computer Science
Sensor Node Localization with Uncontrolled Events
ACM Transactions on Embedded Computing Systems (TECS)
Hi-index | 0.06 |
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measurements in a sensor network. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance 1 away. Despite the negative results, however, one can find a planar spanner of a unit disk graph by using only local angles. The planar spanner can be used to generate a set of virtual coordinates that enable efficient and local routing schemes such as geographical routing or approximate shortest path routing. We also proposed a practical anchor-free embedding scheme by solving a linear program. We show by simulation that not only does it give very good local embedding, i.e., neighboring nodes are close and non-neighboring nodes are far away, but it also gives a quite accurate global view such that geographical routing and approximate shortest path routing on the embedded graph are almost identical to those on the original (true) embedding. The embedding algorithm can be adapted to other models of wireless sensor networks and is robust to measurement noise.