Author:
Bhadra Sandeep,Ferreira Afonso
Abstract
Abstract
Future Internet technologies and the deployment of mobile and nomadic services enable complex communications networks, that have a highly dynamic behavior. This naturally engenders route-discovery problems under changing conditions over these networks, but the temporal variations in the topology of dynamic networks are not effectively captured in a classical graph model. In this paper, we use evolving graphs, which help capture the dynamic characteristics of such networks, in order to compute multicast trees with minimum overall transmission time for a class of wireless mobile dynamic networks. We first show that computing different types of strongly connected components in evolving digraphs is NP-Hard, and then propose a polynomial-time algorithm to build all rooted directed Minimum Spanning Trees in strongly connected dynamic networks. These results open new avenues for the implementation of Internet spanning-tree based protocols over highly dynamic network infrastructures.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications
Reference22 articles.
1. Ambuehl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32th ICALP, pp 1139–1150
2. Andersen FU, Berndt H, Abramowicz H, Tafazolli R (2007) Future internet from mobile and wireless requirements perspective. http://www.emobility.eu.org/
3. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press
4. Bui-Xuan B, Ferreira A, Jarry A (April 2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Found Comput Sci 14(2):267–285
5. Chu YJ, Liu TH (1965) On the shortest arborescence of a directed graph. Sci Sin 14:1396–1400
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献