8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 1/10

EILEEN BALCI

GPSR: Greedy PerimeterStateless Routing for Wireless

Networks

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 2/10

 About GPSR 

GPSR allows nodes to figure out who its closestneighbors are (using beacons) that are also close tothe final destination the information is supposed totravel toTo calculate a path, GPSR uses a greedy

forwarding algorithm that will send theinformation to the final destination using the mostefficient path possible !f the greedy forwardingfails, perimeter forwarding will be used whichroutes around the perimeter of the region

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 3/10

 About the Greedy "orwarding Algorithm

 Assuming the wireless routers #nodes$ %now theirown locations the Greedy forwarding algorithm willtry to find the closest router which is also the closest

to the final destination

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 4/10

Greedy "orwarding Algorithm &enefits

 A node 'ust has to remember the location ofneighbors with in onehop

Routing decisions can be dynamically made

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 5/10

Greedy "orwarding Algorithm rawbac% 

!f the networ% is dense enough that each interiornode has a neighbor in every *Π+ angular sector,Greedy "orwarding will always succeed -owever,

the greedy forwarding algorithm can fail.

Greedy Forwarding fails

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 6/10

Perimeter "orwarding Algorithm &enefits

 /hen the Greedy "orwarding algorithm fails, thePerimeter "orwarding algorithm will be used

 Apply the righthand rule to traverse the edges of the void and find a path using the topology0s perimeter

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 7/10

Perimeter "orwarding Algorithm rawbac% 

The Perimeter "orwarding Algorithm uses a longerpath to the destination so the perimeter forwardingalgorithm less efficient and cannot be used alone

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 8/10

Greedy Perimeter Stateless Routing GPSR 

Putting Greedy "orwarding and Perimeter"orwarding together ma%es the final GPSR which

 will use the necessary algorithm(s) to find the best

path in a given topology

Greedy Forwarding Perimeter Forwarding

greedy fails

have left local maxima

greedy works greedy fails

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 9/10

GPSR 

The GPSR is a responsive and efficient routingprotocol for mobile, wireless networ%s GPSR can beapplied to Sensor networ%s, Rooftop networ%s,

 1ehicular networ%s and adhoc networ%s

8/18/2019 Routing Protocol for Adhoc Network

http://slidepdf.com/reader/full/routing-protocol-for-adhoc-network 10/10

2redits

www.cs.binghamton.edu/~kang/teaching/cs580s/g psr.ppt 

http://www.eecs.harvard.edu/~htk/publication/2000-mobi-karp-kung.pdf 

http://www.icir.org/bkarp/gpsr/gpsr.html