1. Page 1 of 1413.01.2004 Fisheye State Routing (FSR) G. Pei, M. Gerla, Tsu-Wei Chen, "Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks," IEEE ICC 2000, vol. 1, pp. 70 -74. Presented by Pasi Maliniemi

2. Page 2 of 1413.01.2004 Presentation outline Fisheye vision Fisheye State Routing (FSR) Routing technique comparison FSR Simulation Results FSR - Summary References

3. Page 3 of 1413.01.2004 Fisheye vision Fish do have 360° (or almost) vision. Fishes (and humans) do have a higher concentration of optic nerves close to they focal point than elsewhere in they eye. As a result fisheye captures with high detail the points near the focal point

4. Page 4 of 1413.01.2004 Fisheye vision Fisheye View of Polaris. Dennis Anderson (2002)

5. Page 5 of 1413.01.2004 Fisheye State Routing (FSR) For routing this approach translates into an accurate information in the immediate neighborhood of a node and less detail as the distance increases. FSR is similar to link state (LS) routing in that each node maintains a view of the network topology with a cost for each link. In LS routing link state packets are flooded into the network whenever a node detects a topology change.

6. Page 6 of 1413.01.2004 Fisheye State Routing (FSR) In FSR nodes maintain a topology table (TT) based on the up-to-date information received from neighboring nodes and periodically exchange it with their local neighbors. For large networks in order to reduce the size of the routing update messages the FSR technique uses different exchange periods for different entries in the routing table. Relative to each node the network is divided in different scopes.

7. Page 7 of 1413.01.2004 Scopes of FSR 1 3 4 5 6 7 8 2 9 10 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 1 hop 2 hops 3 or more hops 11 33 13

8. Page 8 of 1413.01.2004 Routing technique comparison

9. Page 9 of 1413.01.2004 Message Reduction in FSR 0 5 1 2 4 3 0:{1} 1:{0,2,3} 2:{5,1,4} 3:{1,4} 4:{5,2,3} 5:{2,4} 101122101122 TTHOP 0:{1} 1:{0,2,3} 2:{5,1,4} 3:{1,4} 4:{5,2,3} 5:{2,4} 212012212012 TTHOP 0:{1} 1:{0,2,3} 2:{5,1,4} 3:{1,4} 4:{5,2,3} 5:{2,4} 221101221101 TTHOP Entries in black are exchanged more frequently

10. Page 10 of 1413.01.2004 Simulation Results

11. Page 11 of 1413.01.2004 Simulation Results

12. Page 12 of 1413.01.2004 FSR - Summary Routing table entries for a given destination are updated, i.e. exchanged with the neighbors, with progressively lower frequency as distance to destination increases The further away the destination, the less accurate the route As a packet approaches destination, the route becomes progressively more accurate

13. Page 13 of 1413.01.2004 FSR - Summary Benefits °Scales well to large network sizes °Control traffic overhead is manageable Problems °Route table size still grows linearly with network size °As mobility increases routes to remote destinations become less accurate °What happens if the target node is out of the scope of all nodes in the source nodes scope

14. Page 14 of 1413.01.2004 References G. Pei, M. Gerla, Tsu-Wei Chen, "Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks," IEEE ICC 2000, vol. 1, pp. 70 -74. Carlos Pomalaza-Ráez, Ad Hoc Networks - course material, University of Oulu