Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 適用於無線隨意式網路之逐節點TCP傳輸協定
Hop-by-Hop TCP over MANET
作者 游逸帆
Yu,Yi-Fan
貢獻者 連耀南
Lien,Yao-Nan
游逸帆
Yu,Yi-Fan
關鍵詞 網路協定
行動隨意式網路
逐節點TCP
Network protocol
MANET
Hop-by-Hop TCP
日期 2007
上傳時間 11-Sep-2009 16:03:38 (UTC+8)
摘要 行動隨意式網路(MANET)是一種具有高度動態拓撲結構的網路。每一個行動隨意式網路由一組移動節點(Node)組成,彼此之間互相支援轉送封包可以不依靠基地台建構成Intranet。此種網路中,因節點移動之緣故,連線不穩定、頻寬較窄,錯誤率亦較高。傳統的TCP傳輸協定在行動隨意式網路上的效能不免遭受重創。
     傳統的TCP在封包遺失時,只能從傳送端進行重傳,而行動隨意式網路傳輸品質極不穩定,常常重送多次才可到達目的地,導致要耗費極長的時間才能將封包送達目的地,然而,在行動隨意式網路中,大量傳輸資料的需求並不大,反而是封包的快速送達更為重要,因此加速封包的送達成為比增大傳送量更為重要的目標。
     為了使封包較快送達目的地端,我們提出了Hop-by-Hop TCP的方法,使每個節點使用當地重傳以保證封包成功的傳到下一個節點,遺失的封包不必重新由傳送端重傳,能更快反應封包遺失,並且提昇傳輸可靠度,使封包在高遺失率的情形之下能順利且較為快速的送達目的地端。
     我們利用NS-2網路模擬器進行實驗,驗證我們的機制,實驗在不同的拓樸及負載等參數下進行,觀察傳輸成功率及封包傳輸時間,以及公平性。實驗結果指出,本方法在網路環境不穩定時吞吐量能有25.7%以上的提昇,而延遲時間也能有25%的提昇,亦有相當好的公平性。
