Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,

Slides:



Advertisements
Similar presentations
Bandwidth Estimation for IEEE Based Ad Hoc Networks.
Advertisements

The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.
ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
Routing Security in Ad Hoc Networks
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
CIS 725 Wireless networks. Low bandwidth High error rates.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Routing protocols MANET
Mobile Adhoc Network: Routing Protocol:AODV
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
A survey of Routing Attacks in Mobile Ad Hoc Networks Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, and Abbas Jamalipour Presented.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Wireless Sensor Networks COE 499 Energy Aware Routing
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Cache Management of Dynamic Source Routing for Fault Tolerance in Mobile Ad Hoc Networks.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
DSR: Introduction Reference: D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,”
Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Sergio Marti, T.J. Giuli, Kevin.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Energy-Efficient Protocol for Cooperative Networks.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Fundamentals of Computer Networks ECE 478/578
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Mobile Ad Hoc Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
Routing Metrics for Wireless Mesh Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Routing Metrics for Wireless Mesh Networks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
Routing.
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network, route may not exit for long time. Hence, DSR algorithm finds an alternative route when the existing communicating route goes down. It becomes a time consuming process if the communicating route fails frequently. In order to avoid this, we propose a modification to the existing DSR protocol. In this paper, we add a link breakage prediction algorithm to the Dynamic Source Routing (DSR) protocol. The mobile node uses signal power strength from the received packets to predict the link breakage time, and sends a warning to the source node of the packet if the link is soon-to-be-broken. The source node can perform a pro-active route rebuild to avoid disconnection. Intermediate nodes in the route continuously monitor the signal strength at the time of communication, based on a predefined threshold signal value.

Intermediate node sends a message to the source node that the route is likely to be disconnected, if signal strength falls below the threshold value. If source receive this message it starts using backup route and if back route also fails then it finds alternative route. The backup route will minimize the time consuming process of finding an alternative route to some extent. Experiments demonstrate that adding link breakage prediction to DSR can significantly reduce the total number of dropped data packets (by at least 25%). Simulation results shows the probability of the communication breakage decreases when parallel routes are used and comparisons between DSR and Modified DSR(Preemptive Version) with respective to no of broken paths and routing overhead.

Dynamic Source Routing(DSR) The Dynamic Source Routing (DSR) protocol is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. It is based on the concept of source routing, a routing technique in which the sender of the packet determines the complete sequence of the nodes through which to forward the packet. The sender explicitly lists this route in the packets header, identifying each forwarding hop by the address of the next node to which to transmit the packet on its way to the destination host. The DSR protocol consists of two mechanisms: Route Discovery and Route Maintenance.

Proactive Route Maintenance We assume that all nodes wishing to communicate with other nodes within the ad hoc network are willing to participate fully in the protocols of the network. Each node participating in the network should also be willing to forward packets for other nodes in the network. We refer to the minimum number of hops necessary for a packet to reach from source to destination. We assume that he diameter of an ad-hoc network will be small(5 to 10 hops), but greater than 1. Packets may be lost or corrupted in transmission on the ad-hoc wireless network. A node receiving a corrupted packet can detect the error and discard the packet. The GPS and signal strength methods both use physically measured parameters to predict the link status.

The node with GPS can know the position of itself directly. But GPS currently is not a standard component of mobile devices, and in the metropolitan area and indoor, the signal can be too weak to be received. The signal strength method only consumes receiving nodes computing power, and does not depend on any additional device. It is used in this paper. At first we assume that the sender power level is constant. Received signal power samples are measured from packets received from the sender. From this information it is possible to compute the rate of change for a particular neighbors signal power level. Because the signal power threshold for the wireless network interface is fixed, the time when the power level drops below the acceptable value can be computed. Characteristics of PRM include: Freshness. All nodes near an active route have the up-to-date routing information. Broken paths are eliminated, new paths recognized, and non-optimal paths replaced by optimal ones. Robustness.

Proactive Routing Design Route Discovery Broadcasting Using RREQ Primary Route Design Route Maintenance Multiple Routers Data Transmission

Hardware Requirements: Processor - Pentium –IV RAM MB(min) Hard Disk - 20 GB Software Requirements : Operating System-Windows XP Language - Java RMI, SWING,J2ME Mobile toolkit -J2ME Wireless Toolkit Development Tool- My Eclipse 3.0