A green trust‐distortion resistant trust management scheme on mobile ad hoc networks

Trust management is an emerging security approach used to conduct nodes' relationships in mobile ad hoc networks. It relates to assigning a trust level to each network component based on its cooperative behavior with respect to system goals. Because of its infrastructure‐less nature, frequent network dynamics, and severe resource constraints, it is complex to establish trust in such a network. Mainly, trust systems are vulnerable to attacks that make use of inherent properties of the trust model to alter the accuracy of estimated trust levels, referred to as trust‐distortion attacks. Because of the contradictory nature of such attacks, their detection can be confusing, complex, and energy‐demanding, especially in multiattack environments. To handle such threats, we propose a Green Trust‐distortion Resistant Trust Management Scheme, called GTRTMS, which handles different trust‐distortion attacks in multiattack environments. The proposed solution self‐adapts its trust knowledge monitoring according to the network context to conserve the energy of mobile nodes and reduce the produced CO₂ emissions. Simulation results prove that GTRTMS exhibits significantly better performance than the other counterpart in presence of simultaneous and contradictory different trust‐distortion attacks.     

A Secure Routing Protocol with Trust and Energy Awareness for Wireless Sensor Network

Nodes in most of the deployments of Wireless Sensor Networks (WSNs) remain un-administered and exposed to variety of security attacks. Characterized by constrained resources and dynamically changing behavior of sensor nodes, reliable data delivery in WSNs is nontrivial. To counter node misbehavior attacks, traditional cryptographic and authentication based solutions have proved to be inappropriate due to high cost and incapability factors. Recently, trust based solutions have appeared to be viable solutions to address nodes’ misbehavior attacks. However, the existing trust based solutions incur high cost in trust estimation and network-wide dissemination which significantly increases traffic congestion and undermines network lifetime. This paper presents a Trust and Energy aware Secure Routing Protocol (TESRP) for WSN that exploits a distributed trust model for discovering and isolating misbehaving nodes. TESRP employs a multi-facet routing strategy that takes into consideration the trust level, residual energy, and hop-counts of neighboring nodes while making routing decisions. This strategy not only ensures data dissemination via trusted nodes but also balances out energy consumption among trusted nodes while traversing through shorter paths. Demonstrated by simulation results in NS-2, TESRP achieves improved performance in terms of energy consumption, throughput and network lifetime as compared to existing solutions.     

Trust evaluation method for clustered wireless sensor networks based on cloud model

Trust Management has been proved to be an effective method to detect malicious nodes and ensure security in Wireless Sensor Networks (WSNs). While, most existing trust management methods are not good at dealing with uncertainty of trust relationship such as randomness, fuzziness in WSNs, which leads to inaccurate trust metric. In this paper, a trust evaluation method for clustered wireless sensor networks based on cloud model is proposed and evaluated, which implements the conversion between qualitative and quantitative of sensor nodes’ trust metrics in order to achieve better trust evaluation. Firstly, the method considers multi-factors including communication factor, message factor and energy factor and builds mathematical model for each trust factor to get factor trust cloud. Secondly, immediate trust cloud is calculated by assigning adjustive weights for each factor trust cloud and combining them. Thirdly, recommendation trust cloud and immediate trust cloud are synthesized according to time sensitive factor in order to get final trust cloud. Furthermore, the final trust cloud of sensor node is converted to trust grade by trust cloud decision-making. Verification Experiments manifest that the proposed method has feasibility and accuracy in the aspect of evaluating sensor nodes’ trust. Moreover, comparison experiments under different attacks show that our method is sensitive to multiple attacks, it outperforms other trust evaluation methods not only in the accuracy of detecting malicious nodes, but also in the tolerance of abnormal conditions.     

A fuzzy‐based trust model for flying ad hoc networks (FANETs)

The use of unmanned aerial vehicles has significantly increased for forming an ad hoc network owing to their ability to perform in exciting environment such as armed attacks, border surveillance, disaster management, rescue operation, and transportation. Such types of ad hoc networks are popularly known as flying ad hoc networks (FANETs). The FANET nodes have 2 prominent characteristics—collaboration and cooperation. Trust plays an important role in predicting the behavior of such nodes. Researchers have proposed various methods (direct and indirect) for calculation of the trust value of a given node in ad hoc networks, especially in mobile ad hoc networks and vehicular ad hoc networks. The major characteristic that differentiates a FANET from other ad hoc networks is the velocity of the node; as a result, there are frequent losses in connection and topology change. Therefore, the existing methods of trust calculation are not efficient and effective. In this paper, a fuzzy‐based novel trust model has been proposed to handle the behavioral uncertainty of FANET nodes. Nodes are classified using a multicriteria fuzzy classification method based on node's behavior and performance in the fuzzy and complex environment. Quality of service and social parameter (recommendation) are considered for evaluating the trust value of each node to segregate the selfish and malicious nodes. With the node classification, FANET nodes are rewarded or punished to transform node behavior into a trust value. Compared with the existing trust techniques, the simulation results show that the proposed model has better adaptability, accuracy, and performance in FANETs.     

