Trust Value Of Node Research Articles

Preventing Gray Hole Attack using AOTMDV Routing protocol in MANE

MANETs are autonomous and decentralized networks. It is accessible to both genuine users and malicious attackers. In the network services, confidentiality and integrity of the data is affected due to security issues. MANETs are very vulnerable to various attacks from malicious nodes, some classical malicious attacks (eg., DoS attacks, warm-hole attack, gray-hole attack and black-hole attack). In this paper, we are calculating the trust value of nodes using decision factors such as direct degree and recommendation degree. We focus on further improvement of routing, trust based Ad-hoc On-demand Multi-path Distance Vector Routing (AOTMDV) protocol is used, which is an extension form of Ad-hoc On-demand Multi-path Distance Vector Routing (AOMDV) protocol. AOTMDV protocol is to incorporate other decision factors (Incentive function and Active degree) to improve the trust. By enhancing the trust, gray hole attacks will be prevented and the performance of network throughput, packet delivery ratio and malicious attack resistance also improved effectively.

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.

Trust Aware Data Aggregation And Intrusion Detection System For Wireless Sensor Networks

Abstract Data Aggregation (DA) is one of the most frequently used techniques in Wireless Sensor Networks (WSNs) to improve the network lifetime. It involves gathering, consolidating, and routing the sensory data collected by sensor nodes. However, research studies have demonstrated that the dependability of the DA process affects severely when malicious nodes are present in the network. Many security solutions using cryptography and Intrusion Detection System (IDS) have been proposed in the literature for smooth conduction of the aggregation process. However, these solutions require more energy and processing capacity, which are the main constraints for sensor nodes. To this end, the current study presents Trust-Aware Data Aggregation and Intrusion Detection System (TDAGIDS) for clustered WSNs. This TDAGIDS has two modules viz., trust management and intrusion detection. Each node runs a Trust Management System (TMS) that computes the trust value of neighbor nodes by observing their activities. On the other hand, the Base Station (BS) is equipped with IDS that collects the trust values of network nodes and runs a statistical test to identify malicious nodes. In this way, TMS at the node level and IDS at BS level work in collaboration to detect and isolate the malicious nodes from the DA process. The simulation results show the effectiveness of the TDAGIDS over baseline T-LEACH (Trusted Low Energy Adaptive Clustering Hierarchy) protocol and recently proposed TDAGIOT (Trust based Data Aggregation for Internet of Things) method

Research on dynamic trust model based on recommendation trust iteration

For the difficulty to accurately calculate the recommendation trust value of nodes in current P2P trust management models, it is hard to recognise the malicious recommendations of some nodes. By introducing the concept of historical successful transaction rate and the concept of the best recommendation chain into trust calculation process, a dynamic trust management model based on recommendation trust iterations is proposed in this paper. In the new trust model, the recommendation trust value of nodes can be more accurately calculated. Therefore the trust management model could describe the dynamic trusts of nodes, and it could help users to make decisions to select the transaction nodes, against malicious nodes and malicious recommendations. Simulation results show that the novel trust model has better dynamic adaptability and higher security compared with the current models.

Design of a Novel Trust Model and its Application in Trust based Routing to Defend against Dishonest Recommenders

Trust management frameworks play a very important role in securing the mobile ad hoc networks against various insider attacks that could occur during data forwarding. The success of a trust management framework greatly depends upon the proper design of each of its major components including the direct trust computation component as well as the indirect trust computation component. Specifically, the indirect trust computation component should be robust to handle the dishonest recommendations. The current paper shows the application of a trust model involving a robust indirect trust computation component called as RecommFilter which has been proposed in our earlier work. It can overcome the various attacks caused by dishonest recommenders. The application involves the integration of the trust model with a routing protocol based upon a reliability measure called as Path Allegiance metric (PAM) which is a cumulative value obtained through the trust values of the on-path nodes upon each other. Experimental results show that the proposed scheme along with PAM routing protocol is robust to different dishonest recommendation attacks and accurate in the detection of dishonest recommenders. General Terms Mobile Ad hoc Networks, Trust Management framework, Uncertainty reasoning.

BTRES: Beta-based Trust and Reputation Evaluation System for wireless sensor networks

