Scheme For Wireless Sensor Networks Research Articles

A lightweight security and privacy-aware routing scheme for energy-constraint multi-hop wireless sensor networks

Unique constraints associated with wireless sensor networks notably, limited resources and physical exposure of sensor nodes have warranted the need for a lightweight and low energy demand security mechanisms for wireless sensor networks (WSNs). Most of the existing security schemes demand computational power beyond the computational capacity of WSNs making them unsuitable security schemes for WSNs' routing protocols. In this work, a lightweight security and privacy scheme for WSNs' routing protocol is developed. An elliptic curve cryptography, scalar blinding, symmetric encryption, and modified Diffie Hellman key exchange protocol are adopted to evolve an additive perturbation that ensures data integrity, and an effective authentication that ensure confidentiality during routing. The security analysis shows that the scheme is secured against possible known attacks and performs better than some of the considered state-of-the-art schemes used in WSNs. Both the analytical and experimental results not only show that the proposed scheme requires lower computational power but with increase level of security and speed.

A Lightweight Security and Privacy-Aware Routing Scheme for Energy-Constraint Multi-hop Wireless Sensor Networks

Unique constraints associated with wireless sensor networks notably, limited resources and physical exposure of sensor nodes have warranted the need for a lightweight and low energy demand security mechanisms for wireless sensor networks (WSNs). Most of the existing security schemes demand computational power beyond the computational capacity of WSNs making them unsuitable security schemes for WSNs' routing protocols. In this work, a lightweight security and privacy scheme for WSNs' routing protocol is developed. An elliptic curve cryptography, scalar blinding, symmetric encryption, and modified Diffie Hellman key exchange protocol are adopted to evolve an additive perturbation that ensures data integrity, and an effective authentication that ensure confidentiality during routing. The security analysis shows that the scheme is secured against possible known attacks and performs better than some of the considered state-of-the-art schemes used in WSNs. Both the analytical and experimental results not only show that the proposed scheme requires lower computational power but with increase level of security and speed.

Data Authentication for Wireless Sensor Networks with High Detection Efficiency Based on Reversible Watermarking

Data authentication is an important part of wireless sensor networks (WSNs). Aiming at the problems of high false positive rate and poor robustness in group verification of existing reversible watermarking schemes in WSNs, this paper proposes a scheme using reversible watermarking technology to achieve data integrity authentication with high detection efficiency (DAHDE). The core of DAHDE is dynamic grouping and double verification algorithm. Under the condition of satisfying the requirement of the group length, the synchronization point is used for dynamic grouping, and the double verification ensures that the grouping will not be confused. According to the closely related characteristics of adjacent data in WSNs, a new data item prediction method is designed based on the prediction‐error expansion formula, and a flag check bit is added to the data with embedded watermarking during data transmission to ensure the stability of grouping, by which the fake synchronization point can be accurately identified. Moreover, the embedded data can be recovered accurately through the reversible algorithm of digital watermarking. Analysis and experimental results show that compared with the previously known schemes, the proposed scheme can avoid false positive rate, reduce computation cost, and own stronger grouping robustness.

Security Considerations on Three-Factor Anonymous Authentication Scheme for WSNs

Wireless sensor networks (WSNs) are used to monitor various environmental conditions including movement, pollution level, temperature, humidity, and etc. Secure authentication is very important for the success of WSNs. Li et al. proposed a three-factor anonymous authentication scheme in WSNs over Internet of things (IoT). They argued that their authentication scheme achieves more security and functional features, which are required for WSNs over IoT. Especially, they insisted that their user authentication scheme provides security against sensor node impersonation attack, and resists session-specific temporary information attack and various other attacks. However, this paper shows some security weaknesses in Li et al.’s scheme, especially focused on sensor node masquerading attack, known session-specific temporary information attack and deficiency of perfect forward secrecy. Especially, security considerations are very important to the modern IoT based applications. Thereby, the result of this paper could be very helpful for the IoT security researches.

Trust-based Key Management Conglomerate ElGamal Encryption for Data Aggregation Framework in WSN using Blockchain Technology

