{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T18:05:54Z","timestamp":1749665154635},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2002.1019377","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:04:13Z","timestamp":1056564253000},"page":"1268-1277","source":"Crossref","is-referenced-by-count":26,"title":["Distributed construction of a planar spanner and routing for ad hoc wireless networks"],"prefix":"10.1109","volume":"3","author":[{"family":"Xiang-Yang Li","sequence":"first","affiliation":[]},{"given":"G.","family":"Calinescu","sequence":"additional","affiliation":[]},{"family":"Peng-Jun Wan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"The delaunay triangulation closely approximates the complete euclidean graph","author":"keil","year":"0","journal-title":"Proc 1st Workshop Algorithms Data Structure (LNCS 382) 1989"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187821"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1007\/BF02187801","article-title":"Delaunay graphs are almost as good as complete graphs","author":"dobkin","year":"1990","journal-title":"Discrete Computational Geometry"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"14","first-page":"51","article-title":"Compass routing on geometric networks","author":"kranakis","year":"0","journal-title":"Proc 11th Canadian Conference on Computational Geometry 1999"},{"article-title":"GPS based distributed routing algorithms for wireless networks","year":"2000","author":"lin","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/313239.313282"},{"key":"21","article-title":"Power efficient and sparse spanner for wireless ad hoc networks","author":"li","year":"0","journal-title":"IEEE International Conference on Computer Communications and Networks (ICCCNOI) 2001"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10534"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.2307\/2412323"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02247943"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197318088"},{"journal-title":"New Results on Geometric Spanners and Their Applications","year":"1999","author":"lukovszki","key":"26"},{"article-title":"Partitioned neighborhood spanners of minimal outdegree","year":"1999","author":"fischer","key":"27"},{"key":"28","first-page":"47","article-title":"Online routing in convex subdivisions","author":"bose","year":"0","journal-title":"International Symposium on Algorithms and Computation 2000"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1504\/IJSNET.2007.013202"},{"article-title":"The dynamic source routing protocol for mobile ad hoc networks","year":"1998","author":"broch","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193330"},{"key":"1","article-title":"Online routing in triangulations","author":"bose","year":"0","journal-title":"Proc of the 10th Annual Int Symp on Algorithms and Computation ISAAC 1999"},{"key":"7","article-title":"Highly dynamic destination-sequenced distance-vector routing","author":"perkins","year":"0","journal-title":"Proc of the ACM SIGCOMM October 1994"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/MCSA.1999.749281"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193336"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/98.760423"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749269"}],"event":{"name":"IEEE Information Communications Conference (INFOCOM 2002)","acronym":"INFCOM-02","location":"New York, NY, USA"},"container-title":["Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7943\/21923\/01019377.pdf?arnumber=1019377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:41:57Z","timestamp":1497552117000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019377\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infcom.2002.1019377","relation":{},"subject":[]}}