IEEE 802.16 Mesh模式下的跨层拥塞控制

基于IEEE802.16Mesh网络,提出了一种拥塞控制策略.每个节点通过自身拥塞情况进行局部拥塞控制,同时利用节点间的协同能力在每相邻两跳内的3个结点间进行拥塞控制.通过跨层机制反馈整条传输链路的拥塞情况,并在链路源节点进行数据发送调节.仿真结果表明,这种基于跨层反馈的拥塞控制策略(CLFC2)能有效缓解链路拥塞状况,在负荷严重的情况下能提供更好的通信质量.     

基于滑模变结构的无线传感器网络跨层拥塞控制

基于滑模变结构机制,讨论了节点级和链路级同时发生拥塞情况下的无线传感器网络跨层拥塞控制问题.对于节点级拥塞和链路级拥塞分别提出了准滑模控制策略.链路级拥塞采取节点输出流量最小的数据包优先进行传输的原则,实现了拥塞控制的跨层设计,大大降低了各节点排队时间,能够有效缓解拥塞的发生.仿真结果表明,该算法实现了较高的吞吐量和较低的延迟,提高了整个网络的服务质量.     

基于滑模变结构的WSNs跨层拥塞控制算法

针对具有传输控制协议（TCP）传输机制的无线传感器网络（WSNs）节点拥塞问题,在传输层的基础上结合物理层的信噪比（SNR）参数来估计信道状况,不断调整传输模型,实现跨层控制。此跨层方法改变了以往的单层拥塞控制方法,充分利用了WSNs层与层的协作关系,并用基于自适应趋近律的离散滑模控制结构模型作为控制器,过程简单且易于实现。仿真结果表明：该跨层拥塞控制方法具有响应速度快、延迟小、鲁棒性好等特点。     

无线传感器网络中的逐跳跨层拥塞控制

给出一种逐跳跨层拥塞控制机制,依据检测缓冲区占用率和拥塞度所获得的拥塞信息,在传输层开环逐跳速率控制的基础上,自适应地调整节点MAC层信道接入优先级,使整个传感器网络中的节点根据局部的拥塞状态调整信息发送速率。NS2仿真结果表明,该算法可有效地提高网络性能和拥塞控制效率。     

一种实现MAC层冲突反馈的跨层TCP拥塞控制机制

详细分析了传统的TCP拥塞控制算法在无线多跳网络环境下面临的问题,指出无线多跳环境下的MAC层信道竞争以及TCP拥塞窗口的过激增长机制是影响TCP性能的主要原因,提出一种新的TCP跨层拥塞控制机制TCP-CR.该机制中节点通过MAC层维护的链表信息,将冲突概率定时向源节点的传输层进行反馈,源节点根据获取的反馈信息做出拥塞窗口调整.仿真结果证明,该机制中源节点能有效根据当前MAC层网络状况做出及时动态调整,从而提高TCP的吞吐量.     

无线网络中基于显式拥塞反馈的TCP协议跨层设计研究

无线网络的特殊性使得有线网络下TCP的拥塞控制方法不能直接应用在无线网络中,因此出现了一些跨层设计方法来优化TCP的性能.但是目前跨层优化的实现方法中没有充分考虑与已有TCP协议的相互融合,使得其应用受到一定的限制.为此,提出了基于显式拥塞反馈的TCP协议跨层设计模型,并详细讨论了其可行性、兼容性和扩展性.该模型对混合网络中的TCP协议的研究具有较好的参考价值.     

基于价格的联合拥塞和竞争控制算法

提出一种联合拥塞和信道接入控制的跨层优化方法,以降低多播流的分发时延,建立网络效用最大化模型,采用基于效用的定价机制,通过拉格朗日对偶分解获得基于价格的分布式算法,并以该算法为核心进行链路的信道接入竞争控制和拥塞控制。仿真实验结果表明,该算法是可行的。     

基于比例分配的WSN信息流调度模型

传感器网络负荷的不断增加导致网络性能大幅下降,针对该问题,文章提出基于比例分配的无线传感器网络信息流调度模型,通过采用对拥塞节点的若干个前一跳节点按比例获取信息流代价,以调整流入拥塞节点信息流的方法,来防止网络发生拥塞。结果表明,该方法控制流入拥塞节点的信息流的大小,可避免因控制流入拥塞节点的信息流而导致的若干个前一跳节点发生严重拥塞。     

WSN中基于分簇的实时传输算法

采用跨层技术,提出一种无线传感器网络(WSN)中基于分簇的实时传输算法。在WSN中找出簇头到基站的多条优化路径,采用基于平均队列长度的拥塞控制方法,在这些路径中找出一条耗能最小且实时性最优的路径,并沿着该路径将数据传送到基站。仿真分析表明,该算法能满足网络的实时性需求,并能有效进行拥塞控制。     

一种基于跨层负载感知和双向逐跳信息素更新的自组网蚂蚁算法

本文将跨层优化和蚂蚁优化方法结合起来解决自组网中的负载均衡问题,提出了一种基于跨层负载感知和双向逐跳更新信息素的蚂蚁优化路由协议（CLABHPU）.协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要依据,进行按需路由发现和维护;通过拥塞节点丢弃蚂蚁分组的方法减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚂蚁算法的路由协议中普遍存在的拥塞问题和路由开销问题.同时,协议在路由发现阶段通过中间节点对信息素表进行双向和逐跳更新,提高了算法的收敛速度和对异常情况的反应速度.通过概率选路提供到目的节点的大量冗余路由,提高了算法的可靠性和顽存性.仿真结果表明,CLABHPU在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络业务流负载均衡.     

Jointly optimized congestion control,forwarding strategy,and link scheduling in a named-data multihop wireless network