In wireless sensor networks (WSN), data aggregation is a widely used method. Security issues like data integrity and data confidentiality became a significant concern in data aggregation when the sensor network is deployed in a hostile environment. Many researches may carry out several works to tolerate these security issues. However, there were some limitations like delay, the arrival rate of packets, and so on. Hence, to overcome the existing problems, this approach offers a blockchain-dependent data aggregation scheme in WSN. The main intention of the proposed work is to generate a certificateless key generation so that the proposed system's secrecy rate is improved. The use of blockchain is employed for security purposes, and it enables the user to acquire the information stored internally in an effortless manner. Initially, deployment of sensor and base station (BS) is carried out, followed by node registration at which the public/private keys are generated. The computation of private hash values is carried by performing certificateless key generation. After that, the formation of blockchain is made using the PoW (Proof of Work) detection algorithm followed by the aggregation of data. In the data aggregation process, Elgammal based cryptographic approach is introduced to acquire member data, perform aggregation logic, and transfer the aggregated data. Finally, cluster-based routing is established with the use of Knapsack based cluster routing strategy. The performance investigation of the proposed system is estimated and the outcomes attained are compared with the existing techniques in terms of arrival rate, average delay, and the delay ratio of the packets. The investigation illustrates that the suggested approach is better than the traditional techniques.

An Improved Group Teaching Optimization based Localization Scheme for WSN

Localization is widely employed in wireless sensor networks (WSN) to detect the present position of the nodes. Generally, WSN comprises numerous sensors, which makes the deployment of GPS in all nodes cost and fails to provide precise localization outcomes in several cases. The manual configuration of the position reference of the sensors is not feasible under dense networks. Therefore, the NL process can be treated as an NP-hard problem and solved by metaheuristic algorithms. In this aspect, this paper presents an improved group teaching optimization algorithm-based NL technique called IGTOA-NL for WSN. The IGTOA technique is derived by integrating the basic concepts of GTOA with the β-hill-climbing technique to improve the overall node localization process. The IGTOA-NL technique can effectually localize the nodes in WSN under varying anchor node count. To showcase the productive outcome of the IGTOA technique, a series of simulations take place under a diverse number of anchors. The resultant values highlighted the proficient NL outcome of the IGTOA technique over the current state of art NL techniques in terms of different measures.

Cryptanalysis and improvement of a user authentication scheme for wireless sensor networks using chaotic maps

One of the challenging issues in wireless sensor networks (WSNs) is to provide secure communication as the channel used is wireless. User authentication is a mechanism that is used to provide secure communication. The authors analyse the security of a recent authentication scheme for WSNs and show that it is not resistant to smart card loss, insider, and denial of service attacks besides the user traceability problem. Here, they design an improved user authentication scheme using the chaotic maps for WSNs. The chaotic maps-based public key cryptosystem helps a scheme to consider a large integer as the secret key rather than a large prime number and makes it fast. They show its formal security analysis using the random oracle model. They also analyse its security informally to show that it is resistant to various known attacks. They show that their scheme offers more security features than the existing schemes.

A Social Welfare Theory-Based Energy-Efficient Cluster Head Election Scheme for WSNs

Inequality of energy consumption in the wireless sensor networks (WSNs) leads to the decline of energy efficiency and the shortening of the network lifetime. In this article, the social welfare theory is adopted to promote energy equilibrium during the process of Cluster Head (CH) election. To the best of authors' knowledge, it is for the first time that the CH election is controlled by the systematical social theory. To this end, Atkinson's Inequality Measure is applied to elect the optimal CH. Besides, a novel concept of expected energy efficiency welfare is proposed to determine the CH, with the aim of achieving energy equilibrium within each cluster. Subsequently, a novel Social Welfare theory-based Energy-efficient Cluster head Election (SWECE) scheme is proposed and detailed. Finally, extensive experiments are conducted to evaluate its performance with regards to energy efficiency and network lifetime by extensive comparisons with the existing classic and the latest intelligent clustering strategies. The results have verified its effectiveness on improving energy efficiency and prolonging the network lifespan of WSNs.

Machine learning based lightweight interference mitigation scheme for wireless sensor network

The interference issue is most vibrant on low-powered networks like wireless sensor network (WSN). In some cases, the heavy interference on WSN from different technologies and devices result in life threatening situations. In this paper, a machine learning (ML) based lightweight interference mitigation scheme for WSN is proposed. The scheme detects and identifies heterogeneous interference like Wifi, bluetooth and microwave oven using a lightweight feature extraction method and ML lightweight decision tree. It also provides WSN an adaptive interference mitigation solution by helping to choose packet scheduling, Acknowledgement (ACK)-retransmission or channel switching as the best countermeasure. The scheme is simulated with test data to evaluate the accuracy performance and the memory consumption. Evaluation of the proposed scheme’s memory profile shows a 14% memory saving compared to a fast fourier transform (FFT) based periodicity estimation technique and 3% less memory compared to logistic regression-based ML model, hence proving the scheme is lightweight. The validation test shows the scheme has a high accuracy at 95.24%. It shows a precision of 100% in detecting WiFi and microwave oven interference while a 90% precision in detecting bluetooth interference.

