1800 425 44 38 | From 9 AM to 5.30 PM (IST) | Mon. to Sat
Bachelor of Pharmacy (B.Pharm.) - Admission Open

IEEE ACCESS JOURNAL PAPER | Event Date: Thursday, 28th, January 2021

Dr. K. Sakthidasan Sankaran, Assoc. Prof. ECE; and Dr. N. Vasudevan, Prof., ECE & Dean E & T have published a Paper titled “A Recurrent Reward Based Learning Technique for Secure Neighbor Selection in Mobile AD-HOC Networks” in the IEEE Access Journalon 28 Jan. 2021.


Mobile ad-hoc network is an assortment of distinct attribute-based mobile devices that are autonomous and are cooperative in establishing communication. These nodes exploit wireless links for communication that causes injection of the adversaries in the network. Therefore, detection and mitigation of adversaries and anomalies in the network are mandatory to retain its performance. To strengthen this concept, in this article, a novel secure neighbor selection technique using recurrent reward-based learning is introduced. This proposed technique inherits the benefits of conventional routing and intelligent machine learning paradigm for classifying the states of the nodes based on their communication behavior. Thorough learning of the behavior of the nodes unanimously at all the hop-levels of communication enables establishing secure and consistent routing and transmission paths to the destination. The performance of the proposed technique is estimated using the metrics throughput, packet delivery ratio, and delay and detection ratio. Experimental analysis proves the consistency of the proposed technique by improving throughput, packet delivery ratio, and detection ratio under less delay.

Electronic ISSN: 2169-3536

DOI: 10.1109/ACCESS.2021.3055422

Paper Link: https://ieeexplore.ieee.org/document/9337807