|
SECAN-Lab Home News Projects SECAN-LAB Mesh Sequencer U-2010 NARTUS EFIPSANS IRMA SECRICOM The Group Members Publications Theses Teaching Presentations Topics Mobile Computing Ad-Hoc Networks Ad-Hoc Protocols Mesh Computing Trust Related Stuff L-101 Laboratory Systems AS28 Systems 802.11 Network Simulator Internships Conferences Publications Standards Projects Links Partners OSTN Miscellaneous Contact About Job Opportunities Search |
Pei2000b
Fisheye State Routing Protocol (FSR) for Ad Hoc Networks
Guangyu Pei Rockwell Science Center 1049 Camino Dos Rios P.O. Box 1085 Thousand Oaks, CA 91358-0085, USA Phone: +1 805 373-4639 Fax: +1 805 373-4383 Email: gpei@rsc.rockwell.com Mario Gerla 3732F Boelter Hall Computer Science Department University of California Los Angeles, CA 90095-1596, USA Phone: +1 310 825-4367 Fax: +1 310 825-7578 Email: gerla@cs.ucla.edu Tsu-Wei Chen Bell Laboratories Lucent Technologies 600 Mountain Avenue Murray Hill, NJ 07974, USA Email: tsuwei@research.bell-labs.com Xiaoyan Hong 3820 Boelter Hall Computer Science Department University of California Los Angeles, CA 90095-1596, USA Phone: +1 310 825-4623 Fax: +1 310 825-7578 Email: hxy@cs.ucla.edu Internet-Draft November 17, 2000 Expired: May 17, 2001 IETF MANET Working Group Paper: ![]() ![]() AbstractThe Fisheye State Routing (FSR) algorithm for ad hoc networks introduces the notion of multi-level "scope" to reduce routing update overhead in large networks. A node stores the Link State for every destination in the network. It periodically broadcasts the Link State update of a destination to its neighbors with a frequency that depends on the hop distance to that destination (i.e., the "scope" relative to that destination). State updates corresponding to far away destinations are propagated with lower frequency than those for close by destinations. From state updates, nodes construct the topology map of the entire network and compute efficient routes. The route on which the packet travels becomes progressively more accurate as the packet approaches its destination. FSR resembles Link State routing in that it propagates Link State updates. However, the updates are propagated as aggregates, periodically (with period dependent on distance) instead of being flooded individually from each source. FSR leads to major reduction in link O/H caused by routing table updates. It enhances scalability of large, mobile ad hoc networks.BibTeX
@TECHREPORT(Pei2000b,
TITLE = {Fisheye State Routing Protocol (FSR) for Ad Hoc Networks},
AUTHOR = {Guangyu Pei and Mario Gerla and Tsu-Wei Chen and Xiaoyan Hong},
INSTITUTION = {IETF MANET Working Group},
TYPE = {INTERNET-DRAFT},
HOWPUBLISHED = {Published Online},
MONTH = {November},
YEAR = {2000},
NOTE = {Expiration: Mai 17 ,2001},
URL = {http://www.ietf.org/proceedings/01mar/I-D/manet-fsr-00.txt},
FILE = {manet-fsr-00.txt}
)
"Pei2000b" is mentioned on: Ad-Hoc-Papers | Fisheye State Routing | Pei2000 | Pei2000a |