Efficient Routing Techniques for Congestion Mitigation in Wireless Sensor Networks

Authors

  • Omprakash B, Dr Kavitha S Patil

Keywords:

PRP, NRRP, DRP, Optimized algorithm, DAlPa’s algorithm, TARA algorithm, Congestion Control, Power utilization, route discovery time.

Abstract

The previous routing approaches like Purely random propagation(PRP),Non-repetitive purely random propagation (NRRP),Directed random propagation (DRP)perform the routing of packets without considering congestion might occur. When the intermediate nodes receive a substantial quantity of packets they directly drop the packets. The second problem is that will occur back and forth propagation which decreases the effectiveness of the net-work and increases route discovery time. The intention is to find out the routes in the net-work without any back and forth propagation on order for the  packetwilln’t be send back and forth between nodes (optimized routing algorithm).The second aim in algorithm will find out the motive of congestion and the packets will be send through alternate paths by considering buffer occupancy factor and power level of nodes the network. The paths will be sent through dispersive routesin order for theadversarydoesnottake thepackets. Thepacketswillbesendthroughthepathwho’sround trip moment will be minimum.

Downloads

Published

2024-10-12

How to Cite

Omprakash B, Dr Kavitha S Patil. (2024). Efficient Routing Techniques for Congestion Mitigation in Wireless Sensor Networks. International Journal of Communication Networks and Information Security (IJCNIS), 16(4), 1685–1690. Retrieved from https://ijcnis.org/index.php/ijcnis/article/view/7444

Issue

Section

Research Articles