Gugrajah_Yuvaan_ Ramesh_2003.pdf
Gugrajah_Yuvaan_ Ramesh_2003.pdf Gugrajah_Yuvaan_ Ramesh_2003.pdf
Routing Protocolsfor Ad Hoc Networks 2.2.6.2. FSR o IERP IARP Dominate _.-- _.-" ___ 0 Optimum Zone Radius I Dominate ;' / ;' ;' ;' /IARP / ./ / /' /' /' /' Zone Radius Figure 2-8. The optimum region for the zone radius resides between the IERP and IARP dominated regions [Haas99]. Chapter 2 The Fisheye State Routing (FSR) protocol [Iwata99] models the routing methodology on the way in which the eye of a fish functions. The eye of a fish captures with high detail the pixels near the focal point and the detail decreases as the distance from the focal point increases. Figure 2-9 illustrates the concept of Fisheye State Routing. The aim of FSR is to reduce routing update overhead in large networks. Nodes maintain a link state table based on the up-to-date information received from neighbouring nodes and periodically exchange it with their local neighbours only, which prevents flooding. Table entries with larger sequence numbers replace the ones with smaller sequence numbers. The circles with different shades of grey in Figure2-9 define the fisheye scopes with respect to the centre node. Three scopes are shown for 1 hop, 2 hops and hops greater than 2, respectively. Different exchange periods are used for different entries in the routing table. Entries corresponding to nodes within the smallest scope are propagated to the neighbours most frequently. 2-26
Routing Protocols for Ad Hoc Networks Chapter 2 The imprecise knowledge of the best path to a distance destination is compensated by the fact the route becomes progressively more accurate as the packet gets closer to the destination. FSR is based on Global State Routing (GSR) [Gerla98]. GSR can be considered a special case of FSR where there is only one fisheye scope level. Although information is still only exchanged between direct neighbours, the overhead is high in GSR because the entire topology table is exchanged among neighbours. Unlike FSR, GSR does not distinguish between nodes based on their relative distance away from the node in question. FSR was designed to be able to scale to large networks, but avoid on-demand techniques while keeping overhead low and still provide adequate routes which become more accurate closer to the destination. 2.2:6.3. CGSR Figure 2-9. Fisheye scope in FSR. • Centre node -0 I-hop scope • 2-hop scope • > 2-hop scope Cluster-head Gateway Switch Routing (CGSR) [Chiang97] aggregates nodes into clusters. Each cluster is controlled by a cluster-head and adjacent clusters communicate via gateway nodes, which are members of two or more clusters. A node is always within transmission range of the cluster-head of its cluster. The cluster-head selection process is determined by the Least-Cluster-head Change 2-27
- Page 1 and 2: Routing Performance In Ad Hoc Netwo
- Page 3 and 4: ABSTRACT An ad hoc network is a mul
- Page 5 and 6: ACKNOWLEDGEMENTS I would like to th
- Page 7 and 8: 2.2.5. Routing with a Backbone 2-21
- Page 9: Chapter 2 LIST OF FIGURES AND TABLE
- Page 13 and 14: ABR ACK AMRIS AMROUTE AODV BQ CAMP
- Page 15 and 16: SWAP Shared Wireless Access Protoco
- Page 17 and 18: Introduction Chapter 1 There are a
- Page 19: Introduction Chapter J The problems
- Page 23 and 24: Introduction Chapter J networks and
- Page 25 and 26: Routing Protocols for Ad Hoc Networ
- Page 27: Routing Protocols for Ad Hoc Networ
- Page 35: Routing Protocols for Ad Hoc Networ
- Page 38 and 39: Routing Protocolsfor Ad Hoc Network
- Page 40 and 41: Routing Protocols for Ad Hoc Networ
- Page 44 and 45: Routing Protocols for Ad Hoc Networ
- Page 46 and 47: Routing Protocols for Ad Hoc Networ
- Page 48 and 49: Routing Protocols for Ad Hoc Networ
- Page 52 and 53: Routing Protocols for Ad Hoc Networ
- Page 57: Routing Protocols for Ad Hoc Networ
- Page 60: Routing Protocolsfor Ad Hoc Network
- Page 63: Simulation ofa Load Balancing Routi
- Page 66: Simulation ofa Load Balancing Routi
- Page 69 and 70: Simulation ofa Load Balancing Routi
- Page 71: Simulation ofa Load Balancing Routi
- Page 75 and 76: Simulation ofa Load Balancing Routi
- Page 77: Simulationofa Load Balancing Routin
- Page 87 and 88: Simulation ofa Load Balancing Routi
- Page 89 and 90: EvaLuation ofNetwork Blocking Proba
- Page 96 and 97: Evaluation ofNetwork Blocking Proba
Routing Protocolsfor Ad Hoc Networks<br />
2.2.6.2. FSR<br />
o<br />
IERP IARP<br />
Dominate<br />
_.-- _.-"<br />
___ 0<br />
Optimum<br />
Zone Radius<br />
I<br />
Dominate ;'<br />
/<br />
;'<br />
;'<br />
;'<br />
/IARP<br />
/<br />
./<br />
/<br />
/'<br />
/'<br />
/'<br />
/'<br />
Zone Radius<br />
Figure 2-8. The optimum region for the zone radius resides<br />
between the IERP and IARP dominated regions [Haas99].<br />
Chapter 2<br />
The Fisheye State Routing (FSR) protocol [Iwata99] models the routing<br />
methodology on the way in which the eye of a fish functions. The eye of a fish<br />
captures with high detail the pixels near the focal point and the detail decreases as the<br />
distance from the focal point increases. Figure 2-9 illustrates the concept of Fisheye<br />
State Routing.<br />
The aim of FSR is to reduce routing update overhead in large networks. Nodes<br />
maintain a link state table based on the up-to-date information received from<br />
neighbouring nodes and periodically exchange it with their local neighbours only,<br />
which prevents flooding. Table entries with larger sequence numbers replace the<br />
ones with smaller sequence numbers. The circles with different shades of grey in<br />
Figure2-9 define the fisheye scopes with respect to the centre node. Three scopes are<br />
shown for 1 hop, 2 hops and hops greater than 2, respectively. Different exchange<br />
periods are used for different entries in the routing table. Entries corresponding to<br />
nodes within the smallest scope are propagated to the neighbours most frequently.<br />
2-26
Change language