scholarly journals Congestion Control in CoAP Observe Group Communication

Sensors ◽  
2019 ◽  
Vol 19 (15) ◽  
pp. 3433 ◽  
Author(s):  
Suwannapong ◽  
Khunboa
Keyword(s):  
Early Detection ◽  
Congestion Control ◽  
Control Mechanism ◽  
Group Communication ◽  
Task Force ◽  
Buffer Overflow ◽  
The Internet ◽  
Random Early Detection ◽  
Lossy Networks ◽  
Congestion Control Mechanism

The Constrained Application Protocol (CoAP) is a simple and lightweight machine-to-machine (M2M) protocol for constrained devices for use in lossy networks which offers a small memory capacity and limited processing. Designed and developed by the Internet Engineering Task Force (IETF), it functions as an application layer protocol and benefits from reliable delivery and simple congestion control. It is implemented for request/response message exchanges over the User Datagram Protocol (UDP) to support the Internet of Things (IoT). CoAP also provides a basic congestion control mechanism. In dealing with its own congestion, it relies on a fixed interval retransmission timeout (RTO) and binary exponential backoff (BEB). However, the default CoAP congestion control is considered to be unable to effectively perform group communication and observe resources, and it cannot handle rapid, frequent requests. This results in buffer overflow and packet loss. To overcome these problems, we proposed a new congestion control mechanism for CoAP Observe Group Communication, namely Congestion Control Random Early Detection (CoCo-RED), consisting of (1) determining and calculating an RTO timer, (2) a Revised Random Early Detection (RevRED) algorithm which has recently been developed and primarily based on the buffer management of TCP congestion control, and (3) a Fibonacci Pre-Increment Backoff (FPB) algorithm which waits for backoff time prior to retransmission. All the aforementioned algorithms were therefore implemented instead of the default CoAP mechanism. In this study, evaluations were carried out regarding the efficiency of the developed CoCo-RED using a Cooja simulator. The congestion control mechanism can quickly handle the changing behaviors of network communication, and thus it prevents the buffer overflow that leads to congestions. The results of our experiments indicate that CoCo-RED can control congestion more effectively than the default CoAP in every condition.

Active Queue Management

2008 ◽  
pp. 1-6
Author(s):  
Michele Mara de Araújo Espíndula Lima ◽  
Nelson Luís Saldanha da Fonseca
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Active Queue Management ◽  
Queue Management ◽  
End To End ◽  
Unresponsive Flows ◽  
Congestion Control Mechanism

Although powerful and necessary to prevent network collapse, the congestion control mechanism of the TCP is not sufficient to avoid congestion. Since TCP sources exert a limited control of the network, and unresponsive flows, which do not slow down their sending rates when congestion occurs, may be present, the efficacy of end-to-end congestion control also relies on queue mechanisms at the routers.

scholarly journals MACRE: a Novel Distributed Congestion Control Algorithm in DTN

2011 ◽  
Vol 1 ◽  
pp. 71-75 ◽  
Author(s):  
Ying An ◽  
Xi Luo
Keyword(s):  
Congestion Control ◽  
Routing Protocols ◽  
Control Algorithm ◽  
Network Performance ◽  
Control Mechanism ◽  
Local Information ◽  
Global Information ◽  
Congestion Control Algorithm ◽  
End To End ◽  
Congestion Control Mechanism

Congestion control is a very important problem which can affect network performance directly. However, owing to the lack of steady end-to-end connection and high latency, the traditional congestion control mechanism based on end-to-end feedback is not feasible in DTN. Because obtaining the global information of network is difficult, the congestion control decisions should be made autonomously with local information only. We propose a novel distributed congestion control algorithm based on epidemic routing protocols----MACRE (Message Admission Control based on Rate Estimation). Preliminary experimental results show that this congestion control mechanism can improve the network performance efficiently.

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

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.

Sign in / Sign up

Export Citation Format

Share Document