LSTR: Lightweight and Secure Tree-Based Routing for Wireless Sensor Networks

Hamouid, Khaled; Othmen, Salwa; Barkat, Amine

doi:10.1007/s11277-020-07111-w

Cited by 10 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the detection rate of this technology is usually closely related to factors such as the sampling window and the similarity threshold. When the value of the impact factor is different, the detection rate often differs greatly [17,18]. Next, we do a set of experiments to verify the sensitivity of temporal correlation theory to threshold.…”

Section: Outlier Detection Technique Based On Cluster Analysis and Sp...mentioning

confidence: 99%

Abnormal Data Detection in Sensor Networks Based on DNN Algorithm and Cluster Analysis

Li¹,

Sharma

2022

Journal of Sensors

View full text Add to dashboard Cite

In order to solve the abnormal behaviors in wireless sensor networks, such as attacks, intrusions, node failures, and data anomalies, a data anomaly detection method for sensor networks based on DNN algorithm and cluster analysis is proposed. The deep neural network is introduced into the wireless sensor network, and each wireless sensor data is described by the neuron to construct the neural network element model. The traditional neural network model is improved, and the neural network model of the wireless sensor is used to realize the fusion and extraction of the data collected by the wireless sensor network. The clustering technology is used to complete the abnormal data judgment of the nodes, and at the same time, the spatial correlation of the sensing data between neighboring nodes is used to filter the noise data, extract the abnormal event information, and assist the system decision-making. The results show that when the number of neighbor nodes increases, the number of nodes with similar physical locations in the optimal neighbor node set gradually increases, and the accuracy rate is also continuously improved. However, if too many nodes are selected, the algorithm will use the data of nodes with a longer physical distance to vote, which will lead to an increase in the error rate. Therefore, when determining the number of neighbor nodes, 25%-30% of the total number of nodes in the positioning scenario can be selected. Therefore, the algorithm can effectively detect and distinguish environmental noise and abnormal events in the network.

show abstract

Section: Outlier Detection Technique Based On Cluster Analysis and Sp...mentioning

confidence: 99%

Abnormal Data Detection in Sensor Networks Based on DNN Algorithm and Cluster Analysis

Li¹,

Sharma

2022

Journal of Sensors

View full text Add to dashboard Cite

show abstract

“…In [14], K. Hamouid et al proposed a secure tree-based routing protocol for wireless sensor networks. The authors use ID-Based authentication key-agreement protocol to secure the data routing between the nodes in the network.…”

Section: Related Workmentioning

confidence: 99%

Optimize and Secure Routing Protocol for Multi-hop Wireless Network

Othmen¹,

Mansouri²,

Asklany³

et al. 2022

IJACSA

Self Cite

View full text Add to dashboard Cite

Multi-hop Wireless Network (MWN) requires the existing of wireless nodes that communicate via a wireless channel. Thus, selecting optimal paths between the communicant nodes is a major challenge. Many researchers are focusing on this topic and proposed some routing protocols that help the nodes to learn multi-hop paths. Multi-hop wireless network is used for several types of applications, like military, medical care and national security. These applications are important and critical, so they require a certain level of performance and security during data communication. Securing the transmission of data in a multi-hop network is a challenge since the devices have limited resources like memory and battery. In this paper, we propose an optimal and secure routing protocol. The main goal of this proposal is to improve the performance and the security of such network by selecting a secure route between the source and its target destination. To secure data transmission phase, we propose to create a key shared between the source and the destination. Since the devices have limited energy, we propose to take into consideration the energy of the intermediate nodes of the selected route. Extensive simulations are performed using the Network Simulator (NS2) to validate the proposed protocol. This proposal is compared with the secured Ad-Hoc On-demand Distance Vector (SAODV) in terms of end-to-end delay, overhead and number of compromised devices.

show abstract

“…An appropriate neighbor node is selected as the parent node for every node in a tree-based approach. A routing tree is constructed with a sink node that acts as a root node, and all nodes are connected to the root through the most energy-saving path [23]. The sensor node's data is transmitted along the tree towards the root node (sink) and is fused between nodes.…”

Section: Introductionmentioning

confidence: 99%

Reliability Evaluation for Chain Routing Protocols in Wireless Sensor Networks Using Reliability Block Diagram

Alfawaz

Khedr

Alwasel

et al. 2023

JSAN

View full text Add to dashboard Cite

There are many different fields in which wireless sensor networks (WSNs) can be used such as environmental monitoring, healthcare, military, and security. Due to the vulnerability of WSNs, reliability is a critical concern. Evaluation of a WSN’s reliability is essential during the design process and when evaluating WSNs’ performance. Current research uses the reliability block diagram (RBD) technique, based on component functioning or failure state, to evaluate reliability. In this study, a new methodology-based RBD, to calculate the energy reliability of various proposed chain models in WSNs, is presented. A new method called D-Chain is proposed, to form the chain starting from the nearest node to the base station (BS) and to choose the chain head based on the minimum distance D, and Q-Chain is proposed, to form the chain starting from the farthest node from the BS and select the head based on the maximum weight, Q. Each chain has three different arrangements: single chain/single-hop, multi-chain/single-hop, and multi-chain/multi-hop. Moreover, we applied dynamic leader nodes to all of the models mentioned. The simulation results indicate that the multi Q-Chain/single-hop has the best performance, while the single D-Chain has the least reliability in all situations. In the grid scenario, multi Q-Chain/single-hop achieved better average reliability, 11.12 times greater than multi D-Chain/single-hop. On the other hand, multi Q-Chain/single-hop achieved 6.38 times better average reliability than multi D-Chain/single-hop, in a random scenario.

show abstract

LSTR: Lightweight and Secure Tree-Based Routing for Wireless Sensor Networks

Cited by 10 publications

References 13 publications

Abnormal Data Detection in Sensor Networks Based on DNN Algorithm and Cluster Analysis

Abnormal Data Detection in Sensor Networks Based on DNN Algorithm and Cluster Analysis

Optimize and Secure Routing Protocol for Multi-hop Wireless Network

Reliability Evaluation for Chain Routing Protocols in Wireless Sensor Networks Using Reliability Block Diagram

Contact Info

Product

Resources

About