Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/29685
|
| Title: | 適用於無線隨意式網路之逐節點TCP傳輸協定
Hop-by-Hop TCP over MANET |
| Authors: | 游逸帆
Yu,Yi-Fan |
| Contributors: | 連耀南
Lien,Yao-Nan
游逸帆
Yu,Yi-Fan |
| Keywords: | 網路協定
行動隨意式網路
逐節點TCP
Network protocol
MANET
Hop-by-Hop TCP |
| Date: | 2007 |
| Issue Date: | 2009-09-11 16:03:38 (UTC+8) |
| Abstract: | 行動隨意式網路(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. |
| 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.
[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. |
| Description: | 碩士
國立政治大學
資訊科學學系
94753037
96 |
| Source URI: | http://thesis.lib.nccu.edu.tw/record/#G0094753037 |
| Data Type: | thesis |
| Appears in Collections: | [資訊科學系] 學位論文
|
Files in This Item:
| File |
Size | Format | |
|---|
| index.html | 0Kb | HTML2 | 493 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
