Hierarchical Tree Alternative Path (HTAP) algorithm for congestion control in wireless sensor networks

Recent advances in wireless sensor networks (WSNs) have lead to applications with increased traffic demands. Research is evolving from applications where performance is not considered as a crucial factor, to applications where performance is a critical factor. There are many cases in the fields of automation, health monitoring, and disaster response that demand wireless sensor networks where performance assurances are vital, especially for parameters like power, delay, and reliability. Due to the nature of these networks the higher amount of traffic is observed when the monitored event takes place. Exactly at this instance, there is a higher probability of congestion appearance in the network. Congestion in WSNs is tackled by the employment of two methods: either by reducing the load (“traffic control”), or by increasing the resources (“resource control”). In this paper we present the Hierarchical Tree Alternative Path (HTAP) algorithm, a “resource control” algorithm that attempts, through simple steps and minor computations, to mitigate congestion in wireless sensor networks by creating dynamic alternative paths to the sink. HTAP is evaluated in several scenarios in comparison with another “resource control” algorithm (TARA), as well as with a “traffic control” algorithm (SenTCP), and also the case where no congestion control exists in the network (“no CC”). Results show that HTAP is a simple and efficient algorithm capable of dealing successfully with congestion in WSNs, while preserving the performance characteristics of the network.     

一种基于分组丢失率测量的差错容忍式拥塞控制算法

空间通信的TCP大多数是基于Vegas算法,该算法需要对往返时延进行较为精确的测量,这在具有极长且可变时延的信道特征的深空通信环境中很难实现。提出一种基于分组丢失率测量的差错容忍式拥塞控制算法,该算法采用数据块的形式发送数据,依据历史数据设定差错容忍度,利用分组丢失率测量值进行拥塞状态判断及发送窗口大小调整,从而使用较小的开销达到较高的传输效率。最后,利用数学建模方法,证明基于分组丢失率测量的差错容忍式拥塞控制算法的吞吐量比传统TCP的Tahoe算法提高34%,比Reno算法提高22%。     

Adaptive Load-Aware Congestion Control Protocol for Wireless Sensor Networks

Congestion control in wireless sensor networks (WSNs) is crucial. In this article, we discuss congestion control and the adaptive load-aware problem for sensor nodes in WSNs. When the traffic load of a specific node exceeds its the available capacity of the node, a congestion problem occurs because of buffer memory overflow. Congestion may cause serious problems such as packet loss, the consumption of power, and low network throughput for sensor nodes. To address these problems, we propose a distributed congestion control protocol called adaptive load-aware congestion control protocol (ALACCP). The protocol can adaptively allocate the appropriate forwarding rate for jammed sensor nodes to mitigate the congestion load. Through the buffer management mechanism, the congestion index of neighboring sensor nodes, and an adjustment of the adaptive forwarding rate, the degree of congestion is alleviated markedly. The performance in allocating the forwarding rate effectively to neighboring sensor nodes also improves. The ALACCP can avoid packet loss because of traffic congestion, reduce the power consumption of nodes, and improve the network throughput. Simulation results revealed that the proposed ALACCP can effectively improve network performance and maintain the fairness of networks.     

Performance analysis of congestion avoidance algorithms with non‐zero MCR guarantee for ABR service in ATM networks

This paper proposes a novel explicit rate allocation algorithm called Fast Rate Allocation Congestion Avoidance (FRACA) algorithm supporting non‐zero minimum cell rate (MCR). The non‐zero MCR guarantee strategy for ABR service in ATM networks focused in this paper is MCR plus equal share (The ATM Forum Traffic Management Specification, version 4.0. April 1996). The main goals for designing the algorithm are the fast convergence according to the max–min fairness criteria, fairness among all sessions, maximum network utilization while the switch queue length is properly controlled. At the same time, it should work well under a wide range of network conditions without the need for adjusting the algorithm parameters. The performance of the proposed algorithm is evaluated and compared with the Generic Weighted Fairness (GWF) ERICA + (J Comput Comm 2000; 149). Simulation results show that the proposed algorithm achieves the design goals in the evaluated scenarios. Copyright © 2004 John Wiley & Sons, Ltd.     

