Abstract
Background: 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.
Objective: 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.
Methods: 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.
Results: From the analysis, it is inferred that proposed method had a higher throughput and the throughput was equally distributed among all the participating nodes.
Conclusion: The proposed method endeavours to avoid congestion by implementing an effective queuing mechanism to reinforce definitive wireless communication.
Keywords: Congestion, weight assignment, priority fairness, starvation, wireless sensor network, packet loss.
[http://dx.doi.org/10.1109/JSAC.2007.070514]
[http://dx.doi.org/10.1007/s11276-015-1016-y]
[http://dx.doi.org/10.1186/s13638-015-0241-5]
[http://dx.doi.org/10.1007/s11277-013-1337-z]
[http://dx.doi.org/10.1109/ICDECOM.2011.5738568]
[http://dx.doi.org/10.1145/958491.958523]