2020
DOI: 10.1007/s11277-020-07423-x
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Secure and Efficient Routing Protocol for Mobile Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(28 citation statements)
references
References 93 publications
0
24
0
Order By: Relevance
“…Tripathy [16] presented the CARP that dynamically configures the routing operations according to the network. Here, the routing protocol was configured based on the following parameters such as the contextual features, behavioural dynamics and varying requirements.…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…Tripathy [16] presented the CARP that dynamically configures the routing operations according to the network. Here, the routing protocol was configured based on the following parameters such as the contextual features, behavioural dynamics and varying requirements.…”
Section: Literature Surveymentioning
confidence: 99%
“…The performance of the MAODV-ACO method is analyzed as PDR, throughput, average end-to-end delay and overhead. Here, the MAODV-ACO method is compared with the CARP [16] and AODV-BA-DST [20] to justify the efficiency of the MAODV-ACO method. The performance analysis is described as follows:…”
Section: Performance Analysismentioning
confidence: 99%
“…Step Very Poor (VP) [1,3] Poor (P) [3,4] Medium Poor (MP) [4,5] Medium (M) [5,6] Medium Good (MG) [6,9] Good (G) [9,10] Very Good (VG)…”
Section: Decision On Trustmentioning
confidence: 99%
“…On the other hand, indirect interaction represents the method of determining the behavior of mobile nodes through their neighbours which are cooperating with them for a specific amount of time. Thus, the cooperation degree among the mobile nodes needs to be sustained through potential mitigation of malicious and selfish mobile nodes in the network with maximized optimality [10]. From the recent decades, a diversified number of cooperation enforcing approaches based on acknowledgement, probabilistic distribution-based trust and reputation, watchdog and game theory were contributed in the literature for potential mitigation of malicious nodes.…”
Section: Introductionmentioning
confidence: 99%
“…The other Cuckoo search and M-tree-based approach were proposed by Babu and Ussenaiah (14) to enhance the Adhoc network's performance. The other heuristic and metaheuristic approaches based on an optimization algorithm were developed by several researchers (15)(16)(17)(18)(19)(20)(21)(22)(23)(24)(25)(26)(27)(28) that optimize the network's performance and provide a secure communication environment.…”
Section: Related Workmentioning
confidence: 99%