1 / 39

Ming-Jer Tsai, Associate Professor Department of Computer Science National Tsing Hua University

VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor Networks. Ming-Jer Tsai, Associate Professor Department of Computer Science National Tsing Hua University Presenter: Shouling Ji. Wireless Sensor Network.

kostya
Télécharger la présentation

Ming-Jer Tsai, Associate Professor Department of Computer Science National Tsing Hua University

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. VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor Networks Ming-Jer Tsai, Associate Professor Department of Computer Science National Tsing Hua University Presenter: Shouling Ji

  2. Wireless Sensor Network

  3. 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

  4. (0,8,5) (2,7,4) (7,4,6) (3,6,4) (8,3,7) (1,7,4) (7,3,6) (2,6,3) (6,5,5) (3,5,3) (8,2,7) (2,8,3) (6,4,5) (4,4,3) (3,5,2) (5,4,4) (8,1,6) (3,7,2) (4,4,2) (5,3,3) (4,5,1) (7,1,5) (4,6,1) (8,0,6) (6,2,4) (5,5,1) (5,6,0) 1 1 4 4 2 3 4 2 3 1 3 2 2 4 1 2 3 3 1 VCap X 27 27 8 6 22 18 16 19 7 21 12 9 5 10 1 25 11 (4,4,3) (4,4,3) (4,4,3) 3 13 23 4 15 26 24 Y 20 20 2 Z 14 17 17

  5. VCap Routing Protocol (0,8,5) (2,7,4) (7,4,6) (3,6,4) (8,3,7) (1,7,4) (7,3,6) (2,6,3) (6,5,5) (3,5,3) (8,2,7) (2,8,3) (6,4,5) (4,4,3) (3,5,2) (5,4,4) (8,1,6) (3,7,2) (4,4,2) (5,3,3) (4,5,1) (7,1,5) (4,6,1) (8,0,6) (6,2,4) (5,5,1) (5,6,0) 27 8 6 22 18 16 19 7 21 12 9 5 10 Src 1 1 1 25 11 3 13 Dst 23 23 4 15 15 26 24 20 2 2 14 17 D(15,1)=sqrt(22), D(15,2)=sqrt(3), D(15,4)=sqrt(27), D(15,23)=sqrt(12),D(15,25)=sqrt(14). 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). D(15,2)=sqrt(3), D(15,15)=sqrt(0), D(15,23)=sqrt(12).

  6. Dead-End Problem of VCap Routing Protocol (0,8,5) (2,7,4) (7,4,6) (3,6,4) (8,3,7) (1,7,4) (7,3,6) (2,6,3) (6,5,5) (3,5,3) (8,2,7) (2,8,3) (6,4,5) (4,4,3) (3,5,2) (5,4,4) (8,1,6) (3,7,2) (4,4,2) (5,3,3) (4,5,1) (7,1,5) (4,6,1) (8,0,6) (6,2,4) (5,5,1) (5,6,0) 27 8 Dst 6 22 22 18 16 19 Src 7 21 21 21 12 9 5 10 1 25 11 3 13 23 4 15 26 24 20 2 14 17 D(22,8)=sqrt(2), D(22,11)=sqrt(5), D(22,12)=sqrt(2), D(22,16)=sqrt(5),D(22,21)=sqrt(2).

  7. Virtual-Coordinate-Based Routing Protocols Routing Protocol Delivery Guarantee Feature VCap (Infocom 2005) No Landmark-based, short path No Landmark-based, short path GLIDER (Infocom 2005) HopID (TMC 2007) No Landmark-based, short path No Landmark-based, short path GLDR (Infocom 2007) Yes MAP (Mobicom 2005) Axis-based, long path, need global topology ABVCap (Infocom 2007) Yes Axis-based, long path VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor Networks

  8. Outline • Virtual Face Construction Protocol • Virtual Face Naming Protocol • The VirtualFace Algorithm (VF) • Performance Evaluation • Conclusion

  9. The Purpose (6,6,3) (0,10,7) (3,7,4) X Dead-End Node (4,6,3) Src (7,7,4) (1,9,6) (2,8,5) (6,6,3) (7,7,4) (7,5,4) (6,4,3) (5,5,2) (8,2,4) (9,7,4) (6,6,3) (7,4,2) (9,1,5) (6,5,1) Y (7,3,3) (8,6,3) (10,0,6) (8,2,4) Z (7,6,0) (7,5,2) (8,6,3) Dst

  10. The Purpose (0,10,7) (3,7,4) X Dead-End Node (4,6,3) Src (7,7,4) (1,9,6) (2,8,5) (6,6,3) (7,7,4) (7,5,4) (6,4,3) (5,5,2) Progress Node (8,2,4) (7,4,2) (6,6,3) (9,7,4) (9,1,5) (6,5,1) Y (7,3,3) (8,6,3) (10,0,6) (8,2,4) Z (7,6,0) (7,5,2) (8,6,3) Dst

  11. The Idea 2 2 3 4 2 6 5 1 1 3 3 7 3 6 0 1 9 3 8 Head Node 2 7 2 9 4 1 1 8 3 2 3 Tail Node 8 7 2 4 8 5 6 3 5 4

  12. The Implementation (5) (4) Preprogrammed Node (3) (6) (0) (5) (1) (2) (1) 2 (3) (2) 3 (3) (5) (2) (4) (3) (6) 4 (4) (3) (4) (5) 1 (5) (4) Tail Node 5 6

  13. The Implementation (5) (4) 4 (3) (6) (0) (5) (1) 3 (2) (1) 5 (3) (2) (3) 2 (5) (2) (4) 6 (3) (6) (4) 1 (4) (3) (5) 7 (5) (4) 8 Tail Node

  14. Message Reduction (1) (5) (4) 4 (3) (6) (0) (5) (1) 3 (2) (1) (2) 5 (3) (2) (3) 2 (5) (2) (4) 6 (3) (6) (4) 1 (4) (3) (5) 7 (5) (4) 8 Tail Node

  15. Construction of Connected Dominating Set

  16. Message Reduction (2) (5) (4) (3) (6) (0) (5) (1) (1) (1) (3) (2) (2) (5) (2) (4) (3) (6) (4) (3) (3) (5) (5) (4)

  17. Generation of Triangle-Free Subnetwork

  18. Virtual Face Construction Protocol

  19. Outline Virtual Face Construction Protocol Virtual Face Naming Protocol The VirtualFace Algorithm (VF) VCap augmented with the VirtualFace algorithm (VCap+VF) Performance Evaluation Conclusion

  20. The Purpose (3,7,4) f4 (4,6,3) f6 (1,9,6) (2,8,5) (6,6,3) (6,4,3) (5,5,2) f1 f3 f2 (8,2,4) (7,4,2) (9,7,4) (9,1,5) (6,5,1) f5 (7,3,3) (8,6,3) f7 (9,7,4) (8,2,4) Src Dst (7,6,0) (7,5,2)

  21. The Idea f4 f6 f4 f6 f1 f2 f3 f1 f3 f2 f5 Dst Src f7 f5 f7

  22. The Idea f4 f6 f1 f7 f6 f1 f2 f3 f3 f2 f5 f4 f7 f5

  23. The Idea 2π 0 0 2π/8 2π/4 2π/8 f2 f6 f7 f2 f7 6π/12 3π/12 0 2π/8 f4 f4 4 f6 3 f6 5 2 f1 f1 f3 f2 f2 f3 6 1 f5 f7 7 f5 f7 8

  24. The Implementation v: f6.radius=1, f6.angle= v: f6.radius=1, f6.angle= n f4 v f6 u message content: n message content: m message content: fp=f1, f1.id, f1.angle, f1.radius fp=f1, f1.id, f1.angle, f1.radius fp=f4, f4.id, f4.angle, f4.radius f1.size=8, u.seq(f1)=2, f2.id, f6.id, f7.id f1.size=8, m.seq(f1)=1, f2.id, f7.id f4.size=4, n.seq(f1)=2, f6.id w u f1 f3 f2 w: f2.radius=1, f2.angle= w: f2.radius=1, f2.angle= f5 m f7

  25. Outline Virtual Face Construction Protocol Virtual Face Naming Protocol The VirtualFace Algorithm (VF) Performance Evaluation Conclusion

  26. The Purpose (3,7,4) f4 (4,6,3) f6 (1,9,6) (2,8,5) (6,6,3) Dst (5,5,2) (6,4,3) f1 f3 f2 (8,2,4) (7,4,2) (9,7,4) (6,5,1) (9,1,5) f5 (7,3,3) (8,6,3) Src f7 (9,7,4) (8,2,4) (7,6,0) (7,5,2) Route a packet in a virtual face closest to the destination virtual face

  27. The Idea vf1: (r1, [a, b)) vf2: (r2, [c, d)) f1 c-b+1 if [a,b)<[c,d) a-d+1 if [c,d)<[a,b) 0 otherwise f7 f2 f6 f3 |r1 – r2| if distang=0 r1 otherwise f4 f5 Dst Src dist(vf1,vf2)=(distang,distrad) vf1 is said to be closer to vf3 than vf2 if dist(vf1,vf3)<dist(vf2,vf3)

  28. Delivery Guarantee It suffices to show for each virtual face, there exists a neighboring virtual face closer to the destination virtual face. f1 f1 Dst Src f7 f2 f6 f3 f4 f4 f5 f5 Dst Src Dst

  29. VCap + VirtualFace VCapVirtualFace (3,7,4) (0,10,7) X (4,6,3) (2,8,5) (1,9,6) (6,6,3) (5,5,2) (6,4,3) (9,7,4) (8,2,4) (9,7,4) (7,4,2) (6,5,1) Dst (9,1,5) Y (8,6,3) (8,6,3) (10,8,5) (10,0,6) Src Z (7,3,3) (8,2,4) (7,6,0) (8,4,4) (9,7,4) (7,5,2) (8,3,4) (8,3,4) (8,6,3)

  30. Outline • Virtual Face Construction Protocol • Virtual Face Naming Protocol • The VirtualFace Algorithm (VF) • Performance Evaluation • Conclusion

  31. Performance Evaluation • 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.

  32. Packet Delivery Rate

  33. Routing Path Length

  34. Number of Next Hop Neighbors

  35. Load Imbalance Factor

  36. Number of Broadcasts

  37. Packet Delivery Rate in Networks with Node Failure

  38. Conclusion • We proposed the VirtualFace algorithm to guarantee packet delivery of virtual-coordinate-based routing protocols in wireless sensor networks. • After augmented withthe VirtualFace algorithm, virtual-coordinate-based routing protocolsGLIDER, 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 coordinateassignment costs • As compared to ABVCap, after augmented withthe 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

  39. Thanks!

More Related