Abstract

In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call