近年來發展了許多基於位置資訊服務相關的路由協定，此種路由協定被証明在隨意式無線網路中對於封包的路由效率及延展性有很大的幫助。欲利用位置資訊服務來幫助路由，需要各個節點都能夠獲得與之通訊節點的位置。而此類任務通常藉由某種位置資訊服務來完成。在本文中，我們提出了一種附帶了位置資訊服務的新路由策略，稱為HCR (Hierarchical Cell-Structured Routing)。HCR將網路範圍分割成許多相同面積的小區域，稱作Cell。而網路中的節點組成了一種階層式的架構，並且利用某幾個選定的Cell來forward封包。這種階層式的架構讓HCR特別適合在高密度的網路中運作。而且，在HCR中的traffic loads會由所有的網路節點來分擔而不是只經由特定幾個網路節點來負擔，也因此在high traffic loads的情況下能夠達到減少overhead的目的。我們的模擬結果指出了HCR與LAR (Location-Aid Routing) 相比在封包抵達率、end-to-end delay以及overhead上有較好的表現。

Many location-based routing protocols have been developed recently, and have been demonstrated to be scalable and efficient for packet routing in mobile ad hoc networks. Using location-based routing requires that a node obtains the node position with which it wants to communicate. This task is generally achieved by a location service. This work presents a novel routing protocol, called Hierarchical Cell-Structured Routing (HCR) Scheme, with a location service. The network area is divided into a number of regular triangular regions, called cells. The nodes forward the packets by some chosen cells, and are classified to be three level hierarchical structures. The hierarchical approach of HCR makes it especially suitable for high network density. Moreover, the traffic loads in HCR are shared by all nodes rather than just by some specific nodes, thus the overhead is reduced at high traffic loads. Simulation results indicate that HCR has better performance than Location-Aid Routing (LAR), in terms of packet delivery ratio, end-to-end delay and overhead in high traffic load.

中文摘要........................................................................................................................ I
Abstract ......................................................................................................................... II
目錄.......................................................................................................................... III
圖目錄........................................................................................................................... V
表目錄........................................................................................................................ VII
字母縮寫對照表....................................................................................................... VIII
第一章導論................................................................................................................ 1
1.1 簡介............................................................................................................ 1
1.1.1 無線網路的兩種通訊模式............................................................ 3
1.1.2 IEEE802.11 定義的兩種無線網路架構 ....................................... 6
1.2 研究之相關背景........................................................................................ 8
1.2.1 表格驅動式（Table-Driven）演算法 ........................................ 11
1.2.2 需求式（On-Demand）演算法 .................................................. 12
1.2.3 混和式（Hybrid）演算法 .......................................................... 13
1.2.4 地理位置 (Location-Based) 演算法.......................................... 13
1.3 隨意無線網路架構.................................................................................. 14
1.4 論文架構.................................................................................................. 14
第二章背景及相關研究.......................................................................................... 15
2.1 AODV-即時型(re-active)的演算法 ........................................................ 16
2.2 DSDV-回饋型(Pro-active)的演算法 ....................................................... 17
2.3 地理資訊型的演算法.............................................................................. 18
2.4 節點位址服務 (Location Service) .......................................................... 18
2.4.1 LAR (Location-Aided Routing) ................................................... 19
IV
2.4.2 DREAM (A Distance Routing Effect Algorithm of Mobility) .... 21
2.4.3 GRID ............................................................................................ 22
2.4.4 GLS (Grid Location Service) ....................................................... 22
2.4.5 HLS (Hierarchical Location Service) .......................................... 23
第三章 Hirearchical Cell-Structured Routing (HCR) Scheme ................................. 24
3.1 HCR ......................................................................................................... 24
3.1.1 網路架構...................................................................................... 24
3.2.2 名詞釋義...................................................................................... 26
3.2 網路範圍的切割...................................................................................... 27
3.3 細胞內領導者的選取.............................................................................. 29
3.4 HCR 之路由演算法 ................................................................................ 31
3.4.1 HCR 之路徑搜尋機制 (Route Discovery) ................................. 31
3.4.2 HCR 之路徑維護 (Route Maintenance) .................................... 34
第四章模擬結果與討論.......................................................................................... 38
4.1 模擬環境假設.......................................................................................... 38
4.2 模擬環境參數設定.................................................................................. 39
4.3 模擬工具介紹.......................................................................................... 40
4.4 模擬結果與分析...................................................................................... 44
4.4.1 不同資料流量下對效能之影響.................................................. 44
第五章結論.............................................................................................................. 50
參考文獻...................................................................................................................... 51

