基于动态获知节点状态的间断连接网络拥塞控制机制

间断连接网络中通常是利用多副本数据转发方式来提高数据成功投递概率;但多副本的数据转发易导致冗余数据副本出现的频率升高。对此,设计了动态获知节点状态的间断连接网络拥塞控制机制(SCCS,State-aware Congestion Control Strategy)。引入平滑数学模型,结合节点间的相遇历史信息,构造了效用函数,从而以间接获知网络信息的方式预测下一时刻网络的拥塞情况,进而以分布式的方式动态选择较为合适的中继节点,以更加合理地利用有限的网络资源。仿真结果表明:与当前性能较好的拥塞控制机制相比,该机制的数据成功投递概率更高,而网络负载率更低。     

节点状态感知的延迟容忍网络拥塞控制策略

为了有效提高延迟容忍网络中的数据传输效率,节点普遍采用多副本方式转发数据,然而此种方式将造成网络中冗余数据增多,导致网络拥塞.本文提出了一种带有节点状态感知的拥塞控制策略,根据运动过程中所获知的相关历史信息,节点以直接获取及间接推荐的方式准确地感知网络中各个节点的拥塞状态,进而以分布式的方式动态地为数据选择中继节点,达到更加合理地利用有限的网络资源的目的.结果表明所提出的拥塞控制能有效地改善数据成功投递概率和网络负载率.     

联合无线网络编码与TCP Vegas的多播协议优化研究

为解决移动自组网中网络编码多播路由协议因业务传输负载增大,而产生的网络拥塞现象,本文提出了一种可靠的基于TCP Vegas窗口拥塞控制的网络编码多播路由协议。该协议的核心思想是发送节点采用发送窗口自调整和反馈消息触发发送窗口调整的机制,综合的调节数据包的发送速率,来改善网络拥塞现象,从而可以降低丢包率。仿真结果表明,当传输负载增大时,基于窗口拥塞控制的网络编码多播路由协议可使得系统的总开销大大降低,分组投递率获得了相对的提升。     

基于邻居覆盖信息和节点移动速度的无线自组网多播方案

针对无线自组网节点的移动导致多播可靠性降低、开销和时延增加的问题,提出基于邻居覆盖信息的多播方案。该方案通过少量的Hello报文收集一跳内的邻居信息,并据此实时计算节点的密度系数、邻居节点未覆盖率等参数,利用所获参数动态调整节点的多播数据转发时延与转发概率。为进一步降低时延,提出一种基于节点移动速度的数据分发方案,它允许部分快速移动节点采用更高的概率转发多播数据。将其扩展至多播方案中,形成基于邻居覆盖信息和节点移动速度的多播方案。NS2的仿真结果表明,与现有方案相比,该方案将分组投递率提高27%,控制开销减少33.2%,并将端到端平均时延降低45%。     

一种基于仿生学的MANET拥塞节点自适应回避路由协议

 针对MANET中出现的因节点拥塞而导致路由不稳定、频繁重路由等问题,本文借鉴大肠杆菌培育过程中对营养液浓度变化的新陈代谢自适应调节行为和其数学描述模型ARAS,提出了一种新的拥塞节点自适应回避的MANET路由协议ATAR,其主要思路是:将节点缓存队列信息(可反映该节点拥塞程度)和目的端反馈包跳数信息(可反映该节点到目的端的路径长短)归一化处理后定义为节点的适应值,并将其映射为菌体的成长速率;再在随机性上修正了原始描述模型ARAS,并用其分别计算该节点的所有邻节点若被当作它到目的端路由的下一跳节点时,它们各自对该路由性能的改善度,然后选择其中改善度最大的邻节点作为其下一跳节点,以自适应避开拥塞的邻节点,同时选择较短路径.仿真结果比较显示:ATAR突发大时延发生概率明显较小,具有更低的数据包平均端到端延迟,数据分组投递率也得到提高,体现出ATAR拥塞避免的策略优势较大,并且还观察到ATAR负载均衡程度也优于AODV,瓶颈节点承担的负载差异较AODV小54%.     

基于带宽估计的ad hoc网络拥塞控制机制

针对ad hoc网络提出了一种基于带宽估计的拥塞控制机制.该机制通过实时的监测无线节点链路的工作状态,来估计节点的可用带宽,从而获得节点的拥塞程度指标,根据包的类型进行拥塞控制.由于带宽估计不需要与其他节点进行状态信息交换,降低了系统开销.同时拥塞控制机制缓解了无线网络的拥塞状态,提高了网络性能.     

一种基于距离矢量的Ad Hoc网络拥塞适应路由协议

DSDV是一种基于距离矢量的Ad Hoc网络路由协议,该路由协议在网络负载较大的情况下,网络性能下降很快。本文对DSDV协议进行了改进,使之能实现拥塞感知和拥塞适应功能,提出了一种拥塞警告距离向量（congestion-aware distance vector, CADV）协议。基于NS-2的仿真结果显示,相比于DSDV和AODV,CADV在网络吞吐量和平均分组投递延时方面的性能有了明显的提高,受到节点移动速度变化的影响是最小的。     

