scholarly journals Performance Analysis of Wireless Sensor Networks Based on Trust Mechanism

Author(s):  
Subiksha. V

Abstract: Due to the characteristics like limited resources and dynamic topology, wireless sensor networks (WSNs) are facing two major problems such as security and energy consumption. To deal with various improper behaviors of nodes the trust-based solutions are possible but still exist a variety of attacks, high energy consumption, and communication congestion between nodes. Therefore, this paper proposes an advanced and efficient trust-based secure and energy-efficient routing protocol (TBSEER) to solve these network problems and to avoid malicious nodes. Efficient Adaptable Ant Colony Optimization Algorithm (EAACO) calculates the comprehensive trust value through adaptive direct trust value, indirect trust value, and energy trust value, which can be resistant to internal network attacks such as sinkhole, black hole, selective forwarding, and hello flood attacks. In addition, to fast identify the malicious nodes in the WSN, the adaptive penalty mechanism and volatilization factor are used. Moreover, the nodes only need to calculate the direct trust value, and the indirect trust value is obtained by the sink, so as to further reduce the energy consumption caused by iterative calculations. To actively avoid network attacks, the cluster heads find the safest multi-hop routes based on the comprehensive trust value. The simulation results show that the proposed EAACO reduces network energy consumption, speeds up the identification of malicious nodes, as well as resists all common attacks. Keywords: Comprehensive trust value, direct trust value, indirect value, EAACO, network attacks, wireless sensor networks

Author(s):  
Audrey NANGUE ◽  
◽  
Elie FUTE TAGNE ◽  
Emmanuel TONYE

The success of the mission assigned to a Wireless Sensor Network (WSN) depends heavily on the cooperation between the nodes of this network. Indeed, given the vulnerability of wireless sensor networks to attack, some entities may engage in malicious behavior aimed at undermining the proper functioning of the network. As a result, the selection of reliable nodes for task execution becomes a necessity for the network. To improve the cooperation and security of wireless sensor networks, the use of Trust Management Systems (TMS) is increasingly recommended due to their low resource consumption. The various existing trust management systems differ in their methods of estimating trust value. The existing ones are very rigid and not very accurate. In this paper, we propose a robust and accurate method (RATES) to compute direct and indirect trust between the network nodes. In RATES model, to compute the direct trust, we improve the Bayesian formula by applying the chaining of trust values, a local reward, a local penalty and a flexible global penalty based on the variation of successful interactions, failures and misbehaviors frequency. RATES thus manages to obtain a direct trust value that is accurate and representative of the node behavior in the network. In addition, we introduce the establishment of a simple confidence interval to filter out biased recommendations sent by malicious nodes to disrupt the estimation of a node's indirect trust. Mathematical theoretical analysis and evaluation of the simulation results show the best performance of our approach for detecting on-off attacks, bad-mouthing attacks and persistent attacks compared to the other existing approaches.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhiming Zhang ◽  
Yu Yang ◽  
Wei Yang ◽  
Fuying Wu ◽  
Ping Li ◽  
...  

The current detection schemes of malicious nodes mainly focus on how to detect and locate malicious nodes in a single path; however, for the reliability of data transmission, many sensor data are transmitted by multipath in wireless sensor networks. In order to detect and locate malicious nodes in multiple paths, in this paper, we present a homomorphic fingerprinting-based detection and location of malicious nodes (HFDLMN) scheme in wireless sensor networks. In the HFDLMN scheme, using homomorphic fingerprint and coding technology, the original data is divided into n packets and sent to the base station along n paths, respectively; the base station determines whether there are malicious nodes in each path by verifying the validity of the packets; if there are malicious nodes in one or more paths, the location algorithm of the malicious node is implemented to locate the specific malicious nodes in the path; if all the packets are valid, the original data is recovered. The HFDLMN scheme does not need any complex evaluation model to evaluate and calculate the trust value of the node, nor any monitoring nodes. Theoretical analysis results show that the HFDLMN scheme is secure and effective. The simulation results demonstrate promising outcomes with respect to key parameters such as the detection probability of the malicious path and the locating probability of the malicious node.


