Abstract
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs.
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
References
Bose, P., Devroye, L., Evans, W.S., Kirkpatrick, D.G.: On the spanning ratio of gabriel graphs and β-skeletons. SIAM Journal on Discrete Mathematics 20(2), 412–427 (2006)
Díaz, J., Pottonen, O., Serna, M., van Leeuwen, E.J.: On the Complexity of Metric Dimension. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 419–430. Springer, Heidelberg (2012)
Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D.E., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In: NSDI. USENIX (2005)
Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems 36(9), 1230–1234 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, S., Wanke, E. (2013). Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)