Dynamic Communication Networks- Evolving Graphs

Article Sidebar

PDF HTML
Published: Sep 1, 2022
Keywords:
dynamic communication networks, evolving graphs, mobile and nomadic services, complexity, dynamic behavior, modeling, algorithms, evolving setting, shortest paths, fixed-schedule dynamic networks

Main Article Content

Authors

Dr. J. K. Navis Vigilia

Assistant Professor, Department Of Mathematics, Jyoti Nivas College Autonomous, Bengaluru

Dr. V. Margret Ponrani

Assistant Professor, Department Of Mathematics, Jyoti Nivas College Autonomous, Bengaluru

Abstract

New technologies and the deployment of mobile and nomadic services are driving theemergence of complex com- munications networks, that have a highly dynamic behavior. Modeling suchdynamics, and designing algorithms that take it into account, received considerable attention recently. Inthis paper, we introduce the evolving graphs, a simple model which aims at harnessing the complexity ofan evolving setting as yielded by dynamic communication networks. We exemplify its use through thecomputation of shortest paths under different hypotheses in fixed-schedule dynamic networks.

Downloads

Download data is not yet available.

Article Details

Issue

Vol. 19 No. 3 (2022): Journal of Advances in Science and Technology (JAST)

Section

Articles

References

  1. ARC INRIA. Algorithmique et analyse des graphes dynamiques, www.hipercom.inria.fr/soleil.
  2. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
  3. COLOR INRIA Sophia-Antipolis. Proble`mes de dynamicite´ dans les re´seaux.
  4. D. Coudert. Private communication, February 2002.
  5. C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings of the 4th Workshop on Algorithm Engineering (WAE) 2000, volume 1982 of LNCS, pages 218–229, Saarbru¨cken, Germany, September 2001.
  6. European FET project. Critical Resource Sharing for Cooperation in Complex Systems.
  7. G. Fasoli. Graphes e´volutifs et re´seaux radio-mobiles : simulation et visualisation d’algorithmes de plus court chemins. Rapport de stage, EPF & INRIA Sophia Antipolis, avril 2002.
  8. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and handover in satellite networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, pages 473–493. John Wiley and Sons, 2002.
  9. A. Ferreira and L. Viennot. A note on models, algorithms, and data structures for dynamic communication networks. Technical Report 4403, INRIA, 2002.
  10. T. Goff, N. Abu-Ghazaleh, D. Phatak, and R. Kahvecioglu. Preemptive routing in ad hoc networks. In Proceedings of the seventh International Conference on Mobile Computing and Networking (MobiCom’01), pages 43–52, Rome, Italy, July 2001. ACM.
  11. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochas- tic models for the web graph. In Proceedings of the IEEE Symposium on Foundations of Computer Science,, 2000.
  12. X. Lin, M. Lakshdisi, and I. Stojmenovic. Location based localize alternate, disjoint, multi- path and component routing schemes for wireless networks. In Proceedings of the 2001 ACM International Symposium on Mobile ad hoc Networking and Computing (MobiHoc’01), pages 287–290, October 2001.
  13. C. Scheideler. Models and techniques for communication in dynamic networks. In H. Alt and A. Ferreira, editors, Proceedings of the 19th STACS, volume 2285 of LNCS, pages 27–49, Juan-les-Pins, France, March 2002. Springer-Verlag.
  14. V. Stix. Finding all maximal cliques in evolving graphs. Technical Report TR2001-05, De- partment of Statistics and Decision Support Systems, University of Vienna, February 2001.
  15. L. Viennot. Routage entre robots dont les de´placements sont connus – Un exemple de graphe dynamique. Re´union TAROT, ENST, Paris, Novembre 2001.