Professional Documents
Culture Documents
GPSR
GPSR
Introduction
In the first stages, the router makes a list of which networks it can
reach, and how many hops it will cost. In the outset this will be the
two or more networks to which this router is connected.
Bad routing paths are then purged from the new routing table. If
two identical paths to the same network exist, only the one with
the smallest hop-count is kept. When the new table has been
cleaned up, it may be used to replace the existing routing table
used for packet forwarding.
DV & LS
DV
DV & LS
Hierarchy
Caching
The
of scalability are:
Ad-hoc networks:
Sensor networks:
Rooftop networks:
Greedy Forwarding
Greedy Forwarding
Greedy Forwarding
A
Greedy Forwarding
The 802.11 MAC layer also gives direct indications of linklevel retransmission failures to neighbors; algorithm
interprets these indications identically.
Greedy Forwarding
The
probelm in
Figure 2 is from x to
D the route x-w-v-D
and x-y-z-D are
same in distance.
The dark area is void
area.
Planarized Graphs
While
Planarized Graphs
The
Removing
Planarized Graphs
Relative Neighborhood Graph (RNG)
Planarized Graphs
Relative Neighborhood Graph (RNG)
Planarized Graphs
Gabriel Graph (GG)
The
GG is defined as follows:
Planarized Graphs
Gabriel Graph (GG)
Protocol Implementation
Support
Protocol Implementation
Protocol Implementation
Promiscuous
Protocol Implementation
Results
Simulation Environment
Results
Packet Delivery Success Rate
Results
Routing Protocol Overhead
Results
Path Length
Figure gives a histogram of the number of hops beyond the ideal true shortest path length
in which GPSR and DSR deliver all successfully delivered packets. The data are
presented as percentages of all packets delivered across all six 50-node simulations of
GPSRa and DSR at pause time zero, where topological information available to both
algorithms is least current.
Here, the 0 bin counts packets delivered in the optimal, true-shortest-path number of
hops, and successive bins count packets that took one hop longer, two hops longer, etc.
Results
Effect of Network Diameter
Results
Effect of Network Diameter
Results
Location Database Overhead
Conclusion
Conclusion
END