A Novel Back Pressure Algorithm using Shadow in Wireless Ad Hoc Network
Ugendhar Addagatla1, V. Janaki2

1Ugendhar Addagatla, Department of Computer Science & Engineering, Guru Nanak Institutions Technical Campus, Ranga Reddy (Telangana), India.
2Dr. V. Janaki, Department of Computer Science & Engineering, Vaagdevi Engineering College, Warangal (Telangana), India.

Manuscript received on 13 June 2017 | Revised Manuscript received on 20 June 2017 | Manuscript Published on 30 June 2017 | PP: 326-328 | Volume-6 Issue-5, June 2017 | Retrieval Number: E5099066517/17©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: In this work, network coding has been recently applied to wireless networks to increase throughput. Back-pressure type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multi-hop wireless networks. We explore the performance of backpressure routing and scheduling for TCP flows over wireless networks. TCP and backpressure are not compatible due to a mismatch between the congestion control mechanism of TCP and the queue size based routing and scheduling of the backpressure framework. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues.
Keywords: Back-Pressure Algorithm, Congestion Control, Probabilistic Routing table, Shadow Queues.

Scope of the Article: WSN