Opportunistic Routing with Congestion Diversity in Wireless Ad Hoc Networks

0
597
Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks

Opportunistic Routing with Congestion Diversity in Wireless Ad Hoc Networks

Abstract

Opportunistic Routing With Congestion Diversity is a promising example that has now been proposed in a wireless ad hoc network for a day. Opportunistic routing has become very popular and as wireless network performance has increased.It has helped improve network performance with the broadcast characteristics of the wireless media.

Introduction

Opportunistic Routing with Congestion Diversity We consider the issue of routing packets in a multi-hop network that includes multiple traffic sources and wireless connections while ensuring usual limited delay.

The main challenge in designing minimum delay routing policies is to balance the trade-off between routing the packets to the destination along the shortest paths in the network and distributing traffic according to the maximum backpressure.projects reports on Opportunistic RoutingOpportunistic Routing (OR) is a new promising paradigm for wireless networks that has been proposed.

System Configuration

H/W System Configuration

Speed                   :    1.1 GHz
 
RAM                      :    256 MB(min)
 
Hard Disk              :    20 GB
 
Floppy Drive          :     1.44 MB
 
Key Board             :    Standard Windows Keyboard
 
Mouse                  :    Two or Three Button Mouse
 
Monitor                :    SVGA
 
S/W System Configuration
 
Operating system       : Windows Xp,7,
 
Server                       : WAMP/Apache
 
Working on                : Browser Like Firefox, I

 

Conclusion

Projects reports on Opportunistic Routing In this Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks paper, combining the important aspects of shortest path routing with those of backpressure routing, projects on Opportunistic Routing we provided a distributed opportunistic routing policy with congestion diversity (D-ORCD) is proposed under which packets are routed according to a rank ordering of the nodes based on a congestion cost measure.

Projects on Opportunistic Routing we show that DORCD allows a practically distributed and asynchronous 802.11 compatible implementation, whose performance was investigated through a detailed set of QualNet simulations in practical and realistic networks. Simulations show that in practical settings DORCD consistently outperforms existing routing algorithms