Trust Based Secure Routing Protocol Research Articles

Comprehensive Trust based Routing Protocol to Mitigate Black-hole attack in Wireless Sensor Networks

Wireless Sensor Network (WSN) is a collection of sensor nodes, that sense environmental data and send it to the administrator for further processing. Sensor nodes are wireless devices with limited battery and are vulnerable to security attacks such as black hole attack, gray hole attack, sink hole attack etc. Researchers have proposed many security mechanisms to mitigate security attacks. Trust based approaches have gained tremendous interest among researchers to embed security in WSNs. A Trust Based Secure Routing Protocol to mitigate black hole attack is presented in this paper. The protocol computes comprehensive trust value for each node and routes the packets only through the nodes with trust value > 0.5. The results of the proposed protocol are compared with TBSEER [10] protocol. The results show an improvement in Packet Delivery Ratio (PDR), throughput, End to End (EED), routing overhead and energy consumption.

RETRACTED: Hybrid trust-based secure routing protocol for detection of routing attacks in environment monitoring over MANETs

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

A survey of trust based secure routing protocol used in mobile ad hoc networks

A mobile ad hoc network (MANET) is a dynamic wireless network developed using wireless nodes without using any infrastructures. The significant features of MANET are low-cost infrastructure, self-organization, mobility, and rapid deployment which offer the opportunity to deploy it for various applications such as disaster relief, environmental monitoring and military communications. The wireless nature of mobile networks causes the susceptible to malicious attacks. Therefore, security is turned out an essential factor to ease the secured message transmission among mobile nodes in the wireless medium. In this paper, the significant definition of the secure routing protocol is designated with its merits. Since there are various types of secure routing developed for accomplishing the secure transmission over the MANET. This paper studies the different types of existing routing methods such as optimization-based routing, and key encryption-based routing used in the MANET. The packet delivery ratio, energy consumption and end-to-end delay are considered key parameters for defining the effectiveness of secure routing protocols. This comprehensive research supports the researchers to obtain the best solutions for the current issues in the secure routing of MANET.

Oppositional chaos game optimization based clustering with trust based data transmission protocol for intelligent IoT edge systems

In the past decade, the Internet of Things (IoT) becomes essential in consumer and industrial applications. The accessibility of high bandwidth Internet connection particularly with the arrival of robust 5G networks rises to innovative IoT solutions such as smart city, automobiles, industry 4.0, etc. IoT analytics represents edge computing as a term commonly employed for defining intelligent computational resources placed closer to the source of data generation. Despite the benefits of the IoT edge systems, security and energy efficiency remains major challenging issues. With this motivation, this paper presents an energy-efficient clustering based secure data transmission protocol (EEC-SDTP) for Intelligent IoT Edge systems. The goal of the EEC-SDTP technique is to select an appropriate set of cluster heads (CHs) and optimally secure routes for data transmission in the network. The proposed model involves oppositional chaos game optimization-based clustering (OCGOC) technique for proper CH selection and cluster construction. Besides, a trust-based model is designed to determine the trustworthiness of the node in the IoT edge systems. The proposed OCGOC technique derives a fitness function utilizing 3 input parameters like trust level, distance to neighbors, and energy. Finally, a trust-based secure routing protocol using the quantum sand piper optimization (SRP-QSPO) technique is employed to derive routes for secure data transmission. For examining the better efficiency of the proposed EEC-SDTP algorithm, an extensive group of experimentations were performed and the outcomes are investigated under several performance measures. The experimental outcomes highlighted the improved efficiency of the proposed method over the other related techniques.

Quantum Firefly Secure Routing for Fog Based Wireless Sensor Networks