A Risk-Aware Reputation-Based Trust Management in Wireless Sensor Networks

Wireless sensor networks (WSNs) are susceptible to many security threats and are specifically prone to physical node capture in which the adversary can easily launch the so-called insider attacks such as node compromise, bypassing the traditional security mechanisms based on cryptography primitives. So, the compromised nodes can be modified to misbehave and disrupt the entire network and can successfully perform the authentication process with their neighbors, which have no way to distinguish fraudulent nodes from trustworthy ones. Trust and reputation systems have been recently suggested as a powerful tools and an attractive complement to cryptography-based schemes in securing WSNs. They provide ability to detect and isolate both faulty and malicious nodes. Considerable research has been done on modeling and managing trust and reputation. However, trust topic issue in WSNs remains an open and challenging field. In this paper, we propose a Risk-aware Reputation-based Trust (RaRTrust) model for WSNs. Our novel framework uses both reputation and risk to evaluate trustworthiness of a sensor node. Risk evaluation is used to deal with the dramatic spoiling of nodes, which makes RaRTrust robust to on–off attack and differ from other trust models based only on reputation. This paper contributes to model the risk as opinion of short-term trustworthiness combining with traditional reputation evaluation to derive trustworthiness in WSNs.

     

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks (MANET) is a decentralized, self‐organizing, infrastructure‐less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On‐demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service (DOS/DDOS) attack using network simulator NS‐2. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end‐to‐end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV + Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV + Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end‐to‐end delay, there is no significant improvement. Copyright © 2014 John Wiley & Sons, Ltd.     

TBCS: A Trust Based Clustering Scheme for Secure Communication in Flying Ad-Hoc Networks

In Flying Ad hoc Networks (FANETs), coordination and cooperation among nodes are important for efficient data transmission. Cooperation among the nodes hinges on the node behavior and the behavior of the node can be quantified using the concept of trust. Trust helps in segregation of non-cooperative and malicious network nodes, thus increasing the reliability of information exchanged among nodes. In this paper, a Trust Based Clustering Scheme (TBCS) has been proposed for FANETs. TBCS use a multi-criteria fuzzy method for the classification based on the node’s behavior in the fuzzy and complex environment. The proposed scheme makes use of Takagi–Sugeno–Kang fuzzy inference method. The reward and punishment mechanism has been introduced to convert the node’s behavior into trust, and to segregate malicious and misbehaving nodes in the FANET. Furthermore, a secure Cluster Head has been selected based on calculated trust values that is responsible for communication with ground control station and inter-cluster communication. TBCS is compared with existing trust models and the experiment results revealed that the proposed TBCS model has high accuracy, better performance, and adaptability in FANETs.

     

On the tradeoff between altruism and selfishness in MANET trust management

Mobile ad hoc and sensor networks may consist of a mixture of nodes, some of which may be considered selfish due to a lack of cooperativeness in providing network services such as forwarding packets. In the literature, existing trust management protocols for mobile ad hoc networks advocate isolating selfish nodes as soon as they are detected. Further, altruistic behaviors are encouraged with incentive mechanisms. In this paper, we propose and analyze a trust management protocol for group communication systems where selfish nodes exist and system survivability is highly critical to mission execution. Rather than always encouraging altruistic behaviors, we consider the tradeoff between a node’s individual welfare (e.g., saving energy to prolong the node lifetime) vs. global welfare (e.g., achieving a given mission with sufficient service availability) and identify the best design condition of this behavior model to balance selfish vs. altruistic behaviors. With the system lifetime and the mission success probability as our trust-based reliability metric, we show that our behavior model that exploits the tradeoff between selfishness vs. altruism outperforms one that only encourages altruistic behaviors.     

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network (WSN). Although the hierarchical routing protocol can effectively cope with large-scale application scenarios, how to elect a secure cluster head and balance the network load becomes an enormous challenge. In this paper, a Trust Management-based and ​Low Energy Adaptive Clustering Hierarchy protocol (LEACH-TM) is proposed. In LEACH-TM, by using the number of dynamic decision cluster head nodes, residual energy and density of neighbor nodes, the size of the cluster can be better constrained to improve energy efficiency, and avoid excessive energy consumption of a node. Simultaneously, the trust management scheme is introduced into LEACH-TM to defend against internal attacks. The simulation results show that, compared with LEACH-SWDN protocol and LEACH protocol, LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption, and can effectively mitigate the influence of malicious nodes on cluster head selection, which can greatly guarantee the security of the overall network.     

Trust-Aware Fuzzy Evaluation Method for Preventive Route Generation in Mobile Network

