Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.

Slides:



Advertisements
Similar presentations
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Routing Security in Ad Hoc Networks
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Power saving technique for multi-hop ad hoc wireless networks.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Ad Hoc Wireless Routing COS 461: Computer Networks
HARP-Hybrid Ad Hoc Routing Protocol Navid NIKAEIN Christian BONNET Neda NIKAEIN © 2001 Navid Nikaein Eurecom Institute.
The Zone Routing Protocol (ZRP)
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
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.
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
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.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
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,”
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Ad Hoc Multicast Routing
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Fundamentals of Computer Networks ECE 478/578
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.
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.
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
MZR: A Multicast Protocol based on Zone Routing
Outline Introduction Routing in Mobile Ad Hoc Networks
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
Sensor Network Routing
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Lei Chen and Wendi B. Heinzelman , University of Rochester
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
Proactive vs. Reactive Routing
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
A Talk on Mobile Ad hoc Networks (Manets)
Presentation transcript:

Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz

2 Outline Introduction Source Routing (SR) Problem Related Work SR w/ Mobility Localization (ML) An Example Scenario for ML Evaluation of ML Conclusion

3 Introduction Routing is one of the problems in Mobile Ad Hoc Networks (MANETs) Source Routing (SR) is one of the solutions SR is easily affected by topology changes Aim is to minimize possible overheads due to toplogy changes

4 Source Routing Problem (1/2) SR is a problem of finding maintaining a complete ordered list of nodes through which the packet should pass to reach the destination.

5 Source Routing Problem (2/2) SR consists of Route discovery Route maintenance Discovery procedure is done before any data packet can be send The only overhead associated with SR is discovery (or maintenance) procedure But this overhead can be significant due to rapid topology changes

6 Related Work Works to reduce overhead in SR can be grouped as two catagories Decrease the number of nodes receiving route queries Decrease the number of route requests generated by the source node Location Aided Routing is an example of the first group and Dynamic Source Routing is an example of the second one

7 SR w/ Mobility Localization Fundamental principle behind the ML approach is Even if a mobile node has moved at a time t, there is a fair possiblity that it might be found in the neighborhood until time t+δt δ depends on Velocity vector V Definitiaon of neighborhood

8 SR w/ Mobility Localization So in ML approach a node is attempted to be found in the vicinity instead of restarting the discovery protocol Use of ML affects maintenance procedure, not the discovery procedure

9 SR w/ Mobility Localization When the data link layer of a node reports a transmission error, it analyzes Source route Localization value (α) for the source route Its position in the source route

10 SR w/ Mobility Localization If the node is within α hops from the node encountering next hop error it tries to repair the source route on its own If it is successful traffic is forwarded to the new route Else it checks the value of localization again to see whether any other node just before itself in the source route is eligible to repair the route If such a node exists a route error message is sent to it

11 SR w/ Mobility Localization A node can receive a route error only if it is Within α hops to a node encountering next hop error in a source route the source node In the first case route repair and in the second case route request procedures are executed

12 SR w/ Mobility Localization A node receiving the route error sends a route repair message to every other one- hop neighbor except the node route error is received the node just before itself Route repair is sent in a unicast manner If there is no node to send route repair as unicast message, it is broadcasted Route repair messages have TTL-like info

13 SR w/ Mobility Localization When a node repair message is received It sends route repair reply to originator if it knows the requested node Otherwise it checks whether it can forward route repair message If it can forward, it forwards the message every node except the one the route repair is received from

14 An Example Scenario for ML

15 An Example Scenario for ML

16 An Example Scenario for ML

17 An Example Scenario for ML

18 An Example Scenario for ML

19 Evaluation Evaluation environment is NS Since prominent optimization techniques are already implemented effect of ML on top of others is experimented The maintenance cost is the number of control packets until network is stable Experiment networks have 10 to 20 and 25 nodes Value of localization is between 1 and 3

20 Evaluation

21 Evaluation

22 Evaluation

23 Conclusion ML is an enhancement over existing SR techniques in ad hoc wireless networks ML approach decreases the overhead by significant amount Overhead is not exponential with increase in nuber of nodes Value of localization should be arranged according to average source route length Probabilty of finding the moving node in the neighborhood is important

24 Conclusion Dynamic nature of MANETs strongly affects the effectiveness of ML Lcalization value can be arranged according to the changing dynamics of MANET