Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
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
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
Localization and routing in sensor networks by local angle information
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Sextant: a unified node and event localization framework using non-convex constraints
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Theory of semidefinite programming for sensor network localization
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical aspects of connectivity-based multi-hop positioning
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
HA-A2L: angle to landmark-based high accuracy localization method in sensor networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Algorithms and Simulation Methods for Topology-Aware Sensor Networks
Algorithmics of Large and Complex Networks
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Achieving range-free localization beyond connectivity
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Exploiting low complexity motion for ad-hoc localisation
International Journal of Sensor Networks
High accuracy localization method using AoA in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperative network localization via node velocity estimation
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Collaborative location certification for sensor networks
ACM Transactions on Sensor Networks (TOSN)
Good quality virtual realization of unit ball graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Force-directed approaches to sensor localization
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Deterministic robot-network localization is hard
IEEE Transactions on Robotics
A holistic approach to wireless sensor network routing in underground tunnel environments
Computer Communications
Universal Rigidity and Edge Sparsification for Sensor Network Localization
SIAM Journal on Optimization
Sensor Node Localization with Uncontrolled Events
ACM Transactions on Embedded Computing Systems (TECS)
OFA: An optimistic approach to conquer flip ambiguity in network localization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes,along with additional local information (e.g. distances, angles, orientations etc.), the goal is to reconstruct the global geometry of the network. In this paper, we study the problem of localization with noisy distance and angle information. With no noise at all, the localization problem with both angle (with orientation) and distance information is trivial. However, in the presence of even a small amount of noise, we prove that the localization problem is NP hard.Localization with accurate distance information and relative angle information is also hard. These hardness results motivate our study of approximation schemes. We relax the non-convex constraints to approximating convex constraints and propose linear programs (LP) for two formulations of the resulting localization problem, which we call the weak deployment and strong deployment problems.These two formulations give upper and lower bounds on the location uncertainty respectively: No sensor is located outside its weak deployment region, and each sensor can be anywhere in its strong deployment region without violating the approximate distance and angle constraints. Though LP-based algorithms are usually solved by centralized methods, we propose distributed, iterative methods, which are provably convergent to the centralized algorithm solutions. We give simulation results for the distributed algorithms, evaluating the convergence rate, dependence on measurement noises,and robustness to link dynamics.