scholarly journals CARA: A Congestion-Aware Routing Algorithm for Wireless Sensor Networks

Algorithms ◽  
2021 ◽  
Vol 14 (7) ◽  
pp. 199
Author(s):  
Jiangyu Yan ◽  
Bing Qi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Routing Algorithm ◽  
Geographic Distance ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Local Network ◽  
Forward Rate ◽  
Congestion Aware

Congestion control is one of the key research topics in relation to the routing algorithms of wireless sensor networks (WSNs). In this paper, we propose a congestion-aware routing algorithm (CARA) for unlimited-lifetime wireless sensor networks by integrating the geographic distance and traffic load of sensor nodes. The algorithm takes alleviating congestion as the primary purpose and considers the traffic of the node itself and local network traffic. According to the geographic distance between nodes, CARA defines four decision parameters (node load factor, forward rate, cache remaining rate, and forward average cache remaining rate), selecting the best node as the next-hop through the multi-attribute decision-making method. Compared with the two existing algorithms for congestion control, our simulation results suggest that the CARA algorithm alleviates network congestion and meets reasonable network delay and energy consumption requirements.

Research of Hybrid Congestion Control Mechanism

2012 ◽  
Vol 426 ◽  
pp. 275-278
Author(s):  
Cheng Yu Lai ◽  
Xiao Guang Fu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Energy Saving ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Forward Rate ◽  
Control Mechanisms ◽  
Channel Quality ◽  
Congestion Control Mechanism

In wireless sensor networks, congestion causes overall channel quality to degrade and loss rates to raise, leads to buffer drops and increased delays, and tends to be grossly unfair toward nodes whose data has to traverse a larger number of radio hops. Hybrid congestion control mechanisms relieve the congestion by creating the new path; when establishment of a new path is failed, fairness aggregate mechanisms limits forward rate, ensures that each source node sends data fairly. Based on energy-saving, algorithms for mild congestion have been improved.

Implementation of Improved TOPSIS Method for Congestion Control in WSN

2021 ◽  
Vol 1 (2) ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Network Lifetime ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Topsis Method ◽  
Improved Performance

In wireless sensor networks, sensor nodes are limited in memory, battery power and computational power. Wireless Sensor Networks (WSN) are a specific category of wireless adhoc networks where their performance is highly affected by application, lifetime, storage capacity, topology changes and the communication medium and bandwidth. Whenever the traffic load in the network increases, buffer at a node becomes full and it cannot handle any more data packets. This causes packet loss and retransmission which affects delivery ratio, energy and decreases network lifetime. Congestion is an important issue in wireless networks. Congestion in WSN severely affects loss rate, channel quality, the number of retransmissions, traffic flow, network lifetime, delay, energy as well as throughput. The congestion can be resolved in WSN either by reducing the data rate or by increasing the resources to form alternative paths. In this paper, an Implementation of Improved TOPSIS Method for congestion control in WSN known as Improved Hierarchical tree Alternative path protocol has been proposed which provides an improved performance over the basic HTAP protocol.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document