在行動隨意網路上最主要的挑戰，就是去設計一個“能適應變化非常頻繁之網路環境的路徑協定”。我們知道在無線行動網路上，主要可分類為兩種主要的路由協定: 預建路徑資訊（Source Routing）和需求時才建立路徑資訊的路由協定（On-Demand）。另外作者[1]提出：使用位置資訊（經由全球衞星定位系統獲得）來幫助路徑的建立。
在本論文中，我們嚐試利用兩種方法來改善無線網路路由所可能產生的問題。（一）我們嚐試在AODV[1] 路由協定中，加入被動式的探測 從新導向/發掘的機制。透過可聽到路徑傳輸資訊的其他節點(overheard node)來防止路徑斷裂的發生。並同時可視路徑上節點移動的情形，選取更合適的裝置，有效的去縮減路徑的長度以完成接下來的傳輸工作。（二）我們嚐試利用全球衞星定位系統的特性，來解決在無線行動網路上的路由問題。像是在路徑尋找時的“廣播風暴”、“裝置電源問題”及“最佳化一步路徑的距離”、“頻道的重複利用”、“最佳的路徑”。根據802.11的規格書中，最佳的裝置省電方法就是進入睡眠狀態。在我們的路徑協定中，我們可以讓裝置在大部份的時間進入睡眠模式，直到裝置必需傳輸、接收或扮演代傳者的角色時去甦醒。最後，我們利用模擬程式來證明我們路徑協定所能提供在效能上的改進。

The key challenge in mobile ad-hoc network (MANET) is the design of routing protocol which adapting their behavior to frequency with rapid changes in the network. As we have known, there are two main kinds of routing protocols in MANET: proactive and reactive routing protocol; and in addition, authors [1] proposed to use location information provided by positioning devices such as global positioning systems (GPS) to assist routing. We wonder whether the assumption of all devices in the communication area have the GPS ability is reasonable; furthermore, a GPS-enabled device has its own limitation on working areas; for example, the GPS ability cannot work in the indoor environments.
In this paper, (1) we tried to addition the mechanism of probing routing redirection/discovery at routing protocol in AODV. Using overheard node avoid route breaking and select route batter than origin.(2)we tried to use the property of GPS to solve the routing problems in MANET, which like broadcast storm in the route discovery, device power saving and optimal one-hop destination, channel reuse rate, and optimal routing path. According to 802.11 specification, the best way to reach the goal of device power saving is putting device into the sleep mode. In this routing protocol, we let most mobile devices stay in the sleep mode until it sends or receives data or acts as an intermediate node to forward data. Last, we use simulations and implementation to validate the effectiveness of our design.

目錄
中文摘要………………………………………………………………………………1
英文摘要………....……......…………………………………………………………..2
第1章、導論 10
1.1 無線網路的架構 11
1.2 預建路徑資訊（Proactive）的路由協定 14
1.3 需求時才建立路徑資訊（Reactive）的路由協定 15
1.4 整合性(Hybrid)的路由協定 16
1.5 具地誌資訊(Geographic)的路由協定 17
第2章、動機與觀察 21
2.1 無網區域網路802.11的發展 21
2.2 需求時才建立路徑資訊(On-Demand)的路徑協定之發展 24
2.3 被動式自動重發請求協定 25
2.4 在無線網路一步傳輸的距離的選擇 27
2.5 較佳的一步傳送距離 28
2.6 座標資訊的利用 29
第3章、被動式探測的路由協定 31
3.1 在無線網路路徑選擇協定設計上的瓶頸 31
3.2 被動式探測的路由協定 32
3.3 範例 33
3.4 模擬結果及分析 35
3.5 討論 39
3.5.1 最短路徑的探討 39
3.5.2 提高我們的路由協定（主動探測） 39
3.5.3 引發的問題 40
第4章、具位置知覺的無線網路路由協定 43
4.1 系統假設: 43
4.2 初使化座標系 43
4.3 坐標資訊的維護 45
4.4 內部區域 46
4.4.1 具位置知覺的無線網路路由協定演算法 46
4.4.2 範例 48
4.5 區域之間 50
4.6 模擬測試及分析 51
第5章、結論後序工作 58
參考文獻 61

附錄一 Chun-Hung Richard Lin, Cing-Fong Lin, “Local-Aware Routing Protocol for Wireless Ad-Hoc Network System, Accept in Computer Networks and Mobile Computers Workshop, 2003 National Computer Symposium ( NCS2003)

附錄二 Chun-Hung Richard Lin, Cing-Fong Lin, “Passive Probing Routing Protocol in Wireless Ad-Hoc Network, Accept in Computer Networks and Mobile Computers Workshop, 2003 National Computer Symposium ( NCS2003)