As a promising future network architecture, named data networking (NDN) has been widely considered as a very appropriate network protocol for the multihop wireless network (MWN). In named-data MWNs, congestion control is a critical issue. Independent optimization for congestion control may cause severe performance degradation if it can not cooperate well with protocols in other layers. Cross-layer congestion control is a potential method to enhance performance. There have been many cross-layer congestion control mechanisms for MWN with Internet Protocol (IP). However, these cross-layer mechanisms for MWNs with IP are not applicable to named-data MWNs because the communication characteristics of NDN are different from those of IP. In this paper, we study the joint congestion control, forwarding strategy, and link scheduling problem for named-data MWNs. The problem is modeled as a network utility maximization (NUM) problem. Based on the approximate subgradient algorithm, we propose an algorithm called ‘jointly optimized congestion control, forwarding strategy, and link scheduling (JOCFS)’ to solve the NUM problem distributively and iteratively. To the best of our knowledge, our proposal is the first cross-layer congestion control mechanism for named-dataMWNs. By comparison with the existing congestion control mechanism, JOCFS can achieve a better performance in terms of network throughput, fairness, and the pending interest table (PIT) size.     

Maximum lifetime rate control and random access in multi-hop wireless networks

Network lifetime and transmission quality are of paramount importance for rate control in an energy constrained multi-hop wireless network. It is known that they depend on mechanisms that span several protocol layers due to the existing interference across collision links and the energy constrained nature of wireless nodes. Although separate consideration of these issues simplifies the system design, it is often insufficient for wireless networks when the overall system performance is required. In this paper, we present a framework for cross-layer rate control towards maximum network lifetime and collision avoidance. The main contributions of this paper are twofold. First, although the link attainable rate is typically a non-convex and non-separable function of persistent probabilities, we prove the convergence of this cross-layer algorithm to the global optimum of joint congestion control and random access algorithm under the framework of nonlinear programming. Second, by adjusting a parameter in the objective function, we achieve the tradeoff between transmission quality and network lifetime. Simulations illustrate the desirable properties of the proposed algorithm, including convergence to the global optimum, better performance than the layered scheme, desirable tradeoff between transmission quality and network lifetime.     

Cross-layer topology design for network coding based wireless multicasting

This paper considers wireless multicast networks where network coding (NC) is applied to improve network throughput. A novel joint topology and cross-layer design is proposed to maximise the network throughput subject to various quality-of-service constraints, such as: wireless multicast rate, wireless link capacity, energy supply and network lifetime. Specifically, a heuristic NC-based link-controlled routing tree algorithm is developed to reduce the number of required intermediate nodes. The proposed algorithm facilitates the optimisation of the wireless multicast rate, data flow of wireless links, energy supply and lifetime of nodes through a novel cross-layer design. The proposed joint topology and cross-layer design is evaluated and compared against other schemes from the literature. The results show that the proposed scheme can achieve up to 50% increase in the system throughput when compared to a classic approach.     

Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks

In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.     

无线传感器网络中跨层优化的分簇算法

针对无线传感器网络中节点能量受限问题,提出一种跨出优化的无线传感器网络分簇算法,根据跨层分析方法计算得到的簇数目,将网络区域划分为非均匀的虚拟单元格,采用能量有效策略组织成簇,均衡网络能量消耗.仿真实验证明,采用跨层的方法计算的簇数目可以有效降低节点的能量消耗、延长网络的生存周期.     

Performance improvement in wireless networks using cross-layer ARQ

This paper presents a novel cross-layer approach (LLE-TCP) designed for performance enhancement of TCP over a large variety of wireless networks. LLE-TCP avoids TCP ACK packet transmission over the wireless channel. As a result, the saved time can be utilized by the nodes for data packet delivery. The proposed scheme enhances the protocol stacks of the wireless sender (or a base station) and the receiver with cross-layer ARQ agents which support ACK suppression. ARQ agent suppresses the outgoing ACKs at the receiver side and generates them locally at the sender or base station.The performance evaluation of the proposed approach is performed via simulations as well as IEEE 802.11 testbed experiments for single-hop and infrastructure network scenarios. LLE-TCP demonstrates the performance improvement in the range of 20–100% depending on the transmitted TCP/IP datagram size.Among the factors contributing to performance enhancement are: medium busy time reduction, reduced sensibility to link errors, reduced round trip time (RTT), and improved congestion control.A good level of throughput fairness as well as a fair coexistence with state-of-the-art TCP modifications ensures proper functionality of the proposed approach, while performance advantages extended even on non-LLE-TCP users favor an incremental deployment of the technique in existing networks.     

Joint Design of Source Rate Control and QoS-Aware Congestion Control for Video Streaming Over the Internet

Multimedia streaming over the Internet has been a very challenging issue due to the dynamic uncertain nature of the channels. This paper proposes an algorithm for the joint design of source rate control and congestion control for video streaming over the Internet. With the incorporation of a virtual network buffer management mechanism (VB), the quality of service (QoS) requirements of the application can be translated into the constraints of the source rate and the sending rate. Then at the application layer, the source rate control is implemented based on the derived constraints, and at the transport layer, a QoS-aware congestion control mechanism is proposed that strives to meet the send rate constraint derived from VB, by allowing temporary violation of transport control protocol (TCP)-friendliness when necessary. Long-term TCP-friendliness, nevertheless, is preserved by introducing a rate-compensation algorithm. Simulation results show that compared with traditional source rate/congestion control algorithms, this cross-layer design approach can better support the QoS requirements of the application, and significantly improve the playback quality by reducing the overflow and underflow of the decoder buffer, and improving quality smoothness, while maintaining good long-term TCP-friendliness