Wireless Sensor Networks (WSNs) become an integral part of Internet of Things (IoT) and finds their applicability in several domains. As classical WSN faces several issues in service-based IoT applications, fog computing has been introduced in real-time, enabling local data processing and avoid raw data transmission to cloud servers. The Fog-based WSN generally involves advanced nodes, normal nodes, and some Fog Nodes (FN). Though the Fog-based WSN offers several benefits, there is a need to develop an effective trust-based secure routing protocol for data transmission among Cluster Heads (CHs) and FNs. In this view, this paper presents a Quantum Firefly Optimization based Multi-Objective Secure Routing (QFO-MOSR) protocol for Fog-based WSN. The main intention of the QFO-MOSR technique is to derive an optimal selection of routes between CHs and FNs in the network. The QFO-MOSR technique has incorporated the concepts of quantum computing and Firefly (FF) optimization algorithm inspired by the flashing behaviour of FFs. In addition, a multi-objective fitness function is derived by the QFO-MOSR technique using seven objectives: distance, inter-cluster distance, energy, delay, intra-cluster distance, link lifetime, and trust. The proposed routing technique derives a fitness function including trust factor from ensuring security. The design of the QFO-MOSR technique with a multi-objective fitness function shows the novelty of the work. To validate the performance of the QFO-MOSR technique, a series of experiments were carried out, and the results are investigated in terms of different measures. The experimental analysis ensured that the QFO-MOSR technique is superior to other methods in terms of different measures.

Trust‐aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

Optimisation driven-based secure routing in MANET using atom whale optimisation algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Optimization Driven-Based Secure Routing in MANET Using Atom Whale Optimization Algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Trust-Based Secure Routing in Mobile Ad Hoc Network Using Hybrid Optimization Algorithm

Abstract Routing in mobile ad hoc networks (MANETs) is a hectic challenge due to the dynamic nature of the network. The provisional communication links are assured due to the infrastructure-independent capability of MANET, but with no proper centralized monitoring process, which makes routing in MANETs with respect to the security and trust a major issue. Thus, the paper introduces Advanced Encryption Standard-enabled Trust-based Secure Routing protocol based on the proposed Dolphin Cat Optimizer (AES-TDCO), which is an energy and trust-aware routing protocol. The proposed Dolphin Cat Optimizer is engaged in the optimal route selection based on the modeled objective function based on the trust factors, recent trust, historical trust, direct and indirect trust in addition to delay, distance and link lifetime. The Dolphin Cat Optimizer is the integration of Dolphin Echolocation and Cat Swarm Optimization algorithm that inherits the faster global convergence. The simulation using 75 nodes revealed that the proposed routing protocol acquired the maximal throughput, minimal delay, minimal packet drop and detection rate of 0.6531, 0.0107, 0.3267 and 0.9898 in the absence of network attacks and 0.7693, 0.0112, 0.3605 and 0.9961 in the presence of the network attacks.

Mitigate Black Hole Attack Using Hybrid Bee Optimized Weighted Trust with 2-Opt AODV in MANET

A Mobile Ad hoc Network (MANET) is susceptible to several security threats. This work aims at securing a MANET against black hole attacks. Based on MANET characteristics, a trust based secure routing protocol known as Ad hoc On-Demand Vector Routing has been proposed, which protects a MANET from black hole attack. This work presents an algorithm which decreases the probability of black hole attacks known as a hybrid Weighted Trust based Artificial Bee Colony 2-Opt algorithm. Optimal secure paths can be detected using the ABC algorithm. The hybridization of the algorithm has been performed using the 2-opt as local search. This algorithm’s efficiency can be improvised using the current solutions on the basis of their fitness for generating new solutions. Proposed method enhances the performance parameters such as packet delivery ratio, hops to sink and end to end delay.

Fuzzy rule-based approach for design and analysis of a Trust-based Secure Routing Protocol for MANETs

