Scheme For Sensor Networks Research Articles

Dynamic Charging Scheduling and Path Planning Scheme for Multiple MC-enabled On-demand Wireless Rechargeable Sensor Networks

With the advancement of wireless energy transfer, Wireless Rechargeable Sensor Networks (WRSNs) have become increasingly popular for efficiently charging sensor nodes. In WRSNs, determining the charging schedule for Mobile Chargers (MCs) is critical for reducing maintenance costs and improving charging efficiency. This is termed the Charging Scheduling Problem (CSP), which is proven to be NP-hard in nature. The existing schemes lack a comprehensive approach to determine the optimal number of MCs and often set a fixed charging threshold for the sensor nodes, degrading charging efficiency in dynamic networks. Additionally, relying on a single MC is unrealistic and impractical for large-scale networks, necessitating a more advanced charging strategy. Thus, this study proposes a dynamic and multi-node charging scheduling scheme named Partitioning-based Charging Schedule for Multiple Mobile Chargers (PCSMMC). The PCSMMC utilizes the traffic load of sensor nodes and energy load of MCs to estimate the optimal number of MCs and computes the progressive threshold for sensor nodes to improve the charging efficiency. Moreover, potential sojourn locations are determined and multiple network factors are integrated into a multi-attribute decision-making process to achieve an efficient charging scheduling and path planning scheme for multiple MCs. The objective of PCSMMC is to enhance the survivability rate of sensor nodes and decrease the traveling path followed by MCs to charge the sensor nodes within the network. Empirical simulation results confirm the superiority of PCSMMC in terms of charging response time, survivability rate, energy utilization efficiency, and network lifetime by a significant margin when compared to alternative approaches.

An energy efficient authentication scheme for cluster-based wireless IoT sensor networks

Wireless Internet of Things (IoT) sensor networks (WITSN) play a pivotal role in modern society, facilitating a myriad of applications ranging from smart homes to industrial automation. Therefore, safeguarding these networks against security threats is paramount to ensure the integrity, confidentiality, and availability of data transmitted within them. However, WITSNs face escalating security threats due to their diverse structures and platforms. Existing literature has identified these vulnerabilities but lacks comprehensive solutions to address them effectively. To bridge this gap, this paper proposes a novel security approach termed Randomized Bi-Phase Authentication Scheme (RBAS), which integrates digital watermarking techniques to fortify both external and internal network security. RBAS not only tackles data availability, confidentiality, and authenticity challenges prevalent in WITSNs but also strives to maintain a delicate equilibrium between robust security measures and energy efficiency. Key contributions of this work include the meticulous examination and validation of the integration of cyclic redundancy check (CRC) codes in IoT sensor network authentication, demonstrating their efficacy in error detection through simulations. Furthermore, RBAS employs advanced hashing, cryptography, and dynamic verification codes to ensure strong error detection and data authenticity, leveraging robust CRC codes and randomization to thwart potential attacks. The scheme's complexity acts as a deterrent against manipulation, while its cluster awareness enhances adaptability, and cryptographic principles bolster overall security. Extensive performance evaluation using the Network Simulator-2 (NS2) reveals significant benefits of RBAS, including an 8 % reduction in power consumption and a 7 % increase in network longevity. Notably, RBAS surpasses existing solutions with a 14 % reduction in dropping ratio and an 8 % decrease in latency. The success of RBAS stems from its innovative utilization of lightweight watermarking techniques and cluster-based routing, enabling proactive identification of data tampering and thereby enhancing the network's overall security posture. This pioneering work not only advances the state of the art in WITSN security but also holds profound implications for the practical deployment of secure and efficient IoT sensor networks in real-world scenarios.

A dynamic routing scheme for underwater acoustic sensor networks in submarine disaster applications

IntroductionThe ocean economy serves as a critical engine for the development of human society and economy, and its stable growth is of utmost importance. However, the frequent and unexpected occurrence of natural disasters, such as submarine disasters, poses significant threats to human society, especially disasters related to wave phenomena like the Ekman current, which has particularly prominent impacts.MethodsThe study proposes a dynamic routing scheme for underwater acoustic sensor networks. It establishes a cone-shaped distributed network, utilizing autonomous underwater vehicles to collect crucial data from nodes deployed on the seabed and transmitting it through the underwater cone-shaped distributed sensor network. Additionally, it adopts source location protection (SLP) technology to ensure the privacy of source locations. To validate the practicality and stability of this scheme, simulation experiments targeting the Ekman current were conducted in MATLAB.ResultsThe experimental results demonstrate that the cone–SLP network significantly reduces the frequency of routing information exchange and energy consumption among acoustic sensors, effectively enhancing the economy and durability of the sensor network. Furthermore, it exhibits robust practicality and high stability in complex and variable submarine environments.DiscussionThis research not only provides a practical method for effectively monitoring submarine disasters but also offers valuable experience and significant reference value for other similar projects, playing a more crucial role in the sustainable development of the ocean economy.

