Trust Routing Research Articles

SGor: Trust graph based onion routing

The use of trust for onion routing has been proved effective in thwarting malicious onion routers. However, even state-of-the-art trust-based onion routing protocols still suffer from two key limitations in protecting anonymity. First, these protocols have no means to verify the correctness of the trust they rely on. Second, they run a high risk of being deanonymized by an inference attack due to biased trust distributions. In this paper, we propose SGor, a trust graph based onion routing that mitigates the key limitations of trust in protecting anonymity. SGor is novel with three unique properties. First, SGor aggregates group trust from mutual friends to verify the correctness of users’ trust assignments. Second, SGor employs an adaptive trust propagation algorithm to derive global trust from trust graph. The global trust removes the restriction of users’ local knowledge and defeats inference attacks by guiding users to discover and trust more honest routers (i.e., reducing the bias of trust distribution). Third, SGor is designed to operate in a fully decentralized manner. This decentralized design mitigates the leakage of a priori trust relationships. We evaluate SGor with simulation-based experiments using several real-world social trust datasets. The experimental results confirm that SGor can mitigate key limitations in the use of trust for protecting anonymity but introduces only a few overheads.

A Genetic Algorithm Inspired Load Balancing Protocol for Congestion Control in Wireless Sensor Networks using Trust Based Routing Framework (GACCTR)

Wireless Sensors Networks are ext remely densely populated and have to handle large bursts of data during emergency or high activity periods giving rise to congestion which may disrupt normal operation. Our paper proposes a new congestion control protocol for balanced distribution of traffic among the different paths existing between the Source node and the Sink node in accordance to the different route trust values. This probabilistic method of data transmission through the various alternate routes can be appropriately modeled with the help of Genetic Algorithms. Our protocol is mainly targeted in selecting the reliable or trustworthy routes more frequently than the unreliable ones. In addition, it also prevents concentration of the entire data traffic through a single route eliminating any possible occurrence of bottleneck. The merits of our protocol in comparison to the presently existing routing protocols are justified through the simu lation results obtained which show improvements in both the percentage ratio of successful transmission of data packets to the total number of data packets sent and the overall network lifetime.

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

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 New Trusted Routing Scheme In Vanets

Routing security has been paid more attention gradually in Vehicular Ad hoc Networks (VANETs). However, most existing routing protocols just focus on the behavior credibility which is a kind of subjective trust, merely applied to trust evaluation among familiar nodes, and cannot objectively reflect the trust degree of a given node in the whole network. So based on the former GPSR (Greedy Perimeter Stateless Routing) protocol, the concept of experiential trustiness is introduced as the metrics of credibility. We can establish trust relationships among strangers via extending GPSR protocol, and produce a novel trust routing protocols adaptive to the VANETs. According to the experiential trustiness we design a new dynamic packet forwarding rule, and give some recommendatory methods for calculating the experiential trustiness. The experimental results show that the proposed experiential trustiness is feasible and effective for trust evaluation among strangers. And in consideration of behavior trustiness on packet delivery ratio and routing packet transmission ratio indexes, the improved GPSR protocol(E-GPSR) has obvious advantages compared with the standard GPSR and the variant GPSR even when there are 50% selfish nodes in network. Moreover the improved GPSR also overmatches the other two protocols at throughput aspect in the case without malicious nodes.

Trustworthy Route formation Algorithm for WSNs

paper introduces a new algorithm for the formation of trustworthy route from source node to Base Station (BS) for secure routing of messages in Wireless Sensor Networks (WSNs). This algorithm process the information given by the Trust dependent Link State Routing Protocol which is improved version of our Routing Protocol presented in (1) Direct Trust dependent Link State Routing Protocol based on Geometric M ean (GM ) of the QoS characteristics which allows the trusted nodes only to participate in the routing. Execution of this algorithm at any node, gives different trusted routes to the BS with different route trusts by filtering the un-trusted nodes on the basis of trust metrics levels. The source node selects the best trustworthy route among many trusted routes given by the neighbor nodes based on neighbor nodes trust levels and the route trust levels of different routes given by them. The newly formed trustworthy route from source node to BS will be the best trustworthy route without considering the malicious/selfish nodes.

A Novel Trust Routing Scheme Based on Node Behaviour Evaluation for Mobile AD Hoc Networks

