隨意型無線網路的繞送協定可分為兩大類別。第一類為繞送表導向(Table-driven)繞送法，因其隨時需要傳送大量的繞送資訊，故較適合小範圍的網路。第二種方式為需求導向(On-Demand)繞送法，其作法為僅記錄需要的路徑來減少繞送資訊的大量傳送，但建立路徑時則容易產生氾濫（Flooding）的問題。本篇論文主要探討GPS之應用於隨意型無線網路繞送（Ad Hoc Routing），吾人將網路切割成大小相同灰白相間的區域，區域內部採用繞送表導向方式通訊，區域之間則經由灰色區域之閘道節點採需求導向的方式通訊。本方法將有效地減少在網路中傳播的控制封包數目，以提昇網路之效能。

The routing protocols for Ad Hoc wireless networks can be classified into two major categories. The first one is “Table-driven” routing protocol. Due to exchanging the routing information periodically, it is suitable for small scale’s networks. The second one is “On-demand” routing protocols. It has the advantage that only the needed information for routing is recorded. However, it may have the “Flooding problem”. In this paper, we proposed an efficient GPS aided routing protocol for Ad Hoc wireless networks. Through GPS, the network area is first partitioned into a finite numbers of non-overlapped equal-size square districts with gray and white ones interlaced each other. Next, a mobile host will be select as the gateway for each district. Then, the communication inside the district is using the Table-driven method and the communication between different districts is utilizing the On-demand protocol through the gateway hosts in gray districts. Our approach can be reduce the number of control packets quite well and promote the network efficiency.

摘要V
ABSTRACTVI
誌 謝VII
目 錄VIII
圖目錄X
一、 研究動機1
1.1 緣起1
1.2 研究目的2
1.3 研究的方法與步驟3
1.3.1區域的切割大小3
1.3.2系統架構3
1.3.3路徑的建構4
1.3.4 路徑的維護4
1.4 預期貢獻4
二、 相關研究5
2.1 繞送表導向繞送協定5
2.1.1 DSDV5
2.1.2 CGSR6
2.2需求導向繞送協定7
2.2.1 AODV7
2.2.2 DSR8
2.3 平面式（FLAT）VS.階層式繞送法9
2.3.1 地域繞送協定（Zone Routing Protocol）9
2.4 應用GPS的相關研究10
2.4.1 ZHLS10
2.4.2 LAR12
2.4.3 DBR [1]13
2.4.4 GRID[2]14
三、 研究的方法與步驟17
3.1 區域的切割大小分析17
3.2 系統架構20
3.3 路徑的建構21
3.3.1 路徑要求程序22
3.3.2 路徑回覆程序23
3.4 路徑的維護23
3.4.1 閘道主機的維護24
3.4.2 行動主機移動對路徑的影響25
四、 系統模擬28
4.1 模擬環境與方法28
4.2 效能分析29
4.2.1模擬結果30
4.2.2 數據比較32
五、 結論與未來展望35
參考文獻36

[1] Ying-Kwei Ho, Ru-Sheng Liu, Tsunchen Lin, and Chiu-Wei Chen , “Dichotomy-Based Routing Protocol for Mobile Ad Hoc Networks”.
[2] Wen-Hwa Liao, Yu-Chee Tseng, and Jang-Ping Sheu, “GRID:A Fully Location-Awared Routing Protocol for Mobile Ad Hoc Networks”, Proceedings The 6th Mobile computing Workshop, 2000.
[3] Young-Bae and Nitin H.Vaidya, “Location-Aided Routing(LAR) in Mobile Ad Hoc Networks”,MOBICOM 98 Dallas Texas USA,ACM 1998 .
[4] Zygmunt J. Haas and Marc R. Peariman,“ Performance of A New Routing Protocol for The Reconfigurable Wireless Networks”, ICC98 Conference Record 1998 IEEE Conference on. P 156-160”.
[5] Mario Joa-Na,I-Tai Lu. “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks” IEEE Journal on Selected Areas in Communications, Aug 1999. p 1415-1424
[6] ELIZABETH M.ROYER, SANTA BARBARA CHAI-KEONG TOH “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks” IEEE Personal Communication, April, 1999, p 46-55
[7] Marc R. Pearlman, Zygmunt J. Haas,” Determining the Optimal Configuration for the Zone Routing Protocol”, IEEE Journal on Selected Areas in Communications, Aug 1999. p 1395-1414.
[8] Young-Bae Ko and Nitin H. Vaidya “USING LOCATION INFORMATION IN WIRELESS AD HOC NETWORKS”1999 IEEE
[9] Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk “GEOGRAPHIC MESSAGING IN WIRELESS AD HOC NETWORKS”1999 IEEE
[10] Charles E. Perkins and Pravin Bhagwat “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”1994 ACM.
[11] Sung-Ju Lee, Mario Gerla and Chai-Keong Toh “A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks” 1999 IEEE.
[12] Charles E. Perkins, Elizabeth M. Royer, “Ad-hoc On-Demand Distance Vector Routing”, WMCSA’99 Second IEEE Workshop on, 1999 p 90-100
[13] David B. Johnson,David A.Maltz “Dynamic Source Routing in Ad Hoc Wireless Networks” 1996.
[14] Sze-Yao Ni et al. “The Broadcast Storm Problem in a Mobile Ad Hoc Networks,” The fifth annual ACM/IEEE international conference on mobile computing and networking,1999.