An active jamming-based helper deployment scheme for underwater acoustic sensor networks

Underwater acoustic sensor networks (UASNs) are usually deployed in unattended, opaque and even hostile environments; thus, they may face serious threats. In the last few years, physical layer security (PLS) has emerged as a new technique that can improve the security performance of networks. In this paper, we research the physical layer security scheme of UASNs by actively jamming against eavesdropping attacks. Utilizing the large propagation delay of the underwater acoustic (UWA) signal, the jamming signals can interfere with legitimate signals to prevent eavesdropping. Therefore, we propose an active jamming-based helper deployment scheme (AJHDS) for UASNs, which deploys the helpers to the target water area and realizes the secure transmission of the network. Both the simulation and field test results show that the scheme can significantly reduce the interception capability of eavesdroppers. Furthermore, the field sea experiment evaluates that the location of helpers affects the eavesdropper’s acquisition of legitimate data packets.

An adaptive charging scheme for large-scale wireless rechargeable sensor networks inspired by deep Q-network

An adaptive charging scheme for large-scale wireless rechargeable sensor networks inspired by deep Q-network

An OFDMA Downlink Acoustic Communication Scheme for AUV-Based Mobile Underwater Sensor Network

An OFDMA Downlink Acoustic Communication Scheme for AUV-Based Mobile Underwater Sensor Network

Ses-sn: simple and efficient scheduling scheme in sensor networks

يهدف هذا البحث الى دراسة تصميم بروتوكلات توزيع البيانات في شبكات الاستشعار اللاسلكي، والتي غالبا ما تاخذ في الحسبان الوقت المحدد لتقارير تطبيقات المهمات الضرورية. واتبع البحث المنهج التجريبي وقسم الى مقدمة عامة عن الموضوع واربعة مباحث وخاتمة. وتناول المبحث الاول الدراسات السابقة، ومن ثم بروتوكولات التوجيه المجدولة، ثم الجدولة البسيطة والفعالة، وكذلك تقييم الاداء. أما الخاتمة فتضمنت نتائج الدراسة وأهمها: ان هذا النظام يستخدم الطاقة المحددة ومصادر الذاكرة الموجودة وبطريقة فعالة، وله تاثير هام على نجاح استشعار توزيع البيانات لعقد الاستشعار ويتجنب التصادم.

Energy Balance-Oriented RF Energy Harvesting Schemes for Intelligent Reflecting Surface-Assisted Cognitive Radio Sensor Networks

Energy Balance-Oriented RF Energy Harvesting Schemes for Intelligent Reflecting Surface-Assisted Cognitive Radio Sensor Networks

Optimize the Age of Useful Information in Edge-assisted Energy-harvesting Sensor Networks

The energy-harvesting sensor network is a new network architecture to further prolong the lifetime of sensor networks and enhance the quality of IoT services. Due to the inherent problems of energy-harvesting sensor networks, it is really hard to collect fresh and useful sensory data. To solve the above problems, we investigate the data collection scheme in edge-assisted energy-harvesting sensor networks and try to collect fresh and useful sensory data from such networks. Enlightened by the concept of the age of information, we define a new metric, the age of useful information (AoUI), to measure the usefulness and freshness of the sensory data. Furthermore, we define the Minimizing the Maximum Age of Useful Information problem (Min-AoUI) to construct a sensory data collection method to minimize the AoUI of the sensory data. We prove that the Min-AoUI problem is NP-Hard, and approximation algorithms are proposed to solve this problem. The time complexity and the approximation ratio of this algorithm are analyzed. The performance of the algorithm is also verified by extensive experimental results.

TUBER: Time-aware UAV-based energy-efficient reconfigurable routing scheme for smart wireless livestock sensor network.