A Mobile Ad hoc Network (MANET) MANET is composed of a group of mobile computing devices (nodes) that are equipped with Wireless LAN (WLAN) capability. Nodes can transmit packets to each other to construct Intranet without any base station. In an MANET environment, the communication links are unstable due to various reasons. Error rate is higher and bandwidth is smaller than fixed networks. Running regular TCP protocol on MANET will suffer from serious performance degradation in MANET.
     To handle packet lost, regular TCP can only retransmit lost packets from the source. However, when error rate is high, several retransmissions may be needed to transmit a packet to its destination successfully. As a result, the effective bandwidth is much lower and the average time to transmit a packet will be much longer.
     Considering that most applications on MANET prefer shorter transmission time to higher bandwidth, this thesis proposes Hop-by-Hop TCP protocol aiming to accelerate the transmission of packets. Hop-by-Hop TCP makes every intermediate node in the transmission path running a local TCP to guarantee the transmission of each packet on each link. The retransmission of a lost packet is right at the transmitting end of the link where the packet is lost. It doesn`t need to retransmit a lost packet from its source node. It takes less time in average to transmit a packet to its destination in a high error rate environment.
     We evaluate the performance of our approach by simulation using NS-2 simulator. Our experiments show that our proposed protocol outperforms TCP Reno by 25.7% in throughput and 25% reduction in average transmission time. The fairness requirement is also achieved while our proposed protocol coexists with other major TCP variants.
參考文獻 [1] “IEEE Standards for Information Technology- Telecommunications and Information Exchange between Systems- Local and Metropolitan Area Network- Specific Requirements- Part 11: Wireless LAN Medium Access Control and Physical Layer Specifications,” ANSI / IEEE Std 802. 11 , 1999.
[2] J. S. Ahn, P. B. Danzig, Z. Liu, and L. Yan, “Evaluation of TCP Vegas : Emulation and Experiment,” Proc. of ACM SIGCOMM, pp. 185-195, Aug. 1995.
[3] E. Altman, C. Barakat, and E. Laborde, “Fairness Analysis of TCP/IP,” Proc. of IEEE Conference on Decision and Control, pp. 61-66, Dec. 2000.
[4] C. Barakat, E. Altman, and W. Dabbous, “On TCP Performance in a Heterogeneous Network : A Survey,” IEEE Communications Magazine, vol.38, no.1, pp. 44-46, Jan. 2000.
[5] L. S. Brakmo, S. W. O’Malley, and Larry L. Peterson. “TCP Vegas: New Techniques for Congestion Detection and Avoidance,” Proc. of ACM SIGCOMM, pp. 24-35, Aug. 1994.
[6] L. S. Brakmo and L. L. Peterson. “TCP Vegas: End to End Congestion Avoidance on a Global Internet,” IEEE Journal on Selected Areas in Communication, vol.13, no.8, pp. 1465-1480, Oct. 1995.
[7] K. Chandran, S. Raghunathan, S. Venkatesan, and R. Prakash, “A Feedback Based Scheme For Improving TCP Performance In Ad-Hoc Wireless Networks”, IEEE ICDCS, vol. 8, no. 1, pp. 34-39, Feb. 2001.
[8] K. Chen, Y. Xue, and K. Nahrstedt, “On setting TCP’s congestion window limit in mobile ad hoc networks,” Proc. of IEEE ICC 2003, Anchorage, Alaska, May. 2003.
[9] D. Chiu and R. Jain, “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Computer Networks and ISDN Systems, vol. 1, pp. 1-14, 1989.
[10] D. Clark, “Window and Acknowledgement Strategy in TCP,” IETF RFC 813, 1982.
[11] R. Denda, A. Banchs, and W. Effelsberg, “The Fairness Challenge in Computer Networks,” Lecture Notes in Computer Science, vol. 1922, pp. 208-220, Jun. 2000.
[12] T. Dyer and R. Boppana, “A comparison of TCP performance over three routing protocols for mobile ad hoc networks,” Proc. of the 2nd ACM Int’l Symp, pp. 56−66, 2001.
[13] K. Fall and S. Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP,” ACM Computer Communication Review, vol. 26, no.3, pp. 5-21, 1996.
[14] Sally Floyd and T. Henderson, “The NewReno Modification to TCP`s Fast Recovery Algorithm,” IETF RFC 2582, 1999.
[15] Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla, “The impact of multihop wireless channel on TCP throughput and loss,” Proc .of IEEE INFOCOM, Mar. 2003.
[16] M. Gerla, K. Tang, and R. Bagrodia, “TCP performance in wireless multi-hop networks,” Proc. of the IEEE WMCSA, pp. 25-26, Feb. 1999.
[17] G. Hasegawa and M. Murata, “Survey on Fairness Issues in TCP Congestion Control Mechanisms,” IEICE Transactions on Communications, vol. E84-B, no.6, pp. 1461-1472, Jun. 2001.
[18] S. Heimlicher, R. Baumann, M. Martin, and B. Plattner, “The Transport Layer Revisited,” Proc. of 2nd IEEE International Conference on Communication Systems Software and Middleware, 2007.
[19] G. Holland and N. Vaidya, “Impact of routing and link layers on TCP performance in mobile ad hoc networks,” IEEE Wireless Communications and Networking, vol. 3, pp. 1323-1327, 1999.
[20] V. Jacobson, “Congestion Avoidance and Control,” Proc. of ACM SIGCOMM, pp. 314-329, Aug. 1988.
[21] R. Jain, D-M. Chiu, and W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” Technical Report, DEC Research Report TR-301, Sept. 1984.
[22] D. Kim, C. Toh, and Y. Choi, “TCP-BuS: Improving TCP performance in wireless ad hoc networks,” Journal of Communications and Networks, vol. 3, no. 2, pp. 175–186, Jun. 2001.
[23] S. Kopparty, S. Krishnamurthy, M. Faloutous, and S. Tripathi, “Split TCP for mobile ad hoc networks,” Proc. of IEEE GLOBECOM, Nov. 2002.
[24] Yao-Nan Lien and Ho-Cheng Hsiao, “A New TCP Congestion Control Mechanism over Wireless Ad Hoc Networks by Router-Assisted Approach,” Proc. of IEEE Workshop on Specialized Ad Hoc Networks and Systems, Jun. 2007.
[25] J. Liu and S.Singh, “ATCP: TCP for Mobile Ad Hoc Network,” IEEE Journal on Selective Areas of Communication, vol19, no.7, July. 2001.
[26] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, “TCP Selective Acknowledgement Options,” IETF RFC 2018, 1996.
[27] J. Postel, “Transmission Control Protocol,” IETF RFC 793, 1981.
[28] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” IETF RFC 2001, 1997.
[29] S. Xu and T. Saadawi, “Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?” IEEE Communication Magazine, vol. 39, no.6, P130-137, Jun. 2001.
描述 碩士
國立政治大學
資訊科學學系
94753037
96
資料來源 http://thesis.lib.nccu.edu.tw/record/#G0094753037
資料類型 thesis
dc.contributor.advisor 連耀南zh_TW
dc.contributor.advisor Lien,Yao-Nanen_US
dc.contributor.author (Authors) 游逸帆zh_TW
dc.contributor.author (Authors) Yu,Yi-Fanen_US
dc.creator (作者) 游逸帆zh_TW
dc.creator (作者) Yu,Yi-Fanen_US
dc.date (日期) 2007en_US
dc.date.accessioned 11-Sep-2009 16:03:38 (UTC+8)-
dc.date.available 11-Sep-2009 16:03:38 (UTC+8)-
dc.date.issued (上傳時間) 11-Sep-2009 16:03:38 (UTC+8)-
dc.identifier (Other Identifiers) G0094753037en_US
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/29685-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學學系zh_TW
dc.description (描述) 94753037zh_TW
dc.description (描述) 96zh_TW
dc.description.abstract (摘要) 行動隨意式網路(MANET)是一種具有高度動態拓撲結構的網路。每一個行動隨意式網路由一組移動節點(Node)組成,彼此之間互相支援轉送封包可以不依靠基地台建構成Intranet。此種網路中,因節點移動之緣故,連線不穩定、頻寬較窄,錯誤率亦較高。傳統的TCP傳輸協定在行動隨意式網路上的效能不免遭受重創。
     傳統的TCP在封包遺失時,只能從傳送端進行重傳,而行動隨意式網路傳輸品質極不穩定,常常重送多次才可到達目的地,導致要耗費極長的時間才能將封包送達目的地,然而,在行動隨意式網路中,大量傳輸資料的需求並不大,反而是封包的快速送達更為重要,因此加速封包的送達成為比增大傳送量更為重要的目標。
     為了使封包較快送達目的地端,我們提出了Hop-by-Hop TCP的方法,使每個節點使用當地重傳以保證封包成功的傳到下一個節點,遺失的封包不必重新由傳送端重傳,能更快反應封包遺失,並且提昇傳輸可靠度,使封包在高遺失率的情形之下能順利且較為快速的送達目的地端。
     我們利用NS-2網路模擬器進行實驗,驗證我們的機制,實驗在不同的拓樸及負載等參數下進行,觀察傳輸成功率及封包傳輸時間,以及公平性。實驗結果指出,本方法在網路環境不穩定時吞吐量能有25.7%以上的提昇,而延遲時間也能有25%的提昇,亦有相當好的公平性。
