Routing in accumulative networks using Dijkstra�s algorithm

  • Unique Paper ID: 145648
  • PageNo: 920-922
  • Abstract:
  • This paper examines the issue of finding ideal ways in single-source single-goal collective multi hop systems. We consider a solitary source that conveys to a solitary goal helped by a few transfers through numerous bounces. At each jump, just a single hub transmits, while all the different hubs get the transmitted flag and store it after preparing/interpreting and blending it with the signs got in past jumps. That is, we consider that terminals make utilize of cutting-edge vitality amassing transmission/gathering methods, for example, maximal proportion consolidating gathering of redundancy codes, or data amassing with rate less codes. Collective procedures increment correspondence unwavering quality, lessen vitality utilization, and lessening idleness. We research the properties that a steering metric must fulfill in these collective systems to ensure that ideal ways can be figured with Dijkstra's calculation. We display the issue of directing in aggregate multi-bounce systems, as the issue of directing in a hyper graph. We demonstrate that optimality properties in a conventional multi-bounce arrange (monotonicity and is tonicity) are not any more helpful and determine another arrangement of adequate conditions for optimality. We delineate these outcomes by concentrate the base vitality steering issue in static aggregate multi-bounce systems for distinctive sending procedures at transfers.
add_icon3email to a friend

Copyright & License

Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{145648,
        author = {M.Rama Kumar and S.Sajida},
        title = {Routing in accumulative networks using Dijkstra�s algorithm},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {10},
        pages = {920-922},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145648},
        abstract = {This paper examines the issue of finding ideal ways in single-source single-goal collective multi hop systems. We consider a solitary source that conveys to a solitary goal helped by a few transfers through numerous bounces. At each jump, just a single hub transmits, while all the different hubs get the transmitted flag and store it after preparing/interpreting and blending it with the signs got in past jumps. That is, we consider that terminals make utilize of cutting-edge vitality amassing transmission/gathering methods, for example, maximal proportion consolidating gathering of redundancy codes, or data amassing with rate less codes. Collective procedures increment correspondence unwavering quality, lessen vitality utilization, and lessening idleness. We research the properties that a steering metric must fulfill in these collective systems to ensure that ideal ways can be figured with Dijkstra's calculation. We display the issue of directing in aggregate multi-bounce systems, as the issue of directing in a hyper graph. We demonstrate that optimality properties in a conventional multi-bounce arrange (monotonicity and is tonicity) are not any more helpful and determine another arrangement of adequate conditions for optimality. We delineate these outcomes by concentrate the base vitality steering issue in static aggregate multi-bounce systems for distinctive sending procedures at transfers.},
        keywords = {Accumulative multi-hop, energy accumulation, minimum energy, graph theory.},
        month = {},
        }

Cite This Article

Kumar, M., & S.Sajida, (). Routing in accumulative networks using Dijkstra�s algorithm. International Journal of Innovative Research in Technology (IJIRT), 4(10), 920–922.

Related Articles