This paper is a follow-up to a recent work by the authors on recoverable UAV-based energy-efficient reconfigurable routing (RUBER) scheme for addressing sensor node and route failure issues in smart wireless livestock sensor networks. Time complexity and processing cost issues connected to the RUBER scheme are consequently treated in this article by proffering a time-aware UAV-based energy-efficient reconfigurable routing (TUBER) scheme. TUBER scheme employs a synchronized clustering-with-backup strategy, a minimum-hop neighborhood recovery mechanism, and a redundancy minimization technique. Comparative network performance of TUBER was investigated and evaluated with respect to RUBER and UAV-based energy-efficient reconfigurable routing (UBER) schemes. The metrics adopted for this comparative performance analysis are Cluster Survival Ratio (CSR), Network Stability (NST), Energy Dissipation Ratio (EDR), Network Coverage (COV), Packet Delivery Ratio (PDR), Fault Tolerance Index (FTI), Load Balancing Ratio (LBR), Routing Overhead (ROH), Average Routing Delay (ARD), Failure Detection Ratio (FDR), and Failure Recovery Ratio (FRR). With reference to best-obtained values, TUBER demonstrated improvements of 36.25%, 24.81%, 34.53%, 15.65%, 38.32%, 61.07%, 31.66%, 63.20%, 68.96%, 66.19%, and 78.63% over RUBER and UBER in terms of CSR, NST, EDR, COV, PDR, FTI, LBR, ROH, ARD, FDR, and FRR, respectively. These experimental results confirmed the relative effectiveness of TUBER against the compared routing schemes.

A full privacy-preserving distributed batch-based certificate-less aggregate signature authentication scheme for healthcare wearable wireless medical sensor networks (HWMSNs)

AbstractThe dynamic connectivity and functionality of sensors has revolutionized remote monitoring applications thanks to the combination of IoT and wireless sensor networks (WSNs). Wearable wireless medical sensor nodes allow continuous monitoring by amassing physiological data, which is very useful in healthcare applications. These text data are then sent to doctors via IoT devices so they can make an accurate diagnosis as soon as possible. However, the transmission of medical text data is extremely vulnerable to security and privacy assaults due to the open nature of the underlying communication medium. Therefore, a certificate-less aggregation-based signature system has been proposed as a solution to the issue by using elliptic curve public key cryptography (ECC) which allows for a highly effective technique. The cost of computing has been reduced by 93% due to the incorporation of aggregation technology. The communication cost is 400 bits which is a significant reduction when compared with its counterparts. The results of the security analysis show that the scheme is robust against forging, tampering, and man-in-the-middle attacks. The primary innovation is that the time required for signature verification can be reduced by using point addition and aggregation. In addition, it does away with the reliance on a centralized medical server in order to do verification. By taking a distributed approach, it is able to fully preserve user privacy, proving its superiority.

On CSI-Free Multiantenna Schemes for Massive Wireless-Powered Underground Sensor Networks

Radio-frequency wireless energy transfer (WET) is a promising technology to realize wireless-powered underground sensor networks (WPUSNs) and enable sustainable underground monitoring. However, due to the severe attenuation in harsh underground soil and the tight energy budget of the underground sensors, traditional WPUSNs relying on the channel state information (CSI) are highly inefficient, especially in massive WET scenarios. To address this challenge, we comparatively assess the feasibility of several state-of-the-art CSI-free multi-antenna WET schemes for WPUSNs, under a given power budget. Moreover, to overcome the extremely low WET efficiency in underground channels, we propose a distributed CSI-free system, where multiple power beacons (PBs) simultaneously charge a large set of underground sensors without any CSI. We consider the position-aware K-Means and the position-agnostic equally-far-from-center (EFFC) approaches for the optimal deployment of the PBs. Our results evince that the performance of the proposed distributed CSI-free system can approach or even surpass that of a traditional full-CSI WET strategy, especially when adopting an appropriate CSI-free scheme, applying the advisable PBs deployment approach, and equipping the PBs with an appropriate number of antennas. Finally, we discuss the impact of underground parameters, i.e., the burial depth of devices and the volumetric water content of soil, on the system’s performance, and identify potential challenges and research opportunities for practical distributed CSI-free WPUSNs deployment.

New key management scheme lattice-based for clustered wireless sensor networks.

