{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:16:10Z","timestamp":1725549370398},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926658"},{"type":"electronic","value":"9783540926665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-92666-5_2","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T10:24:44Z","timestamp":1268043884000},"page":"17-28","source":"Crossref","is-referenced-by-count":3,"title":["Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Hannes","family":"Frey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"R\u00fchrup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0743-7315(02)00037-0","volume":"63","author":"X. Lin","year":"2003","unstructured":"X. Lin and I. Stojmenovi\u0107. Location-based localized alternate, disjoint and multipath routing algorithms for wireless networks. Journal of Parallel and Distributed Computing, 63:22\u201332, 2003.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"P. Bose, P. Morin, I. Stojmenovi\u0107, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M 99), pages 48\u201355, August 1999.","DOI":"10.1145\/313239.313282"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"H. Frey and I. Stojmenovi\u0107. On delivery guarantees of face and combined greedyface routing in ad hoc and sensor networks. In 12th Annual Int. Conference on Mobile Computing and Networking (MobiCom\u201906), 2006.","DOI":"10.1145\/1161089.1161133"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. Toussaint","year":"1980","unstructured":"G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261\u2013268, 1980.","journal-title":"Pattern Recognition"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. R. Gabriel","year":"1969","unstructured":"K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259\u2013278, 1969.","journal-title":"Systematic Zoology"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In 6th ACM\/IEEE Annual Int. Conference on Mobile Computing and Networking (MobiCom\u201900), pages 243\u2013254, August 2000.","DOI":"10.1145\/345910.345953"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of gabriel graphs and beta-skeletons. In Latin American Symposium on Theoretical Informatics (LATIN\u201902), April 2002.","DOI":"10.1007\/3-540-45995-2_42"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"H. Kalosha, A. Nayak, S. R\u00fchrup, and I. Stojmenovi\u0107. Select-and-protest-based beaconless georouting with guaranteed delivery in wireless sensor networks. In 27th IEEE Conference on Computer Communications (INFOCOM), April 2008.","DOI":"10.1109\/INFOCOM.2008.78"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"D.P. Dobkin, S.J. Friedman, and K.J. Supowit. Delaunay graphs are almost as good as complete graphs. In Discrete and Computational Geometry, 1990.","DOI":"10.1007\/BF02187801"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"J.M. Keil and C.A. Gutwin. Classes of graphs which approximate the complete euclidean graph. In Discrete Computational Geometry, 7, 1992.","DOI":"10.1007\/BF02187821"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In 2nd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc\u201901), pages 45\u201355, October 2001.","DOI":"10.1145\/501416.501424"},{"key":"2_CR12","unstructured":"X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In 21st Joint Conference of the IEEE Computer and Communications Society (INFOCOM), pages 1268\u20131277, June 2002."}],"container-title":["Informatik aktuell","Kommunikation in Verteilten Systemen (KiVS)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92666-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:13:17Z","timestamp":1606183997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92666-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540926658","9783540926665"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92666-5_2","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[2009]]}}}