On the Computational Complexity of Sensor Network Localization

Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localization problem for sensor networks is to reconstruct the positions of all of the sensors in a network, given the distances between all pairs of sensors that are within some radius r of each other. In the past few years, many algorithms for solving the localization problem were proposed, without knowing the computational complexity of the problem. In this paper, we show that no polynomial-time algorithm can solve this problem in the worst case, even for sets of distance pairs for which a unique solution exists, unless RP = NP. We also discuss the consequences of our result and present open problems.

• Type: Conference
• Year: 2004
• Where: ALGOSENSORS
• Authors: James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang
• Keywords: ALGOSENSORS 2004, Localization Problem, Sensor Nodes, Sensors, Wireless Sensors