Aiming at the quantum algorithm which can solve the problem of large integer decomposition and discrete logarithm in polynomial time, an anti-quantum computing key management scheme for clustered sensor networks is proposed in this paper. The lattice-based cryptosystem is used to achieve the anti-quantum performance of the key management scheme, and the security of the network is further improved through the mutual authentication of sensor network nodes. Due to the limited storage space of sensor nodes, this paper adopts the cluster management of wireless sensor networks, and most sensor nodes only need a small amount of storage space, thus reducing the deployment cost. Cluster management is suitable for medium and large-scale deployment of sensor networks. Because the data traffic is much larger than that of mutual authentication, the sensor nodes in wireless sensor networks use symmetric keys to communicate with each other after mutual authentication, which can effectively improve the communication efficiency in the case of frequent data communication. Experiments show that the authentication scheme based on lattice cryptosystem proposed in this paper will not improve with the continuous improvement of the security level, and its authentication scale will maintain a relatively stable state, while the algorithm scheme based on RSA will increase the authentication cost with the continuous improvement of the security level, so the scheme proposed in this paper is more suitable for application in the environment with high security level. This scheme can effectively reduce the cost of mutual authentication of sensor nodes, is conducive to the expansion of the network, and can ensure the security of authentication between sensor nodes even in the post-quantum era.

A geodesic distance-based routing scheme for sensor networks with irregular terrain structure

A geodesic distance-based routing scheme for sensor networks with irregular terrain structure

Comparison of Collaborative and Cooperative Schemes in Sensor Networks for Non-Invasive Monitoring of People at Home

This paper looks at wireless sensor networks (WSNs) in healthcare, where they can monitor patients remotely. WSNs are considered one of the most promising technologies due to their flexibility and autonomy in communication. However, routing protocols in WSNs must be energy-efficient, with a minimal quality of service, so as not to compromise patient care. The main objective of this work is to compare two work schemes in the routing protocol algorithm in WSNs (cooperative and collaborative) in a home environment for monitoring the conditions of the elderly. The study aims to optimize the performance of the algorithm and the ease of use for people while analyzing the impact of the sensor network on the analysis of vital signs daily using medical equipment. We found relationships between vital sign metrics that have a more significant impact in the presence of a monitoring system. Finally, we conduct a performance analysis of both schemes proposed for the home tracking application and study their usability from the user's point of view.

Multi-UAV WRSN charging path planning based on improved heed and IA-DRL

Aiming at the problem of how to improve the energy utilization rate of UAV (Unmanned Aerial Vehicle) in the charging process of wireless rechargeable sensor network, a charging path planning scheme for multi-UAV wireless rechargeable sensor network based on deep reinforcement learning is proposed. Firstly, the multi-UAV path planning problem is described and a network model is established, and then the network model is optimized by using the improved dynamic clustering algorithm of HEED, and then an intelligent path optimization algorithm based on the intelligent algorithm and deep reinforcement learning IA-DRL is proposed for the problem model. According to this algorithm, the optimal charging path of multiple drones is obtained, and finally the drones charge each node to be charged in the network. The experimental results show, compared with other traditional heuristic methods, IA-DRL has more advantages in solving small and medium-scale UAV path planning problems, and compared with the neural network model without PSO, the minimum AVG performance of IA-DRL is improved by about 3.8% and has a faster convergence speed about 550 episodes.

RUBER: Recoverable UAV-based energy-efficient reconfigurable routing scheme for smart wireless livestock sensor network

This paper is a sequel to a previous article by the authors in which UAV-based energy-efficient reconfigurable routing (UBER) scheme was proposed to address coverage loss and rapid energy depletion issues for smart wireless livestock sensor networks. Sensor node and route failure issues associated with the UBER scheme are therefore addressed in this research by proposing a recoverable UAV-based energy-efficient reconfigurable routing (RUBER) scheme. RUBER scheme relies on an efficient fault detection and recycling technique, dynamic recovery mechanism, and robust route maintenance technique. Performance of RUBER was analyzed under low, medium and high failure rate network conditions. Performance indices employed for this assessment are failure detection ratio (FDR), failure recovery ratio (FRR), load balancing ratio (LBR), and packet delivery ratio (PDR). Analysis results demonstrated that keeping the failure rate below 10% led to performance improvements of 60.96%, 74.14%, 64.68%, and 60.74% for FDR, FRR, LBR, and PDR, respectively. Performance comparison of RUBER was conducted against UBER and hybrid heterogeneous routing (HYBRID) schemes. Performance metrics utilized for this comparative evaluation are average routing delay (ARD), energy dissipation ratio (EDR), routing overhead (ROH), fault tolerance index (FTI), nodal failure recovered (NFR), route failure recovered (RFR), and cluster survival ratio (CSR). With respect to best-case values, RUBER exhibited gains of 79.67%, 44.98%, 67.88%, 74.90%, 52.20%, 70.56%, and 52.52% over UBER and HYBRID in terms of ARD, EDR, ROH, FTI, NFR, RFR, and CSR respectively. Simulation experiments revealed the relative competitiveness of the RUBER scheme against the benchmarked schemes.

