Coap based Congestion Control Mechanism For Low Power Iot Networks

Internet of Things has billions of connected devices into internet. CoAP is a Constrained Protocol used in application layer of IoT Protocol Stack. CoAP is running on top of User Datagram Protocol (UDP), which means that, there is no possibility of congestion control in it, so CoAP is responsible for Congestion control mechanism. UDP has no knowledge on congestion control. IoT has significant resource constraint, due to this there are lots of design challenges in IoT network. This paper proposes a simple change in the CoAP protocol named CoCoA (CoAP Simple Congestion Control / Advance). CoCoA introduces novel Round Trip Time (RTT), VBF (Variable Back off Factor) and aging mechanism to calculate the dynamic and controlled Retransmission Time Out (RTO) for IoT Networks. This paper compared with the existing all the congestion control mechanism and the implementation result shows that the proposed mechanism is better than the existing mechanism in terms of throughput, power consumption, memory foot print and fairness index.

Download Full-text

A Dynamic Approach to Estimate Receiving Bandwidth for WebRTC

International Journal of Multimedia Data Engineering and Management ◽

10.4018/ijmdem.2016070102 ◽

2016 ◽

Vol 7 (3) ◽

pp. 17-33

Author(s):

Razib Iqbal ◽

Shervin Shirmohammadi ◽

Rasha Atwah

Keyword(s):

Congestion Control ◽

Real Time ◽

Control Mechanism ◽

Task Force ◽

Round Trip Time ◽

Round Trip ◽

Dynamic Approach ◽

Trip Time ◽

Proposed Model ◽

Congestion Control Mechanism

Web Real-Time Communication (WebRTC), drafted by the World Wide Web Consortium (W3C) and Internet Engineering Task Force (IETF), enables direct browser-to-browser real-time communication. As its congestion control mechanism, WebRTC uses the Google Congestion Control (GCC) algorithm. But using GCC will limit WebRTC's performance in cases of overusing due to using a fixed decreasing factor, known as alpha (a). In this paper, the authors propose a dynamic alpha model to reduce the receiving bandwidth estimate during overuse as indicated by the overuse detector. Using their proposed model, the receiver can more efficiently estimate its receiving rate in case of overuse. They implemented their model over both unconstrained and constrained networks. Experimental results show noticeable improvements in terms of higher incoming rate, lower Round-Trip Time, and lower packet loss compared to the fixed alpha model.

Download Full-text

An Improved Adaptive CoAP Congestion Control Algorithm

International Journal of Online and Biomedical Engineering (iJOE) ◽

10.3991/ijoe.v15i03.9122 ◽

2019 ◽

Vol 15 (03) ◽

pp. 96 ◽

Cited By ~ 2

Author(s):

Fathia Ouakasse ◽

Said Rakrak

Keyword(s):

Congestion Control ◽

Control Algorithm ◽

Network Resources ◽

Analysis And Evaluation ◽

Trip Time ◽

Time Out ◽

Congestion Control Algorithm ◽

Network Operation ◽

Congestion Control Mechanism ◽

Do So

<p class="0abstract"><span lang="EN-US">The Constrained Application Protocol (CoAP) is one of the most emerging messaging protocols that have successfully fulfilled the need of the lightweight feature required to handle communication between constrained devices in IoT environment. However, these devices are generating a huge amount of messages and notifications which cause the network congestion. Then, the challenge addressed in this paper; consists of designing a suitable congestion control mechanism for CoAP that ensures a safe network operation while keeping the use of network resources efficient. To do so, this paper presents an improved congestion control algorithm for the estimation of a Retransmission Time Out (RTO) value to use in each transaction based on the packet loss ratio and the Round-Trip Time RTT of the previous transmission. A comprehensive analysis and evaluation of simulated results show that the proposed mechanism can appropriately achieve higher performance compared to the basic CoAP congestion control and alternative algorithms based on TCP.</span></p>

Download Full-text

Buffer requirements for ABR traffic using congestion control mechanism

1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305) ◽

10.1109/pccc.1999.749446 ◽

1999 ◽

Cited By ~ 2

Author(s):

E.S. Atieh ◽

M.M. Matalgah ◽

M.M. Guizani

Keyword(s):

Congestion Control ◽

Control Mechanism ◽

Congestion Control Mechanism

Download Full-text

Analysis of Congestion Control Mechanism for IOT

2020 10th International Conference on Cloud Computing, Data Science & Engineering (Confluence) ◽

10.1109/confluence47617.2020.9058058 ◽

2020 ◽

Author(s):

Aastha Maheshwari ◽

Rajesh Kumar Yadav

Keyword(s):

Congestion Control ◽

Control Mechanism ◽

Congestion Control Mechanism

Download Full-text

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.519-520.1239 ◽

2014 ◽

Vol 519-520 ◽

pp. 1239-1242

Author(s):

Xiao Hu Yu

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Congestion Control ◽

Mobile Agent ◽

Mobile Agents ◽

Control Mechanism ◽

Wireless Sensor ◽

Delivery Ratio ◽

Routing Table ◽

Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Download Full-text

An Extended Throughput Model of SCTP with Scalab Congestion Control

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.219-220.1656 ◽

2011 ◽

Vol 219-220 ◽

pp. 1656-1659

Author(s):

Chang Hua Liu ◽

Cao Yuan

Keyword(s):

Congestion Control ◽

Analytical Model ◽

Control Mechanism ◽

Transmission Protocol ◽

Local Networks ◽

Ip Address ◽

Stream Control Transmission Protocol ◽

Throughput Model ◽

Stream Control ◽

Congestion Control Mechanism

The technologies of Wireless local networks and cellular network are very popular and more and more service under the integrated heterogeneous environment. Stream Control Transmission Protocol (SCTP) is considered as an ideal to support the communication between them by enabling a mobile client to freely switch the IP address in different networks. In this paper, we propose an extended analytical model for SCTP which consider the congestion window and scalable of congestion control mechanism. A great advantage of our model is that establishing a relationship between the throughput and congestion control mechanism. Furthermore, the analytical model provides a useful tool to improve congestion control mechanism of SCTP.

Download Full-text