1.

Introduction
n What’s Position Based Routing?
Position Based Routing n Position Based Routing methods
n Unit Graph Model
Lili Zhang n Position Based Routing Schemes
29th Sep 2003

29/09/2003 Lili Zhang 2

Positon-Based Routing Unit Graph Model

n Based on the geographic position of a n A widely accepted basic graph-
packet's destination. theoretical model for networks.
n Each node knows only its own position
and the position of its one-hop
neighbours in order to forward packets.
n Position-based routing does scale well
even if the network is highly dynamic.

29/09/2003 Lili Zhang 3 29/09/2003 Lili Zhang 4

Unicast Routing Algorithms

n Host mobility and changes in node
activity status cause frequent
unpredictable topological changes.
n The destination node is known and
addressed by means of its location.
n The distance between neighboring
nodes can be estimated on the basis of
incoming signal strenths.
n Packets are forwarding in the
geographic direction of the destination
n The forwarding node knows the position
of all the neighbours in the transmission
range.
n Collected neighbour information can get
outdated quickly due to mobility.

29/09/2003 Lili Zhang 5 29/09/2003 Lili Zhang 6

1

Multicast Routing Algorithms
n Uses geographic position of the nodes
to make forwarding decisions.
n No request for the maintenance of a
distration structure (a tree or a mesh).
n No resort of flooding.
n A generlization of existing position-
based unicast routing protocols.
Position-Based Routing
Protocol Taxonomy
n Qualitative and quantitative
independent metrics for the
performance of the mobile networks.
n Desirable qualitative properties include:
distributed operations,loop-
freedom,demand-based operation and
’sleep’ period operation.

29/09/2003 Lili Zhang 7 29/09/2003 Lili Zhang 8

Loop-Freedom Distributed Operation

n Should be inherently loop-free.
n Avoid timeout or memorizing past traffic
n Be classified as having or not having
loop free property.
n Resemble greedy algorithms,simple
local behavior achieves a desired global
objective.
n Localized routing algorithm:based on
the location itself.
n Global routing algorithm:each node
knows the position of every other node
in the network.

29/09/2003 Lili Zhang 9 29/09/2003 Lili Zhang 10

Path Strategy Metrics

n Single path strategy:the shortest path n Hop count used as the metrics in most
route. routing schemes.
n Flooding based approach:message n Power metric
flooded through the whole network. n Cost metric
n Multi-path strategy:composed of few
single recognizable paths.
n Combinations of the two strategies.

29/09/2003 Lili Zhang 11 29/09/2003 Lili Zhang 12

2
 Memorization
n Better to avoid memorizing past traffic
at any node,if possible.
n Memorization of past traffic is needed
for short period of time.
n Memorizing path to optimize the traffic
flow and satisfy QoS criteria.
n Best path found in the search process.
Guaranteed Messge Delivery
n Guarantee delivery is the best
assurance to design routing scheme.
n Single frequency communication model
used in wireless networks.
n Assumes the application of an
ideal,collision free,medium access
scheme,e.g. TDMA

29/09/2003 Lili Zhang 13 29/09/2003 Lili Zhang 14

Scalability
n Simplified criterion:routing scheme is
scalable if it is loop free,localized and
single-path.
n Mobility-caused loops:named by the
position of some nodes.
Robustness
n Small networds
n Short message:can be broadcasted by
using an optimal broadcasting scheme.
n Long message:initiating destination search
by broadcasting a short search message.
n Large networks
n Cope with the network dynamicity
n Backup strategies to reach a node

29/09/2003 Lili Zhang 15 29/09/2003 Lili Zhang 16

Existing Position-Based Basic Distance,Progress and

Routing Schemes Direction Based Methods
n Basic Distance,Progress and Direction Based n Forward Vs. Backward Direction
Methods.
n Partial Flooding and Multi-path Based Path
Strategies.
n Depth First Search Based Routing with
Guaranteed Delivery.
n Nearly Stateless Routing with Guaranteed
Delivery.
n Power and Cost Aware Routing

29/09/2003 Lili Zhang 17 29/09/2003 Lili Zhang 18

3
 MFR
n C,A,F are in forward direction,with a n MFR=Most Forward within Radius
positive progress. n Packet is sent to the neighbor with the
e.g. A’D<SD greatest progress.
n B,D are in backward direction,with a n MFR is a loop-free algorithm.
negative progess. n MFR is the only progress-based
e.g B’D>BD algorithm competitive in terms of hop
count.

29/09/2003 Lili Zhang 19 29/09/2003 Lili Zhang 20

Greedy Scheme GEDIR

n As variant of random progress method
n Selected the node closest to the
destination.
n A variant of greedy algorithms
n The msg is dropped if the best choice
for a current node is to return the msg
to the node the msg came from.
n Increase delivery rate by prolonging
failure.

29/09/2003 Lili Zhang 21 29/09/2003 Lili Zhang 22

n DIR and any other method that includes

forwarding msg to neighbor with closet
direction are not loop-free.

n Path selected by DIR->SACJKLMND

n Path selected by GEDIR->SBEFGHID

29/09/2003 Lili Zhang 23 29/09/2003 Lili Zhang 24

4
 Flooding and Partial Flooding Partial Flooding
n Flooding based method require nodes n It is directed towards nodes in a limited
to memorize past traffic to control sector of the network.
flooding effect. n It is stopped after a certain number of
n Avoid forwarding the same msg over hops.
once. n Partial flooding can be used only for
path discovery purpose or for packet
forwarding.

29/09/2003 Lili Zhang 25 29/09/2003 Lili Zhang 26

Depth First Search Based Routing Nearly Stateless Routing with

with Guaranteed Delivery
n GRA=Geographic Routing Algorithm
n Requires nodes to partially store routes toward
certain destinations in routing tables.
n GRA applies greedy strategy in forwarding
messages.
n DFS=Depth First Search
n Does not use routing table.
n Msg follows the whole depth first search path.
n The algorithm equals greedy method.
Guaranteed Delivery
n Nodes maintain only some local
information to perform routing.
n Face routing and GFG (Greedy-Face-
Greedy) schemes.
n Fail if there is some instability in the
transmission ranges of the mobile host.

29/09/2003 Lili Zhang 27 29/09/2003 Lili Zhang 28

Power and Cost Aware Routing Conclusion

n Power aware routing algorith n The taxonomy of known position based
n Cost efficient routing algorithm routing algorithms.
n Proceed until the destination is reach or a n Position based routing model and
node fails to find better forwarding methods.
neighbor than previous node on the path. n Existing position based routing
n Power and cost are combined into a schemes.
single metrics to choose efficient path
among cost optimal ones.
29/09/2003 Lili Zhang 29 29/09/2003 Lili Zhang 30

5
 References
n [1] I Stojmennovic., Position-Based Routing
Algorithms For Ad Hoc Networks, Ottawa, 2001
n [2] J.H. Chang and L. Tassiulas., Routing for
maximum system lifetime in wireless ad-hoc
networks, Monticello, IL, Sept, 1999
n [3] J.Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu,
J. Jetcheva, A performance comparison of multi-
hop wireless ad hoc network routing protocols,
Proc. MOBICOM, 1998

29/09/2003 Lili Zhang 31