Route Aware Predictive Congestion Control Protocol for Wireless Sensor Networks

Congestion in wireless sensor networks (WSN) may lead to packet losses or delayed delivery of important information rendering the WSN-based monitoring or control system useless. In this paper a routing-aware predictive congestion control (RPCC) yet decentralized scheme for WSN is presented that uses a combination of a hop by hop congestion control mechanism to maintain desired level of buffer occupancy, and a dynamic routing scheme that works in concert with the congestion control mechanism to forward the packets through less congested nodes. The proposed adaptive approach restricts the incoming traffic thus preventing buffer overflow while maintaining the rate through an adaptive back-off interval selection scheme. In addition, the optimal routing scheme diverts traffic from congested nodes through alternative paths in order to balance the load in the network, alleviating congestion. This load balancing of the routes will even out the congestion level throughout the network thus increasing throughput and reducing end to end delay. Closed-loop stability of the proposed hop-by-hop congestion control is demonstrated by using the Lyapunov-based approach. Simulation results show that the proposed scheme results in reduced end-to-end delays

Predictive Congestion Control Protocol for Wireless Sensor Networks

Available congestion control schemes, for example transport control protocol (TCP), when applied to wireless networks, result in a large number of packet drops, unfair scenarios and low throughputs with a significant amount of wasted energy due to retransmissions. To fully utilize the hop by hop feedback information, this paper presents a novel, decentralized, predictive congestion control (DPCC) for wireless sensor networks (WSN). The DPCC consists of an adaptive flow and adaptive back-off interval selection schemes that work in concert with energy efficient, distributed power control (DPC). The DPCC detects the onset of congestion using queue utilization and the embedded channel estimator algorithm in DPC that predicts the channel quality. Then, an adaptive flow control scheme selects suitable rate which is enforced by the newly proposed adaptive backoff interval selection scheme. An optional adaptive scheduling scheme updates weights associated with each packet to guarantee the weighted fairness during congestion. Closed-loop stability of the proposed hop-by-hop congestion control is demonstrated by using the Lyapunov-based approach. Simulation results show that the DPCC reduces congestion and improves performance over congestion detection and avoidance (CODA) [3] and IEEE 802.11 protocols

A hybrid rate control mechanism for forwarding and congestion control in named data network

Named Data Networking (NDN) is an emerging Internet architecture that employs a pull-based, in-path caching, hop-by-hop, and multi-path transport architecture. Therefore, transport algorithms which use conventional paradigms would not work correctly in the NDN environment, since the content source location frequently changes. These changes raise forwarding and congestion control problems, and they directly affect the link utilization, fairness, and stability of the network. This study proposes a Hybrid Rate Control Mechanism (HRCM) to control the forwarding rate and link congestion to enhance network scalability, stability, and fairness performance. HRCM consists of three schemes namely Shaping Deficit Weight Round Robin (SDWRR), Queue-delay Parallel Multipath (QPM), and Explicit Control Agile-based conservative window adaptation (EC-Agile). The SDWRR scheme is scheduling different flows in router interfaces by fairly detecting and notifying the link congestion. The QPM scheme has been designed to forward Interest packets to all available paths that utilize idle bandwidths. The EC-Agile scheme controls forwarding rates by examining each packet received. The proposed HRCM was evaluated by comparing it with two different mechanisms, namely Practical Congestion Control (PCON) and Hop-by-hop Interest Shaping (HIS) through ndnSIM simulation. The findings show that HRCM enhances the forwarding rate and fairness. HRCM outperforms HIS and PCON in terms of throughput by 75%, delay 20%, queue length 55%, link utilization 41%, fairness 20%, and download time 20%. The proposed HRCM contributes to providing an enhanced forwarding rate and fairness in NDN with different types of traffic flow. Thus, the SDWRR, QPM, and EC-Agile schemes can be used in monitoring, controlling, and managing congestion and forwarding for the Internet of the future

A Proposal for Congestion Control in Multi -Hop Mobile Ad Hoc Networks Using Cross -Layer Based TCP Protocol Approach

Abstract A Cross -Layer based approach for the improvement of TCP performance in Multi -Hop Mobile Ad Hoc Networks is proposed in this paper. The proposed congestion triggering mechanism triggers congestion whenever the Channel Occupied Ratio reaches a maximum threshold value and the received signal strength is less than a minimum threshold value. Then, the Congestion Control scheme controls the data sending rate of the sender by determining available bandwidth, delay of its link and COR. Further, a fair resource allocation scheme is put forwarded

A priority-based energy efficient multi-hop routing protocol with congestion control for wireless body area network

Wireless Body Area Networks (WBANs) are advanced and integrated monitoring networks for healthcare applications. In these networks, different types of Biomedical Sensor Nodes (BSNs) are used to monitor physiological parameters of the human body. The BSNs have limited resources such as energy, memory and computation power. These limited resources make the network challenging especially in terms of energy consumption. Efficient routing schemes are required to save the energy during communication processes. Additionally, the BSNs generate sensitive and non-sensitive data packets, which need to be routed according to their priority. In order to address these problems, a priority-based Energy Efficient Multihop Routing protocol with congestion control (3EMR) for wireless body area network was developed that comprises of three different schemes. First, an Optimal Next-hop Selection (ONS) scheme was developed based on the cost function of routing parameters to dynamically select best next-hop for forwarding data packets. Second, a Priority Based Routing (PBR) scheme was developed to forward data packets according to data priority, which is based on sensitivity of the data with regards to patience’s life. Third, a Congestion Avoidance and Mitigation (CAM) scheme was developed to save energy consumption and packet loss due to congestion by considering packet flow adjustment and congestion zone avoidance based strategy. It improvement is benchmarked against related solutions, and they are Healthcare-aware Optimized Congestion Avoidance (HOCA), Differentiated Rate control for Congestion (DRC), Priority based Cross Layer Routing (PCLR), Even Energy-consumption and Backside Routing (EEBR), and Energy Efficient Routing (EER) scheme. The simulation results demonstrated that the 3EMR scheme achieved significant improvement in terms of increased network lifetime by 31.4%, increased throughput by 33.2%, reduced packet loss 30.9%, increased packet delivery ratio by 21.1% and reduced energy consumption 26.8%. Thus, the proposed routing scheme has proven to be an energy efficient solution for data communication in wireless body area networks

Internal Model Hop-by-hop Congestion Control for High-Speed Networks

This paper presents a hop-by-hop congestion control for highspeed networks. The control policy relies on the data exchange between adjacent nodes of the network (nearest-neighbour interaction). The novelty of this paper consists in the extensive use of Internal Model Control (IMC) to set the rates of the traffic flows. As a result, the proposed congestion control provides upper-bounds of the queue lengths in all the network buffers (overflow avoidance), avoids wasting the assigned capacity (full link utilisation) and guarantees the congestion recovery. Numerical simulations prove the effectiveness of the scheme