A Credible Routing Based on a Novel Trust Mechanism in Ad Hoc Networks

Abstract

Many existing routing protocols in Mobile Ad hoc Networks (MANETs) focus on finding paths in dynamic networks without considering security. In this paper, we propose a trust model which evaluates neighbours' direct trust by factors of encounter time, mobility, and successful cooperation frequency. The revised D-S evidence theory is used to combine multiple recommended pieces of evidence and obtain the recommended trust value. Then based on the novel trust mechanism, we propose a trusted routing protocol named TDS-AODV protocol by extending the AODV protocol. In this protocol, a node makes a routing decision according to the trust values of its neighbour nodes. Finally, two routes are built: the main route with highest route trust value in the candidate routes and a backup route. Simulation results reveal that TDS-AODV can eliminate malicious nodes effectively when building the route; furthermore, it also achieves better performance than TAODV and AODV in terms of throughput, packet delivery ratio, and average end to end delay.

A similarity‐based indirect trust model with anti‐spoofing capability

“…Similarly, the trust recommendation computing method for a multiple‐level trust management framework for WSN also decays recommendations according to path length. In , a recommendation is discounted on the basis of the trust values of intermediate nodes along a path. Likewise, the scheme of and decays recommendations according to the trust degrees of intermediates.…”

“…The propagation of trust recommendations in various network types shares a set of common features, and thus it can be abstracted as a general overlay network model. After analyzing a number of trust schemes in the context of MANET, P2P, WSN and cloud computing, we summarize the common features as follows: there is only one requesting entity (trustor) and one target node (trustee) for a set of recommendations; the number of recommenders is not limited ; in general, recommenders are neighbors of the target, and recommendations are the direct trust values of the target evaluated by recommenders ; recommenders are categorized into one‐hop and multi‐hop away from the trustor ; a one‐hop recommendation is directly delivered to the trustor, while a multi‐hop recommendation is transmitted through a path consisting of a certain number of intermediate entities . …”

“…In the following discussion, we will use the term trust model exclusively to mean direct trust model, unless explicitly stated otherwise. Although indirect trust models have been frequently employed in existing trust management systems , there are still some unresolved problems.…”

A Novel Markov Model-Based Low-Power and Secure Multihop Routing Mechanism

“…To improve the security of routing in wireless ad hoc networks, researchers have proposed many relevant algorithms, such as the data encryption algorithm [15,16], the trustbased security routing algorithm [17][18][19][20], and the game theory-based security transmission algorithm [21][22][23]. The large amount of computation makes it challenging to apply the traditional encryption algorithm directly to the energyconstrained wireless ad hoc networks.…”

Link breakage maintenance and power-aware secure routing in MANET based on the Fuzzy Krill Herd-based Grasshopper optimization

“…The malicious mobile nodes often misroute the data packets so that the high nodes having high mobility may damage and interrupt the data transmission. To protect the ad hoc network from the external and internal attacks is the basic need to be addressed properly [3] [22]. As the ad hoc networks are deployed easily, they are widely used in various applications, such as disaster relief operations, and military [1] [23].…”