The paper proposes a fuzzy rule-based approach for design and analysis of a Trust-Based Secure Routing Protocol for MANETs (TBSRPM). Due to highly dynamic behaviour of nodes the shortest route does not necessarily guarantee a secure route. Hence stability of route is not taken into consideration as the route can be easily break in the dynamic MANETs. Thus finding a stable and trusted route is of great importance. The proposed algorithm is the extension of the existing reactive routing protocol (AODV), developed for creating secure route between sources to destination. The protocol behaviour depends on TV and LOT as well as TV decides what level of security action is required. So based on TV, the data packet is encrypted. With the help of TV, malicious nodes can be easily eliminated and we can establish a best trusted route as well. Results show that the proposed TBSRP enhances MANETs.

Design and Development of CTSR with Direct & Indirect Observations of MANET Applications

Prominent applications scenarios like military and commercial platforms mostly rely on wireless communications such as Wireless Sensor Networks (WSN), Mobile Ad-hoc Networks (MANET) and Vehicular Ad-hoc Networks (VANET). Based on the application scenario, the reliability of the nodes deployed has become more important for trust management evaluation. At the same time, trust management system should not be power killing, complex in terms of computation and processing capability. To convey a noticeable framework, we propose Collaborative Trust based Secure Routing protocol (CTSR) for observing direct and indirect trust values. Here we utilize two-way acknowledgement-based trust framework (2-ACKT) which requires lesser memory resources and minimizes the communication overhead. Our simulation setup for Mobile Adhoc Networks with 2-ACKT framework calculates trust value with both direct and indirect observations based on Bayesian inference and Dempster-Shafer Theory (DST) of uncertain reasoning approach respectively. Since the inception of DST for indirect observation in wireless networks trust values are effectively derived with data packets and control packets. The capability of DST to solve the problems with different reliability has flaws in certain areas where the nodes were subjected to disclose critical information like residual energy level and available bandwidth. And also common results derived from DST may lead to uncertain decisions. Considering all these factors we make few notable modifications in DST to enhance the security feature in 2-ACT.

Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks

Most of the existing routing protocols for heterogeneous multi-hop wireless networks (HWMNs) use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes' location information (TSRAL) is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.

Countering Node Misbehavior Attacks using Trust Based Secure Routing Protocol

Wireless sensor networks have gained remarkable appreciation over the last few years. Despite significant advantages and tremendous applications, WSN is vulnerable to variety of attacks. Due to resource constraint nature of WSN, applicability of traditional security solutions is debatable. Although cryptography, authentication and confidentiality measures help in preventing specific types of attacks but they cannot safeguard against node misbehavior attacks and come at significant cost. To address this problem, we propose a Trust Based Secure Routing Protocol (TBSRP) which relies on distributed trust model for the detection and isolation of misbehaving nodes. The TBSRP aims to establish shortest path that contain all trusted nodes, identify packet forwarding misbehavior caused by malicious and faulty nodes and reroute the traffic to other reliable paths. The performance of TBSRP is evaluated in terms of packet delivery ratio, average end-to-end delay and normalized routing load. Simulations results show that TBSRP can achieve both high delivery ratio and throughput in presence of various numbers of misbehaving and faulty nodes.

Analytical models for trust based routing protocols in wireless ad hoc networks

In Wireless Ad Hoc Network environment, there are three ways to understand a routing protocol: (i) monitoring, (ii) simulation and (iii) modeling. In this paper, the different trust based secure routing protocols used in wireless ad hoc networks are analyzed, modeled and described by incorporating process flow diagrams. These process flow diagrams represent stepwise work flow activities and actions. It shows the overall flow of control of a process, program or a protocol. This paper focuses on the security aspects of routing by incorporating trust parameter into account and also highlights methodology used in secure routing protocols. Such protocols have been categorized based on the model used for enforcing security, methodology and information for making effective routing decisions. In this paper, we model, discuss and analyze trust based secure ad hoc routing schemes which do not require each network node to work in promiscuous mode. We propose and design a new protocol - Trust based Routing using Dominating Set Approach (TRDSA) which overcomes the shortcomings of existing protocols.