PROJECT TITLE :
Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks
We have a tendency to take into account the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links whereas making certain bounded expected delay. Each packet transmission will be overheard by a random subset of receiver nodes among which the subsequent relay is chosen opportunistically. The main challenge in the design of minimum-delay routing policies is balancing the trade-off between routing the packets along the shortest ways to the destination and distributing the traffic consistent with the most backpressure. Combining important aspects of shortest path and backpressure routing, this paper provides a scientific development of a distributed opportunistic routing policy with congestion diversity (D-ORCD). D-ORCD uses a measure of draining time to opportunistically determine and route packets along the methods with an expected low overall congestion. D-ORCD with single destination is proved to confirm a bounded expected delay for all networks and below any admissible traffic, so long as the rate of computations is sufficiently fast relative to traffic statistics. Furthermore, this paper proposes a sensible implementation of D-ORCD which empirically optimizes crucial algorithm parameters and their effects on delay plus protocol overhead. Realistic QualNet simulations for 802.eleven-based networks demonstrate a vital improvement in the common delay over comparable solutions in the literature.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here