Unlike traditional networks, the wireless sensor networks (WSNs) are very vulnerable to internal attacks from compromised nodes. The trust management system is the most effective way to defend the attack inside the network. The Beta-based Trust and Reputation Evaluation System (BTRES) is proposed in this paper for WSNs׳ node trust and reputation evaluation. BTRES is based on monitoring nodes׳ behavior, and beta distribution is used to describe the distribution of nodes׳ credibility. The node trust values are used to guide the selection of relay nodes, mitigating internal attacks risks. Simulation results show that the use of BTRES could effectively maximize the defense of internal attacks from compromised nodes and improve the WSNs׳ information security. In this paper, we mainly focus on the communication trust and data trust, and energy trust can be easily integrated into BTRES.

Trust based routing mechanism for securing OSLR-based MANET

A mobile ad hoc network (MANET) is a kind of infrastructure-less wireless network that is self-organized by mobile nodes communicating with each other freely and dynamically. MANET can be applied to many fields, such as emergency communications after disaster, intelligent transportation, and Internet of things. With the rapid development of wireless network applications, MANET will become dense and large because more and more mobile devices are required to be interconnected. The optimized link state routing (OLSR) protocol is an efficient proactive routing protocol which is very suitable for such dense and large-scale MANET. However, in both data plane and routing plane, OLSR-based MANET suffers from many serious security threats which are difficult to resist via traditional security mechanisms. In this paper, we propose a trust based routing mechanism to alleviate this issue. In this mechanism, a trust reasoning model based on fuzzy Petri net is presented to evaluate trust values of mobile nodes. In addition, to avoid malicious or compromised nodes, a trust based routing algorithm is proposed to select a path with the maximum path trust value among all possible paths. Then we extend OLSR by using the proposed trust model and trust based routing algorithm, called FPNT-OLSR. For the implementation of FPNT-OLSR, we design a trust factor collecting method and an efficient trust information propagating method, which do not generate extra control messages. Simulation results show that FPNT-OLSR is very effective in establishing secure routes. It also performs better than existing trust based OLSR protocols in terms of packet delivery ratio, average latency and overhead.

A Self-Adaptive Wireless Sensor Network Coverage Method for Intrusion Tolerance Based on Trust Value

The sensor is quite easily attacked or invaded during the process of the node coverage optimization. It is a great challenge to make sure that the wireless sensor network could still carry out a secure communication and reliable coverage under the condition of being attacked. Therefore, this paper proposes a network coverage method for intrusion tolerance based on trust value of nodes by combining the trust value model with the reliable coverage optimization. It first estimates trust value of nodes through which to regulate the perception radius and decision-making radius. Furthermore, this algorithm also combines the classical methods of wireless network coverage, such as GSO and PSO, to realize the networks coverage of invasive tolerant sensor. After comparing with the conventional single cover mechanism, it can improve the security and coverage rate of network under the condition of invasion. The simulation results verify the effectiveness of the algorithm.

SEDAR: secured energy efficient destination aware routing protocol in delay tolerant network

Delay tolerant network is highly emerging and competing research area, particularly in an era where the ultimate aim is to provide ubiquitous connectivity, even in diversified regions. Routing with minimum bandwidth and limited energy consumption is a challenging issue thereof. Problem of optimising path is of great deal when energy constraints become the main issue. This paper proposes a secured energy efficient destination aware routing protocol, SEDAR. SEDAR restricts the transmission area by splitting geographical region into various sectors. A direction angle for given destination is computed using global positioning system (GPS) coordinates. Heuristic information at current relay node and predictive inferences based on direction angle are used to obtain optimal trajectory toward the destination. Cooperative neighbour node selection is done based on some computed factors viz. node's trust value and node's residual energy level. SEDAR supports public key cryptographic model to deliberately introduce security issues. Performance of SEDAR is evaluated on map–based movement model. Results obtained prove SEDAR to be energy efficient. Comparative results obtained prove that SEDAR increases packet delivery ratio by 15–30%, decreases routing overhead and also reduces energy consumption by 3–5%. Simulation results establish the correctness of the proposed algorithm.

Markov Chain Based Trust Management Scheme for Wireless Sensor Networks

As the effective supplement to traditional cryptography security, trust management plays a key role for detecting malicious behaviors in wireless sensor networks. In this paper, we consider a sensor network wherein nodes have fixed number of states and probabilities of state transitions can be specified. We introduce Markov chain model and Fokker-Planck equation for evaluating the short-term trust value of nodes. In order to avoid the drawbacks of existing long-term trust evaluation models, we propose a new evaluation model with adaptive forgetting factors, where step functions are introduced to calculate the current forgetting factor. Simulation results show that the proposed trust management scheme can effectively detect malicious nodes in wireless sensor networks, and significantly improve the packet delivery ratio compared to the counterparts.

The Study of Trust Evaluation Model Based on Improved AHP and Cloud Model in IoT

