Annals of Emerging Technologies in Computing (AETiC)

 
Paper #4                                                                             

Ideal Node Enquiry Search Algorithm (INESH) in MANETS

Mohammad Riyaz Belgaum, Safeeullah Soomro, Zainab Alansari and Muhammad Alam


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.


Keywords: MANETS; DSR Protocol; AODV Protocol; Malicious.


 
Full Text

This work is licensed under a Creative Commons Attribution 4.0 International License. Creative Commons License


This browser does not support PDFs. Please download the PDF to view it: Download PDF.

 
 International Association for Educators and Researchers (IAER), registered in England and Wales - Reg #OC418009                         Copyright © IAER 2017