SLUA-WSN: Secure and Lightweight Three-Factor-Based User Authentication Protocol for Wireless Sensor Networks.

Wireless sensor networks (WSN) are composed of multiple sensor nodes with limited storage, computation, power, and communication capabilities and are widely used in various fields such as banks, hospitals, institutes to national defense, research, and so on. However, useful services are susceptible to security threats because sensitive data in various fields are exchanged via a public channel. Thus, secure authentication protocols are indispensable to provide various services in WSN. In 2019, Mo and Chen presented a lightweight secure user authentication scheme in WSN. We discover that Mo and Chen’s scheme suffers from various security flaws, such as session key exposure and masquerade attacks, and does not provide anonymity, untraceability, and mutual authentication. To resolve the security weaknesses of Mo and Chen’s scheme, we propose a secure and lightweight three-factor-based user authentication protocol for WSN, called SLUA-WSN. The proposed SLUA-WSN can prevent security threats and ensure anonymity, untraceability, and mutual authentication. We analyze the security of SLUA-WSN through the informal and formal analysis, including Burrows–Abadi–Needham (BAN) logic, Real-or-Random (ROR) model, and Automated Verification of Internet Security Protocols and Applications (AVISPA) simulation. Moreover, we compare the performance of SLUA-WSN with some existing schemes. The proposed SLUA-WSN better ensures the security and efficiency than previous proposed scheme and is suitable for practical WSN applications.

A Survey of Chain Cluster-Based Routing Protocols in Wireless Sensor Network

Over a period, Wireless sensor networks (WSNs) have turned out to be continuously increasingly appealing and discovered the way into a wide assortment of uses and also frameworks in view of their relatively inexpensive, self-sustaining ability, and their detecting capacity in harsh environment. It is a collection of hubs composed onto a system. Based on their routing architecture they are generally separated into two classes: Hierarchical routing topology and Flat routing topology. In a flat routing topology every nodes will have the similar use and they perform similar task presented by the network. Nodes present in hierarchical topology carry out unique tasks and they are normally formed into clusters in WSNs. In this paper, a detailed study is made on chain cluster-based routing schemes for WSNs and few comparisons made by considering performance features such as Fault tolerance, scalability and topology Strengths and limitations of each scheme and the same is presented.

실시간 산불 모니터링을 위한 이벤트 처리 기반 저전력 저비용 무선 센서 네트워크

In this paper, we propose an event-driven low-power low-cost wireless sensor network (WSN) for real time wildfire monitoring. The proposed system will be mainly deployed and operated in a fire alert (or monitoring) area that could be divided into several sectors, each sector consisting of a controller (AP: access point) and its controlled nodes. For the evaluation of the proposed system, we implement a test bed (TB) using Arduino Uno board that has a smoke detector and a ZigBee module. The presented sensor nodes that are operated in power saving mode (PSM) during most of idle period have a longer battery life. Once a node detects smoke sample (which is termed as sensData) that is larger than a given threshold, it will generate a transmission message, called msgSensInfo (msgSensInfo1 for node fusion or msgSensInfo2 for AP fusion), and transmit that message to the AP and then the remote server. When a sensing event or a wake-up message event occurs, the presented node system is woken up from PSM, and gives a prompt (real-time) response including sensing message msgSensInfo generation and its transmission to AP. The proposed system has a data fusion algorithm collecting and synthesizing either multiple spatial samples (in case of AP fusion) or multiple time samples (in case of node fusion) that improves the fire detection performance further. Therefore, compared to existing low-cost WSN schemes, the proposed low-cost WSN scheme would be better at the perspective of real time performance, cost-effectiveness, and life-cycle such that it would be a good candidate for wildfire prevention as well as initial fire fighting.

A Secure and Energy Efficient Sensor Nodes in Wireless Sensor Networks using Improved Ant Lion Optimization

