一种异构网络TCP拥塞控制算法

针对互联网中端对端带宽、时延和丢包率等的差异性日益加剧,导致TCP传输性能严重退化,该文提出一种链路自适应TCP拥塞控制算法(INVS)。INVS在拥塞避免阶段初期采用基于指数函数的凸窗口增长函数,以提高链路利用率;在窗口增长函数中引入了自适应增长因子实现窗口增长速率与链路状态相匹配;采用了自适应队列门限的丢包区分策略以提高无线环境下TCP的性能。性能分析和评估表明,INVS提高了TCP拥塞控制算法的吞吐量、公平性、链路利用率和RTT公平性。     

TCP连接竞争资源的公平性研究

Internet的迅速发展使得计算机网络的资源分配成为数据通信研究领域的热点.在Internet由单一服务质量过渡到支持多种服务质量的过程中,传输控制协议(TCP)将一直是主要的端到端的资源分配方案.本文深入分析了具有不同传输延时的TCP连接竞争资源时的公平性.研究表明,TCP算法对具有较大传输延时的连接具有不公平性.当竞争带宽的各连接的传输延时按比例减小时,小传输延时的连接对大传输延时的连接的抑制性相对减弱,这种不公平性将减弱.结论对于TCP算法的改进具有重要意义,同时这种不公平性对于设计分级服务方案将有很好的应用前景.     

一种提高无线环境中TCP性能的改进方案

本文针对无线信道的特点提出了一种用于提高无线环境中TCP性能的改进方案－Wireless-TCP，通过尝试对TCP的拥塞控制中时间的算法进行调整并增加Probe模块以应对无线信道中的长时间中断，保证TCP连接的存在，通过爱立信通信实验室的仿真实验验证了该改进方案的有效性。     

TCP Performance in Optical Packet-switched Networks

Optical packet assembly is a key function to support inter-working between TCP/IP networks and optical packet-switched networks. It is characterized by the assembly delay and by the segment aggregation needed to form an optical packet. These counter-balancing aspects depend on several environment variables, such as the TCP parameters, the access link speed, the optical packet size whose effects are studied in this paper. Performance evaluations are obtained by extensive simulations in terms of send rate of TCP flows, fairness, efficiency, and assembly delay. Some guidelines in the design of optical packets that take into account the results presented are given.     

Use of TCP Decoupling in Improving TCP Performance over Wireless Networks

We propose using the TCP decoupling approach to improve a TCP connection's goodput over wireless networks. The performance improvement can be analytically shown to be proportional to , where MTU is the maximum transmission unit of participating wireless links and HP_Sz is the size of a packet containing only a TCP/IP header. For example, on a WaveLAN [32] wireless network, where MTU is 1500 bytes and HP_Sz is 40 bytes, the achieved goodput improvement is about 350%. We present experimental results demonstrating that TCP decoupling outperforms TCP reno and TCP SACK. These results confirm the analysis of performance improvement.     

Enhancing Network lifetime and Throughput in Heterogeneous Wireless Sensor Networks

Wireless Personal Communications - In the modern era, WSNs broadly used in many research areas. Mainly researchers are focusing on rising the network lifetime, throughput and decreasing the energy...     

使用ZigBee无线传感器网和异构无线接入网的卫生保健系统

这篇论文推出了一种基于ZigBee技术的可穿戴传感器网络的无所不在的卫生保健系统,详细阐明了其系统结构及组成部分。用此结构收集和传送病人的生理数据与环境参数给卫生保健中心。这个基于异构无线接入网的病人监测系统,集成多个无线技术,在病人移动的情况下,支持连续的,任意时间,任意地点的用户愿意的生理监测。并针对该系统作了硬件与软件的设计。     

异构无线网络业务接入多目标优化控制算法

提出了一种应用于异构无线网络环境的基于多目标优化的业务接入控制算法.该算法以业务占用总资源最少、业务阻塞率最低和网络间负载最均衡为目标建立了多目标优化控制模型,采用高斯和戒上型组合隶属函数将多目标问题模糊化,利用最大化满意度指标法将多目标问题转化为单目标问题,并通过遗传算法求得最优解.仿真结果表明,所提算法能在兼顾各网络资源高效利用的同时,保证业务接入的可靠性,并相对于参考算法有效降低了业务阻塞率.     

网络切换对TCP吞吐量和公平性的影响分析

无线移动网络的发展日新月异.TCP协议是目前互联网上使用的最为广泛的端到端可靠传输协议,但其应用在无线网络上的时候,TCP性能下降明显.文中详细分析了TCP移动网络的切换对TCP造成影响的几个重要方面.最后通过在NS2上进行实验揭示了对多个TCP流公平性的影响,即切换后RTT越小的TCP流的吞吐量增长的越快,同时静态链路会夺取无线链路的链路资源.     