zh_TW
dc.description.abstract (摘要) A Mobile Ad hoc Network (MANET) MANET is composed of a group of mobile computing devices (nodes) that are equipped with Wireless LAN (WLAN) capability. Nodes can transmit packets to each other to construct Intranet without any base station. In an MANET environment, the communication links are unstable due to various reasons. Error rate is higher and bandwidth is smaller than fixed networks. Running regular TCP protocol on MANET will suffer from serious performance degradation in MANET.
     To handle packet lost, regular TCP can only retransmit lost packets from the source. However, when error rate is high, several retransmissions may be needed to transmit a packet to its destination successfully. As a result, the effective bandwidth is much lower and the average time to transmit a packet will be much longer.
     Considering that most applications on MANET prefer shorter transmission time to higher bandwidth, this thesis proposes Hop-by-Hop TCP protocol aiming to accelerate the transmission of packets. Hop-by-Hop TCP makes every intermediate node in the transmission path running a local TCP to guarantee the transmission of each packet on each link. The retransmission of a lost packet is right at the transmitting end of the link where the packet is lost. It doesn`t need to retransmit a lost packet from its source node. It takes less time in average to transmit a packet to its destination in a high error rate environment.
     We evaluate the performance of our approach by simulation using NS-2 simulator. Our experiments show that our proposed protocol outperforms TCP Reno by 25.7% in throughput and 25% reduction in average transmission time. The fairness requirement is also achieved while our proposed protocol coexists with other major TCP variants.
en_US
dc.description.tableofcontents 誌謝 vi
     圖目錄 ix
     表目錄 xi
     第一章 導論 1
     1.1 簡介 1
     1.2 無線隨意式網路簡介 2
     1.3 TCP (Transmission Control Protocol) 簡介 3
     1.4 TCP在無線網路下的問題 4
     1.5 研究動機 7
     1.6 研究目的 7
     1.7 論文架構 8
     第二章 背景與相關研究 9
     2.1 傳輸層通訊協定 9
     2.2 擁塞控制機制 12
     2.2.1 TCP Tahoe and TCP Reno 的擁塞控制 12
     2.2.1.1 慢啟動(Slow Start) 14
     2.2.1.2 擁塞避免(Congestion Avoidance) 16
     2.2.2 TCP SACK 17
     2.2.3 TCP Vegas 17
     2.3 Ad-hoc Network下改進效能的相關研究 18
     2.3.1 Split TCP for MANET 18
     2.3.2 Transport Layer Revisited 19
     2.3.3 ATCP 20
     2.3.4 TCP-F 20
     2.3.5 TCP-BuS 21
     2.3.6 Fixed-RTO 21
     2.3.7 TCP-Muzha 21
     2.4 小結 22
     第三章 Hop-by-Hop TCP 23
     3.1 設計理念 23
     3.2 設計目標 24
     3.3 TCP 設計議題 24
     3.4 Hop-by-Hop TCP 25
     3.4.1 End-to-End TCP 26
     3.4.2 One-Hop TCP 26
     3.4.2.1 遺失封包的處理 30
     3.4.2.2 One-Hop TCP執行流程 31
     3.4.3 提昇End-to-End ACK存活率 35
     3.4.4 降低overhead之方法 35
     3.4.4.1 Piggybacking 機制 36
     3.4.4.2 重複封包的處理 36
     3.5 與MAC層之關連及配合方法 37
     3.6 小結 38
     第四章 效能評估 39
     4.1 實驗目的 39
     4.2 實驗設計 39
     4.3 實驗1 : Hop-by-Hop TCP的效能測試 40
     4.3.1 實驗目標 40
     4.3.2 評估指標 40
     4.3.3 實驗流程 41
     4.3.4 實驗結果分析 42
     4.4 實驗2 : Fairness test 49
     4.4.1 實驗目標 49
     4.4.2 評估指標 50
     4.4.3 實驗 2A: 多協定共存狀態下的公平性實驗 50
     4.4.3.1 實驗環境 50
     4.4.3.2 實驗結果分析 54
     4.4.4 實驗 2B:TCP 同步化的實驗 54
     4.4.4.1 實驗目標 54
     4.4.4.2 實驗步驟 54
     4.4.4.3 實驗結果分析 58
     第五章 結論 60
     5.1 結論與未來發展 60
     參考文獻 61
     
     
     
     
     圖目錄
     圖1.1:The Effect of Mis-triggering Congestion Control 5
     圖1.2:Slowness問題示意圖 6
     圖1.3:Link重傳影響示意圖 7
     圖1.4:從Sender重傳 8
     圖1.5:從Local重傳 8
     圖2.1:TCP端對端傳送示意圖 10
     圖2.2:TCP重傳機制 10
     圖2.3:網路傳輸架構示意圖 11
     圖2.4:TCP Reno 執行流程圖 14
     圖2.5:慢啟動圖示 15
     圖2.6:TCP擁塞控制機制示意圖 15
     圖2.7:Split TCP示意圖 19
     圖3.1:Hop-by-Hop TCP示意圖 25
     圖3.2:One-Hop TCP接收Local ACK流程圖 28
     圖3.3:One-Hop TCP接收資料封包流程圖 29
     圖3.4:One-Hop TCP狀態轉移圖 31
     圖3.5:One-Hop TCP演算法虛擬碼(Pseudo code) 34
     圖3.6:Piggybacking 機制 35
     圖3.7:802.11 MAC Layer 4-Way Handshake 38
     圖4.1:實驗一拓樸 41
     圖4.2:Change of Congestion Window Size (error rate = 0.0) 44
     圖4.3:Change of Congestion Window Size (error rate = 0.1) 44
     圖4.4:Delay time at different number of hops (error rate = 0.0) 45
     圖4.5:Delay time at different number of hops (error rate = 0.1) 45
     圖4.6:Delay time at different number of hops (error rate = 0.2) 46
     圖4.7:Throughput at different number of hops (error rate = 0.0) 46
     圖4.8:Throughput at different number of hops (error rate = 0.1) 47
     圖4.9:Throughput at different number of hops (error rate = 0.2) 47
     圖4.10:使用piggybacking機制及不使用piggybacking機制的throughput比較 48
     圖4.11:不同版本TCP在傳送端重傳比率之比較 49
     圖4.12:4-hop Cross Topology with 9 Nodes and 2 TCP flows 51
     圖4.13:Throughput in Fairness Test 2A at diff. num. of hops (TCP NewReno vs. Vegas) 52
     圖4.14:Throughput in Fairness Test 2A at diff. num. of hops (TCP NewReno vs. Hop-by-Hop TCP) 53
     圖4.15:Comparison of Fairness Index in Fairness Test 2A 53
     圖4.16:Throughout Dynamics in Fairness Test 2B at diff. num. of hops (Hop-by-Hop TCP) 55
     圖4.17:Fairness Index Dynamics in Fairness Test 2B (Hop-by-Hop TCP) 55
     圖4.18:Throughout Dynamics in Fairness Test 2B (TCP Vegas) 56
     圖4.19:Fairness Index Dynamics in Fairness Test 2B (TCP Vegas) 56
     圖4.20:Throughout Dynamics in Fairness Test 2B (TCP NewReno) 57
     圖4.21:Fairness Index Dynamics in Fairness Test 2B (TCP NewReno) 57
     圖4.22:Comparison of Fairness Index in Fairness Test 2B (Hop-by-Hop TCP vs. Vegas vs. NewReno) 58
     
     
     表目錄
     表2.1:TCP實作相關的RFC文件 12
     表3.1:One-Hop TCP機制 32
     表4.1:實驗1參數 42
     表4.2:實驗2A參數 52
zh_TW
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0094753037en_US
dc.subject (關鍵詞) 網路協定zh_TW
dc.subject (關鍵詞) 行動隨意式網路zh_TW
dc.subject (關鍵詞) 逐節點TCPzh_TW
dc.subject (關鍵詞) Network protocolen_US
dc.subject (關鍵詞) MANETen_US
dc.subject (關鍵詞) Hop-by-Hop TCPen_US
dc.title (題名) 適用於無線隨意式網路之逐節點TCP傳輸協定zh_TW
dc.title (題名) Hop-by-Hop TCP over MANETen_US
dc.type (資料類型) thesisen
dc.relation.reference (參考文獻) [1] “IEEE Standards for Information Technology- Telecommunications and Information Exchange between Systems- Local and Metropolitan Area Network- Specific Requirements- Part 11: Wireless LAN Medium Access Control and Physical Layer Specifications,” ANSI / IEEE Std 802. 11 , 1999.zh_TW
dc.relation.reference (參考文獻) [2] J. S. Ahn, P. B. Danzig, Z. Liu, and L. Yan, “Evaluation of TCP Vegas : Emulation and Experiment,” Proc. of ACM SIGCOMM, pp. 185-195, Aug. 1995.zh_TW
dc.relation.reference (參考文獻) [3] E. Altman, C. Barakat, and E. Laborde, “Fairness Analysis of TCP/IP,” Proc. of IEEE Conference on Decision and Control, pp. 61-66, Dec. 2000.zh_TW
dc.relation.reference (參考文獻) [4] C. Barakat, E. Altman, and W. Dabbous, “On TCP Performance in a Heterogeneous Network : A Survey,” IEEE Communications Magazine, vol.38, no.1, pp. 44-46, Jan. 2000.zh_TW
dc.relation.reference (參考文獻) [5] L. S. Brakmo, S. W. O’Malley, and Larry L. Peterson. “TCP Vegas: New Techniques for Congestion Detection and Avoidance,” Proc. of ACM SIGCOMM, pp. 24-35, Aug. 1994.zh_TW
dc.relation.reference (參考文獻) [6] L. S. Brakmo and L. L. Peterson. “TCP Vegas: End to End Congestion Avoidance on a Global Internet,” IEEE Journal on Selected Areas in Communication, vol.13, no.8, pp. 1465-1480, Oct. 1995.zh_TW
dc.relation.reference (參考文獻) [7] K. Chandran, S. Raghunathan, S. Venkatesan, and R. Prakash, “A Feedback Based Scheme For Improving TCP Performance In Ad-Hoc Wireless Networks”, IEEE ICDCS, vol. 8, no. 1, pp. 34-39, Feb. 2001.zh_TW
dc.relation.reference (參考文獻) [8] K. Chen, Y. Xue, and K. Nahrstedt, “On setting TCP’s congestion window limit in mobile ad hoc networks,” Proc. of IEEE ICC 2003, Anchorage, Alaska, May. 2003.zh_TW
dc.relation.reference (參考文獻) [9] D. Chiu and R. Jain, “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Computer Networks and ISDN Systems, vol. 1, pp. 1-14, 1989.zh_TW
dc.relation.reference (參考文獻) [10] D. Clark, “Window and Acknowledgement Strategy in TCP,” IETF RFC 813, 1982.zh_TW
dc.relation.reference (參考文獻) [11] R. Denda, A. Banchs, and W. Effelsberg, “The Fairness Challenge in Computer Networks,” Lecture Notes in Computer Science, vol. 1922, pp. 208-220, Jun. 2000.zh_TW
dc.relation.reference (參考文獻) [12] T. Dyer and R. Boppana, “A comparison of TCP performance over three routing protocols for mobile ad hoc networks,” Proc. of the 2nd ACM Int’l Symp, pp. 56−66, 2001.zh_TW
dc.relation.reference (參考文獻) [13] K. Fall and S. Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP,” ACM Computer Communication Review, vol. 26, no.3, pp. 5-21, 1996.zh_TW
dc.relation.reference (參考文獻) [14] Sally Floyd and T. Henderson, “The NewReno Modification to TCP`s Fast Recovery Algorithm,” IETF RFC 2582, 1999.zh_TW
dc.relation.reference (參考文獻) [15] Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla, “The impact of multihop wireless channel on TCP throughput and loss,” Proc .of IEEE INFOCOM, Mar. 2003.zh_TW
dc.relation.reference (參考文獻) [16] M. Gerla, K. Tang, and R. Bagrodia, “TCP performance in wireless multi-hop networks,” Proc. of the IEEE WMCSA, pp. 25-26, Feb. 1999.zh_TW
dc.relation.reference (參考文獻) [17] G. Hasegawa and M. Murata, “Survey on Fairness Issues in TCP Congestion Control Mechanisms,” IEICE Transactions on Communications, vol. E84-B, no.6, pp. 1461-1472, Jun. 2001.zh_TW
dc.relation.reference (參考文獻) [18] S. Heimlicher, R. Baumann, M. Martin, and B. Plattner, “The Transport Layer Revisited,” Proc. of 2nd IEEE International Conference on Communication Systems Software and Middleware, 2007.zh_TW
dc.relation.reference (參考文獻) [19] G. Holland and N. Vaidya, “Impact of routing and link layers on TCP performance in mobile ad hoc networks,” IEEE Wireless Communications and Networking, vol. 3, pp. 1323-1327, 1999.zh_TW
dc.relation.reference (參考文獻) [20] V. Jacobson, “Congestion Avoidance and Control,” Proc. of ACM SIGCOMM, pp. 314-329, Aug. 1988.zh_TW
dc.relation.reference (參考文獻) [21] R. Jain, D-M. Chiu, and W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” Technical Report, DEC Research Report TR-301, Sept. 1984.zh_TW
dc.relation.reference (參考文獻) [22] D. Kim, C. Toh, and Y. Choi, “TCP-BuS: Improving TCP performance in wireless ad hoc networks,” Journal of Communications and Networks, vol. 3, no. 2, pp. 175–186, Jun. 2001.zh_TW
dc.relation.reference (參考文獻) [23] S. Kopparty, S. Krishnamurthy, M. Faloutous, and S. Tripathi, “Split TCP for mobile ad hoc networks,” Proc. of IEEE GLOBECOM, Nov. 2002.zh_TW
dc.relation.reference (參考文獻) [24] Yao-Nan Lien and Ho-Cheng Hsiao, “A New TCP Congestion Control Mechanism over Wireless Ad Hoc Networks by Router-Assisted Approach,” Proc. of IEEE Workshop on Specialized Ad Hoc Networks and Systems, Jun. 2007.zh_TW
dc.relation.reference (參考文獻) [25] J. Liu and S.Singh, “ATCP: TCP for Mobile Ad Hoc Network,” IEEE Journal on Selective Areas of Communication, vol19, no.7, July. 2001.zh_TW
dc.relation.reference (參考文獻) [26] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, “TCP Selective Acknowledgement Options,” IETF RFC 2018, 1996.zh_TW
dc.relation.reference (參考文獻) [27] J. Postel, “Transmission Control Protocol,” IETF RFC 793, 1981.zh_TW
dc.relation.reference (參考文獻) [28] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” IETF RFC 2001, 1997.zh_TW
dc.relation.reference (參考文獻) [29] S. Xu and T. Saadawi, “Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?” IEEE Communication Magazine, vol. 39, no.6, P130-137, Jun. 2001.zh_TW