Ad Hoc網路是由許多可移動式的通信設備 (mobile host)，在無線網路的架構下所結合成的傳輸網路，但是其卻不需使用其他任何的傳輸通信設備的支援 (如：基地台)，而可以直接利用無線網路來做資訊的傳送。
但由於各個主機快速移動的特性，每台主機可任意加入或是離去，因此Ad Hoc網路所產生的拓僕架構(topology) 將有較高的機率，發生資料封包傳輸的遺失 (packets loss) 或是傳送的遲緩 (delay)，以及造成網路壅塞的情形，因而導致不必要的重傳和流量的流失。
我們會將在Ad Hoc網路下，一些相關的建立路徑之協定做概略的說明以及可能遇到的問題，並且敘述相關的研究如何去解決降低問題的發生。
接著，我們將提出一個新的架構協定 (Partition-Timing Routing Protocol，PTR)，此協定可以適時的調整其涵蓋範圍 (Core) 的鄰近節點的資料，以選擇出的某一節點為其核心點 (Core Node)，在此涵蓋範圍內的節點若需傳送資料到其他範圍內的節點，則必須透過核心點的管理。此外，每個涵蓋範圍所調整更新其資料訊息的時間，也會各有不同，而並非以往其他方式一樣，所有的資料更新時間都在同一時候，以降低整個網路的負擔，以及能更有可變化性，和能增加各個範圍內的更新率以達到資料傳輸的成功率。
模擬結果將可以顯示出其傳輸負擔以及資料傳輸成功率將會比以往其他方法來得較為優異。

Ad Hoc Networks are transmission networks on the structure of wireless networks by consisting of many mobile hosts. But it is no need to use any support by other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission.
Because the feature of per host as fast movement, every host can join or go away as it likes, thus, the topology appeared from Ad Hoc networks will have higher probability to make packet loss or transmission delay and cause network flooded to do unnecessary re-send and lose the flow of running data.
We will explain generally some relative protocols of setting up routes and possible problems. Besides, describe relative researches of how to solve and reduce the possibility of problem happened.
Then, we will bring up a new constructive protocol (Partition-Timing Routing Protocol，PTR), the protocol can adjust neighboring nodes of covered scope to select certain node to be own core node, if any covered node needs to transmit data to others outside the scope, it has to be managed by core node.
Besides, the timing for update and adjust data of per covered scope is different too and not as same as other ways which update timing is at the same time to reduce the load of the entirely network and more changeable.
Furthermore, it may increase the rate of update of per scope to get the target of succeeding data-transmission.
The simulation results will appear that the load and possibility of data transmission has more advantages than other ways.

中文摘要 …………………………………………………………………………… i
Abstract …………………………………………………………………………… ii
Chapter 1 ： Introduction …………………………………………………… 1
Chapter 2 ： Route Strategy ………………………………………………… 3
2-1： Proactive Protocols ……………………………………………… 3
2-1-a ： Distance Vector (DV) ……………………………………… 4
2-1-b ： Link State (LS) …………………………………………… 5
2-2 ：Reactive Protocols ……………………………………………… 6
Chapter 3 ： Related Research ……………………………………………… 7
3-1 ： Destination-Sequenced Distance Vector Protocol (DSDV)… 7
3-2 ： The Ad Hoc On-Demand Distance-Vector Protocol (AODV) … 9
3-2-a ： Route Request (RREQs) …………………………………… 9
3-2-b ：“fresh enough” route …………………………………… 10
3-2-c ： Route Reply (RREPs) ……………………………………… 10
3-2-d ： Route Error (RERRs) ……………………………………… 11
3-2-e ： “hello” Message ………………………………………… 11
3-3 ： Dynamic Source Routing (DSR) ……………………………… 13
3-3-a ： Route Discovery …………………………………………… 13
3-3-b ： Route Maintenance ………………………………………… 14
3-3-c ： The advantage/disadvantage of AODV, DSR …………… 16
3-4 ： Fisheye State Routing (FSR) ………………………………… 18
3-5 ： Zone Routing Protocol (ZRP) ………………………………… 20
3-5-a ： Routing Zone and hops …………………………………… 20
3-5-b ： Intrazone Routing Protocol (IARP) ……………………… 21
3-5-c ： IntErzone Routing Protocol (IERP) ……………………… 21
Chapter 4：Partition Timing Routing Protocol …………………………… 24
4-1 ：Research Motivation ……………………………………………… 24
4-2 ：The Benefit of PTR ……………………………………………… 25
4-3 ：Weight’s Computing ……………………………………………… 26
4-4 ：Choose core node and Set each core ………………………… 26
4-5 ：Data Structure …………………………………………………… 31
4-6 ：Partition Timing …………………………………………………… 31
4-7 ：Node join or leave ………………………………………………… 35
4-8 ：Packet transmitting ……………………………………………… 37
Chapter 5 ： Performance Evaluation ………………………………………… 39
5-1 ：Simulation Environment ………………………………………… 39
5-2 ：Simulation Results and Discussion …………………………… 39
Chapter 6 ： Conclusions ……………………………………………………… 45
References ………………………………………………………………………… 46

