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,"

Slides:



Advertisements
Similar presentations
The Wireless Routing Protocol (WRP) Invented by J.J.Garcia Luna Aceves and S. Murthy Belongs to a general class of algorithms called Path Finding Algorithms.
Advertisements

1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
A Presentation by: Noman Shahreyar
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Unicast Performance Analysis of Extended ODMRP in a Wired-to- Wireless Hybrid Ad-Hoc Network Sang Ho Bae Sungwook Lee Mario Gerla UCLA Computer Science.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
Ad Hoc Wireless Routing CS Winter 2001 Review of conventional routing schemes Proactive wireless routing schemes Hierarchical routing Reactive (on.
Ad Hoc Networks Routing
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Landmark Routing for Large Ad Hoc Wireless Networks Globecom 2000 San Francisco, Nov 30, 2000 Mario Gerla, Xiaoyan Hong and Gary Pei Computer Science Department.
Ad Hoc Networking Course Instructor: Carlos Pomalaza-Ráez Geographical Routing Using Partial Information for Wireless Ad Hoc Networks Rahul Jain, Anuj.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
9/25/2000UCLA CSD Gerla, Kwon and Pei On Demand Routing in Large Ad Hoc Wireless Networks With Passive Clustering Mario Gerla, Taek Jin Kwon and Guangyu.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Mobile Ad hoc Networks COE 549 Routing Protocols I
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
H AZY S IGHTED L INK S TATE R OUTING P ROTOCOL Eleonora Borgia Pervasive Computing & Networking Lab. PerLab IIT – CNR MobileMAN.
On-Demand Routing Protocols Routes are established “on demand” as requested by the source Only the active routes are maintained by each node Channel/Memory.
Scalable Routing Protocols for
Draft-cardenas-dff-05.txt March 26, 2012 Ulrich Herberg (Fujitsu)
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Proposed ad hoc Routing Approaches
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
H AZY S IGHTED L INK S TATE Eleonora Borgia IIT – CNR Pisa - Dicember 4th, 2003.
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.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
1 Optimized Link State Routing Protocol for Ad Hoc Networks Jacquet, p IEEE INMIC Dec park gi won
Jim Parker CMSC691t Spring 2000 “Ad-hoc On-Demand Distance Vector Routing” A dynamic routing algorithm for mobile ad-hoc networks.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Density-Aware Hop-Count Localization (DHL) in Wireless Sensor Networks with Variable Density Sau Yee Wong 1,2, Joo Chee Lim 1, SV Rao 1, Winston KG Seah.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Centralized vs Distributed Routing
Instructor Materials Chapter 5: Dynamic Routing
AODV-OLSR Scalable Ad hoc Routing
DSDV Highly Dynamic Destination-Sequenced Distance-Vector Routing
MZR: A Multicast Protocol based on Zone Routing
TCP and MAC interplay in Wireless Ad Hoc Networks
A comparison of Ad-Hoc Routing Protocols
Fisheye Routing protocol
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Chapter 5: Dynamic Routing
ECE 544 Protocol Design Project 2016
Some Typical Routing Protocols in Mobile Ad Hoc Networks
Wireless Ad Hoc Multicast and ODMRP CS 218 Fall 2017
OLSR + FSR for Scalability in Mesh Networks
Some Typical Routing Protocols in Mobile Ad Hoc Networks
Intradomain Routing Outline Introduction to Routing
Effective Replica Allocation
DSDV Destination-Sequenced Distance-Vector Routing Protocol
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Page 1 of 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 Presented by Pasi Maliniemi

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

Page 3 of 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

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

Page 5 of 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.

Page 6 of 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.

Page 7 of Scopes of FSR hop 2 hops 3 or more hops

Page 8 of Routing technique comparison

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

Page 10 of Simulation Results

Page 11 of Simulation Results

Page 12 of 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

Page 13 of 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

Page 14 of 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 Carlos Pomalaza-Ráez, Ad Hoc Networks - course material, University of Oulu