A Weighted Assignment Approach Using Recommendation Routing for Congestion Control in Wireless Sensor Networks-WEAR
31 Mar 2020-Vol. 13, Iss: 2, pp 183-190
TL;DR: In this paper, a dynamic weight assignment scheme was proposed to suppress congestion in WSNs, where each sensor node transmits the data in accordance to the weight assigned to it, thus ensuring priority fairness and minimizing packet loss.
Abstract:
Congestion can happen in WSNs while congregating the information and sending it
towards the sink. It leads to increased packet delay, indiscriminate packet loss, severe fidelity degradation
and wasted node energy.
The aim of the proposed work is to suppress congestion using a dynamic weight assignment
scheme, where each sensor node transmits the data in accordance to the weight assigned to it, thus ensuring
priority fairness and minimizing packet loss. The proposed congestion control technique shall boost the
overall performance of the system by supporting assured delivery of high importance events to sinks.
Weights are assigned to each record based on two things, the delay in sending and receiving, and
the change in value of the variables passed by the nodes. If the difference in timestamp is below a threshold
(alpha) and the difference in the values is above a threshold (Beta), it gets a weight of W1, which is like a
high priority data record. Similarly, if the difference in timestamp is above a threshold (gamma) and the values
passed by the nodes have changed a negligible amount, that record is assigned a weight of W3, which is
the least priority.
From the analysis, it is inferred that proposed method had a higher throughput and the throughput
was equally distributed among all the participating nodes.
The proposed method endeavours to avoid congestion by implementing an effective queuing
mechanism to reinforce definitive wireless communication.
Citations
More filters
31 Mar 2020
2 citations
References
More filters
16 Jul 2001
TL;DR: This work proposes an adaptive rate control mechanism aiming to support media access control in sensor networks and finds that such a scheme is most effective in achieving the authors' fairness goal while being energy efficient for both low and high duty cycle of network traffic.
Abstract: We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile computing regime. Media access control in sensor networks must not only be energy efficient but should also allow fair bandwidth allocation to the infrastructure for all nodes in a multihop network. We propose an adaptive rate control mechanism aiming to support these two goals and find that such a scheme is most effective in achieving our fairness goal while being energy efficient for both low and high duty cycle of network traffic.
1,068 citations
05 Nov 2003
TL;DR: Simulation results indicate that CODA significantly improves the performance of data dissemination applications such as directed diffusion by mitigating hotspots, and reducing the energy tax with low fidelity penalty on sensing applications.
Abstract: Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these periods of event impulses that the likelihood of congestion is greatest and the information in transit of most importance to users. To address this challenge we propose an energy efficient congestion control scheme for sensor networks called CODA (COngestion Detection and Avoidance) that comprises three mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multi-source regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define two important performance metrics (i.e., energy tax and fidelity penalty) to evaluate the impact of CODA on the performance of sensing applications. We discuss the performance benefits and practical engineering challenges of implementing CODA in an experimental sensor network testbed based on Berkeley motes using CSMA. Simulation results indicate that CODA significantly improves the performance of data dissemination applications such as directed diffusion by mitigating hotspots, and reducing the energy tax with low fidelity penalty on sensing applications. We also demonstrate that CODA is capable of responding to a number of congestion scenarios that we believe will be prevalent as the deployment of these networks accelerates.
1,009 citations
TL;DR: It is demonstrated that PCCP achieves efficient congestion control and flexible weighted fairness for both single-path and multi-path routing, as a result this leads to higher energy efficiency and better QoS in terms of both packet loss rate and delay.
Abstract: Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive energy consumption. Therefore congestion in WSNs needs to be controlled in order to prolong system lifetime. In addition, this is also necessary to improve fairness and provide better quality of service (QoS), which is required by multimedia applications in wireless multimedia sensor networks. In this paper, we propose a novel upstream congestion control protocol for WSNs, called priority-based congestion control protocol (PCCP). Unlike existing work, PCCP innovatively measures congestion degree as the ratio of packet inter-arrival time along over packet service time. PCCP still introduced node priority index to reflect the importance of each sensor node. Based on the introduced congestion degree and node priority index, PCCP utilizes a cross-layer optimization and imposes a hop-by-hop approach to control congestion. We have demonstrated that PCCP achieves efficient congestion control and flexible weighted fairness for both single-path and multi-path routing, as a result this leads to higher energy efficiency and better QoS in terms of both packet loss rate and delay.
327 citations
TL;DR: A solution that sufficiently maintains energy efficiency and congestion control for energy-harvesting WSNs is presented and an optimizing routing algorithm based on congestion control (CCOR) is proposed.
Abstract: Along with the increasing demands for the applications running on the wireless sensor network (WSN), energy consumption and congestion become two main problems to be resolved urgently. However, in most scenes, these two problems aren't considered simultaneously. To address this issue, in this paper a solution that sufficiently maintains energy efficiency and congestion control for energy-harvesting WSNs is presented. We first construct a queuing network model to detect the congestion degree of nodes. Then with the help of the principle of flow rate in hydraulics, an optimizing routing algorithm based on congestion control (CCOR) is proposed. The CCOR algorithm is designed by constructing two functions named link gradient and traffic radius based on node locations and service rate of packets. Finally, the route selection probabilities for each path are allocated according to the link flow rates. The simulation results show that the proposed solution significantly decreases the packet loss rate and maintains high energy efficiency under different traffic load.
49 citations
TL;DR: An Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary and simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.
Abstract: The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source's traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child's sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.
48 citations