L Raghavendar Raju
Research Subjects
L Raghavendar Raju has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
C R K Reddy
Mahatma Gandhi Institute of Technology
2 shared publications- C R K Reddy Reddy
Chaitanya Bharathi Institute of Technology
1 shared publication
Latest Publications
- Open Access
- 1 December 2019
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 9 (6) , 5340-5350
Node activity based trust and reputation estimation approach for secure and QoS routing in MANET
Achieving safe and secure communication in MANETs is a key challenge due to its dynamic nature. A number of security studies disclose that reputation management systems are able to be effectual with less overhead. The reputation of a node is calculated by using automated assessment algorithms depend on predefined trust scheme. This paper proposes a Node Activity-based Trust and Reputation estimation (NA-TRE) approach for the security and QoS routing in MANET. NA-TRE aims to find trust estimation and reputation of a node. The NA-TRE approach monitors the activity changes, packet forwarding or dropping in a node to find the status of the node. The various activities of a node like Normal State (NS), Resource Limitation State (RS) and Malicious State (MS) are monitored. This status of a node is helpful in computing trust and reputation. In this paper NA-TRE approach compared with existing protocols AODV, FACE and TMS to evaluate the efficiency of MANET. The experiment results show that 20% increasing of throughput, 10% decrease of overhead and end to end delay.
- 1 December 2019
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 9 (6) , 5340-5350
Open AccessNode activity based trust and reputation estimation approach for secure and QoS routing in MANET
Achieving safe and secure communication in MANETs is a key challenge due to its dynamic nature. A number of security studies disclose that reputation management systems are able to be effectual with less overhead. The reputation of a node is calculated by using automated assessment algorithms depend on predefined trust scheme. This paper proposes a Node Activity-based Trust and Reputation estimation (NA-TRE) approach for the security and QoS routing in MANET. NA-TRE aims to find trust estimation and reputation of a node. The NA-TRE approach monitors the activity changes, packet forwarding or dropping in a node to find the status of the node. The various activities of a node like Normal State (NS), Resource Limitation State (RS) and Malicious State (MS) are monitored. This status of a node is helpful in computing trust and reputation. In this paper NA-TRE approach compared with existing protocols AODV, FACE and TMS to evaluate the efficiency of MANET. The experiment results show that 20% increasing of throughput, 10% decrease of overhead and end to end delay.
- Open Access
- 5 September 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Interactive Mobile Technologies (iJIM)
- Vol. 13 (09) , 40-51
Security Improvisation through Node Trust Prediction Approach in Mobile Ad Hoc Networks
Identifying trusted nodes for safe communication is a key challenge in mobile ad-hoc networks. Node compromises a service and leads to uncertainty in node behaviour. Computing the node trust and node management will enhance the security aspect in MANETs. This paper proposes a security improvisation based on a Node Trust Prediction Approach (NTPA). NTPA aims to prevent the interference of an anomalous node in a MANET. There by improving the security and data delivery output. The NTPA calculates the node trust prediction by evaluating the four most frequent actions that are performed by a node in the communication process. Node authorization is a key aspect in the evaluation of an ad hoc network’s security. In the proposed method, we monitor the valid and Invalid Authorization of a node. Data delivery reliability is measured with Success of Packet delivery and Loss or Drop of packets. In this paper, NTPA is compared with SAR(Security-Aware Routing) and AODV (Adhoc on-Demand Distance Vector), to evaluate the efficiency in an adhoc networks. The empirical results shows that there is an increase of 25% packet delivery and a 40% reduction in routing overhead.
- 5 September 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Interactive Mobile Technologies (iJIM)
- Vol. 13 (09) , 40-51
Open AccessSecurity Improvisation through Node Trust Prediction Approach in Mobile Ad Hoc Networks
Identifying trusted nodes for safe communication is a key challenge in mobile ad-hoc networks. Node compromises a service and leads to uncertainty in node behaviour. Computing the node trust and node management will enhance the security aspect in MANETs. This paper proposes a security improvisation based on a Node Trust Prediction Approach (NTPA). NTPA aims to prevent the interference of an anomalous node in a MANET. There by improving the security and data delivery output. The NTPA calculates the node trust prediction by evaluating the four most frequent actions that are performed by a node in the communication process. Node authorization is a key aspect in the evaluation of an ad hoc network’s security. In the proposed method, we monitor the valid and Invalid Authorization of a node. Data delivery reliability is measured with Success of Packet delivery and Loss or Drop of packets. In this paper, NTPA is compared with SAR(Security-Aware Routing) and AODV (Adhoc on-Demand Distance Vector), to evaluate the efficiency in an adhoc networks. The empirical results shows that there is an increase of 25% packet delivery and a 40% reduction in routing overhead.
- Open Access
- 22 May 2017
- Published by International Association of Online Engineering (IAOE) in International Journal of Interactive Mobile Technologies (iJIM)
- Vol. 11 (4) , 43-54
A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks
Mobile ad hoc networks (MANETs) are collection of wireless mobile devices with restricted broadcast range and resources. Communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from efficiency and security point of view. This paper presents a proficient and secure routing, based on asymmetric authentication using key exchange approach (KEA). The proposed mechanism ensures secure routing and quality of service in MANETs and minimizes the network overhead. The KEA mechanism can be effectively used to develop a new routing protocol for Mobile Adhoc Networks which will provide maximum security against all kinds of attacks. In this paper, KEA is compared with other secure routing protocols like EEACK, AODV, and ARIADANE, to evaluate the efficiency of KEA in Ad Hoc Networks. The empirical results shows that there is an increase of 20% packet delivery ratio and a reduction of 10% routing overhead.
- 22 May 2017
- Published by International Association of Online Engineering (IAOE) in International Journal of Interactive Mobile Technologies (iJIM)
- Vol. 11 (4) , 43-54
Open AccessA Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks
Mobile ad hoc networks (MANETs) are collection of wireless mobile devices with restricted broadcast range and resources. Communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from efficiency and security point of view. This paper presents a proficient and secure routing, based on asymmetric authentication using key exchange approach (KEA). The proposed mechanism ensures secure routing and quality of service in MANETs and minimizes the network overhead. The KEA mechanism can be effectively used to develop a new routing protocol for Mobile Adhoc Networks which will provide maximum security against all kinds of attacks. In this paper, KEA is compared with other secure routing protocols like EEACK, AODV, and ARIADANE, to evaluate the efficiency of KEA in Ad Hoc Networks. The empirical results shows that there is an increase of 20% packet delivery ratio and a reduction of 10% routing overhead.