Integrated Shared Random Key Agreement Protocol for Wireless Sensor Network

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

Wireless sensor networks (WSNs) are usually deployed in hostile or unattended areas, and users need to obtain real-time data from WSNs. The data collected by sensor nodes are usually relatively private and sensitive, so users must pass the identity authentication before obtaining the information perceived by sensor nodes. In order to enhance the security of wireless sensor networks and prevent illegal users from accessing sensor nodes, this paper designs an efficient and secure identity authentication protocol for wireless sensor networks. The proposed protocol makes full use of the advantages of lightweight cryptographic primitives such as physical unclonable function, one-way hash function and bitwise exclusive operation. Moreover, users only need to use biometrics (such as fingerprints, iris) to access the remote systems and do not need to rely on any password, which avoids the trouble of memorizing and losing password. To prove the scheme’s security, the well-known formal security proof with random oracle model and traditional heuristic discussion are given. Additionally, the performance comparison results show that our scheme has less communication overhead and computation complexity, and is effective for the resource constrained sensor devices in WSNs.

The security of Wireless Sensor Networks (WSNs) has a direct reliance on secure and efficient key management. This leaves key management as a fundamental research topic in the field of WSNs security. Among the proposed key management schemes for WSNs security, LEAP (Localized Encryption and Authentication Protocol) has been regarded as an efficient protocol over the last years. LEAP supports the establishment of four types of keys. The security of these keys is under the assumption that the initial deployment phase is secure and the initial key is erased from sensor nodes after the initialization phase. However, the initial key is used again for node addition after the initialization phase whereas the new node can be compromised before erasing the key. A time-based key management scheme rethought the security of LEAP. We show the deficiency of the time-based key management scheme and proposed a key management scheme for multi-phase WSNs in this paper. The proposed scheme disperses the damage resulting from the disclosure of the initial key. We show it has better resilience and higher key connectivity probability through the analysis.

Wireless Sensor Networks (WSNs) are used for a wide range of things these days, from watching the environment to improving healthcare systems. But because these networks are used everywhere, they are also open to security risks like spying, data corruption, and node capture. It is very important to address these issues in order to protect the accuracy, privacy, and access of data being sent. Information-theoretic security looks like a good way to deal with these problems because it uses mathematical models to make sure that transmission in WSNs is safe and uses little energy. This essay goes into detail about information-theoretic security in WSNs. It gives a full rundown of the mathematical basics and real-world implications for getting strong security in places with limited resources. The idea of "secrecy capacity" is at the heart of this method. It measures the highest rate at which authorized nodes can communicate privately while preventing spying foes. Utilizing the chance that exists in wireless channels, encrypted keys can be generated without using shared secrets, making them resistant to attempts that try to steal them. Because sensor nodes only have a short power life, energy economy is very important in WSNs. Information-theoretic security methods, like physical layer security and joint communication, are designed to use as little energy as possible while still providing strong security. Nodes can work together to improve signal strength and fight channel fading using cooperative methods. This makes the network last longer without compromising security. This article also talks about the trade-offs between security, energy savings, and communication performance in WSNs. This helps us figure out how to make the best transfer schemes.

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

To achieve security in wireless sensor networks (WSNs), it is important to be able to encrypt messages sent among sensor nodes by using shared keys between them. Due to resource constraints, achieving such key agreement in WSNs is nontrivial. Previous research indicates that key management schemes using deployment knowledge can significantly improve the performance of WSNs. Nevertheless, in these schemes, resilient local connectivity and resilient global connectivity become unstable when deployment error changes. To resolve the above problem, in this article, a one-way associated key management model is proposed. In this model, the key pool consists of two layers: 1) the global layer and 2) the local layer. According to different deployment errors, the number of keys allocated from the global key pool and local key pools can be dynamically adjusted, thereby improving the stability of networks' performance. In multiphase sensor networks, analysis and simulation indicate that our scheme has better adaptability in applications where deployment error changes as compared with related schemes.

Wireless sensor networks (WSN) has been extensively used in many real time wireless sensor networks applications. Due to limitations of hardware resources and restricted communication capabilities of sensor nodes, it is very challenging to use wireless sensor networks in real time data transmission. Data collection and routing is the main issue in such applications. To enhance the performance under such real time transmission scenario, it is essential to make the protocol intelligent to choose the appropriate path with change in network scenario. Now a days, many machine learning and deep learning algorithms are used for improving the real time data transmissions in WSNs. From the survey on existing methods, it is clear that using machine learning makes the computational methods more reliable, powerful and economical. This paper proposes a machine learning based Medium Access Control (MAC) protocol to handle real time traffic in wireless sensor networks. To deal with the limitations of WSN in real time application, the proposed scheme can help to increase the performance of time-critical wireless sensor network applications. Simulation results authorize our work and confirm the accuracy of the proposed ML-MAC protocol strategy is higher than the existing work.