The Wireless Sensor Network (WSN) has three critical issues as like network lifetime, saving energy and security. A sensor node has limited battery power so it does need an effective key distribution and management mechanism for a safe communication. In the research literatures a massive key supply and administration methodology had been proposed. Thus, there exists a literature report of numerous schemes in WSNs for Key management and done with a wide analysis to classify the available techniques of key management and the expectable network security on them is studied. In this method a secure efficient key management scheme is proposed with the help of Ant Lion Optimization (ALO) for WSN. The aim of this method is to obtain improved security strength with cost effective. The nature of the ant lion in hunting its prey is derived for the ALO algorithm which known for its meta-heuristic function. In resolving the optimization complications with the advantage of having a great speed and limited parameters it is proved to have a better performance.

A survey and taxonomy on energy management schemes in wireless sensor networks

Abstract Wireless sensor networks (WSNs) with energy harvesting have fascinated the prospectus attention of researchers due to their wide deployment and omnipresent nature in the emerging areas of the Internet of Things (IoT's) and home automation. However, there are a lot of key challenges that affect the performance of WSNs due to their own characteristics. Still, energy constraints remain one of the major hurdles that need to be addressed. The best solution for bottleneck of energy constraints is energy management and harvesting schemes. The taxonomic survey puts the different schemes of energy management into classes that represent different application requirements. This research article provides a systematic taxonomy for energy management schemes in WSNs that examine various energy provisioning-based techniques. Various protocols/algorithms are summarized along with their remarkable implementation in different policies of energy management. Also, this survey study highlights progressing research activities and issues that affect the performance and deployment of WSNs.

Implementation of key predistribution scheme in WSN based on binary Goppa codes and Reed Solomon codes with enhanced connectivity and resiliency

Establishing secure transmissions of messages among the resource limited sensor nodes in wireless sensor network (WSN) is a critical issue and requires secret keys to be established among the communicating nodes. Key predistribution is the most commonly used technique and whereby secret keys are preloaded to the sensor nodes before their deployment into a hostile region. A WSN can be structured or unstructured, and sensor nodes may be deployed in an ad-hoc manner or pre-planned manner into the target field. As sensor nodes are low-cost electronic devices equipped with data processing, limited storage, communication and computation power, connectivity, and resiliency are the major focus in designing key predistribution scheme (KPS) for WSNs. Furthermore, we also expect the KPS to be scalable, enabling insertion of a set of new nodes in WSN at any point of time without altering the key setup of the already existing nodes. Combinatorial design is a widely used mathematical tool for the KPS. However, most of the KPS developed by using combinatorial design are not scalable. In this article, rather than using combinatorial techniques, we employ a code-based approach and design a new method for key predistribution by building a communication model and a connectivity model. We exploit the Reed Solomon code to establish our communication model, integrate the binary Goppa code to derive our connectivity model, and skillfully blend these two models to construct our code-based KPS. A C implementation of our KPS confirms the significant performance gain over the existing similar works. Additionally, nodes in our KPS are all self-dependent for communication and do not rely on cluster heads. Furthermore, we have control over the choice of the parameters in the underlying codes which makes our KPS flexible. To be specific, prior knowledge of additional node deployment increases the scalability of our connectivity model. By suitably choosing the parameters of the Goppa code at prior, we can accommodate extra nodes. More interestingly, our communication model is scalable without any previous knowledge of deployment.

Understanding Node Capture Attacks in User Authentication Schemes for Wireless Sensor Networks

Despite decades of intensive research, it is still challenging to design a practical multi-factor user authentication scheme for wireless sensor networks (WSNs). This is because protocol designers are confronted with a long-standing “security versus efficiency” dilemma: sensor nodes are lightweight devices with limited storage and computation capabilities, while the security requirements are demanding as WSNs are generally deployed for sensitive applications. Hundreds of proposals have been proposed, yet most of them have been found to be problematic, and the same mistakes are repeated again and again. Two of the most common security failures are regarding smart card loss attacks and node capture attacks. The former has been extensively investigated in the literature, while little attention has been given to understanding the node capture attacks. To alleviate this undesirable situation, this article takes a substantial step towards systematically exploring node capture attacks against multi-factor user authentication schemes for WSNs. We first investigate the various causes and consequences of node capture attacks, and classify them into ten different types in terms of the attack targets, adversary’s capabilities and vulnerabilities exploited. Then, we elaborate on each type of attack through examining 11 typical vulnerable protocols, and suggest corresponding countermeasures. Finally, we conduct a large-scale comparative measurement of 61 representative user authentication schemes for WSNs under our extended evaluation criteria. We believe that such a systematic understanding of node capture attacks would help design secure user authentication schemes for WSNs.

Systematic Literature Review on Energy Efficient Routing Schemes in WSN – A Survey

In wireless sensor networks (WSN), routing is quite challenging area of research where packets are forwarded through multiple nodes to the base station. The packet being sent over the network should be shared in an energy efficient manner. It also considers the residual power of battery to enhance the network life time. Existing energy efficient routing solutions and surveys are presented but still there is a need for Systematic Literature Review (SLR) to identify the valid problems. This paper performs SLR for energy efficiency routing with 172 papers at initial stage. Next, 50 papers are shortlisted after filtration based on quality valuation and selection criteria by ensuring relevance with energy efficiency. Initially, we present literature that includes schemes for threshold sensitive, adaptive periodic threshold sensitive, power efficient, hybrid energy efficient distribution and low energy adaptive mechanisms. Result of systematic review reveals that consumption of energy is the most fundamental issue in WSN however, is not noticed by the researchers and practitioners where as it can contribute for the improvement of the energy efficiency. It also elaborates the weaknesses of the existing approaches which make them inappropriate for energy efficient routing in WSN.

GWO‐C: Grey wolf optimizer‐based clustering scheme for WSNs

SummaryA wireless sensor network (WSN) is a prominent technology that could assist in the fourth industrial revolution. Sensor nodes present in the WSNs are functioned by a battery. It is impossible to recharge or replace the battery, hence energy is the most important resource of WSNs. Many techniques have been devised and used over the years to conserve this scarce resource of WSNs. Clustering has turned out to be one of the most efficient methods for this purpose. This paper intends to propose an efficient technique for election of cluster heads in WSNs to increase the network lifespan. For the achievement of this task, grey wolf optimizer (GWO) has been employed. In this paper, the general GWO has been modified to cater to the specific purpose of cluster head selection in WSNs. The objective function for the proposed formulation considers average intra‐cluster distance, sink distance, residual energy, and CH balancing factor. The simulations are carried out in diverse conditions. On comparison of the proposed protocol, ie, GWO‐C protocol with some well‐known clustering protocols, the obtained results prove that the proposed protocol outperforms with respect to the consumption of the energy, throughput, and the lifespan of the network. The proposed protocol forms energy‐efficient and scalable clusters.

Interstellar‐based topology control scheme for optimal clustering performance in WSN

SummaryClustering is one of the essential operations in wireless sensor network (WSN) to ensure organized data aggregation followed by energy efficiency. However, obtaining optimal clustering performance is yet an unsolved problem in WSN. Review of existing approaches towards cluster optimization shows that effective balance between energy efficiency and topology control is still missing. Therefore, the proposed system presents a unique topology control mechanism using a novel concept of interstellar orientation toward optimizing the clustering performance in WSN. Adopting an analytical research methodology, the proposed system introduces two interstellar‐based topology control system, which targets the maximum saving of resource consumption of the cluster head. The simulated outcome of the study shows that the proposed topology control system offers significant energy conservation performance in comparison to the existing hierarchical clustering scheme in WSN.

A Privacy-Preserving Authentication, Authorization, and Key Agreement Scheme for Wireless Sensor Networks in 5G-Integrated Internet of Things

Wireless sensor networks (WSNs) have played an important role in the Internet of Things (IoT), and the 5G network is being considered as a major candidate for IoT's communication network with the advent of 5G commercialization. The potential of integrating WSNs and 5G in the IoT is expected to allow IoT to penetrate deeply into our daily lives and to provide various services that are convenient, but at the same time, it also brings new security threats. From this aspect, user authentication and key agreement are essential for secure end-to-end communication. As IoT devices, including sensors, collect and process more and more personal information, both anonymous authentication and authorization are also required to protect the privacy and to prevent anyone without privileges from accessing private data. Recently, Adavoudi-Jolfaei et al. proposed an anonymous three-factor authentication and access control scheme for real-time applications in WSNs. However, we found that this scheme does not provide sensor-node anonymity and suffers from user collusion and desynchronization attacks. In this paper, we introduce a system architecture by considering the integration of WSNs and 5G for IoT. Based on a cryptanalysis of Adavoudi-Jolfaei et al.'s scheme and the system architecture, we propose an elliptic curve cryptography (ECC)-based privacy-preserving authentication, authorization, and key agreement scheme for WSNs in 5G-integrated IoT. We conduct a formal and informal security analysis in order to demonstrate that the proposed scheme withstands various security attacks and guarantees all desired security features, overcoming the drawbacks of Adavoudi-Jolfaei et al.'s scheme. Finally, a performance and comparative analysis with the related schemes indicate that the proposed scheme is both efficient and more secure.