Ideal Node Enquiry Search Algorithm (INESH) in MANETS

TL;DR

This paper proposes the INESH algorithm for MANET routing that identifies the optimal node for data forwarding, reducing malicious nodes and protocol overhead while maintaining QoS.

Contribution

The paper introduces the INESH algorithm, a novel method for selecting ideal nodes in MANETs based on bounce count and delay, enhancing routing efficiency.

Findings

Reduces malicious node influence in MANET routing

Decreases protocol overhead through optimal node selection

Maintains QoS during routing processes

Abstract

The different routing protocols in Mobile Ad hoc Networks take after various methodologies to send the data starting from one node then onto the next. The nodes in the system are non-static and they move arbitrarily and are inclined to interface disappointment which makes dependably to discover new routes to the destination. During the forwarding of packets to the destination, various intermediate nodes take part in routing, where such node should be an ideal node. An algorithm is proposed here to know the ideal node after studying the features of the reactive routing protocols. The malicious node can be eliminated from the networking function and the overhead on the protocol can be reduced. The node chooses the neighbor which can be found in less number of bounces and with less time delay and keeping up the QoS.