Virtual Face: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing in Wireless Sensor Networks
碩士 === 國立清華大學 === 資訊工程學系 === 96 === We study the problem of packet delivery for virtual-coordinate-based routing in the wireless sensor networks. Most of the virtual-coordinate-based routing protocols do not provide guaranteed packet delivery, and this is an important issue for many applications now...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08786449174633474250 |
| Summary: | 碩士 === 國立清華大學 === 資訊工程學系 === 96 === We study the problem of packet delivery for virtual-coordinate-based routing in the wireless sensor networks. Most of the virtual-coordinate-based routing protocols do
not provide guaranteed packet delivery, and this is an important issue for many applications nowadays. We present a virtual face construction method called VFCP and introduce a virtual face naming rule called VFNP to preserve some information that can guide the packet to a direction with big chance to greedy route to the destination if the packet trapped into a local minimum. We propose a routing scheme called VFTP to support those virtual-coordinate-based routing protocols that can not provide guaranteed packet delivery. Virtual-coordinate-based routing protocols with well dened virtual distance can guarantee packet delivery if using VFTP as the backup. The simulation shows many virtual-coordinate-based routing protocols combining with VFTP have better performance than most of the virtual-coordinate-based and delivery guaranteed routing protocols.
|
|---|