The existence of a non-cooperative or black hole node as an intermediate node in a mobile network can degrade the performance of the network and affects the trust of neighbor nodes. In this paper, a trust-aware routing protocol is defined for improving the routing reliability against black hole attacks. A new Trust aware and fuzzy regulated AODV (TFAODV) protocol is investigated in this work as an improvement over the existing AODV protocol. The session-driven evaluation of stability, communication-delay, and failure-ratio parameters are conducted for evaluating the trust of nodes. The fuzzy rules apply to these parameters for computing the degree of trust. This trust vector isolates the attack-suspected and trustful nodes. The proposed TFAODV protocol used the trustful mobile nodes as the intermediate path nodes. The proposed protocol has been experimented with in the NS2 simulation environment. The analytical results are obtained in terms of PDR ratio, Packet Communication, Loss rate parameters. The comparative results are derived against the AODV, Probabilistic AODV, PDS-AODV, PSAODV, and Juneja et al. protocols. The analysis is performed on different scenarios varied in terms of network density, degree of stability, and the number of attackers. The simulation results ensured the proposed TFAODV protocol has improved the PDR ratio and reduced the communication loss significantly against these state-of-art protocols.

     

Trust prediction and trust-based source routing in mobile ad hoc networks

Mobile ad hoc networks (MANETs) are spontaneously deployed over a geographically limited area without well-established infrastructure. The networks work well only if the mobile nodes are trusty and behave cooperatively. Due to the openness in network topology and absence of a centralized administration in management, MANETs are very vulnerable to various attacks from malicious nodes. In order to reduce the hazards from such nodes and enhance the security of network, this paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction. We have also integrated the proposed trust predication model into the Source Routing Mechanism. Our novel on-demand trust-based unicast routing protocol for MANETs, termed as Trust-based Source Routing protocol (TSR), provides a flexible and feasible approach to choose the shortest route that meets the security requirement of data packets transmission. Extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in malicious node identification and attack resistance. The results show that TSR improves packet delivery ratio and reduces average end-to-end latency.     

Study on Quantum Trust Model Based on Node Trust Evaluation

Trust is the premise and foundation of se-cure communication, no matter in the quantum commu-nication or classical communication. In fact, the existing quantum secure communication protocols and technolo-gies are implicitly related to trust; or assume some trust premise in advance; or create or obtain a trust relationship. This paper studies on quantum trust model using node trust evaluation based on author's own research achieve-ments. We introduce the trust management into quantum communication network to build secure trusted quantum communication network based on evaluating the trust val-ues of nodes, which are used to evaluate the reliability of each user. We put forward a scheme of quantum trust model based on node trust evaluation, and describe the thought and process of trust evaluation in detail based on the principles of quantum entanglement and quantum teleportation. We analyze the feasibility and safety of this scheme, which provides a new thinking and method for es-tablishing a credible secure quantum communication net-work.     

一种移动P2P网络环境下的动态安全信任模型

信任是移动对等(MP2P)网络安全中首要解决的关键技术问题.由于MP2P网络环境与P2P网络环境有本质的区别,因此现有P2P网络信任模型并不适用于MP2P网络环境.本文提出一种适合MP2P网络环境的动态安全信任模型DSTM_MP2P.DSTM_MP2P包括两种方案,一种是针对节点的信任信息已知或部分已知的情况,提出基于节点行为的节点类型识别机制;另一种是针对节点的信任信息未知的情况,提出基于贝叶斯博弈的节点概率选择策略.通过理论分析和实验证明,无论MP2P网络环境如何,DSTM_MP2P模型使得请求节点总是优先连接安全可靠的节点,从而极大地提高了下载成功率.     

Trust Based Detection and Elimination of Packet Drop Attack in the Mobile Ad-Hoc Networks

The mobile ad hoc network (MANET) is communication network of a mobile node without any prior infrastructure of communication. The network does not have any static support; it dynamically creates the network as per requirement by using available mobile nodes. This network has a challenging security problem. The security issue mainly contains a denial of service attacks like packet drop attack, black-hole attack, gray-hole attack, etc. The mobile ad-hoc network is an open environment so the working is based on mutual trust between mobile nodes. The MANETs are vulnerable to packet drop attack in which packets travel through the different node. The network while communicating, the node drops the packet, but it is not attracting the neighboring nodes to drop the packets. This proposed algorithm works with existing routing protocol. The concept of trusted list is used for secure communication path. The trusted list along with trust values show how many times node was participated in the communication. It differentiates between altruism and selfishness in MANET with the help of energy level of mobile components. The trust and energy models are used for security and for the differentiation between altruism and selfishness respectively.     

Trust model for certificate revocation in ad hoc networks