Wireless Sensor Networks (WSNs) are a massive number of tiny nodes installed in harsh and hostile environments to monitor and gather specific data. WSNs installed to support bridge structures, healthcare, robotics, environmental monitoring, etc. WSNs can be used to monitor the pressure, temperature, sabotage of transmission lines, and leak detection. WSNs are vulnerable to different attacks. Cryptographic algorithms have a good role in information security for wireless sensor networks. Accordingly, various cryptographic algorithms provide security in networks. Cryptography has two techniques: the symmetric-key technique and the asymmetric-key technique. But there are still some problems. For example, to store the key across all nodes in the network, the symmetric-key technique needs more storage, while the asymmetric-key technique takes more computation time. This paper proposed a hybrid security algorithm that provides a high-security level with high-speed encryption and decryption using symmetric-key and asymmetric-key cryptographic techniques to avoid computation and memory overheads. It gives three cryptographic primitives, confidentiality, integrity, and authentication. The concept is to use the Blowfish to provide encryption, Message Digest 5 (MD5) for integrity, and Elliptic Curve Diffie Hellman (ECDH) for authentication. The proposed algorithm obtains the best results overall using two computers (A and B) compared to several other algorithms in terms of ciphertext size, encryption time, decryption time, and throughput. By using computer A and the plaintext size is 609 Bytes, the proposed algorithm has 87.9% ciphertext size compared to HA, 19.6% encryption time compared to HCA, and 41.1% decryption time compared to HCA.

Many receiver-based Preamble Sampling Medium Access Control (PS-MAC) protocols have been proposed to provide better performance for variable traffic in a wireless sensor network (WSN). However, most of these protocols cannot prevent the occurrence of incorrect traffic convergence that causes the receiver node to wake-up more frequently than the transmitter node. In this research, a new protocol is proposed to prevent the problem mentioned above. The proposed mechanism has four components, and they are Initial control frame message, traffic estimation function, control frame message, and adaptive function. The initial control frame message is used to initiate the message transmission by the receiver node. The traffic estimation function is proposed to reduce the wake-up frequency of the receiver node by using the proposed traffic status register (TSR), idle listening times (ILTn, ILTk), and “number of wake-up without receiving beacon message” (NWwbm). The control frame message aims to supply the essential information to the receiver node to get the next wake-up-interval (WUI) time for the transmitter node using the proposed adaptive function. The proposed adaptive function is used by the receiver node to calculate the next WUI time of each of the transmitter nodes. Several simulations are conducted based on the benchmark protocols. The outcome of the simulation indicates that the proposed mechanism can prevent the incorrect traffic convergence problem that causes frequent wake-up of the receiver node compared to the transmitter node. Moreover, the simulation results also indicate that the proposed mechanism could reduce energy consumption, produce minor latency, improve the throughput, and produce higher packet delivery ratio compared to other related works.

Wireless Sensor Networks (WSNs) consist of numerous battery-powered sensor nodes that operate with limited energy, computation, and communication capabilities. Designing routing strategies that are both energy-efficient and attack-resilient is essential for extending network lifetime and ensuring secure data delivery. This paper proposes Adaptive Federated Reinforcement Learning-Hunger Games Search (AFRL-HGS), a Hybrid Routing framework that integrates multiple advanced techniques. At the node level, tabular Q-learning enables each sensor node to act as a reinforcement learning agent, making next-hop decisions based on discretized state features such as residual energy, distance to sink, congestion, path quality, and security. At the network level, Federated Reinforcement Learning (FRL) allows the sink node to aggregate local Q-tables using adaptive, energy- and performance-weighted contributions, with Polyak-based blending to preserve stability. The binary Hunger Games Search (HGS) metaheuristic initializes Cluster Head (CH) selection and routing, providing a well-structured topology that accelerates convergence. Security is enforced as a constraint through a lightweight trust and anomaly detection module, which fuses reliability estimates with residual-based anomaly detection using Exponentially Weighted Moving Average (EWMA) on Round-Trip Time (RTT) and loss metrics. The framework further incorporates energy-accounted control plane operations with dual-format HELLO and hierarchical ADVERTISE/Service-ADVERTISE (SrvADVERTISE) messages to maintain the routing tables. Evaluation is performed in a hybrid testbed using the Graphical Network Simulator-3 (GNS3) for large-scale simulation and Kali Linux for live adversarial traffic injection, ensuring both reproducibility and realism. The proposed AFRL-HGS framework offers a scalable, secure, and energy-efficient routing solution for next-generation WSN deployments.