RELD, RTT ECN Loss Differentiation to optimize the performance of transport protocols on wireless networks

One major yet unsolved problem in wired-cum-wireless networks is the classification of losses, which might result from wireless temporary interferences or from network congestion. The transport protocol response to losses should be different for these two cases. If the transmission uses existing protocols like TCP, the losses are always classified as congestion losses by sender, causing reduced throughput. In wired networks, ECN (Explicit Congestion Notification) can be used to control the congestion through active queue management such as RED (Random Early Detection). It can also be used to solve the transport protocol misreaction over wireless networks. This paper proposes a loss differentiation method (RELD), based on ECN signaling and RTT (Round Trip Time), and applied to TCPlike. TCPlike is one of the three current congestion controls present in the new transport protocol DCCP (Datagram Congestion Control Protocol). Our simulations, using a more realistic simulated loss error model for wireless networks, show that RELD optimizes congestion control and therefore increases the performance of transport protocols over wireless networks, leading to an average performance gain ranging from 10% to 15%.     

Performance analysis of SS7 congestion controls under sustainedoverload

Congestion controls are a key factor in achieving the robust performance required of common channel signaling (CCS) networks in the face of partial network failures and extreme traffic loads, especially as networks become large and carry high traffic volume. The CCITT recommendations define a number of types of congestion control, and the parameters of the controls must be well set in order to ensure their efficacy under transient and sustained signalling network overload. The objective of this paper is to present a modeling approach to the determination of the network parameters that govern the performance of the SS7 congestion controls under sustained overload. Results of the investigation by simulation are presented and discussed     

OBS网络中基于拥塞避免的提前偏射路由研究

突发竞争是OBS(光突发交换)网络需要解决的关键问题,偏射路由作为一种有效的竞争解决方案而被广泛研究。文章提出了一种基于拥塞避免的提前偏射路由算法,利用周期性反馈的网络拥塞信息按一定概率提前偏射部分突发包。与传统的最短偏射路由算法相比,本算法达到了避免拥塞以及均衡网络负载的目的。仿真结果表明:文章所提算法在突发丢失率、吞吐量以及平均链路利用率方面性能都有所提高。     

The DDTCI switch algorithm for ABR traffic control in ATM networks

For the issue of flow control for Available Bit Rate (ABR) traffic in ATM network,a new improved Explicit Rate (ER) algorithm named Dynamic Double Threshold Congestion Indication (DDTCI) algorithm is presented based on the Explicit Forward Congestion Indication (EFCI) Current Cell Rate (CCR) algorithm and Relative Rate (RR) algorithm. Different from the early ER algorithm, both the high-level and the low-level threshold is dynamically changing according to the state of the bottleneck node. We determinate the congestion state with the information of the two dynamic threshold, and control the cell rate of the source by feed back mechanism. Except for the well performance in both link utilization and fairness in distribution of available bandwidth, the improved algorithm can alleviate the fluctuation of sending rate dramatically. The mechanism is modeled by a fluid model, and the useful expressions are derived.Simulation results show up our conclusion.     

TCP-Peach: a new congestion control scheme for satellite IPnetworks

Current TCP protocols have lower throughput performance in satellite networks mainly due to the effects of long propagation delays and high link error rates. In this paper, a new congestion control scheme called TCP-Peach is introduced for satellite networks. TCP-Peach is composed of two new algorithms, namely Sudden Start and Rapid Recovery, as well as the two traditional TCP algorithms, Congestion Avoidance and Fast Retransmit. The new algorithms are based on the novel concept of using dummy segments to probe the availability of network resources without carrying any new information to the sender. Dummy segments are treated as low-priority segments and accordingly they do not effect the delivery of actual data traffic. Simulation experiments show that TCP-Peach outperforms other TCP schemes for satellite networks in terms of goodput. It also provides a fair share of network resources     

A new distributed congestion control mechanism for networks on chip

