Trust-based Multipath Routing Research Articles

TBSMR: A Trust-Based Secure Multipath Routing Protocol for Enhancing the QoS of the Mobile Ad Hoc Network

Mobile ad hoc network (MANET) is a miscellany of versatile nodes that communicate without any fixed physical framework. MANETs gained popularity due to various notable features like dynamic topology, rapid setup, multihop data transmission, and so on. These prominent features make MANETs suitable for many real-time applications like environmental monitoring, disaster management, and covert and combat operations. Moreover, MANETs can also be integrated with emerging technologies like cloud computing, IoT, and machine learning algorithms to achieve the vision of Industry 4.0. All MANET-based sensitive real-time applications require secure and reliable data transmission that must meet the required QoS. In MANET, achieving secure and energy-efficient data transmission is a challenging task. To accomplish such challenging objectives, it is necessary to design a secure routing protocol that enhances the MANET’s QoS. In this paper, we proposed a trust-based multipath routing protocol called TBSMR to enhance the MANET’s overall performance. The main strength of the proposed protocol is that it considers multiple factors like congestion control, packet loss reduction, malicious node detection, and secure data transmission to intensify the MANET’s QoS. The performance of the proposed protocol is analyzed through the simulation in NS2. Our simulation results justify that the proposed routing protocol exhibits superior performance than the existing approaches.

Harris Hawks Jaya Algorithm-Based Routing Protocol in Delay Tolerant Network

This paper introduces a trust-based multipath routing protocol for exploiting different paths between source as well as destination to mitigate energy constraints. The key idea is to determine optimal path from the entire paths available among source and target node. To improve the security in routing protocol, the factors, like trust factors, and distance are considered as major components. Based on these parameters, the multipath routing is carried out based on HH-Jaya Algorithm. The HH-Jaya is designed newly by integrating Harris Hawks Optimization (HHO) and Jaya Algorithm. After that, the reputation and trust-based context aware routing (RCAR) protocol is utilized to select the optimal path with more trust factor. Here, the trust is modelled by considering trust factors, like direct, indirect, history, forwarding rate, and availability factors, in addition to the utility function. The proposed HH-Jaya outperformed other methods with minimal delay of 0.007 sec, maximal throughput of 0.913 for 10 user and maximal packet deliver rate (PDR) of 0.991 for 20 users respectively.

A Trust based Multipath Routing for Black Hole Attacks with Group Search Optimization Routing

The Mobile Ad hoc Network (MANET) is the collection of some mobile devices that communicate with one another without any help from a centralized administration. For this, the energy is an important issue that has to be addressed since the ad-hoc network nodes have a limited battery power. A secure routing in the MANETs is an area of research that is emerging. The designing of a security protocol which is trustworthy for the ad hoc routing is an extremely challenging task owing to all its unique traits. Due to its minimal configuration and its quick deployment, the MANETs are found to be well-suited for situations in the case of an emergency such as the natural disasters or the military applications. This way, a transfer of data among two nodes need some security. A MANET black-hole attack will occur owing to the malicious nodes attracting data packets by means of a false advertisement of a fresh route to its destination. For this work, the trust-based routing along with the packet forwarding probability. For this work, the Ad hoc On-Demand Multipath Distance Vector Routing (AOMDV) protocol is used and for finding the routing path a trust value will be piggybacked with a route request packet. There was yet another novel algorithm for optimization known as the Group Search Optimizer (GSO) algorithm that was proposed inspired by the behaviour of animals. This GSO-AOMDV was for the purpose of improving the performance of the network. The results of the experiment proved that this method proposed could achieve a better performance compared to the other method.

A Trust Based Multipath Routing for Black Hole Attacks with Group Search Optimization Routing

The Mobile Ad hoc Network (MANET) is the collection of some mobile devices that communicate with one another without any help from a centralized administration. For this, the energy is an important issue that has to be addressed since the ad-hoc network nodes have a limited battery power. A secure routing in the MANETs is an area of research that is emerging. The designing of a security protocol which is trustworthy for the ad hoc routing is an extremely challenging task owing to all its unique traits. Due to its minimal configuration and its quick deployment, the MANETs are found to be well-suited for situations in the case of an emergency such as the natural disasters or the military applications. This way, a transfer of data among two nodes need some security. A MANET black-hole attack will occur owing to the malicious nodes attracting data packets by means of a false advertisement of a fresh route to its destination. For this work, the trust-based routing along with the packet forwarding probability. For this work, the Ad hoc On-Demand Multipath Distance Vector Routing (AOMDV) protocol is used and for finding the routing path a trust value will be piggybacked with a route request packet. There was yet another novel algorithm for optimization known as the Group Search Optimizer (GSO) algorithm that was proposed inspired by the behaviour of animals. This GSO-AOMDV was for the purpose of improving the performance of the network. The results of the experiment proved that this method proposed could achieve a better performance compared to the other methods.