Security for wireless sensor networks (WSNs) is becoming an increasingly important issue in recent years. However, current works on media access control (MAC) protocols in WSNs mainly concentrate on balancing the efficiency and fairness of common channel access. Without proper security mechanisms, WSNs will be confined to limited and controlled environments, as well as negate numerous promises they hold. In this paper, we propose a novel secure MAC protocol for WSNs. Our algorithm-FSMAC firstly design multiple indicators for intrusion detection according to the classification of popular DoS attacks on MAC layer of WSNs, and innovatively utilizes fuzzy logic theory to implement making decision on intrusion. Moreover, appropriate countermeasures are adopted to reduce the destruction of attacks basing on intrusion detection results. Simulation results are presented to verify the effectiveness of our approach in terms of possibility of successful detection, possibility of false detection, data packet successful transmission rate, average energy consumption and time of first node dead

Wireless sensor networks (WSNs) are quickly becoming an essential part of today's modern infrastructure, and it is becoming crucial to consider time synchronisation problems in WSNs. Furthermore, one of the main design issues in WSN time synchronisation is the efficient use of energy at each sensor node to prolong the lifespan of the network. This paper describes a new energy-efficient time protocol based on the spanning tree of the network model graph in a WSN. Three major cases are discussed: 1) time synchronisation using the energy-efficient spanning tree (EST) protocol in a WSN with approximately 300 sensors; 2) an improved EST protocol in large-scale WSNs; 3) an improved EST protocol under weighted graph. Additionally, a series of practical algorithms are proposed in this paper, where both energy and time efficient can be clearly shown through a number of simulated examples along with their comparative results.

This paper mainly introduces the application of multichannel communication technology in wireless sensor network. The corresponding solutions are proposed based on the analysis of the structure and characteristics of wireless sensor, and the multi-channel MAC protocol in wireless sensor network. In this paper, multi-channel communication technology in wireless sensor network (WSN) is studied, the existing problems and reasons are analysed, and some solutions to further promote the further development of the technology are put forward. With the wide application of WSN, the security of WSN has been paid more and more attention. In this paper, the existing time synchronization protocol, from the security point of view, and the fault tolerance design of the fits protocol. The protocol has an intrusion detection mechanism, which can detect the attack of malicious nodes in time synchronization. Aiming at the small deviation of slow attack and the problem of time synchronization error, information fusion is based on the quality principle, and according to the time synchronization information of different nodes, we make random weighted average correction for local time nodes. The simulation results show that the fits time synchronization protocol has good intrusion detection and fault tolerance capability.

The limited resources, being located in the unattended environment, and the dynamic change of topology, these bring about big challenges for the communication security of wireless sensor networks. The security protocol framework-SPINS adopts multiple-key protocol, which can achieve the confidentiality, authentication, integrity and freshness during the data communication process, and have a relatively low communication cost. However after the sensor nodes being spread and deployed, if the shared master key between node and base station was divulged, the entire network security will be affected. This paper introduces the Schnorr identity authentication to improve SPINS, and give a security protocols for wireless sensor networks based on identity authentication. The analysis shows that the improved protocol can effectively prevent the security problem caused by divulging the shared master key. Meanwhile it is beneficial to find the adversary nodes in the network, and to guarantee the effective communication between nodes in the network.

This paper introduced a new safety and energy saved routing protocol BSATLEACH, it is focus on existing issues of protocols in wireless sensor networks (WSNs) what just considered energy saving only without security concern or designed for security only ignored large overheads and complex algorithm, so on. This protocol is built up based on TLEACH protocol, utilized Base Station to authenticate the identity of nodes, combined the identity trust and the behavior trust, and considered the factor of residual energy in nodes. It balanced above existing issues of protocols in WSNs. The results come from analysis and simulation in MATLAB shown that this new protocol can provide excellent security in WSNs and can extend the lifetime of network efficiently.