ADAPTIVE PROBABILISTIC ROUTING ALGORITHM FOR WIRELESS COMMUNICATION NETWORKS: A CASE STUDY OF NETWORK ROUTING PROBLEM.

Authors

  • Chilupuri Anusha Department of ECE, G. Narayanamma Institute of Technology & Science, Hyderabad- 500104
  • Dr S Karunakar Reddy Department of Mathematics, JNTUH College of Engineering JNTUH Hyderabad-500072

Keywords:

Microcontroller; probabilistic algorithm; back-pressure algorithm; Network routing

Abstract

The back-pressure algorithm cannot be efficient for adaptive routing as the delay performance is very
common problem. In this paper, an attempt has been made to design an probabilistic algorithm that is modified version
of back-pressure algorithm. By maintaining a probabilistic routing table that changes slowly over time, real packets do
not have to explore long paths to improve throughput; this functionality is performed by the shadow “packets.” The
proposed algorithm also allows extra link activation to reduce delays. The algorithm has also been shown to reduce the
queueing complexity at each node and can be extended to optimally tradeoff between routing and network coding.

Downloads

Published

2018-04-25

How to Cite

Chilupuri Anusha, & Dr S Karunakar Reddy. (2018). ADAPTIVE PROBABILISTIC ROUTING ALGORITHM FOR WIRELESS COMMUNICATION NETWORKS: A CASE STUDY OF NETWORK ROUTING PROBLEM. International Journal of Advance Engineering and Research Development (IJAERD), 5(4), 298–301. Retrieved from https://www.ijaerd.org/index.php/IJAERD/article/view/5525

Issue

Vol. 5 No. 4 (2018): Volume 5 Issue 4 April 2018

Section

Articles