圖目錄
圖表 1 Ad-Hoc無線網路的架構 11
圖表 2 BSS的架構 12
圖表 3 ESS的架構 13
圖表 4 預建路徑資訊的路由協定 14
圖表 5 需求時才建立路徑訊的路由協定 15
圖表 6 整合性的路由協定 16
圖表 7 LAR選擇性的氾流封包 17
圖表 8 GRID具位置資訊的路由協定 18
圖表 9 沒有位置資訊下使用位置資訊的路徑協定 19
圖表 10 AODV路徑協定 24
圖表 11 探測性的自動從發請求 26
圖表 12 一步距離對整個網路上路由的影響 27
圖表 13. 最佳化的一步距離 29
圖表 14 無線網路路徑中斷的範例 33
圖表 15 維護路徑封包的交換示意圖 35
圖表 16 網路中節密度不同對路徑中斷比率的影響 36
圖表 17 平均封包傳送的延遲時間 38
圖表 18 發生無效率路徑的情況 40
圖表 19 不可預期的路徑中斷 41
圖表 20 座標的計算 43
圖表 21 內部區域的路由 48
圖表 22 區域間路由協定 50
圖表 23 路由協定的廣播風爆 52
圖表 24 路徑搜尋封包 53
圖表 25 路由協定路徑選擇的比較 54
圖表 26 具位置知覺路由協定路徑選擇的方法 55
圖表 27 路徑總步數的比較 56
圖表 28 中間節點被參考的次數之比較 57

表目錄
表格 1 OH1所能聽到節點資訊表 34
表格 2 OH2所能聽到節點資訊表 34
表格 3網路中節密度不同對路徑中斷比率的影響 37
表格 4平均封包傳送的延遲時間 39
表格 5 Beacon info 45
表格 6 Member table 45
表格 7 路徑需求封包 46
表格 8 路徑需求封包 48
表格 9 Member table 49