[1] S.-J. Lee, C.-K. Toh, Mario Gerla, “Performance Evaluation of Table-Driven and On-Demand Ad Hoc Routing Protocols,” Proc. IEEE PIMRC, September 1999, pp.297-301.

[2] S. Ramanathan, M. Streenstrup, “A Survey of Routing Techniques for Mobile Communication Networks,” ACM/Baltzer Mobile Networks and Applications, special issue on Routing in Mobile Communications Networks, Vol.1, no.2, October 1996, pp.89-104.

[3] Jyoti Raju, J.J. Garcia-Luna-Aceves, “A Comparison of On-Demand and Table Driven Routing for Ad-Hoc Wireless Networks,” IEEE International Conference on Communications, Vol. 3, 2000, pp.1702-1706.

[4] Charles E. Perkins, Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Computer Communications Rev., October 1994, pp.234-244.

[5] S.Murthy, J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Baltzer Mobile Networks and Applications special issue on Routing in Mobile Communications Networks, Vol.1, no.2, October 1996, pp.183-197.

[6] T.-W. Chen, Mario Gerla, “Global State Routing：A New Routing Scheme for Ad hoc Wireless Networks,” Proceedings of the IEEE International Conference on Communications(ICC), Atlanta, GA, June 1998, pp.171-175.

[7] Guangyu Pei, Mario Gerla, Tsu-Wei Chen. “Fisheye State Routing：A Routing Scheme for Ad Hoc Wireless Networks”, IEEE International Conference on Communications, Vol.1, 2000, pp.70-74.

[8] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot, “Optimized Link State Routing Protocol for Ad Hoc Networks,” Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International , 2001, pp.62-68.

[9] Guangyu Pei, Mario Gerla, Xiaoyan Hong, “LANMAR：Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility,” First Annual Workshop on Mobile and Ad Hoc Networking and Computing, 2000, [see also Global Telecommunications Conference], pp.11-18.

[10] Charles E. Perkins, Elizabeth M. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, February 1999, pp.90-100.

[11] D.B. Johnson, D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, Mobile Computing , T. Imielinski and H. Korth, Eds., Kluwer, 1996, pp.153-181

[12] V. D. Park, M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” In Proceedings, IEEE INFOCOM, April 1997.

[13] C.-K,Toh, “Associativity-Based Routing for Ad Hoc Mobile Networks,” Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing System, Kluwer Academic Publishers, Vol. 4, no. 2, March 1997, pp.103-139.

[14] Rohit Dube, Cynthia D. Rais, Kuang-Yeh Wang, Satish K. Tripathi, “Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks,” IEEE Personal Communications [see also IEEE Wireless Communications], Vol.4, no. 1, Febury 1997, pp.36-45.

[15] Samir R. Das, Charles E. Perkins, Elizabeth M. Royer, “Performance Comparison of two On-Demand Routing Protocols for Ad Hoc Networks,” INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE , Vol.1, March 2000, pp.3-12.

[16] Zygmunt J. Hass, Marc R. Pearlman. “The Performance of Query Control Schemes for the Zone Routing Protocol,” IEEE/ACM Transactions on Networking, Vol. 9, no.4, August 2001, pp.427-438.

[17] Xiaoyan Hong, Kaixin Xu, Mario Gerla. “Scalable Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network , Vol. 6, no. 4, July ~ August 2002, pp.11-21.

[18] Elizabeth M. Royer, Santa Barbara, Chai-Keong Toh. “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Communications [see also IEEE Wireless Communications], Vol.6, no.2, April 1999, pp.46-55.

[19] R.Bagrodia, R.Meyer, M.Takai, Y.Chen, X.Zeng, J. Martin, and H.Y. Song, “ PARSEC：A Parallel Simulation Environment for Complex Systems,” IEEE Computer, Vol.31, no.10, October 1998, pp.77-85.

[20] M.Takai, L. Bajaj, R.Ahuja, R. Bagrodia, Mario Gerla, “GloMoSim：A Scalable Network Simulation Environment,” Techical report 990027, UCLA, Computer Science Department, 1999.