Abstract
In dynamic graphs, node additions and node/link failures cause coordinate updates and routing failures for greedy geometric routing. To avoid the packet local minima, the whole topology should be re-embedded, which causes high overhead. In this paper, a sufficient condition that a spanning tree can be greedily embedded into a metric space is found, which can help us avoid re-embedding. Based on the sufficient condition, a dimensional expanding strategy (DES) for online greedy embedding in high dimensional metric spaces is proposed, which can avoid re-embedding, as well as reducing the overhead.
The first two authors have the same contributions to this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Camelo, M., Papadimitriou, D., Fabrega, L., Vila, P.: Geometric routing with word-metric spaces. IEEE Commun. Lett. 18(12), 2125–2128 (2014)
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–160. IEEE (2005)
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–1655. IEEE (2009)
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–25. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00219-9_3
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–791. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10631-6_79
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–58. IEEE (2011)
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–50. IEEE (2013)
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–254. ACM (2000)
Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceeding of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 1902–1909. IEEE (2007)
Maymounkov, P.: Greedy embeddings, trees, and euclidean vs. lobachevsky geometry. Technical report (2006)
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–17. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27820-7_3
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–108. ACM (2003)
Sahhaf, S., Tavernier, W., Colle, D., Pickavet, M., Demeester, P.: Experimental validation of resilient tree-based greedy geometric routing. Comput. Netw. 82, 156–171 (2015)
Westphal, C., Pei, G.: Scalable routing via greedy embedding. In: Proceeding of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 2826–2830. IEEE (2009)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (No. 61572153, No. 61702220, No. 61702223).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Sun, Y., Li, M., Wang, L., Lu, H. (2018). Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11063. Springer, Cham. https://doi.org/10.1007/978-3-030-00006-6_48
Download citation
DOI: https://doi.org/10.1007/978-3-030-00006-6_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00005-9
Online ISBN: 978-3-030-00006-6
eBook Packages: Computer ScienceComputer Science (R0)