Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks

Abstract:
We consider dynamic routing and power allocation for a wireless network with time varying channels. The main reason for this is that the routing algorithm can lead to poor delay performance due to routing loops. Additionally, the implementation of the backpressure algorithm requires each node to maintain per-destination queues that can be burdensome for a wire line or wireless router. Motivated by these considerations, we reexamine the back-pressure routing algorithm in this paper and design a new algorithm that has much superior performance and low implementation complexity. The main purpose of this paper is to study if the shadow queue approach extends to the case of scheduling and routing. In such networks, a relay between two other nodes XORs packets and broadcasts them to decrease the number of transmissions.

Existing System

The n-existent link can be modeled by a rate-power curve that is zero for all power levels at one or more channel states. Thus, the general power curve formulation provides the ability to address hybrid networks containing both wireline and wireless components. The back-pressure algorithm has several disadvantages that prohibit practical implementation.

Disadvantage The routing algorithm can lead to poor delay performance due to routing loops. This problem by introducing a cost function that measures the total amount of resources used by all flows in the network.

Proposed System
We also consider networks where simple forms of network coding are allowed . In such networks, a relay between two other nodes XORs packets and broadcasts them to decrease the number of transmissions. There is a trade off between choosing long routes to possibly increase network coding opportunities (see the notion of reverse carpooling in ) and choosing short routes to reduce resource usage. Our adaptive routing algorithm can be modified to automatically realize this trade off with good delay performance.

Advantage The main purpose of this paper is to study if the shadow queue approach extends to the case of scheduling and routing. The routing algorithm is designed to minimize the average number of hops used by packets in the network.

SYSTEM REQUIREMENT Hardware Requirements Processor Hard Disk Ram Monitor Mouse Keyboard : : Pentium core processors 80 GB : 1 GB : 15VGA Color : Ball / Optical 102 Keys

3.2 Software Requirements Operating System Framework Language Back End : : : Windows XP professional Microsoft Visual Studio .Net 2008 (or) 2010 C#.Net : Sql server 2005