1. Paper Reviews Written reviews for each paper to be discussed in class are due by noon on Fridays of the previous week The soft copy of the reviews should be turned into both the class instructor and TA. The hard copies need to be turned into the instructor only For each paper, students should write a review answering each of the following questions: 1. What problems (with prior work or the lack thereof) were addressed or surveyed by the authors? 2. What solutions were proposed or surveyed by the authors? 3. What are the technical strengths and main contributions of the paper's proposed solutions? 4. What are the technical weaknesses of the paper's proposed solutions? 5. What suggestions do you have to improve upon the paper's ideas?

2. Routing in Mobile Ad hoc Networks

3. Why Routing? Common objective: Route packets along the optimal path –Routing protocols adapt to changing network conditions and by definition offers multi-hop paths –Routing protocols differ in route table  construction  maintenance  update Next-hop routing protocols can be categorized as: –Link-state –Distance-vector

4. –Traditional link-state protocols may not be suitable –Closer to centralized version of shortest-path algorithm –Each node maintains a view of network topology with a cost for each link –Link costs are broadcast periodically to keep the views consistent –Each node updates its view and applies a shortest-path algorithm to find its next hop for each destination –Routing loops may occur due to propagation delays, partitioned networks, and so on –Alternative link-state routing approaches may not require all nodes to have the identical link-state information and route selection algorithms and may find routes on demand Link-State Approach [Dijkstra 1959 and McQuillan+ 1980]

5. –Based on shortest-path routing algorithms i.e., Distributed Bellman-Ford –DBF algorithms are also known as Distance-Vector (DV) –For each destination, the node stores a single route table entry along with next-hop neighbor –Route table entry for destination contains metric which is distance from node to the destination and also the next-hop (vector) towards destination Distance-Vector Approach [Ford+ 1962 and Leiner+ 1987]

6. Ad Hoc Routing Protocols Overview Ad hoc Routing Protocols Table Driven (Proactive) CGSR DSDVWRP AODV DSRTORASSRABR Source-Initiated On-demand Driven (Reactive) Hybrid ZRP

7.  Proactive Protocols –have lower latency due to maintenance of routes at all times –can result in much higher overhead due to frequent route updates  Reactive Protocols may have –higher latency since the routes have to be discovered when the source node initiates a route request –lower overhead since routes are maintained only on-demand basis Proactive vs. Reactive Routing Protocols

8. –Based on classical distributed Bellman-Ford routing mechanism –Routing loops in a mobile network have been eliminated –Each node has a routing table (all possible destinations within network, and number of routing hops to each destination) –A sequence numbering system to distinguish stale routes from new ones and assigned by the destination node –Routing table updates are sent periodically (table consistency) –High volumes of control traffic meaning an inefficient utilization of network resources –To alleviate this problem, the protocol uses two types of route update packets Destination-Sequenced Distance-Vector Routing (DSDV) [Perkins+ 1994]

9. Full dump Carries all available routing info and can require multiple network protocol data units. Infrequently transmitted while there is not much movement. Incremental packets These smaller packets are for relaying only the information that was updated since the last full dump –New route broadcasts: destination address + the # of hops to get to destination + the sequence # of the information received about the destination + new sequence # unique to the broadcast at hand –The route with the most recent sequence # (in increasing order) is always used Destination-Sequenced Distance-Vector Routing (DSDV)

10. –If there is an occurrence of two updates with the same sequence #, the route with the smaller hop count is used in order to obtain optimized (shorter) path –Mobiles keep track of other metrics such as settling time of routes, or the weighted average time –The broadcast of a routing update is delayed by the settling time in order to reduce network traffic, as well as optimizing routes Destination-Sequenced Distance-Vector Routing (DSDV)

11. Dynamic Source Routing (DSR) [Johnson+ 1996]  When node S wants to send a packet to node D, but does not know a route to D, node S initiates a route discovery  Source node S floods Route Request (RREQ)  Each node appends own identifier when forwarding RREQ © 2001 Nitin Vaidya

12. Route Discovery in DSR B A S E F H J D C G I K Z Y Represents a node that has received RREQ for D from S M N L © 2001 Nitin Vaidya

13. Route Discovery in DSR B A S E F H J D C G I K Represents transmission of RREQ Z Y Broadcast transmission M N L [S] [X,Y] Represents list of identifiers appended to RREQ © 2001 Nitin Vaidya

14. Route Discovery in DSR B A S E F H J D C G I K Node H receives packet RREQ from two neighbors: potential for collision Z Y M N L [S,E] [S,C] © 2001 Nitin Vaidya

15. Route Discovery in DSR B A S E F H J D C G I K Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once Z Y M N L [S,C,G] [S,E,F] © 2001 Nitin Vaidya

16. Route Discovery in DSR B A S E F H J D C G I K Z Y M Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide N L [S,C,G,K] [S,E,F,J] © 2001 Nitin Vaidya

17. Route Discovery in DSR B A S E F H J D C G I K Z Y Node D does not forward RREQ, because node D is the intended target of the route discovery M N L [S,E,F,J,M] © 2001 Nitin Vaidya

18. Route Discovery in DSR  Destination D on receiving the first RREQ, sends a Route Reply (RREP)  RREP is sent on a route obtained by reversing the route appended to received RREQ  RREP includes the route from S to D on which RREQ was received by node D © 2001 Nitin Vaidya

19. Route Reply in DSR B A S E F H J D C G I K Z Y M N L RREP [S,E,F,J,D] Represents RREP control message © 2001 Nitin Vaidya