无线传感器网络中基于拥塞程度分级的速率调节机制

文中提出一种基于拥塞程度分级的速率调节算法.首先,对缓冲区进行多尺度排队分析,计算出缓冲区的溢出概率.其次,根据溢出概率的值,把节点拥塞程度分成三级.最后,针对每一级拥塞采取相应的速率调节方案来缓解拥塞.实验结果表明,该算法可以有效缓解拥塞,提高无线传感器网络的数据包投递率.     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

DTN网络环境下基于蚁群算法的数据编码分发

提出了一种DTN多源多宿网络的数据编码分发机制(Data Dissemination Mechanism with Network Coding Based on Ant Colony Algorithm,DDM-NC).在发布/订阅机制的基础上,通过对主题数据的编码运算和传输,充分利用网络容量进行数据多播,使得数据传输具有更好的安全性和传输效率;同时,针对编码包洪泛传输过程中信息冗余大,无效投递较多等问题,设计了基于蚁群算法的编码包路由策略,引导编码包向信宿聚集,降低编码投递过程中的数据冗余,减少投递延迟.仿真实验表明,相比传统的DTN传染病路由策略和随机网络编码传输方法,DDM-NC方法有更好的数据投递性能.     

Link failure and congestion-aware reliable data delivery mechanism for mobile ad hoc networks

Link failures and packet drops due to congestion are two frequently occurring problems in mobile ad hoc networks, degrading the network performance significantly. In this paper, we propose a link failure and congestion-aware reliable data delivery (LCRDD) mechanism that jointly exploits local packet buffering and multilevel congestion detection and control approaches for increasing the data delivery performance. On the detection of link failure or congestive state, an LCRDD intermediate node buffers the incoming data packets at the transport layer queue and resumes transmission when the route is repaired locally. In addition, LCRDD’s multilevel congestion detection helps it to take the most appropriate action proactively. Thus, it offers increased reliability and throughput and decreased end-to-end packet delivery delay and routing overhead compared to state-of-the-art protocols, as shown in results of performance evaluations carried out in network simulator v-2.34.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

SEAD: A simple and efficient adaptive data dissemination protocol in vehicular ad-hoc networks

Vehicular ad-hoc network (VANET) is becoming a promising technology for improving the efficiency and the safety of intelligent transportation systems by deploying a wide variety of applications. Smart vehicles are expected to continuously exchange a huge amount of data either through safety or non-safety messages dedicated for road safety or infotainment and passenger comfort applications, respectively. One of the main challenges posed by the study of VANET is the data dissemination design by which messages have to be efficiently disseminated in a high vehicular speed, intermittent connectivity, and highly dynamic topology. In particular, broadcast mechanism should guarantee fast and reliable data delivery within a limited wireless bandwidth in order to fit the real time applications’ requirements. In this work, we propose a simple and efficient adaptive data dissemination protocol called “SEAD”. On the one hand, the originality of this work lies in its simplicity and efficiency regardless the application’s type. Simplicity is achieved through a beaconless strategy adopted to take into account the surrounding vehicles’ density. Thanks to a metric locally measured, each vehicle is able to dynamically define an appropriate probability of rebroadcast to mitigate the broadcast storm problem. Efficiency is manifested by reducing excessive retransmitted messages and hence promoting the network capacity and the transmission delay. The simulation results show that the proposed protocol offers very low packet drop ratio and network load while still maintaining a low end-to-end delay and a high packet delivery. On the other hand, SEAD protocol presents a robust data dissemination mechanism which is suitable either for safety applications or for other kinds of application. This mechanism is able to adapt the protocol performance in terms of packet delivery ratio to the application’s requirements.     

Performance analysis of data packet discarding in ATM networks

Data performance in ATM networks should be measured on the packet level instead of the cell level, since one or more cell losses within each packet is equivalent to the loss of the packet itself. Two packet-level control schemes, packet tail discarding and early packet discarding, were proposed to improve data performance. In this paper, a new stochastic modeling technique is developed for performance evaluation of two existing packet-discarding schemes at a single bottleneck node. We assume that the data arrival process is independent of the nodal congestion, which may represent the unspecified bit-rate traffic class in ATM networks, where no end-to-end feedback control mechanism is implemented. Through numerical study, we explore the effects of buffer capacity, control threshold, packet size, source access rate, underlying high-priority real-time traffic, and loading factor on data performance, and discuss their design tradeoffs. Our study shows that a network system can he entirely shut down in an overload period if no packet-discarding control scheme is implemented, under the assumption that there are no higher layer congestion avoidance schemes. Further, unless with sufficiently large buffer capacity, early packet discarding (EPD) always outperforms packet tail discarding (PTD) significantly under most renditions. Especially under the overload condition, EPD can always achieve about 100% goodput and 0% badput, whereas the PTD performance deteriorates rapidly. Among all the factors, the packet size has a dominant impact on EPD performance. The optimal selection of the EPD queue control threshold to achieve the maximum goodput is found to be relatively insensitive to traffic statistics     

