Contact at or 8097636691
Responsive Ads Here

Thursday, 22 February 2018

Wardrop Routing in Wireless Networks(2009)

Wardrop Routing in Wireless Networks(2009)

In this project we are going to find the Routing protocols for multihop wireless networks have traditionally used shortest path routing to obtain paths to destinations and do not consider traffic load or delay as an explicit factor in the choice of routes. We develop a protocol that adaptively equalizes the mean delay along all utilized routes from a source to destination and does not utilize any routes that have greater mean delay. This is the property satisfied by a system in Wardrop equilibrium. I am going to address the architectural challenges confronted in the software implementation of a multipath, delay-feedback-based, probabilistic routing algorithm. The protocol has been implemented in user space with a small amount of forwarding mechanism in windows. Finally, we discuss a proof-of-concept measurement study of the implementation on a six node testbed.
Existing Systems
  • Proactive protocols maintain routes to all destinations and incur a large routing overhead. Reactive protocols, on the other hand, construct routes on an on-demand basis using a route discovery procedure.
  • CHAMP, built on top of DSR
  • Data protection technologies and provides theoretical explanations as to why so many data recoveries (over 67 percent recoveries) failed.
Proposed System
The main goal of the project is to bridge the gap between the theory of delay-adaptive routing and its implementation and use in practice as a routing protocol for 802.11-based wireless mesh networks.
Limitation of Existing System
  • The pocket loss Is high.
  • CHAMP, built on top of DSR, uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent link breakdowns.
  • The main drawback of the CDP storage is the huge amount of storage space required, which has thus far prevented it from being widely adopted.
Advantages of Proposed System
  • It is used to find the shortest path routing.
  • Wardrop equilibrium differs from a pure delay minimization policy because it takes resequencing delay at the receiver into consideration.

1.      Source design.
2.      Formation of mesh topology.
3.      Finding Shortest path.
4.      Routing the packets S-D
Source design:  
   In this module we are designed the source system, called GUI using java. We are designed like any number of sources can communicate to the intermediate node. The source having the knowledge of neighboring node weights. The information is maintained in the source database.
Formation of mesh topology:
    In this module we are designed the mesh topology network using java awt concept. Each node maintain the information about the neighbor node and the topology is static one.
Finding shortest path:
  1. In this module we are finding the shortest path using the wardrop equilibrium with respect to N * N node grid area. When packets have to be re sequenced at the receiver and delivered in-order to the application, equalizing the average delay along utilized paths reduces receiver socket buffer space requirements and receiver socket buffer re sequencing delays.
2. Equalizing the average delay along utilized paths mitigates TCP congestion misbehavior that results from TCP’s adverse reaction to multiple paths and reordered packets.
3. Route adaptation using delay feedback allows rerouting of flows around traffic bottlenecks in wireless environments. This allows flows to automatically “avoid” each other and minimize interference.
Routing the packets S-D:
  After finding the shortest path the packets are transmitted through the intermediate nodes. The corresponding packets are sent through the source to destination. 
Hardware and Software Requirements
PROCESSOR                :          PENTIUM IV 2.6 GHz
RAM                               :          512 MB DD RAM
MONITOR                    :          15” COLOR
HARD DISK                  :          20 GB
FLOPPY DRIVE           :          1.44 MB
CDDRIVE                      :          LG 52X
KEYBOARD                 :          STANDARD 102 KEYS
MOUSE                          :          3 BUTTONS
Front End                     :           Java, Swing
Tools Used                   :           Net Beans  IDE 6.1
Operating System       :           WindowsXP

No comments:

Post a Comment