{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T15:21:07Z","timestamp":1723130467973},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2299,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1016\/j.comgeo.2006.02.001","type":"journal-article","created":{"date-parts":[[2006,4,5]],"date-time":"2006-04-05T14:48:41Z","timestamp":1144248521000},"page":"197-214","source":"Crossref","is-referenced-by-count":15,"title":["Geometric spanners with applications in wireless networks"],"prefix":"10.1016","volume":"36","author":[{"given":"Christian","family":"Schindelhauer","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Volbert","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.comgeo.2006.02.001_bib001","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","article-title":"Geometric spanners for wireless ad hoc networks","volume":"14","author":"Alzoubi","year":"2003","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/j.comgeo.2006.02.001_bib002","unstructured":"S. Arora, M. Grigni, D.R. Karger, P.N. Klein, A. Woloszyn, A polynomial-time approximation scheme for weighted planar graph TSP, in: Symposium on Discrete Algorithms (SODA'98), 1998, pp 33\u201341"},{"key":"10.1016\/j.comgeo.2006.02.001_bib003","doi-asserted-by":"crossref","unstructured":"L.P. Chew, There is a planar graph almost as good as the complete graph, in: 2nd ACM Symposium on Computational Geometry (SoCG '86), 1986, pp. 169\u2013177","DOI":"10.1145\/10515.10534"},{"key":"10.1016\/j.comgeo.2006.02.001_bib004","series-title":"Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing","first-page":"56","article-title":"Approximation algorithms for shortest path motion planning","author":"Clarkson","year":"1987"},{"key":"10.1016\/j.comgeo.2006.02.001_bib005","author":"Eppstein"},{"key":"10.1016\/j.comgeo.2006.02.001_bib006","doi-asserted-by":"crossref","unstructured":"D. Eppstein, Spanning trees and spanners, in: Handbook of Computational Geometry, 2000, pp. 425\u2013461","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"10.1016\/j.comgeo.2006.02.001_bib007","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0925-7721(01)00055-4","article-title":"Beta-skeletons have unbounded dilation","volume":"23","author":"Eppstein","year":"2002","journal-title":"Computational Geometry"},{"key":"10.1016\/j.comgeo.2006.02.001_bib008","doi-asserted-by":"crossref","unstructured":"M. Fischer, T. Lukovszki, M. Ziegler, Geometric searching in walk through animations with weak spanners in real time, in: 6th Annual European Symposium on Algorithms (ESA '98), 1998, pp. 163\u2013174","DOI":"10.1007\/3-540-68530-8_14"},{"key":"10.1016\/j.comgeo.2006.02.001_bib009","doi-asserted-by":"crossref","unstructured":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, Dynamic data structures for realtime management of large geometric scenes, in: 5th Annual European Symposium on Algorithms (ESA '97), 1997, pp. 157\u2013170","DOI":"10.1007\/3-540-63397-9_13"},{"key":"10.1016\/j.comgeo.2006.02.001_bib010","doi-asserted-by":"crossref","unstructured":"M. Gr\u00fcnewald, T. Lukovszki, C. Schindelhauer, K. Volbert, Distributed maintenance of resource efficient wireless network topologies (ext. abstract), in: 8th EURO-PAR'02, 2002, pp. 935\u2013946","DOI":"10.1007\/3-540-45706-2_134"},{"key":"10.1016\/j.comgeo.2006.02.001_bib011","doi-asserted-by":"crossref","unstructured":"L. Jia, R. Rajaraman, C. Scheideler, On local algorithms for topology control and routing in ad hoc networks, in: Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA '03), 2003, pp. 220\u2013229","DOI":"10.1145\/777445.777447"},{"key":"10.1016\/j.comgeo.2006.02.001_bib012","series-title":"Ad Hoc Wireless Networking","article-title":"Applications of computational geometry in wireless ad hoc networks","author":"Li","year":"2003"},{"key":"10.1016\/j.comgeo.2006.02.001_bib013","series-title":"Ad Hoc Networking","article-title":"Topology control in wireless ad hoc networks","author":"Li","year":"2003"},{"key":"10.1016\/j.comgeo.2006.02.001_bib014","series-title":"Handbook of Sensor Networks","article-title":"Wireless sensor networks and computational geometry","author":"Li","year":"2003"},{"key":"10.1016\/j.comgeo.2006.02.001_bib015","unstructured":"X.-Y. Li, P.-J. Wan, Y. Wang, Power efficient and sparse spanner for wireless ad hoc networks, in: IEEE International Conference on Computer Communications and Networks (ICCCN01), 2001, pp. 564\u2013567"},{"issue":"3","key":"10.1016\/j.comgeo.2006.02.001_bib016","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00224-004-1124-z","article-title":"Congestion, dilation, and energy in radio networks","volume":"37","author":"Meyer auf der Heide","year":"2004","journal-title":"Theory of Computing Systems"},{"key":"10.1016\/j.comgeo.2006.02.001_bib017","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","article-title":"Graph spanners","volume":"13","author":"Peleg","year":"1989","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"10.1016\/j.comgeo.2006.02.001_bib018","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/564585.564602","article-title":"Topology control and routing in ad hoc networks: A survey","volume":"33","author":"Rajaraman","year":"2002","journal-title":"SIGACT News"},{"key":"10.1016\/j.comgeo.2006.02.001_bib019","doi-asserted-by":"crossref","unstructured":"S.B. Rao, W.D. Smith, Approximating geometrical graphs via spanners and banyans, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 540\u2013550","DOI":"10.1145\/276698.276868"},{"key":"10.1016\/j.comgeo.2006.02.001_bib020","series-title":"Wireless Communications: Principles and Practices","author":"Rappaport","year":"1996"},{"key":"10.1016\/j.comgeo.2006.02.001_bib021","doi-asserted-by":"crossref","unstructured":"C. Schindelhauer, K. Volbert, M. Ziegler, Spanners, weak spanners, and power spanners for wireless networks, in: Proc. of the 15th International Symposium on Algorithms and Computation (ISAAC'04), 2004, pp. 805\u2013821","DOI":"10.1007\/978-3-540-30551-4_69"},{"key":"10.1016\/j.comgeo.2006.02.001_bib022","series-title":"Curves and Fractal Dimension","author":"Tricot","year":"1995"},{"key":"10.1016\/j.comgeo.2006.02.001_bib023","doi-asserted-by":"crossref","unstructured":"K. Volbert, Experimental analysis of adjustable sectorized topologies for static ad hoc networks, in: Proc. of the 2004 Joint Workshop on Foundations of Mobile Computing (DIAL M-POMC'04), 2004, pp. 102\u2013111","DOI":"10.1145\/1022630.1022646"},{"key":"10.1016\/j.comgeo.2006.02.001_bib024","unstructured":"K. Volbert, Geometric spanners for topology control in wireless networks, PhD Thesis, University of Paderborn, 2005"},{"key":"10.1016\/j.comgeo.2006.02.001_bib025","doi-asserted-by":"crossref","unstructured":"Y. Wang, X.-Y. Li, Distributed spanner with bounded degree for wireless ad hoc networks, in: Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, 2002, p. 120","DOI":"10.1109\/IPDPS.2002.1016598"},{"key":"10.1016\/j.comgeo.2006.02.001_bib026","unstructured":"Y. Wang, X.-Y. Li, P.-J. Wan, O. Frieder, Sparse power efficient topology for wireless networks, in: Proc. ACM Hawaii International Conference on System Sciences (HICSS'02), 2002, p. 296"},{"key":"10.1016\/j.comgeo.2006.02.001_bib027","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","article-title":"On constructing minimum spanning trees in k-dimensional space and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM Journal of Computing"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210600023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210600023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:35:01Z","timestamp":1555533301000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577210600023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["S092577210600023X"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2006.02.001","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}