VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate- Based Routing in...

VirtualFace: An Algorithm to Guarantee VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor Based Routing in Wireless Sensor NetworksNetworks

Ming-Jer Tsai, Associate ProfessorMing-Jer Tsai, Associate ProfessorDepartment of Computer ScienceDepartment of Computer Science

National Tsing Hua UniversityNational Tsing Hua University

Sensors

Eco(周百祥教授 )

Octopus II(許建平教授 )

Wireless Sensor Network

台北市政府空調監測系統台北市政府空調監測系統

玻璃基板輸送帶震動監控玻璃基板輸送帶震動監控

土石流暨五彎仔邊坡滑動監測土石流暨五彎仔邊坡滑動監測

生理資訊追蹤及肢體互動系統

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab.

Wireless Sensor Network


Geographic Routing Protocol- GPS Assistance

- A large amount of power consumption

- Cannot be used indoor

- Not suitable for wireless sensor networks

Virtual-Coordinate-Based Routing Protocol- Virtual Coordinate Assignment Protocol

Routing Protocol


VCap

2

16

8

521

24

12

11

22

1

7

6

10

25

19

9

1523

14

13

4

27

3

18

20

17

26

(0,8,5)

(1,7,4)

(2,7,4)

(2,8,3)

(2,6,3)

(3,6,4)

(3,5,3)

(3,5,2)(3,7,2

)

(4,6,1)

(4,5,1)

(4,4,2)

(4,4,3)

(5,6,0)

(5,5,1)

(5,3,3)

(5,4,4)

(6,5,5)

(6,2,4)

(6,4,5)

(7,4,6) (7,3,6

)

(8,3,7)

(8,2,7)

(7,1,5)

(8,1,6)

(8,0,6)

27

17

20

X

Z

Y

2 3 4

1(4,4,3)(4,4,3)(4,4,3)

1

23

4

1

23

4

2 3 4

11

2

3


VCap Routing Protocol

15

2

16

8

521

24

12

11

22

1

7

6

10

25

19

9

23

14

13

4

27

3

18

20

17

26

(0,8,5)

(1,7,4)

(2,7,4)

(2,8,3)

(2,6,3)

(3,6,4)

(3,5,3)

(3,5,2)(3,7,2

)

(4,6,1)

(4,5,1)

(4,4,2)

(4,4,3)

(5,6,0)

(5,5,1)

(5,3,3)

(5,4,4)

(6,5,5)

(6,2,4)

(6,4,5)

(7,4,6) (7,3,6

)

(8,3,7)

(8,2,7)

(7,1,5)

(8,1,6)

(8,0,6)

D(15,1)=sqrt(22), D(15,4)=sqrt(27), D(15,12)=sqrt(36), D(15,23)=sqrt(12), D(15,25)=sqrt(14).

23


2

Src

Dst15

11

D(15,2)=sqrt(3), D(15,15)=sqrt(0), D(15,23)=sqrt(12).

2 2 2

1 1 1 2 2 2 2 1 2 1 2 1(( , , ), ( , , ))D x y z x y z x x y y z z


Dead-End Problem of VCap Routing Protocol

2

16

8

521

24

12

11

22

1

7

6

10

25

19

9

1523

14

13

4

27

3

18

20

17

26

(0,8,5)

(1,7,4)

(2,7,4)

(2,8,3)

(2,6,3)

(3,6,4)

(3,5,3)

(3,5,2)(3,7,2

)

(4,6,1)

(4,5,1)

(4,4,2)

(4,4,3)

(5,6,0)

(5,5,1)

(5,3,3)

(5,4,4)

(6,5,5)

(6,2,4)

(6,4,5)

(7,4,6) (7,3,6

)

(8,3,7)

(8,2,7)

(7,1,5)

(8,1,6)

(8,0,6)

22


2121Src

Dst


Virtual-Coordinate-Based Routing Protocols

Routing Protocol Delivery Guarantee

Feature

MAP (Mobicom 2005) Yes Axis-based, long path, need global topology

ABVCap (Infocom 2007) Yes Axis-based, long path

VCap (Infocom 2005) No Landmark-based, short path

No Landmark-based, short path

HopID (TMC 2007) No Landmark-based, short path

VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor NetworksCoordinate-Based Routing in Wireless Sensor Networks

GLIDER (Infocom 2005)

No Landmark-based, short pathGLDR (Infocom 2007)


Outline

Virtual Face Construction Protocol

Virtual Face Naming Protocol

The VirtualFace Algorithm (VF)

Performance Evaluation

Conclusion


The Purpose

X

YZ(10,0,6)

(6,4,3)

(7,4,2)

