{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:08:28Z","timestamp":1704931708762},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transcom.2015ebp3268","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T22:09:40Z","timestamp":1456783780000},"page":"666-674","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design"],"prefix":"10.23919","volume":"E99.B","author":[{"given":"Sahel","family":"SAHHAF","sequence":"first","affiliation":[{"name":"Internet-Based Communication Networks and Services (IBCN) research group of the Department of Information Technology (INTEC), Ghent University \u2014 iMinds"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"TAVERNIER","sequence":"additional","affiliation":[{"name":"Internet-Based Communication Networks and Services (IBCN) research group of the Department of Information Technology (INTEC), Ghent University \u2014 iMinds"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"COLLE","sequence":"additional","affiliation":[{"name":"Internet-Based Communication Networks and Services (IBCN) research group of the Department of Information Technology (INTEC), Ghent University \u2014 iMinds"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"PICKAVET","sequence":"additional","affiliation":[{"name":"Internet-Based Communication Networks and Services (IBCN) research group of the Department of Information Technology (INTEC), Ghent University \u2014 iMinds"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piet","family":"DEMEESTER","sequence":"additional","affiliation":[{"name":"Internet-Based Communication Networks and Services (IBCN) research group of the Department of Information Technology (INTEC), Ghent University \u2014 iMinds"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] B. Karp and H.T. Kung, \u201cGPSR: Greedy perimeter stateless routing for wireless networks,\u201d Proc. 6th Annual International Conference on Mobile Computing and Networking, MobiCom'00, pp.243-254, 2000.","DOI":"10.1145\/345910.345953"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Bogu\u00f1\u00e1, F. Papadopoulos, and D. Krioukov, \u201cSustaining the Internet with hyperbolic mapping,\u201d Nature Communications, vol.1, no.6, pp.1-8, 2010.","DOI":"10.1038\/ncomms1063"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E. Baccelli, C. Mehlis, O. Hahm, T.C. Schmidt, and M. W\u00e4hlisch, \u201cInformation centric networking in the IoT: Experiments with NDN in the wild,\u201d arXiv preprint arXiv:1406.6608, 2014.","DOI":"10.1145\/2660129.2660144"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] W. Tavernier, S. Sahhaf, D. Colle, M. Pickavet, and P. Demeester, \u201cTowards content-centric geometric routing,\u201d 2014 IEEE 21st Symposium on Communications and Vehicular Technology in the Benelux (SCVT), pp.133-138, 2014.","DOI":"10.1109\/SCVT.2014.7046722"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Sahhaf, D. Papadimitriou, W. Tavernier, D. Colle, and M. Pickavet, \u201cExperimentation of geometric information routing on content locators,\u201d 2014 IEEE 22nd International Conference on Network Protocols, pp.518-524, 2014.","DOI":"10.1109\/ICNP.2014.82"},{"key":"6","unstructured":"[6] R. Fonseca, S. Ratnasamy, J. Zhao, C. Ee, D. Culler, S. Shenker, and I. Stoica, \u201cBeacon vector routing: Scalable point-to-point routing in wireless sensornets,\u201d Proc. 2nd Conference on Symposium on Networked Systems Design & Implementation, vol.2, pp.329-342, USENIX Association, 2005."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] C.H. Papadimitriou and D. Ratajczak, \u201cOn a conjecture related to geometric routing,\u201d Theoretical Computer Science, vol.344, no.1, pp.3-14, 2005.","DOI":"10.1016\/j.tcs.2005.06.022"},{"key":"8","unstructured":"[8] R. Kleinberg, \u201cGeographic routing using hyperbolic space,\u201d IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1902-1909, 2007."},{"key":"9","unstructured":"[9] A. Cvetkovski and M. Crovella, \u201cHyperbolic embedding and routing for dynamic graphs,\u201d IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.1647-1655, 2009."},{"key":"10","unstructured":"[10] R. Flury, S.V. Pemmaraju, and R. Wattenhofer, \u201cGreedy routing with bounded stretch,\u201d IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.1737-1745, 2009."},{"key":"11","unstructured":"[11] C. Westphal and G. Pei, \u201cScalable routing via greedy embedding,\u201d IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2826-2830, 2009."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, \u201cExperimental validation of resilient tree-based greedy geometric routing,\u201d Computer Networks, vol.82, pp.156-171, 2015.","DOI":"10.1016\/j.comnet.2015.02.022"},{"key":"13","unstructured":"[13] A. Maghsoudlou, M. St-Hilaire, and T. Kunz, \u201cA survey on geographic routing protocols for mobile ad hoc networks,\u201d Systems and Computer Engineering, Technical Report SCE-11-03, Carleton University, 2011."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] D. Eppstein and M.T. Goodrich, \u201cSuccinct greedy geometric routing using hyperbolic geometry,\u201d IEEE Trans. Comput., vol.60, no.11, pp.1571-1580, 2011.","DOI":"10.1109\/TC.2010.257"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] E. Ch\u00e1vez, N. Mitton, and H. Tejeda, \u201cRouting in wireless networks with position trees,\u201d Ad-Hoc, Mobile, and Wireless Networks, pp.32-45, Springer, 2007.","DOI":"10.1007\/978-3-540-74823-6_3"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Tang, H. Chen, G. Zhang, and J. Yang, \u201cTree cover based geographic routing with guaranteed delivery,\u201d 2010 IEEE International Conference on Communications, pp.1-5, 2010.","DOI":"10.1109\/ICC.2010.5502391"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] J. Herzen, C. Westphal, and P. Thiran, \u201cScalable routing easy as PIE: A practical isometric embedding protocol,\u201d 2011 19th IEEE International Conference on Network Protocols, pp.49-58, 2011.","DOI":"10.1109\/ICNP.2011.6089081"},{"key":"18","unstructured":"[18] R. Houthooft, S. Sahhaf, W. Tavernier, F. De Turck, D. Colle, and M. Pickavet, \u201cRobust geometric forest routing with tunable load balancing,\u201d Proc. 2015 IEEE Conference on Computer Communications (INFOCOM), pp.1382-1390, 2015."},{"key":"19","unstructured":"[19] R. Houthooft, S. Sahhaf, W. Tavernier, F. De Turck, D. Colle, and M. Pickavet, \u201cFault-tolerant greedy forest routing for complex networks,\u201d Proc. 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), pp.1-8, 2014."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] M. Hoefling, M. Menth, and M. Hartmann, \u201cA survey of mapping systems for locator\/identifier split Internet routing,\u201d IEEE Communications Surveys & Tutorials, vol.15, no.4, pp.1842-1858, 2013.","DOI":"10.1109\/SURV.2013.011413.00039"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A. Cvetkovski and M. Crovella, \u201cOn the choice of a spanning tree for greedy embedding of network graphs,\u201d Networking Science, vol.3, no.1-4, pp.2-12, 2013.","DOI":"10.1007\/s13119-013-0013-7"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] A. Barab\u00e1si and R. Albert, \u201cEmergence of scaling in random networks,\u201d Science, vol.286, no.5439, pp.509-512, 1999.","DOI":"10.1126\/science.286.5439.509"},{"key":"23","unstructured":"[23] \u201cStandard cell library,\u201d www.zhuhai.gov.cn\/image200105186428.pdf"},{"key":"24","unstructured":"[24] M.R. Meher, C.C. Jong, and C.-H. Chang, \u201cA high bit rate serial-serial multiplier with on-the-fly accumulation by asynchronous counters,\u201d IEEE Trans. Very Lagre Scale Integr. (VLSI) Syst., vol.19, no.10, pp.1733-1745, 2011."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, \u201cLink failure recovery technique for greedy routing in the hyperbolic plane,\u201d Comput. Commun., vol.36, no.6, pp.698-707, 2013.","DOI":"10.1016\/j.comcom.2012.08.023"},{"key":"26","unstructured":"[26] S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, \u201cSingle failure resiliency in greedy routing,\u201d 2013 9th IEEE International Conference on the Design of Reliable Communication Networks (DRCN), pp.306-313, 2013."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/3\/E99.B_2015EBP3268\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:14Z","timestamp":1704898754000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/3\/E99.B_2015EBP3268\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2015ebp3268","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}