”數位台灣策略”強調發展寬頻到家所需的基礎設施，積極扶持新興且具高潛力的數位產業。台灣目前上網人數已超過500萬戶，其中寬頻用戶亦高達95%，這麼多的寬頻用戶，願意花費更高的費用，無非希望擁有更高速的遨遊網際網路(internet)的暢快感覺。為提升上網人口數與減輕負擔，加速資訊流通，提供一個低資費或免費的上網環境是很多人的期望。隨意無線網路(Wireless Ad Hoc Network)將有一個低資費或免費的上網的環境，但因為隨意無線網路設計每一節點均可充當路由器使用，當多個訊務同時經過某一共同節點時，可能造成嚴重延遲、封包遺失等缺失，網路效能低，將使隨意無線網路之存在面臨挑戰。
在本文中，將提出一個使應用於VOIP(Voice Over Internet Protocol, VOIP)的隨意無線網路之網路效能提升的方法，利用資料流整形(traffic shaper)的機制，以權杖儲存桶(token bucket)演算法來對資料傳送端或共同路由器所傳送之資料流量做整形，藉由資料流量大小的最佳化調整，適當的分配網路之最大頻寬。在隨意無線網路上以隨選距離向量路由法( Ad Hoc On-Demand Distance Vector Routing, AODV)產生路徑建立過程中，利用路由的replay封包送回資料來源端時，計算每一個節點所處理之總服務路徑數(Total Service Paths, TSP)，並在路由變動的同時對外廣播，當節點收到此資訊時即檢出該總服務路徑數，做好隨時自動的機動調整資料傳送端之資料流量控制。
本文的最終目的是提供使用者一個最小的保證頻寬，提高網路效能，提升網路總頻寬的利用率，縮短資料傳送之延遲(delay)時間，減少封包遺失量(packet loss)，使資料傳輸的抖動率(jitter)降低，資料傳輸的總吞吐量(throughput)適當穩定。

“E-Taiwan Program” is actively used to promote information and communication infrastructure development as well as network security. The objective is to establish a comprehensive network of wired, wireless, mobile and fixed broadband Internet networks. In Taiwan, the number of Internet hosts has exceeded 5 million so far and 95% of them have broadband Internet access. The subscribers definitely desire to exchange information taking place at very high speed even though it costs higher expense. To reach a 100% penetration rate and data transmitting acceleration, it will be launched to cut down the charge at cheaper toll or for nothing to meet consumer’s demands. The Wireless Ad Hoc Network will be under an environment with either low-rate or free of charge in the near future; however, each node organized in the designed network can be recognized as a router. It may operate and result in dramatic delay, packet loss, and low effectiveness while several traffics simultaneously go through a certain node and run in the complex challenge.
In this paper, an effectiveness-improving approach will be addressed to apply to the Wireless Ad Hoc Network of the Voice Over Internet Protocol(VOIP). Using the traffic shaper and the algorithm of the token bucket, the output side of node or the data flow from the same routers is reformed by an optimal adjustment in how much the data discharge properly distributing a maximum of bandwidth. During the path-planning process with Ad Hoc On-Demand Distance Vector Routing(AODV), the replay packet replies to the source node with calculating the Total Service Paths(TSP) number for each node. It also announces outside while the route is changed. The mentioned number is measured and operated to control data flow automatically as soon as any node receives the messages.
The ultimate purpose of the paper aims to supply a minimum bandwidth guarantee, raising performance of network, and improve the rate of utilization for network bandwidth and creates greater benefits for the public, such as reduced transmission time, less packet loss, low jitter, and throughput stability.

一、中文部分
[1] 李雲、陳前斌、隆克平、吳詩其, “無線自組織網絡中TCP穩定性的分析及改進”, 軟件學報, 2003, Vol. 14, No. 6, pp.1178-1186.
[2] 余心淳、林志驊,”802.11 Ad Hoc 網路下競爭窗口選取機制與TCP效能之研究”, 2005年 NCS 全國計算機會議論文集, 崑山科技大學,2006.
http://dspace.lib.fcu.edu.tw:8080/dspace/bitstream/2377/1580/1/ce07ncs002006000083.pdf, 2007.
[3] 孫宏民、張仲丞,”隨意網路之安全性分析”, 資通安全通論,2006/08.
[4] 粘添壽,”電腦網路與連結技術” ,全華科技圖書公司,2006.
[5] 陳青文、賴俊良, “在隨意網路下以切割通道與最小控制頻寬保留策略來改善媒體存取傳輸效率之方法”, 2005 NCS全國計算機會議論文集,16-Oct-2006.
http://dspace.lib.fcu.edu.tw:8080/dspace/bitstream/2377/1579/1/ce07ncs002006000082.pdf, 2006
二、英文部分
[6] Albert Banchs,Xavier Perez,”Providing Throughput Guarantees in IEEE 802.11 Wireless LAN”, WCNC 2002,vol. 1,pp130-138,March 2002.
[7] ANSI/IEEE Standard 802.11, Edition Part 11: “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”, 1999.
http://standards.ieee.org/getieee802/,1999
[8] Behrouz A. Forouzan and Sophia Chung Fegan,”TCP/IP Protocol Suite”,Third Edition, McGraw-Hill,USA,2005.
[9] Charles E. Perkins,”Ad Hoc Networking”,Addison-Wesley,New York,2001.
[10] Charles E. Perkins, Elizabeth M. Belding-Royer,and Samir Das: “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF Network Working Group, Request for Comments: 3561, July 2003.
http://www.ietf.org/rfc/rfc3561.txt,2007.
[11] C.E. Perkins, E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing”, in Proc. of the IEEE WMCSA’99, pp.90-100, Feb., 1999.
[12] Charles E. Perkins and Elizabeth M. Royer,”The Ad Hoc On-Demand Distance
Vector Protocol”, Addison-Wesley, Boston, MA, USA,2001.
[13] Chung-Ju Chang , Chung-Hsun Yu, Chih-Sheng Chang, and Li-Fong Lin,” Intelligent Leaky Bucket Algorithms for Sustainable-Cell-Rate Usage Parameter Control in ATM Networks”, IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 6, NO. 5,
p749~759,OCTOBER 2004.
[14] Frank Yong Li and Norvald Stol,” QoS Provisioning using Traffic Shaping and Policing in 3rd-Generation Wireless Networks”, 0-7803-7376-6/02/$17.00 (c) 2002
IEEE,p139~143,2002.
[15] ITU-T Recommendation I.371, “Traffic control and congestion control in B-ISDN”,1996.
[16] Jani Lakkakorpi，”The Ad Hoc On-Demand Distance-Vector Protocol Quality of Service Extensions”，2004.
[17] Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu “Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED”, ACM MobiCom, pp.16-28, 2003.
[18] Shugong Xua, Tarek Saadawi, “Revealing the problems with 802.11 medium access control protocol in multi-hop wireless ad hoc networks”, ELSEVIER Computer Networks, Vol. 38, pp. 531–548, 2002.
[19] S. Xu and T. Saadawi, “Does the IEEE 802.11 MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks?”, IEEE Communications Magazine, Vol. 39, pp.130-137, 2001.