20. Route Reply in DSR  Route Reply can be sent by reversing the route in Route Request (RREQ) only if links are guaranteed to be bi-directional –To ensure this, RREQ should be forwarded only if it received on a link that is known to be bi-directional  If unidirectional (asymmetric) links are allowed, then RREP may need a route discovery for S from node D –Unless node D already knows a route to node S –If a route discovery is initiated by D for a route to S, then the Route Reply is piggybacked on the Route Request from D.  If IEEE 802.11 MAC is used to send data, then links have to be bi- directional (since Ack is used) © 2001 Nitin Vaidya

21. Dynamic Source Routing (DSR)  Node S on receiving RREP, caches the route included in the RREP  When node S sends a data packet to D, the entire route is included in the packet header –hence the name source routing  Intermediate nodes use the source route included in a packet to determine to whom a packet should be forwarded © 2001 Nitin Vaidya

22. Data Delivery in DSR B A S E F H J D C G I K Z Y M N L DATA [S,E,F,J,D] Packet header size grows with route length © 2001 Nitin Vaidya

23. When to Perform a Route Discovery  When node S wants to send data to node D, but does not know a valid route node D © 2001 Nitin Vaidya

24. DSR Optimization: Route Caching  Each node caches a new route it learns by any means  When node S finds route [S,E,F,J,D] to node D, node S also learns route [S,E,F] to node F  When node K receives Route Request [S,C,G] destined for node, node K learns route [K,G,C,S] to node S  When node F forwards Route Reply RREP [S,E,F,J,D], node F learns route [F,J,D] to node D  When node E forwards Data [S,E,F,J,D] it learns route [E,F,J,D] to node D  A node may also learn a route when it overhears Data packets © 2001 Nitin Vaidya

25. Use of Route Caching  When node S learns that a route to node D is broken, it uses another route from its local cache, if such a route to D exists in its cache. Otherwise, node S initiates route discovery by sending a route request  Node X on receiving a Route Request for some node D can send a Route Reply if node X knows a route to node D  Use of route cache –can speed up route discovery –can reduce propagation of route requests © 2001 Nitin Vaidya

26. Use of Route Caching B A S E F H J D C G I K [P,Q,R] Represents cached route at a node (DSR maintains the cached routes in a tree format) M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] Z © 2001 Nitin Vaidya

27. Use of Route Caching: Can Speed up Route Discovery B A S E F H J D C G I K Z M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ When node Z sends a route request for node C, node K sends back a route reply [Z,K,G,C] to node Z using a locally cached route [K,G,C,S] RREP © 2001 Nitin Vaidya

28. Use of Route Caching: Can Reduce Propagation of Route Requests B A S E F H J D C G I K Z Y M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ Assume that there is no link between D and Z. Route Reply (RREP) from node K limits flooding of RREQ. In general, the reduction may be less dramatic. [K,G,C,S] RREP © 2001 Nitin Vaidya

29. Route Error (RERR) B A S E F H J D C G I K Z Y M N L RERR [J-D] J sends a route error to S along route J-F-E-S when its attempt to forward the data packet S (with route SEFJD) on J-D fails Nodes hearing RERR update their route cache to remove link J-D © 2001 Nitin Vaidya

30. Route Caching: Beware!  Stale caches can adversely affect performance  With passage of time and host mobility, cached routes may become invalid  A sender host may try several stale routes (obtained from local cache, or replied from cache by other nodes), before finding a good route © 2001 Nitin Vaidya

31. Dynamic Source Routing: Advantages  Routes maintained only between nodes who need to communicate –reduces overhead of route maintenance  Route caching can further reduce route discovery overhead  A single route discovery may yield many routes to the destination, due to intermediate nodes replying from local caches © 2001 Nitin Vaidya

32. Dynamic Source Routing: Disadvantages  Packet header size grows with route length due to source routing  Flood of route requests may potentially reach all nodes in the network  Care must be taken to avoid collisions between route requests propagated by neighboring nodes –insertion of random delays before forwarding RREQ  Increased contention if too many route replies come back due to nodes replying using their local cache –Route Reply Storm problem –Reply storm may be eased by preventing a node from sending RREP if it hears another RREP with a shorter route © 2001 Nitin Vaidya

33. Dynamic Source Routing: Disadvantages  An intermediate node may send Route Reply using a stale cached route, thus polluting other caches  This problem can be eased if some mechanism to purge (potentially) invalid cached routes is incorporated.  For some proposals for cache invalidation, see [Hu+ 2000] –Static timeouts –Adaptive timeouts based on link stability © 2001 Nitin Vaidya

34. References [Bertsekas+ 1987] D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, N.J., 1987, 297-333. [Dijkstra 1959] E.W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numerische Math, 1:269-271. [Ford+ 1962] L.R. Ford, Jr. and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, N.J., 1962. [Hu+ 2000] Y-C Hu and D.B. Johnson, Caching strategies in on-demand routing protocols for wireless ad hoc networks, MOBICOM 2000, pp. 231-242. [Johnson+ 1996] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad-Hoc Wireless Networks, Mobile Computing, ed. T. Imielinski and H. Korth, Kluwer Academic Publishers, pp. 153-181, 1996. [Leiner+ 1962] B.M. Leiner, D.L. Nielson, and F.A. Tobagi, Issues in Packet Radio Network Design, Proceedings of the IEEE (Special Issue Packet Radio Networks), 75(1), January 1987, pp. 6-20. [McQuillan+ 1980] J.M. McQuillan, I. Richer, and E.C. Rosen, New Routing Algorithm for the ARPANET, IEEE Transactions on Communications COM-28(5), May 1980, pp. 711-719. [Perkins+ 1994] C.E. Perkins and P. Bhagwat, Highly Dynamic Destination-Sequenced Distance- Vector Routing (DSDV) for Mobile Computers, Commuter Communications Review, October 1994, pp. 234-244.