An energy-balanced head nodes selection scheme for underwater mobile sensor networks

Underwater sensor networks system is a promising technology for smart ocean monitoring applications. To address the imbalance problem of network overhead and limited energy of underwater sensor nodes, this paper presents a CH–SH Selection and Sink Path-planning (CSSP) scheme to collect vast amount of data from heterogeneous sensor nodes. The scheme firstly establishes a three-layer network structure model for underwater mobile sensor networks (UMSN) based on multi-mode communication mechanism and provides energy-balanced head nodes (cluster head and sub-cluster head nodes) selection algorithm based on particle swarm iterative optimization. Then, the optimal global-path-plan of mobile sink is proposed to visit all the head nodes to collect data, reduce the multi-hop underwater acoustic transmission distance of relay nodes, and avoid the energy hole problem. Lastly, the upper-layer multi-hop network of UMSN is designed to remotely control local-path-plan over mobile sink, in order to implement joint planning of global and local paths of mobile sink. Simulation results verified that the proposed CSSP scheme outperformed 11%, 16% and 22% over three typical protocols in terms of nodes energy consumption, CSSP was 9%, 12% and 19% lower than three typical protocols in terms of SD of energy consumption, packet delivery ratio of CSSP was 8%, 10% and 12% higher than three typical protocols. The scheme could significantly balance energy and reduce packet loss rate.

Privacy-Preserving Location-Based Data Queries in Fog-Enhanced Sensor Networks

Fog computing has emerged as a promising framework with the rapid growth of the Internet of Things (IoT). In fog computing, the new entity, named fog device, can help the cloud process the large amount of data generated by IoT devices. Along with this trend, a location-based query scheme that collects IoT devices’ data from specific areas is an important application, especially in fog-enhanced sensor networks. However, in this application, the cloud and fog devices require the user’s query, sensors’ locations, and sensor data so that it raises critical privacy and security concerns. In this article, we devise a privacy-preserving-location-based data query scheme in fog-enhanced sensor networks, which allows the cloud and fog devices to collect sensor data from a query area without learning the three kinds of information. Specifically, we resort to a cryptographic primitive, named somewhat homomorphic encryption (SHE), with ciphertext packing to encrypt query, locations, and sensor data and efficiently calculate the distances between the user’s query and sensors. Then, we show how to build a hardware-assisted data query scheme to extract the matched data based on the distances. We formally analyze the security strengths and implement the system prototype. In order to implement secure processing within software guard extension (SGX), we make an effort to adapt the existing mathematical libraries to the advanced SGX trusted environment. Evaluation results demonstrate that our proposed design is secure and efficient.

An improved pairing-free certificateless aggregate signature scheme for healthcare wireless medical sensor networks.

In healthcare wireless medical sensor networks (HWMSNs), the medical sensor nodes are employed to collect medical data which is transmitted to doctors for diagnosis and treatment. In HWMSNs, medical data is vulnerable to various attacks through public channels. In addition, leakage of patients’ information happens frequently. Hence, secure communication and privacy preservation are major concerns in HWMSNs. To solve the above issues, Zhan et al. put forward a pairing-free certificateless aggregate signature (PF-CLAS) scheme. However, according to our cryptanalysis, the malicious medical sensor node (MSNi) can generate the forged signature by replacing the public key in the PF-CLAS scheme. Hence, to address this security flaw, we design the improved PF-CLAS scheme that can achieve unforgeability, anonymity, and traceability. Since we have changed the construction of the partial private key, the improved PF-CLAS scheme can resist Type I and Type II attacks under the Elliptic Curve Discrete Logarithm assumption. In terms of the performance evaluation, the proposed scheme outperforms related CLAS schemes, which is more suitable for HWMSNs environments.