Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks

Abstract

Considering the problem across a multi-hop network in routing a packet that is it consists of numerous sources of traffic and multiple links at the same time giving bounded expected delay. A random list which is subset of all nodes of receiver nodes is assigned for each packet transmission among which the next relay node is choose opportunistically. The problematic part in the construction of minimum-delay routing techniques is maintaining the balance between routing the packets along the shortest paths to the destination and distributing the traffic as per the maximum backpressure .Using important element of backpressure routing and shortest path, this project provides a planned development of D-ORCD. Distributed-opportunistic routing with congestion diversity (D-ORCD) make use of criteria of draining time to opportunistically select and route the packets along the paths to destination with a possible minimum overall congestion. Distributed-ORCD with single goal is proved to give a bounded expected delay for all networks and under any reasonable traffic.