检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Computer Science and Technology, Tianjin University
出 处:《Transactions of Tianjin University》2010年第6期441-446,共6页天津大学学报(英文版)
基 金:Supported by the National High Technology Research and Development Program of China ( "863" Program, No. 2007AA01Z220);National Natural Science Foundation of China (No. 90604013 and No. 60702038)
摘 要:In wireless networks, data packets are lost due to channel interference and fading rather than network congestion. Thus, TCP designed for wired networks, cannot achieve a satisfying performance in wireless networks. Utilizing a cross-layer mechanism to identify the course of packet loss, we have proved that a mobile-host-centric transport protocol (MCP) can achieve higher throughput than TCP Reno and New Reno in static wireless environment. In this paper, we extend the cross-layer feedback mechanism and con...In wireless networks, data packets are lost due to channel interference and fading rather than network congestion. Thus, TCP designed for wired networks, cannot achieve a satisfying performance in wireless networks. Utilizing a cross-layer mechanism to identify the course of packet loss, we have proved that a mobile-host-centric transport protocol (MCP) can achieve higher throughput than TCP Reno and New Reno in static wireless environment. In this paper, we extend the cross-layer feedback mechanism and congestion control algorithm based on previous work. Furthermore, we implement the extended MCP+ in NS-2 simulator and evaluate its performance in the mobile multi-hop WLAN scenarios. The simulation results show that the proposed protocol improves the end-to-end throughput more effectively than TCP Reno and New Reno.
关 键 词:MCP multi-hop WLAN CROSS-LAYER congestion control
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38