Adaptive expanding ring search based per hop behavior rendition of routing in MANETs

Routing protocols in Mobile Ad Hoc Networks (MANETs) operate with Expanding Ring Search (ERS) mechanism to avoid flooding in the network while tracing step. ERS mechanism searches the network with discerning Time to Live (TTL) values described by respective routing protocol that save both energy and time. This work exploits the relation between the TTL value of a packet, traffic on a node and ERS mechanism for routing in MANETs and achieves an Adaptive ERS based Per Hop Behavior (AERSPHB) rendition of requests handling. Each search request is classified based on ERS attributes and then processed for routing while monitoring the node traffic. Two algorithms are designed and examined for performance under exhaustive parametric setup and employed on adaptive premises to enhance the performance of the network. The network is tested under congestion scenario that is based on buffer utilization at node level and link utilization via back-off stage of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). Both the link and node level congestion is handled through retransmission and rerouting the packets based on ERS parameters. The aim is to drop the packets that are exhausting the network energy whereas forward the packets nearer to the destination with priority. Extensive simulations are carried out for network scalability, node speed and network terrain size. Our results show that the proposed models attain evident performance enhancement.