OCT-11-2082 11:19 FROM: e Mobile Ad hoc Networking To: 815 642 eE52 Elizabeth M. Belding-Royer University of California, Santa Barbara Sung-Ju Lee Hewlett Packard Laboratories vtSB “tag, Why Go Wireless? » Mobile wireless networks « Enable anywhere/anytime connectivity = Bring computer communications to areas without pre-existing infrastructure = Enable mobility « Enable new applications « Are an exciting new research area P.ea1-aE4OCT-11-2082 11:19 FROM: “ae Types of Wireless Networks - Infrastructured Networks » Fixed, wired backbone » Mobiles communicate directly with access points » Suitable for locations where access points can be placed Types of Wireless Networks Infrastructureless Networks (Ad hoc networks) = No wired backbone » All nodes are capable of movement « All nodes serve as routers (multi-hop routes) = Reduced administrative cost + Ease of deployment TO: 615 642 eE52 Pieee-an4OcT-11-2082 11:19 FROM: * hoc Network Applications = Spontaneous networking (conferences, college campuses, businesses, in-field research) » Battlefield = Emergency search-and-rescue » Rooftop networks = Personal area networks * Mobility Characteristics a Nodes » Limited power » Few resources = Dynamic topology » Addressing « Wireless channel = High error rates «= High quality variability » Low bandwidth: = Broadcast nature Security issues Aa TO: 815 642 eE52 Pees-en4OCT-14-2002 11:19 FROM: TO: 815 642 ea5e P.204-e24 Notes = A lot of recent work in this area = Cannot cover everything in this tutorial = Will study some of the most well-known protocols in detail; will introduce others = Terminologies may be used differently for different protocols (@.g., sequence numbers) wg lutorial Roadmap Medium Access Control (IEEE 802.11) Unicast ‘= Proactive (DSDY) = Reactive (AODV, DSR) = Geographical (LAR) = Clustering/Hierarchical Multicast 1» Tree-based (MAODV) = Mesh-based (ODMRP) 1» Geographical (LEM) ‘Transport Other Issues and Future DirectionsOCT-11-2082 11:19 FROM: To: 815 642 eE52 P.eas-e24 Further Readings _ = Charles Perkins, Ed., “Ad Hoc Networking,” Addison-Wesley, Dec, 2000, = IETF MANET Working Group, http://www etf-org/html.charters/manet-charter.html Proceedings of the IEEE, vol. 75, no. 1, Jan 1987 Recent ad hoc networks special issues from + TEE JSAC, vol, 17, no. 8, Aug 1989 «= IEEE Personal Communications Magazine, vol. 8, no. 1, Feb 2001. + TEE Communications Magazine, vol 29, no. 6, Jun 2004 © ACM/Kiuwer MONET, vol. 4, no, 3, Oct 1999 + Stil more coming... = Recent proceedings from MobiHoc, MobiCom, Infocom, GlobeCom, ICC, WCNC, ICCCN, etc. Medium Access Control (MAC) " ProtocolsOCT-11-2082 11:19 FROM: To: 815 642 eE52 : Motivation = Why do we need a different MAC layer for ad hoc networks? + Mobility + Different network characteristics than wired environment + Power management + Bandwidth + Interference = Security = CSMA/CD (Ethernet) doesn’t work with half-duplex radios * Other Problems idden terminal problem » Even if the medium is free near the transmitter, it may not be free near the intended receiver = Exposed terminal problem » Even if the medium is busy near the transmitter, it may be free near the intended receiver P.e26-024D 2 2ar- eed OCT-14-2002 11:19 FROM: TO: 815 642 ea5e Pear. ~ Hidden Terminal Problem Will collide with ‘wansmission froma A at B Exposed Terminal Problem ‘Cannot send to D due t canter senseOCT-11-2002 11:20 FROM: TO: 815 642 ea5e P.2e6-824 Previous Wireless MAC Schemes a CSMA = Cartier sense before transmitung a MACA = Uses RTS/CTS to acquire the channel before transmitting = FAMA = Similar to MACA but with carrier sense = MACAW = Similar to MACA but with extra control frat ‘acknowledgements, different backoff scheme’ and separation of streams IEEE 802.11 = Physical Layer Specifications = DSSS; Direct Sequence Spread Spectrum » FHSS; Frequency Hopping Spread Spectrum « Infrared (IR) pulse position modulationOCT-11-2082 11:28 FROM: To: 815 642 eE52 P.e29-eE4 IEEE 802.11 = MAC Layer » Distributed Coordination Function (DCF) += Allows for ad hoc network communication between cls nodes * (RTS/CTSyDat » Point Coordination Function (PCF) = Implemented on top of DCF, if access points are: CSMA/CA with ACK, virtual carrier sense te/ACK) keene Veco pay “au, CSMA/CA » Carrier sense: When a node wishes to transmit @ packet, it first waits until the channel is idle + Station wishing to broadcast senses the channel + If channel is busy, defer transmission «= If channel is not busy, transmit = Collision avoidance: Once channel becomes idle, the node waits for a randomly chosen duration before attempting to transmit «If medium is busy, run exponential backoff algorithm + If medium is not busy, it must remain free for ‘specified interval before station can transmitOCT-11-2082 11:28 FROM: To: 815 642 eE52 P.e1e-224 <-> E Virtual Carrier Sense = For unicast transmissions only «= Request to Send (RTS) Packet «= Check if OK to send to receiver = Clear to Send (CTS) Packet = Receiver says OK to send = Virtual Carrier Sense Indicator of 3rd party = Network Allocation Vector set when overhearing either RTS or CTS packet, same as physical carrier sense indicates busy * Hidden Terminal Avoidance 10OCT-11-2082 11:28 FROM: To: 815 642 eE52 P.e11-eE4 B controls medium, transmitting to C. A in range of B only, D in range of C only. a E_ Positive Acknowledgement = The receiving station checks the CRC and sequence number of the arriving packet, and sends an acknowledgement packet itOCT-11-2082 11:28 FROM: To: 815 642 eE52 P.e12-224 + Exponential Backoff Algorithm = Select random number of slot times to defer transmission, keep as a state variable = After channel has been idle for specified interval, decrement variable after each idle slot passes = If carrier Is sensed, freeze variable countdown, wait for channel to become idle again and resume countdown Example | Bi~25 B1=5 ‘ait _ t i wait B2=20 B2=15 B2=10 B1 and B2 are backoff intervals at nodes # and 2 12OCT-14-2002 11:26 FROM: “he Exponential Backoff Algorithm = No response from RTS or lost ACKs necessitates retransmission «= Contention window is doubled, until reaching CWrax = After successful transmissions » Contention window reset to CWrin a MAC Summary _ = Designing MAC protocols for ad hoc networks is very difficult # Issues to consider: = Hidden/exposed terminal = Collision avoidance «= Congestion control » Fairmess = Reliability = Energy efficiency = IEEE 802.11 DCF (RTS/CTS/DATA/ACK) widely used, but many other protocols are proposed 13 TO: 815 642 ea5e P.e1s-ec4OCT-11-2082 11:21 FROM: + Further Readings _ # Lots of MAC protocols published in MobiCom, Infocom, GlobeCom, ICC, Mobittoc, WCNC, VTC, ete, = CSMA: L. Kleinrock and F.A. Tobagi, "Packet Switching in Radio Channels: Part I-Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics,” EEE Transactions on Communications, vol. COM-23, no. 12, Dec. 1975, pp. 1400-1416. MACA: P. Karn, "MACA — A New Channel Access Protocol for Packet Radio,” ARRL/CRRL Amateur Radio S* Computer Networking Conference, 1990, pp. 134-140. > Further Readings Il » FAMA: C.L. Fullmer and J.J. Garcla-Luna-Aceves, “Floor Acquisition Multiple Access (FAMA) for Packet-Radio Networks,” Proceedings of ACM SIGCOMM'95, Cambridge, MA, Aug, 1995, pp. 262-273. MACAW: V. Bharghavan, A. Demers, S, Shenker, and L. Zhang, "MACAW: A Media Access Protocol for Wireless LANs," Proceedings of ACM SIGCOMM'94, London, UK, Sep. 1994, pp. 212-225. IEEE Computer Society LAN MAN Standards Committee, “Wireless LAN Medium Access Protocol (MAC) and Physical Layer (PHY) Specification,” IEEE Std 802.11 USM IMAAHELLINLIMELLILLMELANLLAELALAEI 14 To: 815 642 eE52 Pie1aen4OCT-11-2082 11:21 FROM: To: 815 642 eE52 + Goals Ill = Minimal control overhead = Minimal processing overhead = Multi-hop path routing capability = Dynamic topology maintenance = No loops «= Self-starting P.e15-224 AS.OCT-11-2082 11:21 FROM: To: 815 642 eE52 + 2 Primary Approaches = Proactive + Based on traditional distance-vector and link-state Protocols = Each node maintains route to each other network node » Periodic and/or event triggered routing update exchange + Higher overhead in most scenarios » Longer route convergence time = Examples: DSDV, TBRPF, OLSR 2 Primary Approaches (cont.) = Reactive (on-demand) = Source build routes on-demand by “flooding” » Maintain only active routes = Route discovery cycle = Typically, less control overhead, better scaling Properties = Drawback: route acquisttion latency + Example: AODV, DSR P.a16-224 16OCT-14-2002 11:21 FROM: To: 815 642 Babe FUT TTL _ Destination-Sequenced * Distance-Vector (DSDV) Routing = Proactive = Each node maintains its own sequence number + Updates at each change in neighborhood information «= Used for loop freedom = Each node maintains routing table with entry for each node in the network DSDV: Routing Updates = Each node periodically transmits updates = Includes its own seq#, route table updates = Nodes also send routing table updates for important link changes (i.e., link breaks) = When two routes to a destination received from two different neighbors = Choose the one with the greatest destination sequence number = If equal, choose the smaller hopcount A P.e17-@24OCT-11-2082 11:21 FROM: To: 815 642 eEse P.e16-024 DSDV: Full Dump/ Incremental Updates = Full dumps = Cary all routing table information « Transmitted relatively infrequently = Incremental updates = Carry only information changed since last full dump = Fits within one network protocol data unit (NPDU) « When updates can no longer fit in one NPDU, send full dump * L_DSDV: Link Additions oe. B’s Route Table: ase Gier Dime ot E15S.D.2 1. Node A joins network 18OCT-11-2082 11:21 FROM: To: 815 642 eEs2 | + DSDV: Link Additions 5.8.0 oe 1 B1ss.b.2 1. Node A joins network 2. Node A transmits routing table: + DSDV: Link Additions B’s Route Table: 212.30 e1ec1 (D,202,D.1 E18D,2 A101 dt 1. Node A joins network 2, Node A transmits routing table: 2. Node receives transmission, inserts into route table P.219-224 ae| | OCT-11-2082 11:22 FROM: To: 815 642 eESe + DSDV: Link Additions B’s Route Table: Blind aie cy D2D.1 2155.02 ALA 4 Node 2 propagates new route information to neighbors: > DSDV: Link Additions asi B's Route Table: ; Lc 4,101.4, 1 4. Node & propagates new route information to neighbors: 8. Neighbors update their routing tables with , and continue propagation of information a MRL AML IAEA SALINE LLALL LALLA P.ee6-024 20OCT-11-2082 11:22 FROM: To: 615 642 eE52 = DSDV: Link Breaks — 4101.4, 1. Link between Band D breaks * L_DSDV: Link Breaks 5 lll, _& See ain G 144.1 @—@ 2d E156, D2 4, 101,4)1 a. Link between Band D breaks 2 Node Bnotices break 1. Updates hopcount for Dand Eto be infinity > Increments seq# for Dand F P.ge1-0E4 21a 2 P.eee-e24 OCT-11-2002 11:22 FROM: To: 815 642 ea5e vg DSDV: Link Breaks mies e—@ DB, 203, De £156, 0. 4,102,4,] 1, Link between Band D breaks 2 Node Bnotices break 2 Updates hopcount for Dand Fo be infinity 2 Increments seq# for Dand E 2. Node &sends update with new route information DSDV: Damping Route Fluctuations = Settling time: time to get all the updated advertisements for a route = Walt settling time before advertising new routes with higher metric to prevent frequent route update ‘transmissions » Maintain table with weighted average settling time and last settling time for neighbors and destinationsTo: 815 642 ex52 OCT-11-2082 11:22 FROM: > DSDV: Summary = Proactive = Routes maintained through periodic and event triggered routing table exchanges = Incremental dumps and settling time used to reduce control overhead Proactive protocols tend to perform best in networks with low to moderate mobility, few nodes, and many data sessions aT TTC ELLEN ULLT Ad hoc On-Demand Distance * s Vector (AODV) Routing = Reactive = Route discovery cycle used for route finding «= Maintenance of active routes «= Sequence numbers used for loop prevention and as route freshness criteria = Descendant of DSDV = Provides unicast and multicast communication | 623-024 ea41-2002 11:22 FROM: To: 815 642 eEs2 P.ee4-eR4 ocT-44- : i LEO + » AODV: Route Discovery 1. Node Sneeds a route to D TUTTLE cs * AODV: Route Discovery ~@-—@ 1. Node Sneeds a route to D 2 Creates a Route Request (RREQ) Enters D's IP addr, seq#, S's IP addr, seq# hopcount (=0) 24528-180" > AODV: Route Discovery 1 Node Sneeds a route to D 2 Creates a Route Request (RREQ) Enters D's IP addr, seqi#, ‘S's IP addr, seq# hopcount (=0) 3. Node Sbroadcasts RREQ to neighbors ~~ __ AODV: Route Discovery S RREQS ac — 4. Node A receives RREQ = Makes reverse route entry for $ dest=, nexthop=5, hopent=1 = Ithas no route to D, so it rebroadcasts RREQ 2500 BPO Ste :OL 25 HOM $2TT 2002-11-104 AODV: Route Discovery ai. 4. Node A receives RREQ = Makes reverse route entry for $ dest=5, nexthop= 5, hopent=1 = Tt has no route to 0, so it rebroadcasts RREQ * AODV: Route Discovery os, s. Node Creceives RREQ + Makes reverse route entry for 5 dest=5, nexthop=A, hopent=2 = Ithasa route to 2, and the seq# for route to D is >= Ds seq# in RREQ 26 528-200'd 2500 3b9 ste :OL HOM $2TT 2002-11-10ev: Route Discovery a s. Node Creceives RREQ (cont.) = Ccreates a Route Reply (RREP) Enters Os IP addr, seqi# $6 IP addr, hopcount to D(= 1) = “Unicasts RREP to A * AODV: Route Discovery s. Node Creceives RREQ (cont.) = Ccreates a Route Reply (RREP) Enters Ds IP addr, seq# Ss IP addr, hopcount to D(= 1) = Unicasts RREP to 4 27 S2B-£00"d 2500 3b9 ste :OL HOM $2TT 2002-11-10gy ADV: Route Discovery «6 Node A receives RREP «Makes forward route entry to D dest = D, nexthop = G hopcount = 2 = Unicasts RREP to S CUNT INTMINIMI IMMA EMI tO IKE MIKI * AODV: Route Discovery 7 Node Sreceives RREP » Makes forward route entry to D dest = D, nexthop = 4, hopcount = 3 28 S2B-b20"d 2500 3b9 ste :OL HOM $2TT 2002-11-10* AODV: Route Discovery 7. Node Sreceives RREP = Makes forward route entry to D dest = 2, nexthop = A, hopcount = 3 + Sends data packets on route to D oi A0DV Route Maintenance RERR 1 Link between Cand D breaks 2 Node Cinvalidates route to Din route table 3 Node Ccreates Route Error (RERR) message ‘= Usts all destinations which are now unreachable = Sends to upstream neighbors 29 528-500" 2500 Sho Ste OL HOM $2TT 2002-11-10528-500" hv: Route Maintenance RERR wenn @ 4. Node A receives RERR = Checks whether Cis its next hop on route to D = Deletes route to D Forwards RERR to $ Av: Route Maintenance i @ s. Node Sreceives RERR = Checks whether is its next hop on route to D = Deletes route to D Rediscovers route if still needed 2500 3b9 ste :OL 30 HOM $2TT 2002-11-10foo Optimizations » Expanding Ring Search «= Prevents flooding of network during route discovery = Control Time To Live (TTL) of RREQ to search incrementally larger areas of network «= Advantage: Less overhead when successful » Disadvantage: Longer delay if route not found immediately ma AODv: Optimizations (cont.) = Local Repair = Repair breaks in active routes locally instead of notifying source + Use small TTL because destination probably hasn't moved far «= If first repair attempt is unsuccessful, send RERR to source = Advantage: repair links with less overhead, delay and packet loss = Disadvantage: longer delay and greater packet loss when unsuccessful 31 520-200'd 2500 3b9 ste :OL HOM $2TT 2002-11-10we AOD: Summary _ = Reactive/on-demand » Sequence numbers used for route freshness and loop prevention = Route discovery cycle = Maintain only active routes = Optimizations can be used to reduce overhead and increase scalability he Dynamic Source Routing (DSR) = Reactive = Route discovery cycle used for route finding = Maintenance of active routes « Utilizes source routing 32 528-600'd 2500 3b9 ste :OL HOM $2TT 2002-11-10-" - DSR: Route Discovery 1 Node Sneeds a route to D 2 Broadcasts RREQ packet * DSR: Route Discovery 1. Node Sneeds a route to 0 2. Broadcasts RREQ packet 3. Node A receives packet, has no route to D Rebroadeasts packet after adding its address to source route 33 ea-coa'd 2500 3b9 ste :OL HOM $2TT 2002-11-104 DSR: Route Discovery 1 Node Sneeds a route to D 2. Broadcasts RREQ packet 3. Node A receives packet, has no route to D = Rebroadcasts packet after adding its address to source route * DSR: Route Discovery 4. Node Creceives RREQ, has no route to D + Rebroadcasts packet after adding its address to source route 34 S28-010"d 2500 3b9 ste :OL HOM $2TT 2002-11-10= DSR: Route Discovery 4, Node Creceives RREQ, has no route to D + Rebroadcasts packet after adding its address to ‘source route - DSR: Route Discovery 4. Node Creceives RREQ, has no route to D = Rebroadcasts packet after adding its address to source route s. Node Dreceives RREQ, unicasts RREP to C 7 a source route accumulated in RREQ into 35 S2B-T18"d 2500 3b9 ste :OL HOM $2TT 2002-11-10S2B-210"d eee: Route Discovery em 4. Node Creceives RREQ, has no route to D = Rebroadcasts packet after adding its address to source route s. Node Dreceives RREQ, unicasts RREP to C = Puts source route accumulated in RREQ into RREP , DSR: Route Discovery s. Node Creceives RREP = Unicasts to A 2500 3b9 ste :OL :HOMd SBT 2002-11-10 36> DSR: Route Discovery s. Node A receives RREP = Unicasts to $ ae, DSR: Route Discovery CHS «. Node Sreceives RREP = Uses route for data packet transmissions 2500 3b9 ste :OL 37 :HOMd SBT 2002-11-10AODV and DSR Differences = DSR uses source rol 7 AODV uses next hop entry «= DSR uses route cache; AODV uses route table » DSR route cache entries do not have lifetimes; AODV route table entries do have lifetimes » DSR nodes respond to each RREQ duplicate; AODV nodes only respond to first RREQ, unless one arrives along a better path a Location-Aided Routing (LAR) = Exploits location information to limit scope of RREQ flood = Location information obtained using GPS = All nodes must maintain their current location » Expected Zone: region that is expected to hold the current location of the destination + Expected region determined based on potentially old Saad information, and knowledge of the destination’s = RREQs limited to a Request Zone that contains the Expected Zone and location of the sender node 38 S2B-bT0"d 2500 3b9 ste :OL :HOMd SBT 2002-11-10S28-S18"d ie LAR: Expected Zone D = last known location of node D, at time 10 D’= location of node D at current time tt, unknown to node $ = (tt -t0)* estimate of D's speed ab LAR = The request zone is the smallest rectangle that includes the current location of the source and the expected zone = Only nodes within the request zone forward route requests » Node A does not forward RREQ, but node B does = Request zone explicitly specified in the RREQ = Each node must know its physical location to determine whether it is within the request zone 39 2500 3b9 ste :OL :HOMd SBT 2002-11-10LAR: Request Zone Network Space Xe Ys) ‘Xp Yd) LAR = If route discovery using the smaller request zone fails to find a route, the sender initiates another route discovery (after a timeout) using a larger request zone » The larger request zone may be the entire network = Rest of route discovery protocol similar to DSR. 40 S2B-910"d 2500 3b9 ste :OL :HOMd SBT 2002-11-10LAR: Adaptive Request Zone « Each node may modify the request zone included in the forwarded request = Modified request zone may be determined using more recent/accurate information, and may be smaller than the original request zone Request zone adapted by B juest zone defined by sender S * LAR: Implicit Request Zone 1 Source implicity defines a request zone as the clstance from the current location of the forwarding node to the previous location of the intended destination; incudes this distance In route request 1 For example, on receiving a request from node S, node Y forwards the request since its distance to Dis shorter than the distance from S to D, ‘whereas node X discards it ‘= The motivation is to attempt to bring the route request physically closer to the destination node after each forwarding —p *, Mai ee Rey, 4 SPB-L18'd 2500 3b9 ste :OL :HOMd SBT 2002-11-10Location-Aided Routing = The basic proposal assumes that, ‘tially, location. information for node X becomes knawn to Y only during a route discovery = This location information is used for a future route discovery 1» Each route discovery yields more updated information which Is used for the next discovery Variations = Location information can also be piggybacked on any message from Y to X = Y may also proactively distribute its location information + Location-Aided Routing (LAR) » Advantages » Reduces the scope of RREQ flood » Reduces overhead of route discovery » Disadvantages = Nodes need to know their physical locations = Does not take into account possible existence of obstructions for radio transmissions 42 S2B-810'd 2500 3b9 ste :OL MOMs SBT 2002-11-10Hybrid: Zone Routing Protocol (ZRP) = Proactive + reactive = Each node maintains a zone (e.g., 2 hops) » Intra-zone routing: proactive routing protocol for nodes within the zone » Inter-zone routing: reactive routing protocol for nodes outside the zone » Bordercasting: Peripheral nodes (nade that are in the border of the zone) perform on-demand flooding . Clustering/Hierarchical Routing = Impose hierarchical topology on netwoi + Cluster leaders may serve as cluster representatives + Control may be distributed = Many clustering options » Overlapping clusters/disjoint clusters + One-level hierarchy/multi-level hierarchy 43 S2B-610"d 2500 3b9 ste :OL MOMs SBT 2002-11-10528-020'd +> Example Cluster Topology = Each node communicates with its cluster leader = Gateways interconnect clusters » Joint/distributed gateways connect non-overlapping clusters Cluster Formation « Clusters may be formed by = Geographical location « Functional relationships » Cluster leaders may be elected by « Highest ID algorithms = First come, first cluster leader 2500 3b9 ste :OL MOMs SBT 2002-11-10Cluster Leader Maintenance » Clustering protocols typically have cluster leader selection and revocation schemes Selection - nodes may become cluster leaders if they wander out of the transmission range of all other cluster leaders = Revocation ~ to prevent a continual growth in the number of cluster leaders, there must be a mechanism for cluster leaders to become non- leaders Revocation Algorithms = When two cluster leaders come into contact, one must give up its leadership status » ID-based algorithms » Weight-based algorithms = Cluster member-based algorithms » Subset-based algorithms 45 S28-T20"d 2500 3b9 ste :OL MOMs SBT 2002-11-10Tee GF eof = Physical sUbnet: disjoint thistefe based on physical locality = Virtual subnet: routing backbone connecting nodes within multiple physical subnets = Node addresses are “

