Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur.

Slides:



Advertisements
Similar presentations
Routing Protocols for Ad-Hoc Networks
Advertisements

1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
A Survey of Secure Wireless Ad Hoc Routing
MANET: Performance Reference: “Performance comparison of two on-demand routing protocols for ad hoc networks”; Perkins, C.E.; Royer, E.M.; Das, S.R.; Marina,
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
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)
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Overview of AODV protocol SNAP Presentation 9/7/2007 Jaein Jeong and Jorge Ortiz.
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
Routing Two papers: Location-Aided Routing (LAR) in mobile ad hoc networks (2000) Ad-hoc On-Demand Distance Vector Routing (1999)
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
Security in Mobile Ad Hoc Networks (MANETs) Group : ►NS. Farid Zafar Sheikh ►NS. Muhammad Zulkifl Khalid ►NS. Muhammad Ali Akbar ►NS. Wasif Mehmood Awan.
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.
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
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.
1 Ad Hoc On-Demand Distance Vector Routing (AODV) Dr. R. B. Patel.
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,
1 A Practical Routing Protocol for Vehicle-formed Mobile Ad Hoc Networks on the Roads 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Wang, S.Y.; Lin, C.C.; Hwang, Y.W.; Tao,
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,”
Traditional Routing A routing protocol sets up a routing table in routers A node makes a local choice depending on global topology.
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.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
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.
Analysis the performance of vehicles ad hoc network simulation based
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
Sensor Network Routing
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
ITIS 6010/8010 Wireless Network Security
Routing in Mobile Ad-hoc Networks
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 2/17 Multi hop Connectivity  Multi hop connectivity is solved for wired networks long ago  Multi hop connectivity for wireless networks is also not new  Many routing protocols like AODV, DSDV, DSR, TBRF etc.  Still no widely accepted solution as we have in wired networks Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 3/17 Proactive vs. Reactive  Routing in MANETs  Proactive routing protocols –maintain consistent and up-to-date information about the network by constantly exchanging routing information among nodes  Reactive routing protocols –initiate an independent route discovery process whenever a source node requires a route to some destination  Reactive approaches have less overhead but require more time to connect source and destination  Reactive is preferable-more suits to low resource nature  Reactive route discovery requires some attention Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 4/17 On-demand behavior in AODV  On-demand Features  An approach based only on reaction to the offered traffic  A reactive protocol might have some proactive (not on-demand) features –In AODV, during the route discovery process, if an in-valid route entry is already present in the routing table, the value of TTL field in the RREQ packet’s IP header is initially set to the hop count value in that entry.  In AODV which is a reactive protocol, dependency on proactive features or stale information is not beneficial Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 5/17 On-demand behavior in AODV  In these simulations  AODV with a reduced proactive feature vs. AODV –Initial value of TTL field will not depend on existing stale entry  AODV with additional proactive feature vs. AODV –Sharing of additional route information Problem AnalysisAd hoc MACFuture Plans Learning during Route Discovery

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 6/17 On-demand behavior in AODV  Simulation Results  NS2.28 with AODV-UU  100 nodes  40 and 80 source/destination pairs  Node speed 1 m/sec  Pause Time 0 seconds  CBR sources  UDP packets of 1024 Bytes Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 7/17 Some other Issues  Broadcast transmissions  Used extensively in both Proactive and Reactive protocols for maintaining routing tables  Is just not affordable  No RTS/CTS which means high risk of collision  Scalability is the major problem in ad hoc networks  Number of nodes  Amount of mobility  Offered load Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 8/17 Ad hoc MAC  A multi hop extension for IEEE MAC header  It is a reactive or on-demand in nature  Exploit the normal MAC operations –No special route/destination request packet/frame –No special route/destination reply packet/frame  Exploits the use of data frame for destination discovery –reduce the delay for connecting source to destination Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 9/17 Modifications to MAC  Additions to MAC header: Multi hop Data Frame (MDF)  Address1 = Recipient Address (RA)  Address2 = Transmitter Address (TA)  Address3 = Destination Address (DA)  Address4 = Source Address (SA)  An additional 2 Bytes cost field –Hop count Problem AnalysisAd hoc MACFuture Plans Octets FCS Frame Body Address 4 SA Sequence Control Address 3 DA Address 2 TA Address 1 RA Duration / ID Frame Control Octets Cost 2

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 10/17 Modifications to MAC  A Forwarding Table is maintained by each node  Destination Address (6 Bytes)  Next Hop (6 Bytes)  Cost (2 Byte)  All frames carry unique sequence number and fragment number in sequence control field (SCF)  Nodes maintain a list of MAC address (sender/TA) and SCF value pairs  In Ad hoc MAC, original sender is SA and not the TA therefore in SCF list SAs should be stored Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 11/17 Protocol Components  Three main components  Learning  Forwarding  Repair  Learning: learning about accessible nodes  Whenever a node receives a multi hop data frame –It adds entries in FWT for TA and SA of the frame if there is no entry for either of them –If there is already an entry for either, this entry will be updated  A repair operation will be performed if the cost of previously stored path is less than the new path Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 12/17 Protocol Components  Forwarding  Originating data frames –If there is an entry for DA in FWT  TA would be the next hop in this entry –Else TA would be broadcast  Relaying frames for other nodes –If DA is broadcast and SCF is new  Broadcast it once again –If DA is uni-cast and SCF is new  Follow same steps as in originating –Frames carrying old SCF will always be dropped Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 13/17 Protocol Components  Repair  Responsible for identifying anomalies in FWTS  Also share information about these anomalies with other nodes  Path Repair Frame (PRF) –A multi hop data frame with no data in frame body Problem AnalysisAd hoc MACFuture Plans Octets FCS CostSA Sequence Control DATARA Duration / ID Frame Control

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 14/17 Protocol Components  Possible situations for Repair operation  A node receives a data frame addressed to itself with RA as a broadcast address –A path repair frame will be sent  RA in this frame would be broadcast  SA and DA will be copied from the data frame just received  The cost field will carry the SCF value of the data frame just received  A node receives a data frame addressed to itself through a path which has higher cost than a path already known to it –A path repair frame will be sent to SA on the previously (low cost) known path  A node receives a data frame with RA as broadcast –A path repair frame will be sent to TA if DA is known Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 15/17 Some Results  25 Nodes  10 and 20 Source/Destination pairs  Speed 1 m/sec  Pause Time 0 seconds  4 packets of 1024 bytes per second generated by each source. Max packets  CBR sources generating UDP packets Problem AnalysisAd hoc MACFuture Plans

Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur Rehman 16/17 Future Work  The initial simulation results show that scalability could be a big challenge  A detailed analysis of network size, mobility, offered load  Detailed analysis of different components and their effects on performance  Comparison with other well known routing protocols  Possibility of different cost metrics Problem AnalysisAd hoc MACFuture Plans

Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Thanks for your attention Habib-ur Rehman