TCP-BIAD for Enhancing TCP Performance in Broadband Wireless Access Networks

In this paper a new TCP variant, named TCP-Binary Increase, Adaptive Decrease is presented. The suggested congestion control algorithm is a joint approach of Westwood and an enhanced version of BIC, for improving TCP performance in broadband wireless access networks. BIAD has been evaluated with respect to other TCP variants such as Reno, Westwood, BIC, CUBIC, HSTCP and STCP with the use of network simulator 2. The results indicate that the proposed solution achieves high network utilization levels in a wide range of network settings, including wireless channel errors, link asymmetry and congestion. We also evaluated TCP-BIAD when multiple flows share a bottlenecked access link and we show that it demonstrates the fairness features required for network deployment.     

异构无线网络可信接入设计及实现

异构无线网络互连后的安全问题是当前网络安全研究的一个热点问题,为了解决异构网络互连后产生的接入安全问题,提出了一种基于信任模型的可信接入框架,该框架建立了异构无线网络间的信任评价体系,对接入异构无线网络用户除了进行身份验证,还必须进行用户信任度的验证,既拒绝了恶意节点接入,又确保了合法节点的安全接入,从而保证异构无线网络互连接入的安全和可信。     

基于网络编码的无线路由技术研究进展

网络编码是近年来通信领域所取得的重大进展之一,其核心思想是网络节点对于接收的分组不是采取的传统的存储-转发的简单路由方式,而是存储-编码处理-转发的方式。网络编码已被证明是改善无线网络性能特别是吞吐量性能方面的下一代关键技术之一,特别适合战场环境下广播和组播信息的高效传输。本文综述了近年来基于网络编码的无线路由技术的相关研究进展,分析了现有研究的局限性与不足,并对下一步研究方向进行了展望。     

Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks

In this paper, we propose a scheme that dynamically adjusts the slow start threshold (ssthresh) of TCP. The ssthresh estimation is used to set an appropriate ssthresh. A good ssthresh would improve the transmission performance of TCP. For the congestion avoidance state, we present a mechanism that probes the available bandwidth. We adjust the congestion window size (cwnd) appropriately by observing the round trip time (RTT) and reset the ssthresh after quick retransmission or timeout using the ssthresh estimation. Then the TCP sender can enhance its performance by using the ssthresh estimation and the observed RTT. Our scheme defines what is considered an efficient transmission rate. It achieves better utilization than other TCP versions. Simulation results show that our scheme effectively improves TCP performance. For example, when the average bottleneck bandwidth is close to 30% of the whole network bandwidth, our scheme improves TCP performance by at least 10%.

支持移动无线接入的IP网络QoS保证技术

针对服务质量(QoS)保证技术问题,从移动性、无线链路特性和IP网络传统的QoS保证技术的改进几个方面出发,对下一代支持多种移动无线接入的IP网络中,QoS保证技术的相关研究热点及技术现状进行了分析和总结,并提出了本研究方向QoS分层模型和进一步的研究建议。     

Throughput Scalability of Wireless Hybrid Networks over a Random Geometric Graph

In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by purely using the remaining ad hoc nodes as their relays. In addition, ad hoc nodes can also utilize the existing infrastructure fully or partially by reaching any access point (or gateway) of the infrastructure network in a single or multi-hop fashion. Using the same tools as in [9], we show that the per source node capacity of Θ(W/log(N)) can be achieved in a random network scenario with the following assumptions: (i) The number of ad hoc nodes per access point is bounded above, (ii) each wireless node, including the access points, is able to transmit at W bits/sec using a fixed transmission range, and (iii) N ad hoc nodes, excluding the access points, constitute a connected topology graph. This is a significant improvement over the capacity of random ad hoc networks with no infrastructure support which is found as in [9]. We also show that even when less stringent requirements are imposed on topology connectivity, a per source node capacity figure that is arbitrarily close to Θ(1) cannot be obtained. Nevertheless, under these weak conditions, we can further improve per node throughput significantly. We also provide a limited extension on our results when the number of ad hoc nodes per access point is not bounded.Ulaş C. Kozat was born in 1975, in Adana, Turkey. He received his B.Sc. degree in Electrical and Electronics Engineering from Bilkent University, Ankara, Turkey and his M.Sc. in Electrical Engineering from The George Washington University, Washington D.C. in 1997 and 1999 respectively. He has received his Ph.D. degree in May 2004 from the Department of Electrical and Computer Engineering at University of Maryland, College Park. He has conducted research under the Institute for Systems Research (ISR) and Center for Hybrid and Satellite Networks (CSHCN) at the same university. He worked at HRL Laboratories and Telcordia Technologies Applied Research as a research intern. His current research interests primarily focus on wireless and hybrid networks that span multiple communication layers and networking technologies. Mathematical modelling, resource discovery and allocation, vertical integration of wireless systems and communication layers, performance analysis, architecture and protocol development are the main emphasis of his work. E-mail: kozat@isr.umd.eduLeandros Tassiulas (S′89, M′91) was born in 1965, in Katerini, Greece. He obtained the Diploma in Electrical Engineering from the Aristotelian University of Thessaloniki, Thessaloniki, Greece in 1987, and the M.S. and Ph.D. degrees in Electrical Engineering from the University of Maryland, College Park in 1989 and 1991 respectively.He is Professor in the Dept. of Computer and Telecommunications Engineering, University of Thessaly, Greece and Research Professor in the Dept. of Electrical and Computer Eng and the Institute for Systems Research, University of Maryland College Park since 2001. He has held positions as Assistant Professor at Polytechnic University New York (1991–95), Assistant and Associate Professor University of Maryland College Park (1995–2001) and Professor University of Ioannina Greece (1999–2001).His research interests are in the field of computer and communication networks with emphasis on fundamental mathematical models, architectures and protocols of wireless systems, sensor networks, high-speed internet and satellite communications.Dr. Tassiulas received a National Science Foundation (NSF) Research Initiation Award in 1992, an NSF CAREER Award in 1995 an Office of Naval Research, Young Investigator Award in 1997 and a Bodosaki Foundation award in 1999 and the INFOCOM′94 best paper award. E-mail: leandros@isr.umd.edu     