. = Nodes can dynamically adjust their transmission range Hierarchical Addressing » Addresses can be assigned to nodes based on their cluster membership «Ifa node'sidis 2, and itis a member of cluster y, its address may be yz = In general, if tis a member of multiple hierarchical Custers, it may have address X....y.2 «Tt may also have multiple addresses if clusters overlap 46 520-220'd 2500 3b9 ste :OL MOMs SBT 2002-11-10Hierarchical Routing = Hierarchical routes are longer-lived «= Increases robustness of routes = Physical route: S > Cl; > G> CL, > D « Logical route: S > CL, > CL, > D 4 Multi-Level Hierarchical Routing Scalability improvement of single-level hierarchy is limited = Utilize multiple hierarchical level to scale to larger networks 47 S2B-£20'd 2500 3b9 ste :OL HOM 22+ 2002-11-10S2B-bOo"d 2S00 Jb9 STO OL LTTE LLL * Clustering/Hierarchical Routing Advantages «Increase in route robustness, leading to increase in delivered data packets | + Hierarchical addressing architectures «Reduction in routing layer control messages: Disadvantages + May require periodic messages to maintain clusters = Centralization of routes through cluster leaders Is possible Examples: LCA, ARC, ARCH, DMAC, CGSR, HSR, ... > Multiple Path Routing = Establish more than one path for each (source, destination) pair » When the primary route fails, alternate paths can be used » Helps balancing the load = Examples: APR, SMR, AOMDV, AODV-BR, ROAM, MDSR 48 HOM 22+ 2002-11-10Energy Efficient Routing = Several schemes recently proposed: « Adjust the transmission power of each node to control the topology = Select routes based on power levels = Select route with low transmission eneray « Tum off unnecessary nodes = Use directional antennas «Split traffic using multiple routes = Examples: RABR, ECR, BEE, SSA, PAR, CMMBCR, GAF, ORSA * Further Readings Proactive = DSDV: C. Perkins and P. Bhagwat, "Highly Dynamic Destination Sequenced Distance-Vector Routlng (BSDV) for Mobile Computers,” ‘Gommunications Review, 24(4), Oct. 1994, pp. 234-244. = ose. ‘Jacquet, et. al_, “Optimized Link State Routing Protocol, JETE Internet Draft dratt-itf-manet-olst-04,bxt, March 2001. + TBRPF: B, Betlur, et, al, "Topology Broadcast based on Reverse-Path Forwarding (TBRPF),” JE7F internet Dra, draft-ietf-manet-torof- (2.bt, Sept. 2001. » Reactive/On-Demand = AODV: CE. Perking and EM. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proceedings of IEEE WMCSA'D9, New Orleans, LA, Feb. 1999, pp. 90-100, 528-520" 2500 3b9 ste :OL HOM 22+ 2002-11-1014:26 FROM: To: 815 642 eE52 P.ea1-e3t Oct-11-2002 111 : TTT LILLIE + Further Readings _ = Reactive/On-Demand + DSR: D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad hoc Wireless Networks,” Mabile Computing, edited by T. Imielinski and H. Korth, Chapter 5, Kluwer Publishing Company, 1996, pp. 153- 181. » LAR: Y.-B, Ko and NH. Ri YB, Ko Vaidya, Lagat Routing (LAR) in Mobile Ad hoc Networks,” Proceedings. IEEE MOBICOM'96, Dallas, TX, Oct. 1998, pp. 66-75. = 2RP: M.R. Pearlman and Z.J, Haas, “Determining the Optimal Configuration for the Zone Routing Protocol,” EEF Journal on Areas in Communications, vol. 17, n0. 8, Aug. 1999, Pp, 1395-1414, FT ELLIE > Further Readings | = Custering/Hierarchical Routing > DMAC: S, Bosegni, “Distributed Clustering for Ad hoc Networks," Proceedings OFISPAN, Austrol, June 199, pp. 310-315, + ARC: EM. Beling-Royer, “Hierarchical Routing In Ad hoc Mobile Networks,” ‘To appear in Hretess Communications and Mobile Computing, 2002, Wi, W. Liu and M, Gar, "Routing in Clustered Networks with Facing Channel” rocesdings of ICON, Kor. 1997, pp. 197-211. + Multiple Path Routing *» APR: MR, Pearman, ZJ. Haas, P, Sholander, and $.S. Tabriz, “On the |mpact of aterete Path Routing for Load Balancing In Mobile’Ad Hoe ReSNOnS,” Proceedings of ACH/IEEE MobinOC 2000, Boston, MA, Aus, 2000, Po. * SMR: Ste and, Gavia, Spt Matipatn Routing wth MextrallyDigont Baths in Ad hoc Newest,” 9f teat 16.2004, Men, Pn, ‘June 2001, pp. 3201-3205. Hina i TITTIES ILLUMI 50To: 815 642 eE52 Further Readings = Multiple Path Routing * GOMDN: MK Naina and SR. Des, ‘Omdemand Mulpath Distance factor Rou Hoc Networks,” Proceedings TEND, Riverside, Cy Nov. 2001, + AODV-BR: S.-J. Lee and M. Gerla, "AODV-BR: Backup Routing in Ad he Networks,” Poceeaings oF EEE WCNC 200, Chicago, IL, Sept = ROAM: 3. aly rd). acy ann Aco “A Naw Approach a dana Loop-Fee Mul ng," IEEE IXCON'99, Boston, MA, Oct. 1999, pp. 522-527, * DSR: A Mas and 5.5, as “on Devan utah Routing for Hobie Hoe Newors,” Procesings of Ieee ICC Boston, MA, Ot 1999, Pp. 6470, ss . Further Readings = Power Aware Routing +» RABR: 5, Agarwal, A. Ahuja, 1.P. Singh, and R, Shorey, "Route-Lifetime ‘Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks,” Proceedings of TEBE ICC 2000, New Orleans, LA, Jun. 2000, pp. 1657-1701 «ECR: J-H. Chang and L. Tassius, “Energy Conserving Routing in Wireless ‘Adshoc Networks,” Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, ‘Mar. 2000, pp. 22-31, 1 BEE: CF. Chiasserini and R.R. Rao, "Routing Protocols to Maximize Battery Efficiency," Proceedings of IEEE MILCOM 2000, Les Angoles, CA, Oct, 2000, pp. 496-500. SSA: R. Dude, C.D. Rals, KY, Wang, and S.K. Tripathi, "Signal Stability Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks," IEEE Personal Communications, vol. 4, no. 1, Feb. 1987, pp.36-45. P.eee-e3t 51OCT-11-2082 11:28 FROM: To: 815 642 eE52 P.223-031 + Further Readings _ 1 Power Avvare Routing ‘= PAR: S, Sinn, M, Woo, and C'S. Raghavendra, "Power-Aware Routing in Mobile Ad Hod Networks," Proceedings of AGH/IEEE MOBICOW'SS, Dal, ‘Te, Oct. 1998, pp. 181-190. ‘+ CMMBCR: C.K. Toh, "Maximum Batteny Life Routing to Support Ubiqutous Mobile Computing in Wireless Ad Hoe Networks," JEEE Communications ‘Magazie, vo. 38, no. 6, Jun. 2004, pp. 138-147. + GAF:Y. Xu, 3, Heldemana, and D. tin “Geography informed Energy Conservation for Ad Ho Routing," Aroosediags of ACM MORICOM 200, Rome, Tay, Jul. 2002, pp. 70-24, + ORSA: V Srnvasan, CF. Chiasserin P, Nuggehal, and RR. optima fat Aeaion ae rate pt for Energy ice Reta n Neto" eppearnProneenas 0 Db No ore, NY, un. 2008. Further Readings Performance Comparison ‘= J. Broch, D.A. Malt, D.B, Johnson, Y.-C. Hu, and J, Jetcheva, “A Performance ‘Comparison of Mult-Hop Wircless Ad Hoc Network Routing Protocols,” Proceedings of ACH/IEEE MOBICOM'99, Dallas, TX, Oct. 1998, pp. 95-97. = T. Camp, 3, Boleng, B. Willams, W. Navid, and L. Wilcox, “Performance. Comparison of Two Locetion Besed Rowtng Protocols for Ad Hoc Networks,” to ‘3ppear in Proceedings of BEE INFOCOM 2002, New York, NY, Jun, 2002. SAR. Das, R. Castaneda, 2. Yan, and R, Sengupta, "Comparative Performance. Evaluation of Routing Protocol for Mobile, Ad hac Networks,” Proceedings of IEEE ICON, \afayette, LA, Ock. 1998, pp. 153-161. +P. Johansson, T. Larsson, N. Hedman, B, Milezarek, and M, Degermark, 'Scenario-based Performance Analysis of Routing Protocols for Mobile Adthoc Networks," Proceedings of ACM/IEEE MOBICOM'S, Seattle, WA, Aug, 1999, pp. 195-206, + Gé, Periuns, E.M. Royer, S.R. Das, and M.K, Marina, “Performance Comparison of Two On-Demand rotocols tor Ad hoc Networks,” EEE Personal ‘Communications Magaamne, Feb. 2001, pp. 16-28. 52OCT-11-2062 11:29 FROM: To: 815 642 eE52 Further Readings _ = Rovting/MAC Interaction + EM Royer, $1 ee, and CE, Peking “The Bets of MAC Protacls on hl ‘hoc Network Communications,” Proceedings of IEEE WCNC, Chicago, IL, Sept 2000. = Other Protocols +. Bsogn) 1, Clemtac, VR, Syietuk, and BA, Woodard, "A Distance Routing Eka horn Yor ity (OREAM) * rocecings of ACPPIEEE MOBICOM'98, Dalias, TX, Oct. 1998, pp. 76-64, = RV, Boppana and S.P. Konduru, "An Adapuve Distance Vector Algorithm for Mobile, Adc eto” Procaongs a SEE INFOCON 2001, anchorage, Pky Ap 200, pp 17e0762. = S. Chen and K. Nahrstedt, "Distributed Quality-of-Service Routing in Ad Hoc Networks," IEEE Journal on Selected Areas in Communications, vol. 17, no, 8, Aug, 1999, pp. 1488-1505, + W. Chol and Ba, "A Pron asd Indract Routing Schame for Ad Hoe Wise Nava? Posen oF INPOCOM 20 Now York,NY, 2002 Further Readings _ = "Wher Prowals '» MS, Corson and A, Ephremides, "a Distriouted Routing Algorhm for Motil Wiretess Networks ACH/Blts Wiless Networks, vo no, Feb. 1985, pp. 61-81. = T, Goff, N. Abu.Ghazaich, D. Phatak, and R. Kahvecloglu, "Preemptive Routlag in Ad Hoe Networks,” Proceedings oF ACM MOBICOM 2001, Reme, {aly Jul. 2001, pp. 43-52. 2 Haas, 3. Helgem, and LU, “Gossip-Based Ad Hac Routing," Proceedings CF FEEE INFOGOM 2002, New! Yotk, NY, Jun, 2002, » Rein, A. Pur and R, Sengupta, “Geoorephical Routing Using Partial Information for Wireless Ad Hoc Networks,” JEEE Personal Communication, vol. 8, no. 1, Feb. 2001, pp. 48-57. + M.2oa-Ng and 1-7. Lu, “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoe Networks,” IEEE Journal on Selected Areas in ‘Communications, vol. 17, no. 8, Aug. 1999, pp. 1415-1425. +B. Kerp and HT. Kung, "GPSRs Greedy Poremeter Stettless Routing for ‘Wireless Networks,” Proceedings of ACM MOBICOM 2000, Boston, MA, Aug. 2000, pp. 243-254. P.e24-e3t faaOCT-11-2082 11:29 FROM: To: 815 642 eE52 + Further Readings _ Other Protocols 1» S-3. Lee and M, Geri "Dynamic Load-Awere Routing in Ad Hoc Networks,” Proceedings of IEEE 10C 200%, Helsinki, Finland, Jun. 200%, pp. 3206-3240, + 9.3. Adam and D Rus, “Onine Powerware Routing in Wireless Ac-noe Natori,” ‘Proceedings of ACM MOBICOM 2008, Rome, Italy, Jul 2001, Pp. Le Neto,” racoazngs oF ACH MOBICOHSS, Berkey, CA, Nov. 1995, po. + ViD, Pork and M.S, Corson "A Highly Adoptive Distributed Routing Algorithm Seva as tees ae eat * BIR A Gian Or res so re So z 1A, Jun. 2000, pp. 70-74. Further Readings = S. Roy and J.J. Garcia-Luna Aceves, “Using Minimal Source Trees for On ‘Demand Routing in Ad Hoc Networks,” Proceedings of IEEE INFOCOM 200%, ‘Anchorage, AK, Apr, 2001, pp. 1172-1181. = P.Sinha, R. Shakumar, V. Bharghaven, “CEDAR: 2 Core-Extraction Distributed Ad hoc Routing Algorithm,” Proceedings of IEEE INFOCOM'99, New York, NY, Mar. 1999, pp. 202-200, + M. Spohn and J. Garcia-Luna-Acavas, “Neighborhood Aware Source Reuting Poceacings oF ACM Moatnoc 2601 Lang Bese, Ch Oct 2003, pp. 12a, = CK, Ton, “Assoclatvty-Based Routng for Ad-Hoc Mobile Networks,” ites hesona Communica Jura a. 8, 0.2, Ma. 1997, pp. 102 = C. Zhu and MS, Corson, “QoS Routing for Mobile Ad Hoc Networks,” Proceedings of IEEE INFOCOM 2002, New York, NY, Jun. 2002. + M. Gerla, X. Hong, and G, Pei, *Landmork Routing for Large Ad Hoc Wireless. Networks," Proceedings of JEBE GLOBECOM 2000, San Francisco, CA, Nov. 2000, pp. 1702-1706. P.225-031OCT-11-2082 11:29 FROM: To: 815 642 eE52 e Multicast Routing .. Multicasting II = A multicast group is defined with a unique group identifier » Nodes may join or leave the multicast group anytime = In traditional networks, the physical network topology does not change often » In MANET, the physical topology can change continuously P.226-031 55OCT-11-2082 11:29 FROM: To: 815 642 eE52 P.eerest + Multicasting in MANET = Need to take topology changes into account when designing a multicast protocol = Several new protocols have been Proposed for multicasting in MANET 4 Primary Approaches = Tree-based * Efficient, but can be fragile in highly mobile networks = Reactive: MAODV = Proactive: LAM = Mesh-based = Robust to mobility at the cost of redundancy = Reactive: ODMRP = Proactive: CAMP = Location-based (Geocasting) = Flood-based: LBMOCT-14-2002 11:29 FROM: TO: 815 642 ea5e P.208/e31, Multicast AODV (MAODV) a Utilizes same RREQ/RREP message cycle as unicast AODV = Shared tree composed of group members and connecting nodes is formed = Dynamic group membership = Group Leader + Maintains and distributes group sequence number » Not a central point of failure « Multicast group members are also routers for the tree * 5 MAODV: Joining the Group oT 1. Node Gwishes to join the multicast group 2. Creates a Route Request (RREQ) Enters dest_IP_addr = mcast_grp_addr 3. Broadcasts RREQ to neighbors aOCT-11-2082 11:29 FROM: To: 815 642 eE52 P.229-031 + MAODV: Joining the Group RREQ Only nodes on the multicast tree that receive the RREQ can reply 4. Node receives the RREQ + Since it Is on the multicast tree, it unicasts a Route Reply (RREP) to G MAODV: Joining the Group REP. RREQ Only nodes on the multicast tree that receive the RREQ can reply +. Node Freceives the RREQ * Since it is on the multicast tree, it unicasts a Route Reply (RREP) to G 58OCT-11-2082 11:38 FROM: 4 MAODV: Joining the Group es , 3. Node Freceives the RREQ = Since it is not on the multicast tree, it rebroadcasts the RREQ To: 815 642 eE52 > MAODV: Joining the Group RREP "RE s. Node Freceives the RREQ = Since it is not on the multicast tree, it rebroadcasts the RREQ s. Node Dreceives the RREQ = Teunicasts a RREP to F P.e16-031 59OCT-11-2082 11:38 FROM: To: 815 642 eE52 Pretest ~~ MAODV: Joining the Group s. Node Freceives the RREQ = Since it is not on the multicast tree, it rebroadcasts the RREQ 6. Node Dreceives the RREQ + Tt unicasts a RREP to F 4 MAODV: Joining the Group 7. Node F forwards the RREP to G 60OCT-11-2082 11:38 FROM: TO: 815 642 eE52 + MAODV: Joining the Group 7. Node F forwards the RREP to G 8. Node Gwaits a discovery period and collects RREPs * ty MAODV: Joining the Group REP ‘RREP 7. Node F forwards the RREP to G «. Node Gwaits a discovery period and collects RREPS 3. Then, it unicasts a Multicast Activation (MACT) message to its selected next hop, in this case, node & P.e12-031 61TO: 815 642 eE52 OCT-11-2082 11:38 FROM: + MAODV: Joining the Group oof SS a—€ 9 > @ 2. Node F forwards the RREP to G 2. Node Gwaits a discovery period and collects RREPS 3, Then, it unicasts a Multicast Activation (MACT) message to its selected next hop, in this case, node & * MAODV: Joining the Group oef SS 10. Node Freceives the MACT = Adds Gas a next hop on the multicast tree 11. The tree branch addition is completed P.e13-034 62OCT-14-2002 11:38 FROM: TO: 815 642 ea5e P.e14/e31, * ,MAODV: Joining the Group 1. Node Freceives the MACT = Adds Gas a next hop on the multicast tree a. The tree branch addition is completed > MAODV: Leaving the Group MACT 1 Node Gwishes to leave the multicast group + Only leaf nodes con actualy leave the multicast tree 2 Node Gcreates a Prune-MACT and unicasts it to its next hop (node £) = Node Gdeletes all multicast group state information 63OCT-11-2082 11:38 FROM: To: 815 642 eE52 P.e15-031 ae AOD: Leaving the Group oot e 2 Node Ereceives the MACT » Deletes G from its next hop table Prune is complete “tye MAODV: Leaving the Group oot * e e 2 Node Ereceives the MACT + Deletes Grom its next hop table = Prune is completeOCT-11-2082 11:38 FROM: To: 815 642 eE52 = Links are considered broken if no packet from the neighbor is received for a timeout interval = Nodes send Hello messages when no packets are transmitted during the hello interval = When the link break is detected, the downstream node of the broken link initiates the local repair by sending a RREQ with a small value of TTL = Only nodes that are part of the multicast tree, have fresh enough multicast group seq #, and are at least as close to the group leader as the initiating node can reply by unicasting RREP ‘% MAODV: Summary » Builds a shared bi-directional tree for multicast groups = Multicast tree = On-demand creation = Maintained as long as the group exists = Dynamic group membership = RREQ/RREP/MACT messages for tree branch additions « Follows AODV’s basic route discovery cycle » Link breaks in the tree are fixed by local repair P.a16-031 65OCT-11-2082 11:38 FROM: * Protocol (ODMRP) To: 815 642 eE52 On-Demand Multicast Routing = ODMRP requires cooperation of nodes wishing to send data to the multicast group = Construct the multicast mesh = Asender node wishing to send multicast Packets periodically floods a Join Query packet throughput the network + Periodic transmissions are used to update the Toutes IM LLLALHIMELAULVELAN LAMELLAE On-Demand Multicast Routing Protocol (ODMRP) = Each multicast group member, on receiving a Join Query, broadcasts a Join Reply to all its neighbors = Join Reply contains (sender S, next node N) pairs = next node N denotes the next node on the path from the group member to the multicast sender S » When node N receives the above broadcast, N becomes member of the forwarding group = When node N becomes a forwarding group member, it transmits Join Reply containing the entry (S,M) where M is the next hop towards node $ P.e17-e34OCT-11-2062 11:31 FROM: TO: 815 642 eE52 P.e16-031 > Why a Mesh? IN « Richer connectivity among multicast members = Unlike trees, frequent reconfigurations are not needed Sempre Se Nah Res » A set of nodes in charge of forwarding multicast packets = Supports shortest paths between any member pairs o = Flooding redundancy Forwarding Grow ps ee aed displacements at Gresser channel fading 67OCT-11-2062 11:31 FROM: To: 815 642 eE52 P.e19-e34 CL EER MELIMAL ELLA LALLMLAN LAMINA +* ODMRP 7 = Nodes A, B, and C are multicast members = Nodes A and C have data to send = Nodes A and C create their own Join Query = Nodes A and C flood their Join Query + Source address, multicast group address, sequence numberD 2 P.228/e31, OCT-14-2002 11:31 FROM: TO: 815 642 ea5e * ODMRP oT = Nodes that receive non-duplicate Join Query create a reverse route entry and broadcast the packet = Routes taken: = A-X-Y-8,A-X-7Z-¢ = C-Z-X=A,C-B = When multicast members receive Join Query, they create Join Reply = Source(s) address, next hop(s) addressOCT-11-2062 11:31 FROM: To: 815 642 eE52 P.ge1-e34 omer B's Join Reply packet a i Secs Nethor = Upon receiving Join Reply, if any of the next hop Tatches itself (but not the source of than entry), the node is a forwarding group member 7 ODMRP : - Further Readings _ = Otner issues * GS. Ain Li un, 8, Vers and AT. Comabal, “SWAN: Serdce fn in Stateless Wireless letworks,” Proceedings of IEEE INFOCOM 2002, New York, NY, Jun. 202. +; Bancrec and A Misa, "rimum Eneray Pats for Reliable wmunieation In Mult-hop Wireless Networks," Proceedings of ACH ‘Mobitoc 2002, austnne, Sitzetend, Jun. 2002. * Bao nd 12. Gree neozves, “Transmission scheduling ind Hoe reconal Antennas,” to appear in Proceedings ofA ‘Mobicom 2002, Ktianta, GA, Sep. 2602, =D, Blough and P, Santi, "rvestigating Unner Rounds on Network Lifetime Extension for Ceased Energy Conservation Techniques in Stationary Ad Hoe Networks," to appear In Proceedings oF ACM MobiCom 2002, Atlanta, GA, Sep. 2002. + BL Chen, K-Jomieson,H. Balsirshnan, ond R, Mortis, “Span: An Energy Effient Coordination Aigorthm for Topology Maintenange In Ad Hoe Wireless Networks," Proceedings of AGM MabiCom 200i, Rome, Tay, Jul 2001, pp. 85-96. Further Readings — + 0, Dousse P.Thiten, and M. Hasler, “Connectivity n Ad-Hoc and Hybrid Networks Procsszings of IEEE INFOCOM 2002 New York, NY, Dun. 2002, + E-S, Jung and N, Vaidya, "A Power Control MAC Protocol for Ad Hoc Nein appear reais of Act icon cde, Mt, GA + ¥<-B. Ko, V, Shankerkumar, and N.H. Vaidya, "Medlum Access Control Drotecale Using Directional Antennas in Ad Hor Networks,” {IEEE INFOCOM 2600, Tel Avy, Irae, Mar. 2000, pp. 13-21. + 5B. Lee end AT. Campbell INSIGNIA: In-band ignaing suppor for QOS ine adhe ewe," rece of ont 5, erin, Geman, Sc. Lee, EM. Belding Royer, and C.E, Perkins, “Scalability Study ofthe Ad foc On Banana Dunce Veo toting Proto appear ‘Inernadonal Journal of Network Management. val. 13, ne. 2, 2003. + W. Liang, Constucting Minimum-Energy Broadcast Trees in Wireless Ad Hoc Network," Prceetdngs OF ACM Mobiine 2002, Lausanne, Swzerand, un, 2002, P.eee-e24 100OCT-11-2082 11:38 FROM: To: 815 642 eE52 P.ee1-eE4 Further Readings Other Issues ~ Maia nS. ,oting Pegmance in Pecans of Uridine in Multhnop Wircess Networks," Precaodings of ACM Mobic 2008, Lausanne, Switzerland, Jun, 2002, + A. Nasipur 3. Mendeve, H. Manchala, and R.E, Mromoto, “On-Demand Routing Using Directional Antennas i Moble Ad Hoc Networks,” Preceeoings ‘OfTEEE ICCC 2000, Las Veges, NV, Oct. 2000. * A. Nasipur,S, Ye. You, and RLE. Hitoroto, "A MAC Protocol for Mobile Ad Hoc Networks Using Directional Antennas." Proceedings of IEEE WONC 2000, Chicago, I, Sep. 2000. MLR, Peariman, 23. Haas, and 8.P. Monvell, "Using Mult-Hop ‘Acknowledgements to Discover and Relably Communicate over Unidirectional Une in Ad Hoe Nevo" Procadnge oF IGE WENC 2008 Cog ly +R. Prekash, “Unicrectonal Links Prove Cost In Wireless Ad Hoc Networks,” Proceedings OF ACH DIAL M99, Sextie, WA, Aug. 1998, Dp. 15-22. Further Readings Drie 7 cent 8 mn Ogi semen num ones ent ee Sane « Rae hg hn tai tn hom CControt in Ad Hoc Networks Using Directional Antennas,” to appear in Proceedings of ACM MobiCom 2002, Manta, GA, Sep. 2002. « Cie dca emote ru one Scalabilty of choc routing protoco’s,” Proceedings of IEEE INFOCOM 2002, New York, NY, Jun. 2002. +E Shih, V. Bel and m, Sina, "wake on Wires: An Event nt van on Power ik Sraurmscureaine Shier Sees + A. Spyropoulos and CS. Raghavendra, "Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas,” Proceedings of IEEE INFOCOM Seria 101OCT-14-2002 11:38 FROM: TO: 815 642 ea5e P.eee-e24 ++ Further Readings = Other Issues 1M, Takai, J, Martin, R. Bagrodia, and A. Ren, “Directional Virtual Carrier Sensing for Directional Antennas in Mobile Ad Hoc Networks,” Proceedings of ACM MobiNoc 2002, Lausanne, Switzetand, Jun, + YoC, Tseng, GS. Hsu, and T.-¥. Hsieh, “Power-Saving Protocols for {IEEE 802.11-Based Mult-Hop Ad Hoc Networks,” Proceedings of IEEE 2002, New York, NY, Jun. 2002. LE, Wieselthier, G.D, Nguyen, and A. Ephremides, “Energy-Limited ‘Wireless Networking with Directional Antennas: The Case of Sescion- Based Multicasting,” Procoadings of IEEE INFOCOM 2002, New York, ‘NY, Jun, 2002. tgs ACKnowledgements = Young-Bae Ko (Ajou University) = Ken Tang (Scalable Networks) » Nitin Vaidya (UIUC; some slides from his tutorials are included in this tutorial) 102OCT-14-2002 11:38 FROM: TO: 815 642 ea5e P.2e3-24 Hp Thaniss | Elizabeth M. Belding-Royei ebelding@cs.ucsb.edu Sung-Ju Lee sjlee@hpl.hp.com 103P.ee4-e24 OCT-11-2002 11:38 FROM