Because nodes in the loT(Internet of Things) are widely distributed and most of them are unattended, so single node is vulnerable to be attacked and destroyed. Once one node is destroyed or attacked, the whole loT will be faced with tremendous security problems. This paper proposed a Trust Evaluation Model of loT based on AHP and Backward Cloud Model. In the model, in order to be solve the problem that nodes in loT have limited resources, the paper made use of the improved AHP(Analytic Hierarchy Process) and Reverse Cloud Model method, which can work with simple calculation and few resources. In the last, we simulate the method using omnet++ and simulation result show that the model can evaluate the trust value of the malicious node that executes bad communication behaviours fast and also reduce the possibility of wrong judgment.

E-Commerce Recommending Model Based on Trust Community

To responses to the current information "overload" problem widespread in e-commerce systems, a new approach, using the method of user clustering, node trust value analyzing and product evaluating is put forward to build an e-commerce trust community for e-commerce recommendation. According to some of the most trusted neighbors` evaluation information for goods, the recommendation model predicts the score of goods that the users have purchased, to recommend items which have a higher value score, to a customer. In the proposed recommending algorithm, the time effect of recommendation is taken into consideration to provide effective recommending services for users.

BPTrust: A Novel Trust Inference Probabilistic Model based on Balance Theory for Peer-to-Peer Networks

In this paper, we propose a novel trust inference model named BPTrust (Balance and Probability based Trust model) based on balance theory and probability theory. Trust relations network, trust inference network and trust inference deep level are defined firstly before modelling. Based on balance theory, two inference rules are proposed, and trusted evidence chains generation algorithm is designed. In terms of a single trusted evidence chain, mathematics models are proposed to infer the trust value of sink node based on Markov chain theory while Bayesian theory is used to design inferring model during multi paths condition. Simulations proved the rightness and effectiveness.DOI: http://dx.doi.org/10.5755/j01.eee.18.10.3068

Dynamic Monitoring in Ad Hoc Network

This paper, present a novel model to resolve the problems of evaluating trust value of nodes, and prepare a dynamic supervising in ad hoc network as well. Trust evaluation is not only based on direct interactions among nodes, but also observing previous behaviors of nodes, which come from all interactions through the network. This model specially decreases the delay time of selecting a new head for each cluster, which leads to prepare a dynamic monitoring in intra cluster and inter cluster in ad hoc network.

Trust Based Scheme for QoS Assurance in Mobile Ad-Hoc Networks

A mobile ad-hoc network (MANET) is a peer-to-peer wireless network where nodes can communicate with each other without the use of infrastructure such as access points or base stations. These networks are self-configuring, capable of self-directed operation and hastily deployable. Nodes cooperate to provide connectivity, operates without centralized administration. Nodes are itinerant, topology can be very dynamic and nodes must be able to relay traffic since communicating nodes might be out of range. The dynamic nature of MANET makes network open to attacks and unreliability. Routing is always the most significant part for any networks. Each node should not only work for itself, but should be cooperative with other nodes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET. The Qos parameters like PDR, throughput and delay are affected directly due to such misbehaving nodes. We focus on trust management framework, which is intended to cope with misbehaviour problem of node and increase the performance of MANETs. A trust-based system can be used to track this misbehaving of nodes, spot them and isolate them from routing and provide reliability. In this paper a Trust Based Reliable AODV [TBRAODV] protocol is presented which implements a trust value for each node. For every node trust value is calculated and based trust value nodes are allowed to participate in routing or else identified to become a misbehaving node. This enhances reliability in AODV routing and results in increase of PDR, decrease in delay and throughput is maintained. This work is implemented and simulated on NS-2. Based on simulation results, the proposed protocol provides more consistent and reliable data transfer compared with general AODV, if there are misbehaving nodes in the MANET

A Trust Evaluation Algorithm for Wireless Sensor Networks Based on Node Behaviors and D-S Evidence Theory

For wireless sensor networks (WSNs), many factors, such as mutual interference of wireless links, battlefield applications and nodes exposed to the environment without good physical protection, result in the sensor nodes being more vulnerable to be attacked and compromised. In order to address this network security problem, a novel trust evaluation algorithm defined as NBBTE (Node Behavioral Strategies Banding Belief Theory of the Trust Evaluation Algorithm) is proposed, which integrates the approach of nodes behavioral strategies and modified evidence theory. According to the behaviors of sensor nodes, a variety of trust factors and coefficients related to the network application are established to obtain direct and indirect trust values through calculating weighted average of trust factors. Meanwhile, the fuzzy set method is applied to form the basic input vector of evidence. On this basis, the evidence difference is calculated between the indirect and direct trust values, which link the revised D-S evidence combination rule to finally synthesize integrated trust value of nodes. The simulation results show that NBBTE can effectively identify malicious nodes and reflects the characteristic of trust value that ‘hard to acquire and easy to lose’. Furthermore, it is obvious that the proposed scheme has an outstanding advantage in terms of illustrating the real contribution of different nodes to trust evaluation.

A secure model for controlling the hubs in P2P wireless network based on trust value

Recently a lot of efforts are focused on the most promising solutions in future communication environments with information and communication security technologies. As a result of anonymity and contribution resources voluntary of nodes in P2P wireless network, the overwhelming nodes lack enthusiasm when they provide service, which is easy to cause free riding phenomenon. Thus, it leads to the emergence of hubs. Due to the existence of hubs in P2P wireless networks, the network becomes much more vulnerable because of great reducing in defending against coordinated attacks. Therefore, in this paper we provide a secure model for controlling the hubs in P2P network based on trust value. In detail, this paper proposes a model based on trust value of nodes against vulnerability, which not only takes into account a node’s connections, but also gives full consideration about a node’s trust value. The calculation of trust value is broken down to various types of resources. In accordance with the type of pre-transaction resources, the nodes that have higher trust value and fewer connections are chosen to make transaction. Simulation results demonstrate that this model can encourage nodes to participate in sharing recourses with other nodes in the network actively, and simultaneously it can avoid generating hubs effectively. Our model could improve the ability of defending against coordinated attacks, and also could enhance the network robustness and stability.

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.

Markov Chain Trust Model for Trust-Value Analysis and Key Management in Distributed Multicast MANETs

To increase efficiency in mobile ad hoc networks (MANETs), the multicast MANET is proposed for a sender that sends packets to several receivers through a multicast session. In MANETs, multicast group members frequently change due to node mobility; thus, supporting secure authentication and authorization in a multicast MANET is more critical than that in a wired network with a centralized certificate authentication (CA) server. This paper thus proposes a two-step secure authentication approach for multicast MANETs. First, a Markov chain trust model is proposed to determine the trust value (TV) for each one-hop neighbor. A node's TV is analyzed from its previous trust manner that was performed in this group. The proposed trust model is proven as an ergodic continuous-time Markov chain model. Second, the node with the highest TV in a group will be selected as the CA server. To increase reliability, the node with the second highest TV will be selected as the backup CA server that will take over CA when CA fails. The procedures of the secure authentication for group management are detailed. The security analysis of each procedure is analyzed to guarantee that the proposed approach achieves a secure reliable authentication in multicast MANETs. In addition, several famous attacks have been analyzed and discussed. Numerical results indicate that the analytical TV of each mobile node is very close to that of simulation under various situations. The speed of the convergence of the analytical TV shows that the analyzed result is independent of initial values and trust classes. This is a good feature of analytical models.

Trust Model Based on Minimal Uncertainty Metric in Wireless Mesh Network

PDF HTML阅读 XML下载 导出引用 引用提醒 无线网状网基于不确定性度量极小化信任模型 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant Nos.60673142, 60473090 (国家自然科学基金) Trust Model Based on Minimal Uncertainty Metric in Wireless Mesh Network Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:WMN(wireless mesh network)网络环境中,网络拓扑结构的改变或无线冲突的发生,都可能导致作为信任值评估证据的样本空间不一定完整和可靠,使得现有的信任评估模型不能应用其上.为了解决WMN网络节点间信任评估问题和建立信任关系,在研究现有信任模型并分析其存在问题的基础上,提出了基于不确定性度量极小化的信任模型.模型引入可信任度因子,根据网络实际情况,弱化证据样本空间不一定完整和可靠对信任值评估的影响,使得信任评估值的修正量在全局范围内达到最小.仿真实验与基于证据理论的信任评估模型进行了对比 Abstract:In wireless mesh networks, the sample space of evidence may be not integrative or reliable because of the change of network topology and the occurrence of wireless collision. It makes the existing trust evaluation models inapplicable. To evaluate trust values of nodes and establish trust relationship in nodes, a trust model is proposed on the basis of the analyses of the existing trust models and the minimal principle of uncertainty metric. The model reduces the influence of the non-integrated and unreliable sample space through importing a credible parameter. According to the real situation of networks, the model can minimize the amendment of evaluation values in the whole scope. Contrasted with the evidence-based trust model, the simulation results show that the proposed model is effective. 参考文献 相似文献 引证文献