An optimized routing scheme for congestion avoidance using mobile nodes in Wireless Sensor Network

Wireless Sensor Network (WSN) consists of a group of dynamic sensor nodes such nodes form a volatile topology. When an event occurs the dynamic nodes WSN communicate wirelessly from source to destination node without any infrastructure. Dynamic sensor nodes are vital characteristics of WSN where link breakage occurs recurrently and change in topology. Due to this overall network Quality of Service (QoS) degrades due to link failure. Whenever an event in the network experience packet loss due to link failure which leads one of the causes for congestion. However predictable network tries to discover alternate path whenever the link failure occurs on demand which does not have the overall network information thus increasing the communication overhead, delay, and high energy consumption. To address these issues this problem paper proposes an optimized routing scheme known as low latency optimal link-state routing (LL-OLSR) for mobile in WSN which proactively monitors the established path and connects the source to destination with minimum cost with optimal energy. LL-OLSR algorithm finds the disjoint link where it is detected between two nodes and also maximizes the packet delivery ratio by minimizing path delay using connectivity range and queuing delay by which congestion is avoided. Simulation experiment of proposed LL-OLSR scheme is carried on event-driven simulation tool –NS2 and QoS parameters are evaluated by comparing with existing routing scheme. •LL-OLSR routing scheme uses congestion avoidance technique based on queue buffer availability, connectivity range, and also previously connected information to forward packets over connected path.•Upon link disjoint between two nodes, the LL-OLSR scheme discovers the shortest alternate path by minimizing the path delay and seeks to maximize the packet delivery ratio by using connectivity range and queuing time.