A Solution for Successful Routing in Low–Mid-Density Network Using Updated Azimuthal Protocol

The field of wireless sensor networks has witnessed an increasing traction among researchers in the erstwhile few decades. Since in large networks, sensors are not uniformly distributed; thus, a problem arises in low- and medium-density part of that large network which has a high probability of the packets getting stuck at a specific node due to the problem of local minima. Thus, this paper tries to solve the problem of unsuccessful routing in low–medium-density networks by implementing updated form of azimuthal routing protocol which removes the overhead of keeping the routing details and also ensures that the packets reach the sink and is not affected by the presence of holes which is normally the case in lower density network. This protocol has been compared with greedy protocol which shows that it exhibits excellent performance with around 98.78% of average successful ratio compared to 45.38% in case of greedy.