OBS网络中的主动拥塞控制策略研究及性能分析

根据光突发交换(Optical Burst Switching--OBS)网络的结构和特点,分析了其核心节点在数据信道调度发生拥塞时拥塞控制策略的缺陷,提出了OBS网络中一种主动拥塞控制策略(ACC),详细讨论了该策略的具体实现过程.通过仿真验证,在OBS网络中采用该算法能减少突发数据包的丢包率,从而达到改善整个OBS网络性能的目的.     

Energy Efficient Reliable Multi-path Data Transmission in WSN for Healthcare Application

In healthcare applications of WSN, the data loss due to congestion may cause death alarm for a patient in critical condition. Therefore, an efficient congestion avoidance or otherwise an efficient congestion control mechanism is required. In this paper, we present an energy efficient reliable multi-path data transmission protocol for reliable data transport over WSN for the health care application. The emergency data and sensitive data packets are transmitted through an alternate path having minimum correlation with transmission interference during congestion. The proposed protocol attempts to avoid congestion by computing the probability of congestion at the intermediate nodes and transmission rate at the intermediate node is adjusted. The buffer of each node is partitioned to support fair and efficient data delivery. The reliability of the proposed protocol is achieved through hop-by-hop loss recovery and acknowledgement. The performance of the proposed protocol is evaluated through extensive simulations. The simulation results reveal that it outperforms the existing congestion control protocols for healthcare application in terms of energy efficiency, reliability and end-to-end delivery ratio.     

Compressive sensing based data gathering algorithm over unreliable links in WSN

To solve the problem that the ubiquitous unreliable links in the WSN influence the performance of the compressive sensing (CS) based data gathering,first the relationship between the reconstruction SNR of CS-based data gathering algorithm and the bit-error-ratio (BER) were simulated quantitatively.Then classify two cases were classified,namely light-payload and heavy-payload,relying on the analysis of wireless link packet loss characteristics.The random packet loss model was conceived to describe the packet loss under light-payload scenario.Further the neighbor topology spatial correlation prediction-based CS data gathering (CS-NTSC) algorithm was proposed,which utilized the nodes spatial correlation to reduce the impact of error.Additionally,the node pseudo-failure model was conceived to describe the packet loss occurred in network congestion,and then the sparse schedule-aided CS data gathering (CS-SSDG) algorithm were conceived,for the purpose of changing the sparsity of measurement matrix and avoiding measurements amongst the nodes affected by unreliable links,thus weakening the impact of error/loss on data reconstruction.Simulation analysis indicates that the proposed algorithms are not only capable of improving the accuracy of the data reconstruction without extra energy,but also effectively reducing the impact affected by the unreliable links imposed on CS-based data gathering.     

信道公平分配的局部拥塞控制算法

提出基于信道公平分配的局部拥塞控制算法FCA(fair channel allocation),在缓解局部拥塞的同时增强信道分配的公平性。为减少获取邻居节点实时缓存信息的通信开销和提高以单一节点缓存是否溢出为检测模型的准确性,FCA采用以节点实时缓存长度预测为基础的邻居节点缓存总长度和分组平均传输延迟作为检测指标的拥塞检测模型。为避免使用独立拥塞通告消息增加信道负载,FCA采用在ACK控制帧中增加一个节点地址位携带拥塞信息。在去拥塞阶段,FCA采用基于实时缓存长度和队列优先权值的信道分配机制保证公平传输和防止部分节点因缓存增速过快导致溢出分组丢失。实验结果表明,FCA在碰撞次数、分组传递率、吞吐量和公平性等方面相比802.11、CODA和PCCP具有显著优势。     

A novel adaptive traffic prediction AQM algorithm

In the Internet, network congestion is becoming an intractable problem. Congestion results in longer delay, drastic jitter and excessive packet losses. As a result, quality of service (QoS) of networks deteriorates, and then the quality of experience (QoE) perceived by end users will not be satisfied. As a powerful supplement of transport layer (i.e. TCP) congestion control, active queue management (AQM) compensates the deficiency of TCP in congestion control. In this paper, a novel adaptive traffic prediction AQM (ATPAQM) algorithm is proposed. ATPAQM operates in two granularities. In coarse granularity, on one hand, it adopts an improved Kalman filtering model to predict traffic; on the other hand, it calculates average packet loss ratio (PLR) every prediction interval. In fine granularity, upon receiving a packet, it regulates packet dropping probability according to the calculated average PLR. Simulation results show that ATPAQM algorithm outperforms other algorithms in queue stability, packet loss ratio and link utilization.