Chapter 16 Wireless LAN, Mobile Ad Hoc Networks, and MANET Routing Protocols Associate Prof. Yuh-Shyan Chen Department of CSIE National Chung Cheng University 2002/11/ Yuh-Shyan Chen 1
Wireless Network Models With Infrastructure: Without Infrastructure (ad hoc networks): 2002/11/ Yuh-Shyan Chen 2
Various Wireless Network Models 2002/11/ Yuh-Shyan Chen 3
Illustration of an ad hoc network 2002/11/ Yuh-Shyan Chen 4
Wireless Sensor Networks (WSNET) 2002/11/ Yuh-Shyan Chen 5
Bluetooth Scatternet 2002/11/ Yuh-Shyan Chen 6
Wireless LAN and PAN Techniques 2002/11/ Yuh-Shyan Chen 7
Comparison between 802.11 Protocols and Bluetooth 2002/11/ Yuh-Shyan Chen 8
The Data Rate vs. Distance 2002/11/ Yuh-Shyan Chen 9
Outline of Mobile Ad Hoc Networks Routing = Ants Searching for Food Introduction to Ad Hoc Wireless Networks Ad-Hoc Routing Protocols (Proactive vs. Reactive) Ad Hoc Networks 2002/11/ Yuh-Shyan Chen 10
Problem Definition Design efficient routing protocols in Mobile Ad-Hoc NETwork (MANET) Design Difficulty: Changeable Topology 2002/11/ Yuh-Shyan Chen 11
Routing = Ants Searching for Food???????????????????????????????? 2002/11/ Yuh-Shyan Chen 12
2002/11/ Yuh-Shyan Chen 13
Example: 2002/11/ Yuh-Shyan Chen 14
Three Main Issues in Ants Life Route Discovery: Searching for the places with food Packet Forwarding: Delivering foods back home Route Maintenance: When foods move to new place 2002/11/ Yuh-Shyan Chen 15
Mobile Ad Hoc Networks Infrastructureless mobile network No fixed routers, no base stations All nodes can move and be connected dynamically All nodes is treated as routers Application battlefield, disaster areas 2002/11/ Yuh-Shyan Chen 16
Challenge of Ad Hoc NETs No centralized entity Host is no longer just an end system Acting as an intermediate system Changing network topology over time Every node can be mobile 2002/11/ Yuh-Shyan Chen 17
Overview of current approaches 2002/11/ Yuh-Shyan Chen 18
Proactive vs. Reactive Routing Proactive Routing Protocol (Table-Driven) Continuously evaluate the routes Attempt to maintain consistent, up-to-date routing information When a route is needed, one may be ready immediately When the network topology changes The protocol responds by propagating updates throughout the network to maintain a consistent view Reactive Routing Protocol (On-Demand-Drien) Ex: DSR, AODV 2002/11/ Yuh-Shyan Chen 19
On-demand vs Table-driven Parameters On-demand Table-driven 2002/11/ Yuh-Shyan Chen 20
Table-Driven Routing DSDV: Destination Sequence Distance Vector CGSR: Clustered Gateway Switch Routing 2002/11/ Yuh-Shyan Chen 21
DSDV Destination Sequenced Distance Vector Table-driven Based on the distributed Bellman-Ford routing algorithm Each node maintains a routing table Routing hops to each destination Sequence number 2002/11/ Yuh-Shyan Chen 22
DSDV 2002/11/ Yuh-Shyan Chen 23
DSDV(cont.) 2002/11/ Yuh-Shyan Chen 24
DSDV(cont.) 2002/11/ Yuh-Shyan Chen 25
DSDV Problem Solution A lot of control traffic in the network two types of route update packets Full dump All available routing information Incremental Only information changed since the last full dump 2002/11/ Yuh-Shyan Chen 26
On-Demand Routing DSR(Dynamic Source Routing) AODV(Ad Hoc On-Demand Distance Vector) TORA(Temporally Ordered Routing Algorithm) MER-TORA (micromobility protocol) IP Mobility Support handover solutions LAR(Location-Aware Routing) ZRP(Zone Routing Protocol) SSA(Signal Stability-Based Adaptive Routing) 2002/11/ Yuh-Shyan Chen 27
DSR(Dynamic Source Routing) 2002/11/ Yuh-Shyan Chen 28
DSR Dynamic Source Routing [1996] On-demand driven Based on the concept of source routing Required to maintain route caches Two major phases Route discovery Route maintenance A route error packet 2002/11/ Yuh-Shyan Chen 29
DSR 2002/11/ Yuh-Shyan Chen 30
DSR(cont.) 2002/11/ Yuh-Shyan Chen 31
DSR: Route Request(RREQ) 2002/11/ Yuh-Shyan Chen 32
DSR: Route Reply(RREP) 2002/11/ Yuh-Shyan Chen 33
DSR: Data Packet 2002/11/ Yuh-Shyan Chen 34
DSR: Error Packet 2002/11/ Yuh-Shyan Chen 35
AODV(Ad Hoc On-Demand Distance Vector) 2002/11/ Yuh-Shyan Chen 36
AODV Ad hoc On-demand Distance Vector On-demand driven Nodes that are not on the selected path do not maintain routing information Route discovery The source node broadcasts a route request packet (RREQ) The destination or an intermediate node with fresh enough route to the destination replies a route reply packet (RREP) 2002/11/ Yuh-Shyan Chen 37
AODV 2002/11/ Yuh-Shyan Chen 38
AODV (cont.) 2002/11/ Yuh-Shyan Chen 39
AODV: Route Request 2002/11/ Yuh-Shyan Chen 40
AODV: Route Reply 2002/11/ Yuh-Shyan Chen 41
AODV Problem A node along the route moves Solution Upstream neighbor notices the move Propagates a link failure notification message to each of its active upstream neighbors The source node receives the message and reinitiate route discovery 2002/11/ Yuh-Shyan Chen 42
ZRP(Zone Routing Protocol)- Combining Pro-active and Reactive 2002/11/ Yuh-Shyan Chen 43
ZRP Zone Routing Protocol Hybrid protocol On-demand Proactive ZRP has three sub-protocols Intrazone Routing Protocol (IARP) Interzone Routing Protocol (IERP) Bordercast Resolution Protocol (BRP) 2002/11/ Yuh-Shyan Chen 44
Zone of Node Y Border Node Zone of Node Y Bordercasting Border Node Node X Zone Radius = r Hops Node Z Zone of Node X Zone of Node Z 2002/11/ Yuh-Shyan Chen 45
ZRP 2002/11/ Yuh-Shyan Chen 46
Location-Aware Routing (1) LAR 2002/11/ Yuh-Shyan Chen 47
LAR Location-Aided Routing [Mobicom 98 best paper award] Location information via GPS Shortcoming GPS availability is not yet worldwide Position information come with deviation 2002/11/ Yuh-Shyan Chen 48
Request Zone Expected Zone (Xd+R, Yd+R) DEST R (Xd,Yd) SRC 2002/11/ (Xs,Ys) Yuh-Shyan Chen 49
LAR 2002/11/ Yuh-Shyan Chen 50
LAR(cont.) 2002/11/ Yuh-Shyan Chen 51
Notebook + GPS 2002/11/ Yuh-Shyan Chen 52
SSA(Signal Stability-Based Adaptive Routing) 2002/11/ Yuh-Shyan Chen 53
SSA 2002/11/ Yuh-Shyan Chen 54
SSA(cont.) 2002/11/ Yuh-Shyan Chen 55
Power-Aware Routing 2002/11/ Yuh-Shyan Chen 56
PAR Power-Aware Routing N1 + N2 + SRC + + DES T N3 + N4 + 2002/11/ Yuh-Shyan Chen 57
Mobile Ad-hoc Networks (manet) Working Group Internet-Drafts: (http://www.cs.ccu.edu.tw/~yschen/course/92-1/wireless-92.html) The Zone Routing Protocol (ZRP) for Ad Hoc Networks (38377 bytes) Ad Hoc On Demand Distance Vector (AODV) Routing (84395 bytes) The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (192667 bytes) On-Demand Multicast Routing Protocol (ODMRP) for Ad-Hoc Networks (59372 bytes) Topology Broadcast based on Reverse-Path Forwarding (TBRPF) (112739 bytes) Landmark Routing Protocol (LANMAR) for Large Scale Ad Hoc Networks (50155 bytes) Fisheye State Routing Protocol (FSR) for Ad Hoc Networks (38463 bytes) The Interzone Routing Protocol (IERP) for Ad Hoc Networks (40534 bytes) The Intrazone Routing Protocol (IARP) for Ad Hoc Networks (32486 bytes) The Bordercast Resolution Protocol (BRP) for Ad Hoc Networks (35570 bytes) 2002/11/ Yuh-Shyan Chen 58
Wireless and Mobile Network Lab. 所設計的 MANET System 2002/11/ Yuh-Shyan Chen 59
Current Results (IPv4 Multi-hop) Yahoo or Hinet Eth0: 140.123.102.64 IP Protocol Eth0:140.123.102.65 Eth1: 192.168.10.40 Eth1: 140.123.102.61 192.168.10.13 MANET Routing (DSDV) 140.123.102.59 2002/11/ Yuh-Shyan Chen 60 192.168.10.20 140.123.102.62
Eth0: 140.123.102.64 Eth0:140.123.102.65 Eth1: 192.168.10.40 Eth1: 140.123.102.61 192.168.10.13 140.123.102.59 2002/11/ Yuh-Shyan Chen 61 192.168.10.20 140.123.102.62
2002/11/ Yuh-Shyan Chen 62
Yahoo or Hinet Eth0: 140.123.102.64 Eth0:140.123.102.65 Eth1: 192.168.10.40 Eth1: 140.123.102.61 192.168.10.13 140.123.102.59 2002/11/ Yuh-Shyan Chen 63 192.168.10.20 140.123.102.62
2002/11/ Yuh-Shyan Chen 64
2002/11/ Yuh-Shyan Chen 65