(5,5,2)

(6,5,1)

(7,5,2)

(8,6,3)

(9,7,4)

(6,6,3)

(7,3,3)

(4,6,3)(3,7,4)

(2,8,5)(1,9,6)

(0,10,7)

(7,6,0)

(9,1,5)

(8,2,4)

(8,2,4)

Src

Dst

(7,5,4)

Dead-End Node

(6,6,3)

(8,6,3)

(6,6,3)

(7,7,4)

(7,7,4)


The Purpose

X

YZ(10,0,6)

(6,4,3)

(7,4,2)

(5,5,2)

(6,5,1)

(7,5,2)

(8,6,3)

(9,7,4)

(7,3,3)

(4,6,3)(3,7,4)

(2,8,5)(1,9,6)

(0,10,7)

(7,6,0)

(9,1,5)

(8,2,4)

(8,2,4)

Src

Dst

(7,5,4)

Dead-End Node

(6,6,3)

(8,6,3)

Progress Node

(6,6,3)

(7,7,4)

(7,7,4)


The Idea

4

0

7

8

1

1

2

2

3 3

3

4

4

5

5

5

6

6

6

7

8

89

Head Node

Tail Node 8

7

9

1

1

1

2

2

22

2

4

3

3

33

3


The Implementation

Preprogrammed Node

(0)

(1)

(1)

(2)

(2)

(3)

(3)

(3)(3)

(3)

(4)

(4)

(4)

(4)

(2)

(4)

(5)

(5)

(5)

(5)

(5)

(6)

(6)

Tail Node6

5

4

3

2

1


The Implementation

(0)

(1)

(1)

(2)

(2)

(3)

(3)

(3)

(3)

(3)

(4)

(4)

(4)

(4)

(2)

(4)

(5)

(5)

(5)

(5)

(5)

(6)

(6)

Tail Node

6

8

4

3

2

1

5

7


Message Reduction (1)

(0)

(1)

(1)

(2)

(2)

(3)

(3)

(3)

(3)

(3)

(4)

(4)

(4)

(4)

(2)

(4)

(5)

(5)

(5)

(5)

(5)

(6)

(6)

Tail Node

6

8

4

3

2

1

5

7

(2)


Construction of Connected Dominating Set


Message Reduction (2)

(0)

(1)

(1)

(2)

(1)

(3)

(3)

(3)

(3)

(2)

(4)

(4)

(4)

(4)

(2)

(3)

(5)

(5)

(5)

(5)

(5)

(6)

(6)


Generation of Triangle-Free Subnetwork


Outline




VCap augmented with the VirtualFace algorithm (VCap+VF)


Conclusion


The Purpose

(6,4,3)

(7,4,2)

(5,5,2)

(6,5,1)

(7,5,2)

(8,6,3)

(9,7,4)(7,3,3)

(4,6,3)(3,7,4)

(2,8,5)(1,9,6)

(7,6,0)

(9,1,5)

(8,2,4)

(8,2,4)

SrcDst

(6,6,3)

(9,7,4)

f1f2

f7f5

f4f6

f3


The Idea

f1f2

f7f5

f4f6

f3

f4f6

f5f7

f2f1

f3

Src Dst


The Idea

f4

f6

f5

f7 f2

f1

f3

f4

f6

f5 f7

f2 f1 f3(0,0)

(1, 2)

(1, )

(2,3 4)

(1,3 2)

(1,0)

(2,5 4)

(1,[ 2, ))

(1,[ ,3 2))

(2,[ 2,3 4))

(1,[3 2,2 ))

(1,[0, 2))

(2,[5 4,3 2))

(0,[0,2 ))


))4

,8

[,1(

f1f2

f7

f3

f6

f4

f5

(1,?)

(1,?)

(1,?)

(1,?)

(0,[0,2 ))

0 2π

0 2π/8

0 2π/8f2 f7

))8

