1 / 16

Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004)

Geographic Routing in City Scenarios C. Lochert, M. Mauve, H. Fler,H. Hartenstein Mobile Computing and Communications Review 9(1): 69-72, 2005 . Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004). Introduction. Greedy Perimeter Stateless Routing (GPSR)

dotty
Download Presentation

Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Geographic Routing in City ScenariosC. Lochert, M. Mauve, H. Fler,H. HartensteinMobile Computing and Communications Review 9(1): 69-72, 2005 Slide by JihyukChoi ( Partly from authors poster presentation at MobiCom 2004)

  2. Introduction • Greedy Perimeter Stateless Routing (GPSR) • Well worked for inter-vehicle communication on highways. • Not suitable for city environment due to radio obstacles • How do we use Position-based routing in urban areas?

  3. GPSR: Assumptions • Nodes know • Their own position • Position of neighbors acquired beaconing • Position of the destination

  4. Closest to D A GPSR: Greedy Routing S D • Find neighbors who are the closer to the destination • Forward the packet to the neighbor closest to the destination

  5. GPSR: Benefits • A node only needs to remember the location info of one-hop neighbors • Routing decisions can be dynamically made

  6. GPSR: Local optimum D u v x S No neighbor exists which is closer to the destination than itself

  7. y D x w b u v a S GPSR: Repair Strategy Perimeter Forwarding

  8. Reaches a local optimum GPSR Greedy Routing Repair Strategy have left a local optimum greedy works greedy fails

  9. GPSR: Challenges in a City Environment

  10. Greedy Perimeter Coordinator Routing • Assumption • Nodes do know if they are located on a junction • This information is sent within a beacon message

  11. GPCR: Greedy Routing

  12. GPCR: Repair Strategy

  13. Detecting Junctions • Assumption • Node’s neighbor table is sent within a beacon message

  14. GPCR NT • Comparing neighbor tables of direct neighbors (NT)

  15. GPCR CC • Calculating correlation coefficient

  16. Conclusion • GPCR combines position-based routing with local topological knowledge • In simulations, GPCR outperforms GPSR significantly and independently of a given junction detection algorithm • Calculating the correlation coefficient is sufficient to detect a junction

More Related