基于无线传感器网络的跨层拥塞控制协议

无线传感器网络(WSN)中由拥塞引起的大量分组重传以及重传多次失败后的分组丢弃会导致较长的时延、较高的分组丢失率和较多的能量消耗.为了准确探测和控制网络拥塞,提出了一种基于跨层设计的拥塞控制协议,即上行拥塞控制(UCC)协议.该协议利用节点在媒质接人控制(MAC)层中未占用的缓冲器区间大小和所预测的通信流量作为该节点的...     

基于混沌遗传的异构无线网络接入选择策略

为了解决异构无线网络接入选择问题,提出一种基于混沌遗传算法的解决方法.将网络接入选择转换为一个多属性优化问题,利用混沌遗传算法解决全局寻优问题.算法首先通过超混沌系统产生初始种群和混沌扰动向量,对遗传算法进行改进;然后利用混沌遗传算法对适应度函数求解得到网络选择评价指标权重.仿真结果表明,该算法能够使新到达的用户更均匀地分布在各备选网络中,有效降低网络阻塞率并减小各候选网络阻塞率差距,实现网络的负载均衡.     

Node Throughput Analysis of Decentralized Wireless Networks Using Multibeam Antennas in Multipath Environments

The use of multibeam antennas (MBAs) in decentralized wireless networks significantly increases the throughput by improving spatial reuse and extending coverage compared with single-beam antennas. The throughput performance may, however, degrade in multipath environments due to the fact that multipath propagation increases the probability of collision among different users. Based on the probability of collision, accurate analytical expressions are derived for the node throughput gain (NTG) of a wireless network using MBAs in quasi-stationary multipath environments. The results show that a higher number of propagation paths cause more frequent collisions and thus yield lower node throughput.

基于网络利用率最大化来提高无线Mesh网络中TCP协议的传输性能

In Wireless Mesh Networks (WMNs), the performance of conventional TCP significantly deteriorates due to the unreliable wireless channel. To enhance TCP performance in WMNs, TCP/LT is proposed in this paper. It introduces fountain codes into packet reorganization in the protocol stack of mesh gateways and mesh clients. Furthermore, it is compatible with conventional TCP. Regarded as a Performance Enhancement Proxies (PEP), a mesh gateway buffers TCP packets into several blocks. It simultaneously processes them by using fountain encoders and then sends them to mesh clients. Apart from the improvement of the throughput of a unitary TCP flow, the entire network utility maximization can also be ensured by adjusting the scale of coding blocks for each TCP flow adaptively. Simulations show that TCP/LT presents high throughput gains over single TCP in lossy links of WMNs while preserving the fairness for multiple TCPs. As losses increase, the transmission delay of TCP/LT experiences a slow linear growth in contrast to the exponential growth of TCP.     

Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time, is addressed in this paper. It is shown that a simple distributed scheduling strategy, maximal scheduling, attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. The guaranteed fraction depends on the ldquointerference degreerdquo of the network, which is the maximum number of transmitter-receiver pairs that interfere with any given transmitter-receiver pair in the network and do not interfere with each other. Depending on the nature of communication, the transmission powers and the propagation models, the guaranteed fraction can be lower-bounded by the maximum link degrees in the underlying topology, or even by constants that are independent of the topology. The guarantees are tight in that they cannot be improved any further with maximal scheduling. The results can be generalized to end-to-end multihop sessions. Finally, enhancements to maximal scheduling that can guarantee fairness of rate allocation among different sessions, are discussed.