1. 後卓越計畫進度報告 (2007/6/4) 中央大學 許健平教授 淡江大學 張志勇教授

2. Routing with Hexagonal Virtual Coordinate in Wireless Sensor Networks

3. 3 Introduction Our goal:  To create a virtual coordinate system and give load-balancing routing protocol  In addition, forwarding a packet across holes and the routing path generated as short as possible

4. 4 Introduction (cont.) Hole Sink G B C D E F P Q H I J K A Hole T4T4 T3T3 T2T2 T1T1 Auxiliary Routing Path (ARP) S→T1→T2→T3→T4→D Hole Sink Hexagonal Virtual Coordinate HVC Chart

5. 5 HVC construction protocol 1 Sink Second landmark 3 4 5 7 6 8 With Max. ID within two-hop neighborhoodTo choice the Max. ID in this ring-shaped area to be the second landmark Local flooding within the R’th hop 2 R hops

6. 6 HVC construction example Hole Sink

7. 7 Construct the HVC chart Hole Sink P A B C D E Q F G J I H

8. 8 HVC Routing Protocol Hole T4T4 T3T3 T2T2 T1T1 Find a shortest path in HVC chart from source node to a landmark nearest to the destination node to be the Auxiliary Routing Path (ARP)  Dijkstra’s algorithm ARP S→T 1 →T 2 →T 3 →T 4 →D

9. 9 HVC Routing Protocol - Example D S T1T1 T2T2 T3T3 T5T5 T4T4