In this paper we propose a distributed trust model for certificate revocation in ad hoc networks. The proposed model allows trust to be built over time as the number of interactions between nodes increase. Furthermore, trust in a node is defined not only in terms of its potential for maliciousness, but also in terms of the quality of the service it provides. Trust in nodes where there is little or no history of interactions is determined by recommendations from other nodes. If the nodes in the network are selfish, trust is obtained by an exchange of portfolios. Bayesian networks form the underlying basis for this model.     

SSDHT：基于社交网络的DHT安全增强机制

P2P系统在文件共享等领域中得到了广泛的应用,但DHT（distributed hash table）网络无中心、无认证、缺乏节点身份验证机制,使得现有的基于DHT的P2P系统易受到Sybil攻击等外部攻击。提出一种基于社交网络的DHT安全增强机制,将社交网络中节点的信任关系引入DHT网络中提高对Sybil节点的识别能力。以KAD（Kademlia）算法为例进行了实验验证,基于Facebook和Twitter数据集的实验结果表明本文提出的安全机制适用于大规模动态的网络,能够有效防御Sybil攻击。     

Applying trust enhancements to reactive routing protocols in mobile ad hoc networks

Due to the characteristics of mobile ad hoc networks, such networks are more susceptible to the destruction of malicious attacks or denial of cooperation. It would be easy for an adversary or a malicious node to launch attacks on routing function, especially attacks on packet routing. In order to mitigate these hazards, we incorporate the concept of ‘trust’ into MANETs, and abstract a decentralized trust inference model. The core of this model is trust computation, which is divided into two parts: historical trust assessment and trust prediction. We can quantify a node’s historical trust based on its historical behaviors via introducing multiple trust attributes. The fuzzy AHP method based on entropy weights is used to calculate the weight of trust attributes. By making use of the obtained historical trust data sequence, we propose an improved dynamic grey-Markov chain prediction measure to effectively estimate node’s trust prediction. In order to verify the validity of our trust model, we propose a trust-enhanced unicast routing protocol and a trust-enhanced multicast routing protocol, respectively. Both of the two new protocols can provide a feasible approach to kick out the untrustworthy nodes and choose the optimal trusted routing path. Moreover, the new proposed data-driven route maintenance mechanisms can reduce the routing overhead. The persuasive experiments have been conducted to evaluate the effectiveness of the new proposed trust-enhanced routing protocols in the aspects of packets delivery ratio, end-to-end latency, malicious node detection and attack resistance.     

Byzantine robust trust establishment for mobile ad hoc networks

In a mobile ad hoc network (MANET), the nodes act both as traffic sources and as relays that forward packets from other nodes along multi-hop routes to the destination. Such networks are suited to situations in which a wireless infrastructure is unavailable, infeasible, or prohibitively expensive. However, the lack of a secure, trusted infrastructure in such networks make secure and reliable packet delivery very challenging. A given node acting as a relay may exhibit Byzantine behavior with respect to packet forwarding, i.e., arbitrary, deviant behavior, which disrupts packet transmission in the network. For example, a Byzantine node may arbitrarily choose to drop or misroute a certain percentage of the packets that are passed to it for forwarding to the next hop. In earlier work, we proposed a trust establishment framework, called Hermes, which enables a given node to determine the “trustworthiness” of other nodes with respect to reliable packet delivery by combining first-hand trust information obtained independently of other nodes and second-hand trust information obtained via recommendations from other nodes. A deficiency of the Hermes scheme is that a node can fail to detect certain types of Byzantine behavior, such as packet misforwarding directed at a particular source node. In this paper, we propose new mechanisms to make Hermes robust to Byzantine behavior and introduce a punishment policy that discourages selfish node behavior. We present simulation results that demonstrate the effectiveness of the proposed scheme in a variety of scenarios involving Byzantine nodes that are malicious both with respect to packet forwarding and trust propagation.     

MANET 中基于信任的安全位置辅助路由模型

In view of the security weakness in resisting the active attacks by malicious nodes in mobile ad hoc networks, the trust metric is introduced to defend those attacks by loading a trust model on the previously proposed Distance Based LAR. The improved Secure Trust based Location Aided Routing algorithm utilizes direct trust and recommendation trust to prevent malicious nodes with low trust values from joining the forwarding. Simulation results reveal that ST LAR can resist attacks by malicious nodes effectively; furthermore, it also achieves better performance than DBLAR in terms of average end to end delay, packet delivery success ratio and throughput.     

ProTru: a provenance‐based trust architecture for wireless sensor networks

Trust is an important component of wireless sensor networks for believability of the produced data, and trust history is a crucial asset in deciding trust of the data. In this paper, we show how provenance can be used for registering previous trust records and other information such as node type, data type, and node location. Our aim is to design a distributed trust‐enhancing architecture using only local provenance during sensor fusion with a low communication overhead. Our network is cognitive in the sense that our system reacts automatically upon detecting low trust. Copyright © 2016 John Wiley & Sons, Ltd.