2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Hyeonsang Cho ◽  
Jungmin So

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.


Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3829 ◽  
Author(s):  
Chuanjun Yi ◽  
Geng Yang ◽  
Hua Dai ◽  
Liang Liu ◽  
Ning Li

The existing public key-based en-route filtering schemes are vulnerable to report disruption attacks or selective forwarding attacks, and they fail to consider any measure to detect and punish the malicious nodes. The authors propose a series of public key-based security mechanisms for wireless sensor networks (WSNs) in this paper, including a mechanism for verifying the partial signatures, a substitution mechanism, an effective report forwarding protocol, and a trust value-based mechanism to identify and punish the malicious nodes. Finally, the authors develop a public key-based authentication and en-route filtering scheme (PKAEF), which can resist false data injection attacks, report disruption attacks and selective forwarding attacks, and can mitigate the impact of malicious nodes. Detailed performance analysis and evaluation show that, in most cases, PKAEF outperforms previous works in terms of safety, filtering efficiency, and data availability.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 968
Author(s):  
Carlos Egas Acosta. ◽  
Felipe Gil-Castiñeira ◽  
Enrique Costa-Montenegro ◽  
Jorge Sá Silva

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.


2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Ling Song ◽  
Liqin Zhao ◽  
Jin Ye

Node location is one of the most important problems to be solved in practical application of WSN. As a typical location algorithm without ranging, DV-Hop is widely used in node localization of wireless sensor networks. However, in the third phase of DV-Hop, a least square method is used to solve the nonlinear equations. Using this method to locate the unknown nodes will produce large coordinate errors, poor stability of positioning accuracy, low location coverage, and high energy consumption. An improved localization algorithm based on hybrid chaotic strategy (MGDV-Hop) is proposed in this paper. Firstly, a glowworm swarm optimization of hybrid chaotic strategy based on chaotic mutation and chaotic inertial weight updating (MC-GSO) is proposed. The MC-GSO algorithm is used to control the moving distance of each firefly by chaos mutation and chaotic inertial weight when the firefly falls into a local optimum. The experimental results show that MC-GSO has better convergence and higher accuracy and avoids the premature convergence. Then, MC-GSO is used to replace the least square method in estimating node coordinates to solve the problem that the localization accuracy of the DV-Hop algorithm is not high. By establishing the error fitness function, the linear solution of coordinates is transformed into a two-dimensional combinatorial optimization problem. The simulation results and analysis confirm that the improved algorithm (MGDV-Hop) reduces the average location error, increases the location coverage, and decreases and balances the energy consumption as compared to DV-Hop and the location algorithm based on classical GSO (GSDV-Hop).


2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Zhu ◽  
Junfang Wei

Underwater Wireless Sensor Networks (UWSNs) have drawn tremendous attentions from all fields because of their wide application. Underwater wireless sensor networks are similar to terrestrial Wireless Sensor Networks (WSNs), however, due to different working environment and communication medium, UWSNs have many unique characteristics such as high bit error rate, long end-to-end delay and low bandwidth. These characteristics of UWSNs lead to many problems such as retransmission, high energy consumption and low reliability. To solve these problems, many routing protocols for UWSNs are proposed. In this paper, a localization-free routing protocol, named energy efficient routing protocol based on layers and unequal clusters (EERBLC) is proposed. EERBLC protocol consists of three phases: layer and unequal cluster formation, transmission routing, maintenance and update of clusters. In the first phase, the monitoring area under the water is divided into layers, the nodes in the same layer are clustered. For balancing energy of the whole network and avoiding the “hotspot” problem, a novel unequal clustering method based on layers for UWSNs is proposed, in which a new calculation method of unequal cluster size is presented. Meanwhile, a new cluster head selection mechanism based on energy balance and degree is given. In the transmission phase, EERBLC protocol proposes a novel next forwarder selection method based on the forwarding ratio and the residual energy. In the third phase, Intra and inter cluster updating method is presented. The simulation results show that the EERBLC can effectively balance the energy consumption, prolong the network lifetime, and increase the amount of data transmission compared with DBR and EEDBR protocols.


Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 165 ◽  
Author(s):  
Qiong Shi ◽  
Li Qin ◽  
Yinghua Ding ◽  
Boli Xie ◽  
Jiajie Zheng ◽  
...  

Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes. For each relay node in the route, associated information such as its trust value and status is considered in the protocol. The trust value is defined as the attack probability of the node according to previous packet-forwarding behaviors, and the status is a hybrid metric that combines the residual energy and distance to the sink node. Therefore, the route generated by the protocol is secure against malicious attacks and globally optimal according to the associated information. We used an improved variant of the Dijkstra algorithm to generate the secure route for WSNs in the presence of malicious nodes. Compared with the Reputation-Based Mechanism to Stimulate Cooperation (RBMSC) model in the same simulation environment, the proposed model can maintain a higher delivery ratio, which verifies the effectiveness of the proposed model on the basis of global optimization. Furthermore, compared with the traditional Dijkstra algorithm, the packet loss ratio in the improved Dijkstra algorithm is lower because it can more effectively avoid malicious nodes, thus verifying the effectiveness of the improved algorithm.


