{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:14:26Z","timestamp":1729656866561,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/icc.2003.1204216","type":"proceedings-article","created":{"date-parts":[[2004,3,23]],"date-time":"2004-03-23T16:02:41Z","timestamp":1080057761000},"page":"443-447 vol.1","source":"Crossref","is-referenced-by-count":1,"title":["Localized routing for wireless ad hoc networks"],"prefix":"10.1109","author":[{"family":"Xiang-Yang Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yu Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Frieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2412323"},{"key":"ref12","article-title":"On the spanning ratio of gabriel graphs and beta-skeletons","author":"bose","year":"2002","journal-title":"Proc Latin American Theoretical Infocomatics (LATIN)"},{"key":"ref13","article-title":"Distributed spanner with bounded degree for wireless networks","author":"wang","year":"2002","journal-title":"Telecommunication Systems"},{"key":"ref14","article-title":"Sparse power efficient topology for wireless networks","author":"li","year":"0","journal-title":"Journal of Parallel and Distributed Computing 2002 To appear Preliminary version appeared in ICCCN 2001"},{"key":"ref15","article-title":"Online routing in triangulations","author":"bose","year":"1999","journal-title":"Proc of the 10 th Annual Int Symp on Algorithms and Computation ISAAC"},{"key":"ref16","article-title":"Critical power for asymptotic connectivity in wireless networks","author":"gupta","year":"1998","journal-title":"Stochastic Analysis Control Optimization and Applications A Volume in Honor"},{"key":"ref17","first-page":"51","article-title":"Compass routing on geometric networks","author":"kranakis","year":"1999","journal-title":"Proc 11 th Canadian Conference on Computational Geometry"},{"key":"ref18","first-page":"564","article-title":"Power efficient and sparse spanner for wireless ad hoc networks","author":"li","year":"2001","journal-title":"IEEE Int Conf on Computer Communications and Networks (ICCCN01)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/65.967595"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193336"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/190809.190336","article-title":"Highly dynamic destination-sequenced distance-vector routing","author":"perkins","year":"1994","journal-title":"Proc of the ACM SIGCOMM October"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625335"},{"key":"ref5","article-title":"Ad-hoc on-demand distance vector routing","author":"perkins","year":"1997","journal-title":"MILCOM '97"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/71.963415"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749269"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012319418150"},{"key":"ref1","article-title":"Distributed construction of planar spanner and routing for ad hoc wireless networks","volume":"3","author":"li","year":"2002","journal-title":"21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"},{"key":"ref22","article-title":"Partitioned neighborhood spanners of minimal outdegree","author":"fischer","year":"1999","journal-title":"Tech Rep"},{"journal-title":"New Results on Geometric Spanners and Their Applications","year":"1999","author":"lukovszki","key":"ref21"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51542-9_6","article-title":"The delaunay triangulation closely approximates the complete euclidean graph","author":"keil","year":"1989","journal-title":"Proc of the Workshop on Algorithms and Data Structures"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","article-title":"Delaunay graphs are almost as good as complete graphs","author":"dobkin","year":"1990","journal-title":"Discr Comp Geom"},{"journal-title":"Online Routing in Geometric Graphs","year":"2001","author":"morin","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187821"}],"event":{"name":"IEEE International Conference on Communications","start":{"date-parts":[[2003,5,11]]},"location":"Anchorage, AK","end":{"date-parts":[[2003,5,15]]}},"container-title":["IEEE International Conference on Communications, 2003. ICC '03."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8564\/27113\/01204216.pdf?arnumber=1204216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T07:23:27Z","timestamp":1524641007000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1204216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icc.2003.1204216","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}