7 Routing Wo Location

8/16/2019 7 Routing Wo Location

1/35

Geographic Routing withoutLocation Information


2/35

Assumption by Geographic Routing

Each node knows its own location. outdoor positioning device:

GPS: global positioning systemaccuracy: in about 5 to 50 meters

indoor positioning device:Inraredshort!distance radio

"he destination#s location is also known.


3/35

Problem Statement

Geographic routing assumes:

$odes know their own location rompositioning devices such as GPS.

$odes know each other#s location thru alocation service.

%hat i positioning systems such asGPS are not available&


4/35

Three papers addressing this question

'obi(om#0) !! *Geographic +outing without

,ocation Inormation-'obioc#0) !! *,ocali/ation rom 'ere

(onnectivity-

I$1(1'#0) !! *,ocating $odes with E2SE:,ast Encounter +outing in 2d oc $etworksthrough 'obility 3iusion-


5/35

Basic Ideas

(ompute ,ocation Inormation1r somehow obtain location

inormation


6/35

Geographic Routing without LocationInformation !obi"om#$%&


7/35

"ompute Location Information

4. %hich nodes are on the perimeter&

. (ompute perimeter nodes# locations.

). (ompute interior nodes# locations.


8/35

Step %' "ompute interior nodes#

locations(

2ssumption: perimeter nodes know their

*perimeter node- status and location.Each non!perimeter node i iteratively

appro6imates its location by:

7i 8 average o all neighbors# 6!coordinates9i 8 average o all neighbors# y!coordinates

Initial value o 7i ; 9i < 8 &


9/35

Initial )alue of *+i , -i . / 0

2verage o all perimeter modes#

coordinates.1r use step to obtain a more

reasonable initial value.


10/35

Step 1' "ompute perimeter nodes#

location *2.

2ssumption: perimeter nodes know their

*perimeter node- status; but not their location.(ompute the distance = o hops


11/35

Solutions are sub@ect to translation;

rotation; lipping.$eed three nonlinear points to i6 a

solution.

2; : two bootstrapping nodes(: center o gravity 2

(


12/35

"ompute the distance *3 of hops.

between e)ery two perimeter nodes(

Each perimeter node broadcasts by

looding< a ello message to the entirenetwork.Each perimeter node computes its

distances to all other perimeter nodes.Each perimeter node broadcasts these

distances.


13/35

Step 2' 4hich nodes are on the

perimeter0

2: a particular node.

I a node i is the arthest away; amongits !hop neighbors; rom 2; then i is aperimeter node.


14/35

Simulation results

Perimeter nodes know their status and

location. 2ctual positions


15/35

2ter 40 iterations

2ter 400 iterations 2ter 4000 iterations

2ctual positions


16/35

Simulation results

2ctual positions

Perimeter nodes know their status only.

2dvanced initial values are used.(omputed positions

2ter 4 iteration


17/35

Simulation results

2ctual positions

Perimeter nodes are unknown.


18/35

Geographic Routing' simulation

results

Success rate:

0.FF using actual positions 0.FF) using computed positions

Perimeter nodes know their position 0.FF 0.FFH< using computed positions

Perimeter nodes know their status 2ter 4 40< iteration with advanced initial values.

0.FF using computed positionsPerimeter nodes know neither 2ter 40 iterations with advanced initial values.


19/35

Geographic Routing' simulation

results

2verage length path = o hops<

4. using actual positions 4J.4 using computed positions

Perimeter nodes know their position 4J. using computed positions

Perimeter nodes know their status 2ter 4 iteration with advanced initial values.

4J.) using computed positionsPerimeter nodes know neither 2ter 40 iterations with advanced initial values.


20/35

Irregular shape *2.

Success rate: 0.F) vs. 0.FJ

Path length: 4J. vs. 4.H

2ctual positions


21/35

Irregular shape *1.

Success rate: 4.00 vs. 0.FF

Path length: 4).F vs. 4H.)


22/35

Locali5ation from !ere"onnecti)ity !obi6oc#$%&


23/35

"ompute Location Information

4. (ompute shortest paths between all pairs onodes.

. 2ssign location 7i ;9i ?measured!disti;@


24/35

7nly connecti)ity info is used


25/35

8istance info is used


26/35

Geographic Routing withoutLocation Ser)ice


27/35

Problem Statement

Kpdating location databases is

e6pensive; especially i nodes keepmoving.Given that nodes keep moving; is it

possible to perorm geographic routingwithout e6plicitly updating locationdatabases&


28/35

*,ocating $odes with E2SE: ,ast

Encounter +outing in 2d oc $etworksthrough 'obility 3iusion-'atthias Grossglauser; 'artin Detterli

I$1(1' 00)


29/35

Last 9ncounter H

node time location

64;y4<

,E "able o node

H 44:)0 64; y4<

F

F 4:00 6; y<

6; y<


30/35

Locating a :ode with

9;ponential Age Search *9AS9.

time

t4 t t) tH

now


31/35

Performance Analysis

(osts; d< 8 cost o sending a packet

rom s to d. "otal number o hops or the data packet

and the search packetssd


32/35

Asymptotic "ost

s and d randomly pickedEL(osts; d


33/35

Last 9ncounter Routing

Still in its inancyurther research needed


34/35

"oncluding Remar


35/35

!athematics used

Disuali/ation o Graphs

'ultidimensional Scaling+andom %alk
http://graph%20drawing%20book.htm/http://book%20modern%20multidimensional%20scaling.htm/http://book%20modern%20multidimensional%20scaling.htm/http://graph%20drawing%20book.htm/

Date post:	05-Jul-2018
Category:	Documents
Upload:	thanhtraniuerd
View:	225 times
Download:	0 times

7 Routing Wo Location

Documents