2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Zhengwang Ye ◽  
Tao Wen ◽  
Zhenyu Liu ◽  
Xiaoying Song ◽  
Chongguo Fu

Trust evaluation is an effective method to detect malicious nodes and ensure security in wireless sensor networks (WSNs). In this paper, an efficient dynamic trust evaluation model (DTEM) for WSNs is proposed, which implements accurate, efficient, and dynamic trust evaluation by dynamically adjusting the weights of direct trust and indirect trust and the parameters of the update mechanism. To achieve accurate trust evaluation, the direct trust is calculated considering multitrust including communication trust, data trust, and energy trust with the punishment factor and regulating function. The indirect trust is evaluated conditionally by the trusted recommendations from a third party. Moreover, the integrated trust is measured by assigning dynamic weights for direct trust and indirect trust and combining them. Finally, we propose an update mechanism by a sliding window based on induced ordered weighted averaging operator to enhance flexibility. We can dynamically adapt the parameters and the interactive history windows number according to the actual needs of the network to realize dynamic update of direct trust value. Simulation results indicate that the proposed dynamic trust model is an efficient dynamic and attack-resistant trust evaluation model. Compared with existing approaches, the proposed dynamic trust model performs better in defending multiple malicious attacks.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Felicia Engmann ◽  
Kofi Sarpong Adu-Manu ◽  
Jamal-Deen Abdulai ◽  
Ferdinand Apietu Katsriku

In Wireless Sensor Networks, sensor nodes are deployed to ensure continuous monitoring of the environment which requires high energy utilization during the data transmission. To address the challenge of high energy consumption through frequent independent data transmission, the IEEE 802.11b provides a backoff window that reduces collisions and energy losses. In the case of Internet of Things (IoTs), billions of devices communicate with each other simultaneously. Therefore, adapting the contention/backoff window size to data traffic to reduce congestion has been one such approach in WSN. In recent years, the IEEE 802.11b MAC protocol is used in most ubiquitous technology adopted for devices communicating in the IoT environment. In this paper, we perform a thorough evaluation of the IEEE 802.11b standard taking into consideration the channel characteristics for IoT devices. Our evaluation is aimed at determining the optimum parameters suitable for network optimization in IoT systems utilizing the IEEE 802.11b protocol. Performance analysis is made on the sensitivity of the IEEE 802.11b protocol with respect to the packet size, packet delivery ratio (PDR), end-to-end delay, and energy consumption. Our studies have shown that for optimal performance, IoT devices using IEEE 802.11b channel require data packet of size 64 bytes, a data rate of 11Mbps, and an interpacket generation interval of 4 seconds. The sensitivity analysis of the optimal parameters was simulated using NS3. We observed PDR values ranging between 27% and 31%, an average end-to-end delay ranging within 10-15 ms while the energy remaining was between 5.59 and 5.63Joules. The results clearly indicate that scheduling the rate of packet generation and transmission will improve the network performance for IoT devices while maintaining data reliability.


Sign in / Sign up

Export Citation Format

Share Document