Trust based Multipath Routing Scheme (TMAODV)

Trust based Multipath Routing Scheme (TMAODV)

Security Enrichment with Trust Multipath Routing and Key Management Approach in WMN

ABSTRACTWireless mesh networks (WMNs) have emerged as a promising notion in order to meet the challenges in multimedia wireless networks. Due to the open nature of WMN, security is one of the primary concerns. Because of the multi-hop communication environment and wireless media, ensuring security in WMN is a critical issue. To address the security vulnerabilities, several secure routing protocols have been proposed in WMN but still there exist problems. In order to overcome this, an effective integrated trust management scheme called Enhanced Weighted Trust based Multipath Routing Protocol (EWTMRP) that improves the security in path selection and an Enhanced Permuted Data Encryption Standard algorithm for the transmission of video frames in WMN. The proposed integrated trust management scheme includes two components in the trust model, namely, direct trust and indirect trust. By combining these two trust values, an integrated trust is evaluated and the probability value for each path is calculated based on the Bayesian theorem. The best path having the higher probability value is preferred by naive Bayes classification algorithm for the transmission of video, audio, and data frames, respectively. The simulation results show that the EWTMRP outperforms well than other similar trust models by considering various parameters such as packet delivery ratio, energy consumption, average throughput, trust value computation, and control overhead.

A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network

In today’s world the security vulnerabilities are increasing day by day. It is really difficult to route the packet with minimum packet loss with less power consumption and high energy efficiency. In this paper a new routing protocol is presented which would route the packets in a highly efficient way by introducing the concept of friend list, unauthenticated list and question mark list. The algorithm will avoid the malicious node by studying the network in an intelligent way. The algorithm works by sending challenges and sharing friend list to provide a list of trusted nodes to the source node through which data is transmitted [1]. The proposed algorithm is also compared with the existing algorithms namely Trust-Based Multipath Routing (TMR), Disjoint Multipath Routing (DMR). Message Trust-Based Multipath Routing(MTMR) and the performance analysis proves that the proposed method will have better performance with respect to number of hops, route discovery time, power consumed, energy efficiency and packet loss.

Security in mobile ad-hoc networks using soft encryption and trust-based multi-path routing

Due to their applications in situations such as emergencies, crisis management, military and healthcare, message security is of paramount importance in mobile ad-hoc networks. However, because of the absence of a fixed infrastructure with designated centralized access points, implementation of hard-cryptographic security is a challenging prospect. In this paper, we propose a novel method of message security using trust-based multi-path routing. Less trusted nodes are given lower number of self-encrypted parts of a message, making it difficult for malicious nodes to gain access to the minimum information required to break through the encryption strategy. Using trust levels, we make multi-path routing flexible enough to be usable in networks with ‘vital’ nodes and absence of necessary redundancy. In addition, using trust levels, we avoid non-trusted routes that may use brute force attacks and may decrypt messages if enough parts of the message are available to them. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the traditional multi-path routing algorithms.

Location verification and trust management for resilient geographic routing

In this paper, we consider the security of geographic routing (GR) protocols. In GR, neighbors exchange their location information. Based on this information, a node forwards packets to the neighbor that is closest to the destination. Although GR is widely used in ad hoc and wireless sensor networks, its security has rarely been studied; there are a number of attacks that are possible on GR. In one attack, misbehaving nodes can falsify their location information. Also, malicious nodes can drop packets that they need to forward towards the destination. The first contribution of the paper is to propose a location verification algorithm to address the attacks falsifying the location information. The second contribution of the paper is to propose approaches for trust-based multi-path routing, aiming to defeat attacks on GR. We discuss the proposed approaches in detail, outlining possible attacks and defenses against them. In addition, we show, via simulation, how trust-based route selection is able to circumvent attackers and route around them. This paper summarizes and extends results reported by the authors in a previous article [K.-D.K. Nael, B. Abu-Ghazaleh, K. Liu, Towards resilient routing in WSNs, in: Proceedings of the First IEEE/ACM Workshop on QoS and Security in Wireless Networks (Q2SWinet 2005), 2005, pp. 71–78].