{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T20:14:50Z","timestamp":1696623290425},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T00:00:00Z","timestamp":1347321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00446-012-0179-3","type":"journal-article","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T05:34:16Z","timestamp":1347255256000},"page":"39-58","source":"Crossref","is-referenced-by-count":12,"title":["Bounding the locality of distributed routing algorithms"],"prefix":"10.1007","volume":"26","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,11]]},"reference":[{"issue":"4","key":"179_CR1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1142\/S021819590200089X","volume":"12","author":"P Bose","year":"2002","unstructured":"Bose, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., L\u00f3pez-Ortiz, A., Morin, P., Munro, I.: Online routing in convex subdivisions. Int. J. Comput. Geom. Appl. 12(4), 283\u2013295 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"179_CR2","doi-asserted-by":"crossref","unstructured":"Bose, P., Carmi, P., Durocher, S.: Bounding the locality of distributed routing algorithms. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), vol. 28, pp. 250\u2013259. ACM (2009)","DOI":"10.1145\/1582716.1582756"},{"key":"179_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theor. Comput. Sci. 324, 273\u2013288 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"179_CR4","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33(4), 937\u2013951 (2004)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"179_CR5","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Netw."},{"key":"179_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M.: On ad hoc routing with guaranteed delivery. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), vol 27, p. 418. ACM (2008)","DOI":"10.1145\/1400751.1400809"},{"key":"179_CR7","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Local construction of planar spanners with irregular transmission ranges. In: Proceedings of the Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pp. 286\u2013297. Springer, Berlin (2006)","DOI":"10.1007\/11682462_29"},{"key":"179_CR8","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Route discovery with constant memory in oriented planar geometric networks. Networks 48(1), 7\u201315 (2006)","DOI":"10.1002\/net.20114"},{"key":"179_CR9","unstructured":"Chen, D., Devroye, L., Dujmovi\u0107, V., Morin, P.: Memoryless routing in convex subdivisions: Random walks are optimal. In: Proceedings of the European Workshop on Computational Geometry (EuroCG), pp. 109\u2013112 (2010)"},{"key":"179_CR10","unstructured":"Durocher, S., Kirkpatrick, D., Narayanan, L.: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wirel. Netw. 16, 227\u2013235 (2010)"},{"key":"179_CR11","doi-asserted-by":"crossref","unstructured":"Durocher, S., Kranakis, E., Krizanc, D., Narayanan, L.: Balancing traffic load using one-turn rectilinear routing. J. Interconnect. Netw. 10(1\u20132), 93\u2013120 (2009)","DOI":"10.1142\/S0219265909002455"},{"key":"179_CR12","doi-asserted-by":"crossref","unstructured":"Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI\/RR-87-180. Information Sciences Institute (1987)","DOI":"10.21236\/ADA180187"},{"key":"179_CR13","doi-asserted-by":"crossref","unstructured":"Flury, R., Wattenhofer, R.: Randomized 3D geographic routing. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pp. 834\u2013842. IEEE (2008)","DOI":"10.1109\/INFOCOM.2007.135"},{"key":"179_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Local memory requirement of universal routing schemes. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Parallel Algorithms and Architecture (SPAA), pp. 183\u2013188. ACM (1996)","DOI":"10.1145\/237502.237541"},{"key":"179_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s004460050025","volume":"10","author":"P Fraigniaud","year":"1997","unstructured":"Fraigniaud, P., Gavoille, C.: Universal routing schemes. Distrib. Comput. 10, 65\u201378 (1997)","journal-title":"Distrib. Comput."},{"issue":"2","key":"179_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/PL00009211","volume":"21","author":"P Fraigniaud","year":"1998","unstructured":"Fraigniaud, P., Gavoille, C.: Interval routing schemes. Algorithmica 21(2), 155\u2013182 (1998)","journal-title":"Algorithmica"},{"key":"179_CR17","unstructured":"Fraigniaud, P., Gavoille, C.: A theoretical model for routing complexity. In: Proceedings of the International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 98\u2013113. Carleton Scientific (1998)"},{"key":"179_CR18","first-page":"179","volume":"6","author":"M Fraser","year":"2008","unstructured":"Fraser, M.: Local routing on tori. Adhoc Sens. Wirel. Netw. 6, 179\u2013196 (2008)","journal-title":"Adhoc Sens. Wirel. Netw."},{"key":"179_CR19","unstructured":"Fraser, M., Kranakis, E., Urrutia, J.: Memory requirements for local geometric routing and traversal in digraphs. In: Proceedings of the Canadian Conference on, Computational Geometry (CCCG). vol. 20 (2008)"},{"key":"179_CR20","unstructured":"Guan, X.: Face routing in wireless ad-hoc networks. PhD thesis, University of Toronto (2009)"},{"key":"179_CR21","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG), vol. 11, pp. 51\u201354 (1999)"},{"key":"179_CR22","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Joint Workshop on Foundations of Mobile Computing, pp. 69\u201378. ACM (2003)","DOI":"10.1145\/941079.941089"},{"issue":"12","key":"179_CR23","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/TPDS.2004.77","volume":"15","author":"X-Y Li","year":"2004","unstructured":"Li, X.-Y., Wang, Y., Song, W.-Z.: Applications of $$k$$ -local MST for topology control and broadcasting in wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 15(12), 1057\u20131069 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"179_CR24","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"issue":"1","key":"179_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"29","author":"N Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Comput. J. 29(1), 5\u20138 (1985)","journal-title":"Comput. J."},{"issue":"7","key":"179_CR26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/MCOM.2002.1018018","volume":"40","author":"I Stojmenovi\u0107","year":"2002","unstructured":"Stojmenovi\u0107, I.: Position based routing in ad hoc networks. IEEE Commun. Mag. 40(7), 128\u2013134 (2002)","journal-title":"IEEE Commun. Mag."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0179-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0179-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0179-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T16:30:21Z","timestamp":1562171421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0179-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0179-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,11]]}}}