Congestion is an important issue in networks and significantly affects network performance. Various congestion control mechanisms have been proposed for the Internet, interconnection networks, etc. However, they are not suitable for network–on-chip systems. Based on the requirements of chip designs, we propose a new distributed congestion control mechanism for network–on-chip systems in this paper. The mechanism uses a new detection metric, the length of the occupied source buffer, to detect network congestion. The new metric is more accurate compared with others. Using the new metric, the congestion information can be directly obtained inside a node. This allows the mechanism to be fully distributed and without requiring any global information. In addition, the presence of real time traffic is considered. Throttling is not required for such traffic to provide QoS. An asymmetric router architecture with additional congestion control unit is also proposed to facilitate the implementation of the new congestion control mechanism. The overhead is relatively low, about 1.79% overhead in area and 2.06 mW in power consumption. The simulations are carried out in OPNET. The results show that our congestion control mechanism alleviates performance degradation for loads beyond saturation, and maintains adequate levels of throughput at higher loads. The new mechanism achieves better network performance than others under different traffic patterns and network sizes.     

A Real-Time Monitoring and Intelligent Decisions-Making Platform for Enhanced Radio Resource Management in Wireless Cellular Systems

Congestion management in cellular networks is of prime importance for the mobile network operators of present and future generations. Nowadays cellular operators utilize improved planning techniques for enhanced capacity management, but on the other hand the number of mobile subscribers rapidly increases and additionally, new data-technologies for wireless access add extra traffic to the already overloaded networks, often causing serious problems to their performance. In this paper, we present a resource management system for increasing the efficiency of 2G and 2.5G cellular networks especially during overloading periods through the introduction of innovative extra elements. For validating the system's behavior, a set of trials have been performed focusing on alleviating both voice and data congestion problems. The results of these trials show important improvements on the network's capacity availability when the presented system intervenes.     

Lightpath Rerouting Algorithm to enhance blocking performance in all-optical WDM network without wavelength conversion

In this paper, we have proposed an efficient wavelength rerouting algorithm for dynamic provisioning of lightpath. In wavelength-division multiplexed (WDM) networks rerouting of lightpath can be used to improve throughput and to reduce blocking probability. We have proposed a Lightpath Rerouting Algorithm (LRRA) for dynamic traffic in WDM optical networks. The results have shown that LRRA can improve blocking performance of the network. In this paper, low complexity algorithm has been developed which is used for the calculation of blocking probability of network. The proposed algorithm has also been applied on the realistic network such as NSFnet for calculation and optimization of blocking probability of the network. The results have also shown that the proposed algorithm can be implemented to huge networks for good blocking performance of the network.     

前向主动网络拥塞控制算法及其性能分析

本文提出了一种基于主动式网络(Active Networks)技术的拥塞控制算法FACC(Forward Active Networks Congestion Control).与传统的TCP(Transport Control Protocol)相比,FACC算法通过在网络结点直接提供拥塞检测和拥塞控制机制,大大缩短源端点的拥塞反应时间,从本质上提高了网络拥塞检测和控制的性能,从而提高了终端用户的平均吞吐量.文中还利用计算机仿真研究了FACC算法在各种网络条件下的性能,并与传统的Tahoe,Reno,NewReno及SACK TCP协议做了对比.结果表明无论网络中存不存在非受控数据流时,FACC控制算法均能明显地提高用户终端的平均吞吐量,并且由于采用FACC控制算法而增加的网络结点运算迟延也很小.     

无线传感器网络突发感知的拥塞控制协议(英文)

In monitoring Wireless Sensor Networks(WSNs),the traffic usually has bursty characteristics when an event occurs.Transient congestion would increase delay and packet loss rate severely,which greatly reduces network performance.To solve this problem,we propose a Burstiness-aware Congestion Control Protocol(BCCP) for wireless sensor networks.In BCCP,the backoff delay is adopted as a congestion indication.Normally,sensor nodes work on contention-based MAC protocol(such as CSMA/CA).However,when congestion occur...     

A low complexity mechanism for congestion notification in rural IPSec‐enabled heterogeneous backhaul networks

