{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090335,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030000059"},{"type":"electronic","value":"9783030000066"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00006-6_48","type":"book-chapter","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T15:27:56Z","timestamp":1540999676000},"page":"525-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree"],"prefix":"10.1007","author":[{"given":"Yanbin","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,1]]},"reference":[{"issue":"12","key":"48_CR1","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1109\/LCOMM.2014.2364213","volume":"18","author":"M Camelo","year":"2014","unstructured":"Camelo, M., Papadimitriou, D., Fabrega, L., Vila, P.: Geometric routing with word-metric spaces. IEEE Commun. Lett. 18(12), 2125\u20132128 (2014)","journal-title":"IEEE Commun. Lett."},{"doi-asserted-by":"crossref","unstructured":"Caruso, A., Chessa, S., De, S., Urpi, A.: GPS free coordinate assignment and routing in wireless sensor networks. In: Proceedings of the 24th IEEE International Conference on Computer Communications (INFOCOM), pp. 150\u2013160. IEEE (2005)","key":"48_CR2","DOI":"10.1109\/INFCOM.2005.1497887"},{"doi-asserted-by":"crossref","unstructured":"Cvetkovski, A., Crovella, M.: Hyperbolic embedding and routing for dynamic graphs. In: Proceeding of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 1647\u20131655. IEEE (2009)","key":"48_CR3","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-00219-9_3","volume-title":"Graph Drawing","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 14\u201325. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00219-9_3"},{"key":"48_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Algorithms and Computation","author":"MT Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the Euclidean plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 781\u2013791. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10631-6_79"},{"doi-asserted-by":"crossref","unstructured":"Herzen, J., Westphal, C., Thiran, P.: Scalable routing easy as PIE: a practical isometric embedding protocol. In: Proceeding of the 19th IEEE International Conference on Network Protocols (ICNP), pp. 49\u201358. IEEE (2011)","key":"48_CR6","DOI":"10.1109\/ICNP.2011.6089081"},{"doi-asserted-by":"crossref","unstructured":"Hofer, A., Roos, S., Strufe, T.: Greedy embedding, routing and content addressing for darknets. In: Proceedings of 2013 Conference on Networked Systems (NetSys), pp. 43\u201350. IEEE (2013)","key":"48_CR7","DOI":"10.1109\/NetSys.2013.23"},{"doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243\u2013254. ACM (2000)","key":"48_CR8","DOI":"10.1145\/345910.345953"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceeding of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 1902\u20131909. IEEE (2007)","key":"48_CR9","DOI":"10.1109\/INFCOM.2007.221"},{"unstructured":"Maymounkov, P.: Greedy embeddings, trees, and euclidean vs. lobachevsky geometry. Technical report (2006)","key":"48_CR10"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-27820-7_3","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"CH Papadimitriou","year":"2004","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 9\u201317. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27820-7_3"},{"doi-asserted-by":"crossref","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 96\u2013108. ACM (2003)","key":"48_CR12","DOI":"10.1145\/938985.938996"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.comnet.2015.02.022","volume":"82","author":"S Sahhaf","year":"2015","unstructured":"Sahhaf, S., Tavernier, W., Colle, D., Pickavet, M., Demeester, P.: Experimental validation of resilient tree-based greedy geometric routing. Comput. Netw. 82, 156\u2013171 (2015)","journal-title":"Comput. Netw."},{"doi-asserted-by":"crossref","unstructured":"Westphal, C., Pei, G.: Scalable routing via greedy embedding. In: Proceeding of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 2826\u20132830. IEEE (2009)","key":"48_CR14","DOI":"10.1109\/INFCOM.2009.5062240"}],"container-title":["Lecture Notes in Computer Science","Cloud Computing and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00006-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T15:44:44Z","timestamp":1541000684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00006-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000059","9783030000066"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00006-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cloud Computing and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incodldos2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icccsconf.org\/icccs2018.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}