Abstract With the rapid application and development of mobile ad hoc network, security and trust aze important to the network. As the vazious attack models, we need trust routing scheme to guarantee the security and trust for the network. So trust routing scheme is the main issue in security mobile ad hoc network. As the cooperation chazacter of the network, trust routing is related to node behaviours. A novel trust routing scheme based on node behaviour evaluation is proposed to enhance security of the network. The defmition of trust routing is proposed in the paper. Ad hoc On-Demand Distance Vector (AODV) routing protocol is used to validate trust routing scheme, Route Reply (RREP) Message is extended to record node behaviour.Ns-2 simulator is used to simulate the trust scheme under different node behaviours and experiment scenarios. Simulation results show that trust routing scheme can improve the security and performance of network effectively.

Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT

hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision- making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node's power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.

A trust mechanism-based channel assignment and routing scheme in cognitive wireless mesh networks with intrusion detection

Cognitive Wireless Mesh Networks (CWMN) is a novel wireless network which combines the advantage of Cognitive Radio (CR) and wireless mesh networks. CWMN can realize seamless integration of heterogeneous wireless networks and achieve better radio resource utilization. However, it is particularly vulnerable due to its features of open medium, dynamic spectrum, dynamic topology, and multi-top routing, etc.. Being a dynamic positive security strategy, intrusion detection can provide powerful safeguard to CWMN. In this paper, we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection. Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calculating trust degree is given based on distributed detection of attack to networks. A channel assignment and routing scheme is proposed, in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route. Simulation results indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels, and improve the packet safe delivery fraction effectively.

Trust Based Routing for Misbehavior Detection in Ad Hoc Networks

Node misbehavior due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. To deal with misbehavior in MANET, an incentive mechanism should be integrated into routing decision-making. In this paper firstly we review existing techniques for secure routing, and then propose to use trust vector model based routing protocols. Each node would evaluate its own trust vector parameters about neighbors through monitoring neighbors’ pattern of traffic in network. At the same time, trust dynamics is included in term of robustness. Then we integrated trust model into Dynamic Source Routing (DSR) and Ad-hoc On Demand Distance Vector (AODV) which are most typical routing protocols in MANET. We evaluate the performance of those trust routing protocols by compar ing the simulation results of with and without the proposed trust mechanism . The simulation results demonstrate that modified routing protocols can effectively detect malicious nodes and mitigate their attacks.

Research on Beta Trust Model of Wireless Sensor Networks Based on Energy Load Balancing

This paper proposed beta trust model based on energy load balancing combines the recent achievements of the trust models in distributed networks, together with the characteristics of wireless sensor networks. The inter-node trust relation is established after an overall evaluation of node trust value based on the monitor results of the node packets forwarding behavior conducted by inter-node collaboration. Due to the node energy limitation in wireless sensor networks, energy load balancing mechanism is applied to prolong the node survival time. And the redundant routing protocol involves the presented trust model to develop the novel trust routing protocol of beta trust model based on energy load balancing. Simulation performance demonstrates that the beta trust model based on energy load balancing outperforms current schemes in energy consumption.

Improve routing trust with promiscuous listening routing security algorithm in mobile ad hoc networks

In this paper, we propose a novel routing security algorithm, called promiscuous listening routing security algorithm, for mobile hosts to detect malicious attacks in the middle, such as packet dropping or modifying. After identifying the malicious nodes, mobile hosts can isolate these nodes. The proposed algorithm is distributed and does not need any communications between hosts. It only switches on the promiscuous listening mode in hosts. Through detailed simulations, the performance of data transmission is improved by the proposed algorithm. Even only when parts of hosts employ the algorithm intermittently, the improvement is obvious.

A Comprehensive Trust Model Based on Multi-factors for WSNs

The goal of this paper is to introduce a novel trust model for wireless sensor networks. This trust model calculates trust value of nodes through two kinds of trusts: private trust and interactive trust of a node. Private trust focuses on the past record of a node’s sensing and its remaining energy. Interactive trust cares for the interaction of a node with its neighbors. This trust model can recognize faulty nodes inside a network, reduce their impaction to data acquisition, and select a trust routing for precise data transmission. A simulation is given and shows that this trust model has a higher performance than TMS and ECCR in some aspects. But it consumes more energy than ECCR for its comprehensive structure of data.