Management in wireless backhaul networks is a challenging task, especially in rural and isolated environments. In these scenarios, the backhaul network usually consists of a set of heterogeneous wireless links that provide limited and variable bandwidth to the access networks, often 3G/4G small cells. Because of the highly constrained nature of this type of backhaul network, intelligent and joint management in both the backhaul network and the access network is crucial in order to avoid performance degradation caused by traffic congestion. In order to avoid the saturation in the backhaul network, access networks should consider the backhaul state when taking decisions in the admission control and scheduling procedures. However, no standardized mechanisms currently exist for sharing management information between both networks. In this work, we propose to use the Explicit Congestion Notification (ECN) bit in the outer IP headers present in the Iuh 3GPP IPSec‐enabled interfaces in order to notify the backhaul congestion state to the access network. We analyze for the referred scenario, compatibility and security details, validating our approach by running numerically simulations and implementing the notification mechanism. Our low complexity approach offers 2% accuracy and backhaul update latency lower than 10 ms during 80% of the time, which makes the solution appropriate for admission control and scheduling intervals in small cells.     

TCP CERL+: revisiting TCP congestion control in wireless networks with random loss

Wireless Networks - In this paper, we analyze the performance of wireless networks subject to random loss. In this regard, we revisit our TCP Congestion Control Enhancement for Random Loss (CERL)...     

A Prioritization Based Congestion Control Protocol for Healthcare Monitoring Application in Wireless Sensor Networks

Recent developments in biosensor and wireless technology have led to a rapid progress in wearable real time health monitoring. Unlike wired networks, wireless networks are subject to more packet loss and congestion. In this paper, we propose a congestion control and service prioritization protocol for real time monitoring of patients’ vital signs using wireless biomedical sensor networks. The proposed system is able to discriminate between physiological signals and assign them different priorities. Thus, it would be possible to provide a better quality of service for transmitting highly important vital signs. Congestion control is performed by considering both the congestion situation in the parent node and the priority of the child nodes in assigning network bandwidth to signals from different patients. Given the dynamic nature of patients’ health conditions, the proposed system can detect an anomaly in the received vital signs from a patient and hence assign more priority to patients in need. Simulation results confirm the superior performance of the proposed protocol. To our knowledge, this is the first attempt at a special-purpose congestion control protocol specifically designed for wireless biosensor networks.     

Enhanced performance based on cross-layer design from physical to transport layers for multihop wireless networks

This paper puts forward a novel cognitive cross-layer design algorithms for multihop wireless networks optimization across physical,mediam access control(MAC),network and transport layers.As is well known,the conventional layered-protocol architecture can not provide optimal performance for wireless networks,and cross-layer design is becoming increasingly important for improving the performance of wireless networks.In this study,we formulate a specific network utility maximization(NUM)problem that we believe is appropriate for multihop wireless networks.By using the dual algorithm,the NUM problem has been optimal decomposed and solved with a novel distributed cross-layer design algorithm from physical to transport layers.Our solution enjoys the benefits of cross-layer optimization while maintaining the simplicity and modularity of the traditional layered architecture.The proposed cross-layer design can guarantee the end-to-end goals of data flows while fully utilizing network resources.Computer simulations have evaluated an enhanced performance of the proposed algorithm at both average source rate and network throughput.Meanwhile,the proposed algorithm has low implementation complexity for practical reality.     

Adaptive device-to-device communication using Wi-Fi Direct in smart cities

Wi-Fi Direct has become vastly popular in the last few years. Due to its fast network setup and the provision of high transmission rates, it is expected to be the piggyback technology for high speed device-to-device communications in smart cities. The increasing demand on Wi-Fi Direct networks and its co-location in the same band with other Wi-Fi ad-hoc and infrastructure networks have entailed the need for developing new adaptive techniques to utilize the wireless spectrum efficiently. In this paper, we introduce, analyze and implement a self-organizing algorithm designed specifically for pop-up Wi-Fi Direct networks. The algorithm dynamically changes the operating channels of pop-up Wi-Fi Direct networks according to their performance in a non-cooperative manner. It utilizes the spectrum efficiently, reduces congestion and enhances performance. Moreover, the modified Wi-Fi Direct network running the proposed algorithm is interoperable with all other Wi-Fi network modes and setups and does not affect their functionalities. On the contrary, it enhances their performance implicitly. We implement the algorithm using the driver of RTL8188CUS chipset in a Linux environment and conduct experiments to evaluate its performance. The obtained results illustrate the benefits of using the proposed algorithm.