Proposal and Evaluation Method to Reduce Loops to Congestion Avoidance in Ad Hoc Networks

Main Article Content

Nada Badr Jarah

Abstract

Congestion is the most important problem for private networks, one of this problem is the formation of routing rings when an error occurs in the operation of the routing algorithm between a set of nodes and the path to a particular destination is a loop that leads to cut the connection.


     In the present research we try to limit the formation of guidance rings and avoid congestion by proposing and evaluating the LLD and LMR methods to reduce the Interim loops. The foundation has been given a rationale for the loop prevention performance, and each methods was simulated using the program  Qualnet 4.5  for simulation  ad hoc network.

Article Details

How to Cite
[1]
“Proposal and Evaluation Method to Reduce Loops to Congestion Avoidance in Ad Hoc Networks”, JUBPAS, vol. 29, no. 2, pp. 147–159, Jul. 2021, Accessed: Feb. 18, 2025. [Online]. Available: https://www.journalofbabylon.com/index.php/JUBPAS/article/view/3657
Section
Articles

How to Cite

[1]
“Proposal and Evaluation Method to Reduce Loops to Congestion Avoidance in Ad Hoc Networks”, JUBPAS, vol. 29, no. 2, pp. 147–159, Jul. 2021, Accessed: Feb. 18, 2025. [Online]. Available: https://www.journalofbabylon.com/index.php/JUBPAS/article/view/3657

Similar Articles

You may also start an advanced similarity search for this article.