15-06-2012, 03:33 PM
Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
Abstract:
A major problem is delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. In this paper we are addressing the problem of delivering data packets in mobile ad hoc networks. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. To solve this problem, we propose an efficient Position based Opportunistic Routing protocol (POR) which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In case of communication hole, a Virtual Destination based Void Handling scheme is further proposed to work together with POR and achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.
Existing System:
Mostly ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. One of the main reasons is due to the pre-determination of an end-to-end route before data transmission. Owing to the constantly and even fast changing network topology, it is very difficult to maintain a deterministic route. The discovery and recovery procedures are also time and energy consuming. Once the path breaks, data packets will get lost or be delayed for a long time until the reconstruction of the route, causing transmission interruption.
Disadvantage:
• Pre-determination of an end-to-end route will be constructed before data transmission.
• No guarantee the data will send to destination.
• Required more time and energy to discovery and recovery the route to send data.
Proposed System:
MOBILE ad hoc networks (MANETs) have gained a great deal of attention because of its significant advantages brought about by multi-hop, infrastructure-less transmission. However, due to dynamic network topology the reliable data delivery in network, especially in challenged environments with high mobility remains an issue. We propose the new structure which takes advantage of the broadcast nature of network. By utilizing intermediate nodes as air-backup, communication is maintained without being interrupted. There will be n number of candidates nodes among the network, if the best candidate does not forward the packet in certain time slots, suboptimal Candidates will take turn to forward the packet according to a locally formed order. In this way, as long as one of the candidates succeeds in receiving and forwarding the packet, the data transmission will not be interrupted.
Advantage:
• No end-to-end routes need to be maintained, leading to high efficiency and scalability in transfer
• The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased.
• No data loss.
• Data can be forward through neighbor node to the destination node.
Hardware Requirements:
• SYSTEM : Pentium IV 2.4 GHz
• HARD DISK : 40 GB
• MONITOR : 15 VGA colour
• MOUSE : Logitech.
• RAM : 256 MB
• KEYBOARD : 110 keys enhanced.
Software Requirements
• Operating system :- Windows 7/XP Professional
• Front End :- Microsoft Visual Studio 2010
• Coding Language :- C#.NET
• Database :- SQL SERVER 2005