,0[,1(

2π/4

3π/12f2 f6 f7

2π/8

The Idea

5(1,[ , ))

3 12

6π/12

3(1,[ , ))

4

3 19(2,[ , ))

8 48

(2,[ , ))96 48

f1f2

f7f5

f4f6

f3

1

2

3

4

5

6

7

8


f1f2

f7f5

f4f6

f3uw

v

m

: f1.radius=0, f1.angle= [0,2 ) : f4.radius=0, f4.angle= [0,2 ) : f5.radius=0, f5.angle= [0,2 )

fp=f1, f1.id, f1.angle, f1.radius f1.size=8, u.seq(f1)=2, f2.id, f6.id, f7.id

u message content:

w: f2.radius=1, f2.angle= (1,[ , ))4 3

fp=f1, f1.id, f1.angle, f1.radius f1.size=8, m.seq(f1)=1, f2.id, f7.id

m message content:

w: f2.radius=1, f2.angle= (1,[0, ))8

n

fp=f4, f4.id, f4.angle, f4.radius f4.size=4, n.seq(f1)=2, f6.id

n message content:

v: f6.radius=1, f6.angle= (1,[ , ))2

v: f6.radius=1, f6.angle= 5

(1,[ , ))3 12

The Implementation


Outline





Conclusion


The Purpose

(6,4,3)

(7,4,2)

(5,5,2)

(6,5,1)

(7,5,2)

(8,6,3)

(9,7,4)(7,3,3)

(4,6,3)

(3,7,4)

(2,8,5)(1,9,6)

(7,6,0)

(9,1,5)

(8,2,4)

(8,2,4)

Src

Dst (6,6,3)

(9,7,4)

f1f2

f7f5

f4f6

f3

Route a packet in a virtual face closest to the destination virtual face


0, if overlap.

- 1, otherwise.c b

(f1, f2) ( (f1, f2), (f1, f2))ang raddist dist dist

2 1

1

, if overlap.

, otherwise.

r r

r

The Idea

(f3, f6) (f2, f6)dist dist(f3, f6) (f2, f6)dist dist

f1

f2f7 f3f6

f4f5

[ , )8 4

[0,2 )

[0, )8

5[ , )

3 12

3[ , )

4

3 19[ , )

8 48

[ , )96 48

angdist

raddist

(f5, f7) 0angdist

(f5, f6) 13 96angdist

(f2, f7) 18 8angdist

(f5, f4) (f7, f4)ang angdist dist

(f5, f7) 2 1raddist (f5, f6) 2raddist (f5, f4) (f7, f4)rad raddist dist

(f1, f2) ( (f1, f2), (f1, f2))rad angdist dist dist

f1

f2 f3

f6

f4f5

Dst

Src

DstSrc


Delivery Guarantee

It suffices to show for each virtual face, there exists a neighboring virtual face closer to the destination virtual face.

f1

f2f7 f3f6

f4f5f5Src f4 Dst

(f7,f4) (f5,f4)ang angdist dist

(f7,f4) (f5,f4)rad raddist dist

Dstf1





Src

Dst

0, if overlap.

- 1, otherwise.angdistc b

1 2(([ , ), ), ([ , ), )) ( , )ang raddist a b r c d r dist dist

2 1

1

, if overlap.

, otherwise.rad

r rdist

r


VCap + VirtualFace

X

(6,4,3)

(7,4,2)

(5,5,2)

(6,5,1)

(7,5,2)

(8,6,3)

(9,7,4)

(6,6,3)

(7,3,3)

(4,6,3)

(3,7,4)

(2,8,5)(1,9,6)

(0,10,7)

(7,6,0)

(9,1,5)

(8,2,4)

(8,2,4)

(8,3,4)

(8,4,4)

(8,6,3)

(9,7,4)

(10,8,5)(8,6,3)

(9,7,4)

YZ

))2,0[,0( ))

8,0[,1(

)),4

3[,1(

))12

5,

3[,1(

))48

19,

8

3[,2(

))48

,96

[,2(

(10,0,6)

))4

,8

[,1(

(8,3,4)

VCapVirtualFace

Src

Dst






Conclusion

Outline



Assumptions

- The network was static.

- The transmission range of a node was a circle of radius 1.

- Network behavior were not taken into consideration.

Setup

- Network size: 25*25

- Network density: 10, 15, 20, 25, 30

- Node Failure : 0%, 10%

Empirical data were obtained by averaging data of 1000 source-destination pairs from 100 networks.


Packet Delivery Rate


Routing Path Length


Number of Next Hop Neighbors


Load Imbalance Factor


Number of Broadcasts


Packet Delivery Rate in Networks with Node Failure


Conclusion

We proposed the VirtualFace algorithm to guarantee packet delivery of virtual-coordinate-based routing protocols in wireless sensor networks.

After augmented with the VirtualFace algorithm, virtual-coordinate-based routing protocols GLIDER, Hop ID, GLDR, and VCap each

- guarantee packet delivery

- improve load balance

- enhance fault tolerance

- suffer from longer routing paths

- decrease routing flexibility

- require larger coordinate assignment costs

As compared to ABVCap, after augmented with the VirtualFace algorithm,- Hop ID, GLDR, and VCap each have a shorter routing path

- GLIDER, Hop ID, GLDR, and VCap each have a higher packet delivery rate in networks with node failure

VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate- Based Routing in...

Documents

Transcript of VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate- Based Routing in...