Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albowicz, J., Chen, A., Zhang, L.: Recursive position estimation in sensor networks. In: Proceedings of the 9th International Conference on Network Protocols 2001, Riverside, CA, November 2001, pp. 35–41 (2001)
Bahl, P., Padmanabhan, V.N.: RADAR: An in-building RF-based user location and tracking system. In: Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 775–784 (2000)
Biswas, P., Ye, Y.: Semide nite programming for ad hoc wireless sensor network localization. In: Zhaoand, F., Guibas, L. (eds.) Proceedings of Third International Workshop on Information Processing in Sensor Networks, Berkeley, CA (April 2004)
Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low-cost outdoor localization for very small devices. IEEE Personal Communications Magazine 7(5), 28–34 (2000)
Capkun, S., Hamdi, M., Hubaux, J.-P.: GPS-free positioning in mobile ad-hoc networks. In: HICSS (2001)
Chintalapudi, K., Govindan, R., Sukhatme, G., Dhariwal, A.: Ad-hoc localization using ranging and sectoring. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China (April 2004)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)
Doherty, L., Pister, K.S.J., Ghaoui, L.E.: Convex position estimation in wireless sensor networks. In: Proceedings of IEEE INFOCOM 2001, Anchorage, AK, April 2001, pp. 1655–1633 (2001)
Eren, T., Goldenberg, D., Whitley, W., Yang, Y.R., Morse, S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization of network localization. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China (April 2004)
Estrin, D., Govindan, R., Heidemann, J.S., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: Proceedings of the Fifth International Conference on Mobile Computing and Networking (Mobicom), Seattle, WA, November 1999, pp. 263–270 (1999)
Forman, G.H., Zahorjan, J.: The challenges of mobile computing. IEEE Computer 27(4), 38–47 (1994)
Girod, L., Estrin, D.: Robust range estimation using acoustic and multimodal sensing. In: IEEE/RSI Int. Conf. on Intelligent Robots and Systems, IROS (2001)
He, T., Huang, C., Blum, B., Stankovic, J., Abdelzaher, T.: Range-free localization schemes in large scale sensor networks. In: Proceedings of The Ninth International Conference on Mobile Computing and Networking (Mobicom), San Diego, CA, September 2003, pp. 81–95 (2003)
Hightower, J., Borriella, G.: Location systems for ubiquitous computing. IEEE Computer 34(8), 57–66 (2001)
Hofmann-Wellenhof, B., Lichtenegger, H., Collins, J.: Global Positioning System: Theory and Practice, 4th edn. Springer, Heidelberg (1997)
Xiang, J.: Sensor positioning in wireless ad-hoc sensor networks with multidimensional scaling. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China (April 2004)
Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the Sixth International Conference on Mobile Computing and Networking (Mobicom), Boston, MA (August 2000)
Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: Proceedings of the Seventh International Conference on Mobile Computing and Networking (Mobicom), Rome, Italy (July 2001)
Niculescu, D., Nath, B.: Ad-hoc positioning system. In: Proceedings of IEEE Globecom 2001 (November 2001)
Niculescu, D., Nath, B.: Ad hoc positioning system (APS) using AOA. In: Proceedings of IEEE INFOCOM 2003, San Francisco, CA (April 2003)
Priyantha, N.B., Chakraborty, A., Balakrishnan, H.: The cricket location-support system. In: Proceedings of the Sixth International Conference on Mobile Computing and Networking (Mobicom), Boston, MA, August 2000, pp. 32–43 (2000)
Savarese, C., Rabay, J., Langendoen, K.: Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In: USENIX Technical Annual Conference, Monterey, CA (June 2002)
Savvides, A., Han, C.-C., Strivastava, M.B.: Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the Seventh International Conference on Mobile Computing and Networking (Mobicom), Rome, Italy, July 2001, pp. 166–179 (2001)
Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of the 17th Allerton Conference in Communications, Control and Computing, pp. 480–489 (1979)
Shang, Y., Ruml, W.: Improved MDS-based localization. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China (April 2004)
Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47(1), 85–93 (1986)
Want, R., Hopper, A., Falcão, V., Gibbons, J.:The active badge location system. Technical Report 92.1, Olivetti Research Ltd. (ORL), 24a Trumpington Street, Cambridge CB2 1QA (1992)
Ward, A., Jones, A., Hopper, A.: A new location technique for the active office. IEEE Personal Communications 4(5), 42–47 (1997)
Weiser, M.: Some computer science problems in ubiquitous computing. Communications of ACM (July 1993)
Werb, J., Lanzl, C.: Designing a positioning system for finding things and people indoors. IEEE Spectrum 35(9), 71–78 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aspnes, J., Goldenberg, D., Yang, Y.R. (2004). On the Computational Complexity of Sensor Network Localization. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2004. Lecture Notes in Computer Science, vol 3121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27820-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-27820-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22476-1
Online ISBN: 978-3-540-27820-7
eBook Packages: Springer Book Archive