Trusted Secure Geographic Routing Protocol: outsider attack detection in mobile ad hoc networks by adopting trusted secure geographic routing protocol

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Francis H. Shajin ◽  
Paulthurai Rajesh

Purpose This study aims to evaluate the direct trust value for each node and calculate the trust value of all nodes satisfying the condition and update the trust value and value each trust update interval for a secure and efficient communication between sender and destination node. Hence, a Trusted Secure Geographic Routing Protocol (TSGRP) has been proposed for detecting attackers (presence of the hacker), considering the trust value for a node produced by combining the location trusted information and the direct trusted information. Design/methodology/approach Amelioration in the research studies related to mobile ad hoc networks (MANETs) and wireless sensor networks has shown greater concern in the presence of malicious nodes, due to which the delivery percentage in any given network can degrade to a larger extent, and hence make the network less reliable and more vulnerable to security. Findings TSGRP has outperformed the conventional protocols for detecting attacks in MANET. TSGRP is establishing a trust-based secure communication between the sender and destination node. The evaluated direct trust value is used after the transmission of route-request and route-reply packets, to evaluate the direct trust value of each node and a secure path is established between the sender and the destination node. The effectiveness of the proposed TSGRP is evaluated through NS-2 simulation. Originality/value The simulation results show the delay of the proposed method is 92% less than PRISM approach and the overhead of the proposed TSGRP approach is 61% less than PRISM approach.

Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2219 ◽  
Author(s):  
Dong Yang ◽  
Hongxing Xia ◽  
Erfei Xu ◽  
Dongliang Jing ◽  
Hailin Zhang

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.


Author(s):  
Hicham Zougagh ◽  
Noureddine Idboufker ◽  
Rida Zoubairi ◽  
Rachid El Ayachi

In a mobile ad hoc network, a source node must rely on intermediate nodes to forward its packets along multi-hop routes to the destination node. The performance of a mobile ad hoc network is closely related to the capability of the implemented routing protocol to adapt itself to unpredictable changes of topology network and link status. One of these routing protocols is optimized link state routing protocol which assumes that all nodes are trusted. However, in a hostile environment, the OLSR is known to be vulnerable to various kinds of malicious attacks. Without having any control on packet forwarding, an intermediate node can behave selfishly or maliciously to drop packets going through it. Therefore, in this article, the authors propose a new technique for the selection of multipoint relays whose aims to provide each node the ability to select alternative paths in order to reach any destination two hops away.


Sign in / Sign up

Export Citation Format

Share Document