[1] C.E. Perkins, E.M. Belding-Royer, and Samir Das. “Ad Hoc On Demand Distance Vector (AODV) Routing.”IETF Internet draft, draft-ietf-manet-aodv-12.txt, November 2002 (Work in Progress).
[2] C.E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance vector rouging (DSDV) for mobile computers”. Proceedings of ACM SIGCOMM’94, (1994), 234-244.
[3] C.E. Perkins and E.M. Royer. “Ad hoc On-Demand Distance Vector Routing.” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
[4] D.B. Johnson, and D. A. Maltz, “Dynamic Source Routing”, Mobile Computing, 1996.
[5] D.L. Lu and J.F. Chang, “Performance of ARQ protocols in nonindependent channel errors,” IEEE Trans. Commun., vol. COM-41, pp. 721–730, May 1993.
[6] E.M. Belding-Royer. “Report on the AODV Interop.” UCSB Tech Report 2002-18, June 2002
[7] G. Holland, N. Vaidya, and P. Bahl, “A Rate-Adaptive MAC Protocol For Multi-Hop Wireless Networks, ” In Proceedings of Mobicom 2001, Rome, Italy, 2001.
[8] H.S.Wang, “On verifying the first-order Markovian assumption for a Rayleigh fading channel model,” in Proc. ICUPC’94, pp. 160–164, San Diego, CA, Sep. 1994.
[9] M. Eyugoglu, C. Forney, P. Dong, and G. Long. “Advanced modulation techniques for v.fast.” In Eur. Trans. Telecommun., volume 4, pages 243-256. May-June 1993.
[10] M. Zorzi, R.R. Rao, “Energy constrained error control for wireless channels,” in Proc. IEEE GLOBECOM'96, London (UK), Nov. 1996
[11] M. Zorzi, R.R. Rao, “Error Control and Energy Consumption in Communications for Nomadic Computing,” IEEE Trans. Computers (special issue on Mobile Computing), vol. 46, pp. 279–289, Mar. 1997.
[12] M. Zorzi, R.R. Rao, “Throughput analysis of ARQ Go-Back-N protocol in Markov channels with unreliable feedback,” in Proc. IEEE ICC’95, pp. 1232–37, Jun. 1995.
[13] M. Zorzi, R.R. Rao, “Throughput analysis of ARQ Selective-Repeat protocol with time diversity in Markov channels,” in Proc. IEEE GLOBECOM’95, pp. 1673–67, Nov. 1995.
[14] S. –Y. Ni, Y. –C. Tseng, Y. –S. Chen, “The broadcast storm problem in a Mobile Ad Hoc network”, Proceedings of the MobiCom’99, (1999), 151-162
[15] Y.J. Cho and C.K. Un, “Performance analysis of ARQ error controls underMarkovian block error pattern,” IEEE Trans. Commun., vol. COM-42, pp. 2051–2061, Feb.-Apr. 1994.
[16] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance vector rouging (DSDV) for mobile computers”. Proceedings of ACM SIGCOMM’94, (1994), 234-244.
[17] David B.Johnson, and David A.Maltz, “Dynamic Source Routing”, Mobile Computing, 1996
[18] Elizabeth M.Royer, Charles E. Perkins, “Multicast operation of the Ad-hoc On-Demand Distance Vector Routing Protocol,” Mobicom ‘99 Seattle Washington USA.
[19] C-K Toh, “A novel distributed routing protocol to support ad-hoc mobile computing”, Proceedings of 15th IEEE Annual International Phoenix Conference on Computers and Communications, (1996), 480-486.
[20] R. Dube, C. D. Rais, K. –Y. Wang, and S. K, Tripathi, “Signal Stability Based adaptive routing (SSA) for AD-Hoc mobile networks”, IEEE Personal Communications (1997), 36-45.
[21] Jeffrey P. Monks, “A Power Controlled Multiple Access Protocol for Wireless Packet Network”, IEEE INFOCOM 2001, pp.219-228.
[22] Young-Bae Ko, and Nitin H.Vaidya, “Location-Aided Routing(LAR) in Mobile Ad Hoc Networks”, MobiCom’98, 1998. (Full paper).
[23] Wen-Hwa Liao, Yu-Chee Tseng, and Jang-Ping Sheu, “GRID:A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks”.
[24] Priscilla Chen, Bob O’Dea, Ed Callaway, “Energy Efficient System Design with Optimum Transmission Range for Wireless Ad Hoc Network”, IEEE 2002, pp.945-952.
[25] J. Gomez-Castellanos, A. T. Campbell, M. Naghshineh, C. Bisdikian “PARO: Suporting Transmission Power Control for Routing in Wireless Ad Hoc Networks,” ACM journal, under review.
[26] X. Lin and I. Stojmenovic. “GEDIR: Loop-Free Location Based Routing in Wireless Network”. In proc. IASTED Int. Conf. on Parallel and D9stributed Computing and System(to appear), 1999.
[27] Z. Hass and M. Pearlman. “The Zone Routing Protocol for Highly Reconfigurable Ad Hoc Network.” In Proceedings of ACM SIGCOMM ’98, August 1998.
[28] B. Karp and H. Kung. “Greedy Perimeter Stateless Routing”. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), 2000.
[29] Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia, “Routing with Guaranteed Delivery in Ad-Hoc Wireless Networks,” ACM Wireless Networks, November 2001.
[30] Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia. “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks”, In Wireless Networks, Vol. 7, pages 609– 616, 2001. citeseer.nj.nec.com/bose00routing.html
[31] J. Gao, L. J. Guibas, J. Hershburger, L. Zhang, A. Zhu, “Geometric Spanner for Routing in Mobile Networks ”, In Proceedings of the 2nd ACM ”, In Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001), pages 45–55, October 2001.
[32] Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, and Robert Morris, “A Scalable Location Service for Geographic Ad Hoc Routing”, ACM Mobicom 2000.
[33] Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker, Lon Stoica, “Gergraphic Routing Without Location Information”, MobiCom ’03 Sep
[34] J.J. Garcia-Luna-Aceves, M. Spohn, “Efficient routing in packet-radio networks using link-state information,” 1999 IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1308-1312, 1999.
[35] T.-C. Hou, T.-J. Tsai, “Adaptive clustering in a hierarchical ad hoc network,” ICS Proceedings of the Workshop on Computer Networks, Internet, and Multimedia, Dec, 1998.
[36] D.A. Maltz, J. Broch, J. Jetcheva, D.B. Johnson, “The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 17 Issue: 8, pp. 1439-1453, Aug. 1999.
[37] S. Bandyopadhyay, K. Paul, “Evaluating the performance of mobile agent-based message communication among mobile hosts in large ad hoc wireless network,” Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, August 1999.
[38] A. Boukerche, “A performance comparison of routing protocols for ad hoc networks,” Proceedings of the 15th International Parallel and Distributed Processing Symposium, pp. 1940-1946, 2001.
[39] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” The fourth annual ACM/IEEE international conference on Mobile computing and networking, October 1998.
[40] E.M. Royer, C.-K. Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Personal Communications, vol. 6 Issue: 2, pp. 46-55, April 1999.
[41] D. Samir R., R. Castañeda, J. Yan, “Simulation-based performance evaluation of routing protocols for mobile ad hoc networks,” Mobile Networks and Applications, vol. 5 Issue 3, September 2000.