Packet-by-Packet Adaptive Routing in Communication Networks By using Back Pressure Algorithm

  • Unique Paper ID: 145577
  • PageNo: 596-599
  • Abstract:
  • Data aggregation in WSNs (Wireless Sensor Networks) can effectively reduce communication overheads and the energy consumption of sensor nodes. A WSN needs to be not only energy efficient, but also secure. Various attacks may make data aggregation unsecure. Back-pressure-based adaptive routing is an algorithm in which each packet is routed along different possible paths. This algorithm provides high complexity in implementation and performs high delay. In this paper, we develop a novel adaptive routing algorithm back-pressure algorithm. A probabilistic routing table is used for decoupling the routing and scheduling components. The counters called shadow queues can be used for the scheduling decisions. This algorithm provides low complexity.
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{145577,
        author = {Priyanka.m},
        title = {Packet-by-Packet Adaptive Routing in Communication Networks By using Back Pressure Algorithm},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {10},
        pages = {596-599},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145577},
        abstract = {Data aggregation in WSNs (Wireless Sensor Networks) can effectively reduce communication overheads and the energy consumption of sensor nodes. A WSN needs to be not only energy efficient, but also secure. Various attacks may make data aggregation unsecure. Back-pressure-based adaptive routing is an algorithm in which each packet is routed along different possible paths. This algorithm provides high complexity in implementation and performs high delay. In this paper, we develop a novel adaptive routing algorithm back-pressure algorithm. A probabilistic routing table is used for decoupling the routing and scheduling components. The counters called shadow queues can be used for the scheduling decisions. This algorithm provides low complexity.},
        keywords = {Back-pressurealgorithm,routing,.},
        month = {},
        }

Cite This Article

Priyanka.m, (). Packet-by-Packet Adaptive Routing in Communication Networks By using Back Pressure Algorithm. International Journal of Innovative Research in Technology (IJIRT), 4(10), 596–599.

Related Articles