[1] J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, “Multi-hop wireless ad hoc network routing protocols,” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Oct. 1998, pp. 85-97.
[2] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, “A distance routing effect algorithm for mobility (DREAM),” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Aug. 1998, pp. 76-84.
[3] T. Camp, J. Boleng, B. Williams, L. Wilcox, and W. Navidi, “Performance comparison of two location based routing protocols for ad hoc networks,” in Proc. IEEE INFOCOM, Jun. 2002, pp. 1678-1687.
[4] S. Choi and K.G. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Trans. Networking, vol. 8, pp. 44-59, Feb. 2000.
[5] X. Du and D. Wu, “Adaptive cell relay routing protocol for mobile ad hoc networks,” IEEE Trans. Vehicular Technology, vol.55, no.1, pp. 278-285, Jan. 2006.
[6] X. Du, D. Wu, W. Liu, and Y. Fang, “Multiclass routing and medium access control for heterogeneous mobile ad hoc networks,” IEEE Trans. Vehicular Technology, vol.55, no.1, pp. 270-277, Jan. 2006.
[7] Z. J. Haas and M.R. Pearlman, “The performance of query control schemes for the zone routing protocol,” IEEE/ACM Trans. Networking, pp. 427-438, 2001.
[8] T.-C. Huang, C.-K. Liao, and C.-R. Dow, “Zone-based hierarchical routing in two-tier backbone ad hoc networks,” in Proc. IEEE International Conference on Communications (ICC), Nov. 2004, pp. 650- 654.
[9] D. Johnson and D. Maltz, “Dynamic source routing (DSR) in ad hoc wireless networks,” in Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell, MA: Kluwer, 1996.
[10] Y. B. Ko and N. H. Vaidya, “Location-aided routing (LAR) in mobile ad hoc networks,” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Aug. 1998, pp. 66-75.
[11] B. Karp and H. T. Kung, “Greedy perimeter stateless routing for wireless networks (GPSR),” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Aug. 2000, pp. 243-254.
[12] W. Kieß, H. Fuessler, J. Widmer, and M. Mauve, "Hierarchical location service for mobile ad-hoc networks," ACM SIGMOBILE Mobile Computing and Communications, vol.8, pp. 47-58, Oct. 2004.
[13] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing,” in Proc. ACM SIGMOBILE International Conference on Mobile Computing and Networking, Aug. 2000, pp. 120-130.
[14] W.-H. Liao, J.-P. Sheu, and Y.-C. Tseng, “GRID: A fully location-aware routing protocol for mobile ad hoc networks.” Telecommunication Systems, vol.18, pp. 37-60, 2001.
[15] S. Nanda. and R.S. Gray, “Spatial multipath location aided ad hoc routing” in Proc. IEEE International Conference on Computer Communications and Networks (ICCCN), Oct. 2004, pp.544-.
[16] V. Park and M. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM, Apr. 1997, pp.1405-1413.
[17] G. Pei, M. Gerla, X. Hong, and C. Chiang, “A wireless hierarchical routing protocol with group mobility” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), Sep. 1999, pp. 1538-1542.
[18] G. Pei, M. Gerla, and T.-W. Chen, "Fisheye state routing (FSR): a routing scheme for ad hoc wireless networks," in Proc. IEEE International Conference on Communications (ICC), Jun. 2000, pp. 70-74.
[19] C. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM/SIGCOMM International Conference on Communications, Aug. 1994, pp. 232-244.
[20] C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[21] K. Xu, X. Hong, and M. Gerla, “An ad hoc network with mobile backbones,” in Proc. IEEE International Conference on Communications (ICC), Apr. 2002, pp. 3138-3143.
[22] X. Xiang, Z. Zhou, and X. Wang, “Robust and scalable geographic multicast protocol for mobile ad-hoc networks,” in Proc. IEEE INFOCOM, May 2007, pp. 2301-2305.
[23] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. [Online]. Available：http://www.isi.edu/nsnam/ns