slide by jihyuk choi partly from authors poster presentation at mobicom 2004 l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004) PowerPoint Presentation
Download Presentation
Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004)

Loading in 2 Seconds...

play fullscreen
1 / 16

Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004) - PowerPoint PPT Presentation


  • 165 Views
  • Uploaded on

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)

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Slide by Jihyuk Choi ( Partly from authors poster presentation at MobiCom 2004)' - dotty


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide by jihyuk choi partly from authors poster presentation at mobicom 2004

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)

introduction
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?
gpsr assumptions
GPSR: Assumptions
  • Nodes know
    • Their own position
    • Position of neighbors acquired beaconing
    • Position of the destination
gpsr greedy routing

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
gpsr benefits
GPSR: Benefits
  • A node only needs to remember the location info of one-hop neighbors
  • Routing decisions can be dynamically made
gpsr local optimum
GPSR: Local optimum

D

u

v

x

S

No neighbor exists which is closer to the destination than itself

gpsr repair strategy

y

D

x

w

b

u

v

a

S

GPSR: Repair Strategy

Perimeter Forwarding

slide8

Reaches a local optimum

GPSR

Greedy Routing

Repair Strategy

have left a local optimum

greedy works

greedy fails

greedy perimeter coordinator routing
Greedy Perimeter Coordinator Routing
  • Assumption
    • Nodes do know if they are located on a junction
    • This information is sent within a beacon message
detecting junctions
Detecting Junctions
  • Assumption
    • Node’s neighbor table is sent within a beacon message
gpcr nt
GPCR NT
  • Comparing neighbor tables of direct neighbors (NT)
gpcr cc
GPCR CC
  • Calculating correlation coefficient
conclusion
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