在本論文中，我們針對無線隨意網路(Ad-Hoc Network)提出一個有限延遲時間的路由方法。ㄧ般認為one-hop的傳播方式可以使封包較快送達目的地，但是在複雜的隨意網路，我們不只針對單一節點，而是很多節點同時要傳送的情況下，multi-hop的傳送方式不但可以減少能源耗損同時也能有相當良好的throughput。在無線隨意網路中，在一個有限延遲時間內使網路的產量最大化是一個相當重要的議題。在本文中，我們提出一個maximum flow approach使網路能在一個有限的延遲時間內讓sink接收到最多的封包，我們最大的貢獻是將有限延遲的問題轉換成最大流量的問題，並且運用maximum flow的觀念獲得最佳解，這個最佳解可以確保在整個網路的效能會被發揮到最大。

In this thesis, we proposed a delay limited routing scheme in wireless ad hoc networks. When nodes transmit packets in wireless ad hoc networks, most people think the one-hop way is better than the multi-hop way in reducing the delay time. Since most cases in wireless ad hoc networks are not single sources, we should consider at least two sources transmitting packets at the same time and then use the multi-hop way in order to reduce the energy consumption. We want to maximize the throughput with limited delay. Our contribution is to transform the optimal scheduling problem in wireless ad hoc networks to the classic maximum flow problem. The maximum flow approach does maximize the throughput and can get the optimal solution.

目錄
第一章 緒論....…………………………………………………………..1
1-1 無線隨意網路背景介紹………………………………………..1
1-2 文獻探討………………………………………………………..2
1-3 研究動機………………………………………………………..3
1-4 文章組織………………………………………………………..5
第二章 系統模型………………………………………………………..6
2-1 System model……………………………………………………6
第三章 最大流量方法(THE MAX-FLOW APPROACH)…………..….9
3-1 Max-Flow Problem定義與介紹……………………………..….9
3-2 The Ford-Fulkerson Algorithm…………………………...……10
3-3 TRANSFORM(網路問題轉換)………………………………..13
第四章模擬與分析……………………………………………………..19
4-1 複雜度分析……………………………………………………19
4-2 模擬結果圖……………………………………………………19
第五章 結論……………………………………………………………31
5-1 總結……………………………………………………………31
參考文獻…………………..……………………………………………32

參考文獻
[1] Bush, L.A.; Carothers, C.D.; Szymanski, B.K., “Algorithm for optimizing energy use and path resilience in sensor networks, ” Wireless Sensor Networks, 2005. Proceeedings of the Second European Workshop on ,31 Jan.-2 Feb. 2005　, Page(s):391 – 396
[2] Blazevic, L.; Le Boudec, J.-Y.; Giordano, S,“A location-based routing method for mobile ad hoc networks,”IEEE Transactions on Mobile Computing,Vol. 4, March-April 2005, Page(s):97 – 110.
[3] Jae-Hwan Chang; Tassiulas, L, “Maximum lifetime routing in wireless sensor networks,” IEEE/ACM Transactions on Networking, Vol 12, Aug. 2004 p.609 – 619
[4] Wang, G.; Cao, G.; Porta, T.L.; Zhang, W, “Sensor relocation in mobile sensor networks,” IEEE INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings,Vol 4, 13-17 March 2005, Page(s):2302 – 2312
[5] Intanagonwiwat, C.; Govindan, R.; Estrin, D.; Heidemann, J.; Silva, F, “Directed diffusion for wireless sensor networking,” IEEE/ACM Transactions on Networking,Vol. 11, Issue 1, Feb. 2003 ,Page(s):.2 – 16
[6] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM/IEEE Int’l Conf. Mobile Computing and Networking (MobiCom ’00), Aug. 2000.
[7] Krunz, M.; Muqattash, A.; Sung-Ju Lee,“Transmission power control in wireless ad hoc networks: challenges, solutions and open issues, ” IEEE Network,Vol. 18, Sept.-Oct. 2004 ,Page(s):8 – 14
[8] S.-J. Lee, M. Gerla, and C.-K. Toh, “A Simulation Study of Tabledriven
and On-Demand Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network, vol. 13, no. 4, Page(s):. 48-54, July-Aug. 1999.
[9] Li Li; Halpern, J.Y.; Bahl, P.; Yi-Min Wang; Wattenhofer, R., “A cone-based distributed topology-control algorithm for wireless multi-hop networks,” IEEE/ACM Transactions on Networking, Vol. 13, Issue 1, Feb. 2005 ,Page(s):147 – 159
[10] X.-H. Lin, “Channel Adaptive Techniques for Resources Management
in Wireless Ad Hoc Networks,” PhD thesis, The Univ. of Hong Kong, Aug. 2003

[11] X.-H. Lin, Y.-K. Kwok, and V.K.N., “BGCA: Bandwidth Guarded 　channel Adaptive Routing for Ad Hoc Networks,” Proc.Third IEEE Comm. and Networking Conf. (WCNC ’02), vol. 1, pp. 433-439, Mar. 2002.
[12] Xiao-Hui Lin, Yu-Kwong Kwok, and Vincent K.N. Lau,“A Quantitative Comparison of Ad Hoc Routing Protocols with and without Channel Adaptation,” IEEE Transactions on Mobile Computing, VOL. 4, NO. 2, MARCH/APRIL 2005,Page(s):111-128.

[13] Yunhao Liu; Xiaomei Liu; Li Xiao; Ni, L.M.; Xiaodong Zhang,“Location-aware topology matching in P2P systems,” INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies,Vol., 7-11 March 2004 ,Page(s):2220 - 2230
[14] Niculescu, D.,“Positioning in ad hoc sensor networks,” IEEE Network ,Volume: 18 , Issue: 4 , July-Aug. 2004 ,Page(s):24-29.
[15] Ad Hoc Networking, C.E. Perkins, ed. Addison-Wesley, 2000.
[16] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing, Mobile Computing Systems and Applications,” Proc. IEEE Workshop Mobile Computing Systems & Applications (WMCSA ’99) ,Page(s): 90-100, 1999.
[17] E.M. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm., vol. 6, no. 2 ,Page(s): 46-55, Apr. 1999.
[18] C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems.
Prentice Hall, 2002.
[19] C.-K. Toh, “A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing,” Proc. 1996 IEEE 15th Ann. Int’l Phoenix Conf. Computers and Comm. ,Page(s): 480-486, 1996

[20] Jie Wu; Fei Dai, “Mobility management and its applications in efficient broadcasting in mobile ad hoc networks,”INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies,Volume 1, 7-11 March 2004 Page(s): Digital Object Identifier 10.1109/INFCOM.2004.1354507
[21] Behzad, A.; Rubin, I.; “High transmission power increases the capacity of ad hoc wireless networks,” , IEEE Transactions on Wireless Communications , Volume 5, Issue 1, Jan. 2006 Page(s):156 - 165