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
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
The n-hop multilateration primitive for node localization problems
Mobile Networks and Applications
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Low-dimensional embedding with extra information
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Theory of semidefinite programming for sensor network localization
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A robustness analysis of multi-hop ranging-based localization approximations
Proceedings of the 5th international conference on Information processing in sensor networks
The effects of ranging noise on multihop localization: an empirical study
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Robust statistical methods for securing wireless localization in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Localization in sparse networks using sweeps
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
Universal rigidity: towards accurate and efficient localization of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Formal Theory of Noisy Sensor Network Localization
SIAM Journal on Discrete Mathematics
CAUCHY localization: a distributed computation of WSNs
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Universal Rigidity and Edge Sparsification for Sensor Network Localization
SIAM Journal on Optimization
Performance improvements for network-wide broadcast with instantaneous network information
Journal of Network and Computer Applications
Sensor network localization by eigenvector synchronization over the euclidean group
ACM Transactions on Sensor Networks (TOSN)
Applicability of Hop Distance in Random Sensor Networks
Wireless Personal Communications: An International Journal
Scale-free coordinates for multi-robot systems with bearing-only sensors
International Journal of Robotics Research
A distributed continuous-time algorithm for network localization using angle-of-arrival information
Automatica (Journal of IFAC)
Hi-index | 0.00 |
Location information is useful both for network organization and for sensor data integrity. In this article, we study the anchor-free 2D localization problem by using local angle measurements. 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 &sqrt;2/2 away. Despite the negative results, however, we 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 it gives both a good local embedding, with neighboring nodes embedded close and non-neighboring nodes far away, and a satisfactory 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.