在無線感測器網路中，以虛擬座標為基底的路由協定已經被廣泛討論，但是這些以虛擬座標為基底的路由協定大部分不保證完全傳輸， 但許多應用都需要路由協定具備傳輸保證以符合實際需求。因此，本篇論文將提出一個通用的演算法來解決大部分以虛擬座標為基底但不保證完全傳輸的路由協定所遇到傳輸失敗的問題， 並且保證完全傳輸。本論文提出一個虛擬面建造協定，以及虛擬面命名協定，可以提供封包路由的資訊，將封包指引到正確的方向，以避免陷入區域最小值。本論文還提出一個路由的架構可以支援這些以虛擬座標為基底但不保證完全傳輸的的路由協定，使得保證傳輸。根據實驗結果顯示， 套用本論文提出之演算法的以虛擬座標為基底且不保證完全傳輸之路由協定比起已被提出之以虛擬座標為基底且保證傳輸的路由協定有更好的傳輸效能。

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 dened 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.

[1] B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in IEEE/ACM MOBICOM, 2000.
[2] H. Frey and I. Stojmenovic, "On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks," in IEEE/ACM MOBICOM, 2006.
[3] M. J. Tsai, H. Y. Yang, and W. Q. Huang, "Axis based virtual coordinate assignment protocol and delivery guaranteed routing protocol in wireless sensor networks," in IEEE INFOCOM, 2007.
[4] J. Bruck, J. Gao, and A. Jiang, "MAP: medial axis based geometric routing in sensor networks," in IEEE/ACM MOBICOM, 2005.
[5] A. Caruso, S. Chessa, S. De, and A. Urpi, "GPS free coordinate assignment and routing in wireless sensor networks," in IEEE INFOCOM, 2005.
[6] Y. Zhao, Y. Chen, B. Li, Q. Zhang, "Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks," in IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007.
[7] A. Nguyen, N. Milosavljevic, Q. Fang, J. Gao, and L. J. Guibas, "Landmark selection and greedy landmark-descent routing for sensor networks," in IEEE INFOCOM, 2007.
[8] Y. TSENG, S. NI, Y. CHEN, J. SHEU, "The Broadcast Storm Problem in a Mobile Ad Hoc Network," in Wireless Networks, 2002.
[9] J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanners for routing in mobile networks," IEEE Journal on Selected Areas in Commnications, vol. 23, pp. 174V185, 2005.
[10] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing: of theory and practice," In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, pages 63V72, 2003.
[11] F. Dai, J. Wu, "An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks," IEEE TPDS, 2004.
[12] J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris, "A scalable location service for geographic ad-hoc routing," in IEEE/ACM MOBICOM, 2000, pp. 120V130.
[13] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "GHT: a geographic hash table for data-centric storage," in ACM WSNA, 2002, pp. 78V87.