BU CS 580S - Motivation (27 pages)

Previewing pages 1, 2, 3, 25, 26, 27 of 27 page document View the full content.
View Full Document

Motivation



Previewing pages 1, 2, 3, 25, 26, 27 of actual document.

View the full content.
View Full Document
View Full Document

Motivation

41 views


Pages:
27
School:
Binghamton University
Course:
Cs 580s - Smart Devices And Sensing

Unformatted text preview:

GPSR Greedy Perimeter Stateless Routing for Wireless Networks B Karp H T Kung Borrowed some slides from Richard Yang s 1 Motivation A sensor net consists of hundreds or thousands of nodes Scalability is the issue Existing ad hoc net protocols e g DSR AODV ZRP require nodes to cache e2e route information Dynamic topology changes Mobility Reduce caching overhead Hierarchical routing is usually based on well defined rarely changing administrative boundaries Geographic routing Use location for routing 2 Scalability metrics Routing protocol msg cost How many control packets sent Per node state How much storage per node is required E2E packet delivery success rate 3 Assumptions Every node knows its location Positioning devices like GPS Localization A source can get the location of the destination 802 11 MAC Link bidirectionality 4 Geographic Routing Greedy Routing Closest to D S A D Find neighbors who are the closer to the destination Forward the packet to the neighbor closest to the destination 5 Benefits of GF A node only needs to remember the location info of one hop neighbors Routing decisions can be dynamically made 6 Greedy Forwarding does NOT always work GF fails If the network is dense enough that each interior node has a neighbor in every 2 3 angular sector GF will always succeed 7 Dealing with Void Right Hand Rule Apply the right hand rule to traverse the edges of a void Pick the next anticlockwise edge Traditionally used to get out of a maze 8 Right Hand Rule on Convex Subdivision For convex subdivision right hand rule is equivalent to traversing the face with the crossing edges removed 9 Right Hand Rule Does Not Work with Cross Edges z u D w x originates a packet to u Right hand rule results in the tour x u z w u x x 10 Remove Crossing Edge z u D Make w the graph planar Remove x w z from the graph Right hand rule results in the tour x u z v x 11 Make a Graph Planar Convert a connectivity graph to planar non crossing graph by removing bad edges Ensure the



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Motivation and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Motivation and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?