Search Results (1,281)

Wireless Sensor Networks (WSNs) are vital to a wide range of applications, spanning from environmental monitoring to safety-critical systems. Ensuring dependable operation in these networks critically depends on selecting an optimal node scheduling algorithm; however, this remains a major challenge since no single approach performs best under all conditions. To address this issue, this paper proposes an AI-driven framework that evaluates scenario-specific functional requirements—such as coverage, connectivity, and network lifetime—to identify the optimal node scheduling algorithm from a pool that includes Hidden Markov Models (HMMs), BAT, Bird Flocking, Self-Organizing Maps (SOFMs), and Long Short-Term Memory (LSTM) networks. The framework was evaluated using a neural network trained on simulated data and tested across five real-world scenarios: healthcare monitoring, military operations, industrial IoT, forest fire detection, and disaster recovery. The results clearly demonstrate the effectiveness of the proposed framework in identifying the most suitable algorithm for each scenario. Notably, the LSTM algorithm frequently achieved near-optimal performance, excelling in critical objectives such as network lifetime, connectivity, and coverage. The framework also revealed the complementary strengths of other algorithms—HMM proved superior for maintaining connectivity, while Bird Flocking excelled in extending network lifetime. Consequently, this work validates that a scenario-aware selection strategy is essential for maximizing WSN dependability, as it leverages the unique advantages of diverse algorithms. Full article

Wireless Sensor Networks (WSNs) have emerged as a foundational technology for monitoring and data collection in diverse domains such as environmental sensing, smart agriculture, and industrial automation. Precise node localization plays a vital role in WSNs, enabling effective data interpretation, reliable routing, and spatial context awareness. The challenge intensifies in range-free settings, where a lack of direct distance data demands efficient indirect estimation methods, particularly in large-scale, energy-constrained deployments. This work proposes a hybrid localization framework that integrates the distance vector-hop (DV-Hop) range-free localization algorithm with the Fire Hawk Optimizer (FHO), a nature-inspired metaheuristic method inspired by the predatory behavior of fire hawks. The proposed FHODV-Hop method enhances location estimation accuracy while maintaining low computational overhead by inserting the FHO into the third stage of the DV-Hop algorithm. Extensive simulations are conducted on multiple topologies, including random, circular, square-grid, and S-shaped, under various network parameters such as node densities, anchor rates, population sizes, and communication ranges. The results show that the proposed FHODV-Hop model achieves competitive performance in Average Localization Error (ALE), localization ratio, convergence behavior, computational, and runtime efficiency. Specifically, FHODV-Hop reduces the ALE by up to 35% in random deployments, 25% in circular networks, and nearly 45% in structured square-grid layouts compared to the classical DV-Hop. Even under highly irregular S-shaped conditions, the algorithm achieves around 20% improvement. Furthermore, convergence speed is accelerated by approximately 25%, and computational time is reduced by nearly 18%, demonstrating its scalability and practical applicability. Therefore, these results demonstrate that the proposed model offers a promising balance between accuracy and practicality for real-world WSN deployments. Full article

Intelligent reflecting surface-assisted unmanned aerial vehicles (IRS-UAVs) have been widely applied in various communication scenarios. This paper addressed the uplink communication problem in wireless sensor networks (WSNs) by proposing a novel double IRS-UAVs assisted framework to improve the pairwise sum rate. Specifically, nodes with relatively short signal transmission distances upload signals via a single-reflection link, while nodes with relatively long distances upload signals through a dual-reflection link involving two IRSs. Within each work cycle, the IRS-UAVs followed a fixed service sequence to cyclically assist all sensor node pairs. We designed a joint optimization algorithm that simultaneously optimized the UAV trajectories and IRS phase shifts to maximize the pairwise sum rate while guaranteeing each node’s transmission rate meets a minimum quality of service (QoS) constraint. Specifically, we introduce slack variables to linearize the inherently nonlinear constraints arising from interdependent variables, thereby transforming each subproblem into a more manageable form. These subproblems are then solved iteratively within a coordinated optimization framework: in each iteration, one subproblem is optimized while keeping variables of others fixed, and the solutions are alternately updated to refine the overall performance. The numerical results show that this algorithm can effectively optimize the flight trajectory of the unmanned aircraft and significantly improve the pairwise total rate of the system. Compared with the two traditional schemes, the average optimization rates are 11.91% and 16.36%. Full article

The growing need for efficient and sustainable urban water management has accelerated the adoption of smart monitoring infrastructures based on wireless sensor networks (WSNs). This study proposes a connectivity-aware methodology for the optimal deployment of wireless sensor networks (WSNs) in smart water metering systems. The approach models the wireless sensors as nodes embedded in household water meters and determines the minimal yet sufficient set of Data Aggregation Points required to ensure complete network coverage and transmission reliability. A scalable and hierarchical topology is generated by integrating an enhanced minimum spanning tree algorithm with set covering techniques and geographic constraints, leading to a robust intermediate layer of aggregation nodes. These nodes are wirelessly linked to a single cellular base station, minimizing infrastructure costs while preserving communication quality. Simulation results on realistic urban layouts demonstrate that the proposed strategy reduces network fragmentation, improves energy efficiency, and simplifies routing paths compared to traditional ad hoc designs. The results offer a practical framework for deploying resilient and cost-effective smart water metering solutions in densely populated urban environments. Full article

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. Full article

Wireless sensor networks (WSNs) are an advanced solution for data collection in Internet of Things (IoT) applications and remote and harsh environments. These networks rely on a collection of distributed sensors equipped with wireless communication capabilities to collect low-cost and small-scale data. WSNs face numerous challenges, including network congestion, slow speeds, high energy consumption, and a short network lifetime due to their need for a constant and stable power supply. Therefore, improving the energy efficiency of sensor nodes through solar energy harvesting (SEH) would be the best option for charging batteries to avoid excessive energy consumption and battery replacement. In this context, modern wireless communication technologies, such as Wi-Fi and Li-Fi, emerge as promising solutions. Wi-Fi provides internet connectivity via radio frequencies (RF), making it suitable for use in open environments. Li-Fi, on the other hand, relies on data transmission via light, offering higher speeds and better energy efficiency, making it ideal for indoor applications requiring fast and reliable data transmission. This paper aims to integrate Wi-Fi and Li-Fi technologies into the SEH-WSN architecture to improve performance and efficiency when used in all applications. To achieve reliable, efficient, and high-speed bidirectional communication for multiple devices, the paper utilizes a Markov model, sleep scheduling, and smart switching algorithms to reduce power consumption, increase signal-to-noise ratio (SNR) and throughput, and reduce bit error rate (BER) and latency by controlling the technology and power supply used appropriately for the mode, sleep, and active states of nodes. Full article

Wireless sensor networks (WSNs) are key enablers of efficient communication in the Internet of Things (IoT) ecosystem. These networks comprise numerous sensor nodes that collaboratively collect and transmit data, requiring adaptive and energy-efficient management. However, high node density and resource limitations introduce challenges such as control overhead, packet collisions, interference, and energy inefficiency. To mitigate these issues, this paper adopts the Hybrid Wireless Mesh Protocol (HWMP), standardized under IEEE 802.11s for wireless mesh networks (WMNs), as the routing protocol in WSNs. HWMP’s hybrid design combining reactive and proactive routing is well-suited for dynamic and mobile environments, making it applicable to WSNs operating under similar conditions. Building on this foundation, we propose a community-aware topology control mechanism that constructs a Connected Dominating Set (CDS) to serve as the network’s energy-efficient backbone. Node selection is guided by centrality metrics and detected community structures to enhance routing efficiency and network longevity. The mechanism is evaluated across six mobility scenarios characterized by realistic movement patterns. Comparative results show that incorporating community structure significantly improves routing performance and reduces energy consumption, validating the approach’s effectiveness in real-world WSN deployments. Full article

The research work presents an artificial intelligence-driven, energy-aware data aggregation and routing protocol for wireless sensor networks (WSNs) with the primary objective of extending overall network lifetime. The proposed scheme leverages reinforcement learning in conjunction with deep Q-networks (DQNs) to adaptively optimize both Cluster Head (CH) selection and routing decisions. An adaptive clustering mechanism is introduced wherein factors such as residual node energy, spatial proximity, and traffic load are jointly considered to elect suitable CHs. This approach mitigates premature energy depletion at individual nodes and promotes balanced energy consumption across the network, thereby enhancing node sustainability. For data forwarding, the routing component employs a DQN-based strategy to dynamically identify energy-efficient transmission paths, ensuring reduced communication overhead and reliable sink connectivity. Performance evaluation, conducted through extensive simulations, utilizes key metrics including network lifetime, total energy consumption, packet delivery ratio (PDR), latency, and load distribution. Comparative analysis with baseline protocols such as LEACH, PEGASIS, and HEED demonstrates that the proposed protocol achieves superior energy efficiency, higher packet delivery reliability, and lower packet losses, while adapting effectively to varying network dynamics. The experimental outcomes highlight the scalability and robustness of the protocol, underscoring its suitability for diverse WSN applications including environmental monitoring, surveillance, and Internet of Things (IoT)-oriented deployments. Full article

Three-dimensional (3D) wireless sensor networks (WSNs) are gaining increasing significance in applications across complex environments, including underwater monitoring, mountainous terrains, and smart cities. Compared to two-dimensional (2D) WSNs, 3D WSNs introduce unique challenges in coverage, connectivity, map construction, and blind area detection. This paper provides a comprehensive survey of node deployment strategies in 3D WSNs. We summarize several key design aspects: sensing models, occlusion detection, coverage and connectivity, sensor mobility, signal and protocol effects, and simulation map construction. Deployment algorithms are categorized into six main types: classical algorithms, computational geometry algorithms, virtual force algorithms, evolutionary algorithms, swarm intelligence algorithms, and approximation algorithms. For each category, we review representative works, analyze their design principles, and evaluate their advantages and limitations. Comparative summaries are included to facilitate algorithm selection based on specific deployment requirements. Recent advancements in these strategies have led to significant improvements in network performance, with some algorithms achieving up to 12.5% lower cost and 30% higher coverage compared to earlier methods, and even reaching 100% coverage in certain cases. Thus, this survey aims to present the current research status and highlight practical improvements, offering a reference for understanding existing approaches and selecting appropriate algorithms for diverse deployment scenarios. Full article

The rapid growth of the Internet of Things (IoT) has driven the need for ultra-low-power wireless communication systems. Wake-up receivers (WuRXs) have emerged as a key technology to enable energy-efficient, near-always-on operation for IoT devices. This review explores the state of the art in WuRXs design, focusing on low-power architectures, key trade-offs, and recent advancements. We discuss the challenges in achieving low power consumption while maintaining sensitivity, power consumption, and interference resilience. The review highlights the evolution from radio frequency (RF) envelope detection architectures to more complex heterodyne and subthreshold designs and concludes with future directions for WuRXs research. Full article

Wireless sensor networks (WSNs) are deployed in terrestrial environments. However, on the sea surface, sensor nodes can drift due to ocean currents and wind; thus, network topologies continuously evolve, and the communication between nodes is frequently disrupted. These unstable connections significantly degrade data transmission stability and overall network performance. These problems are particularly significant in maritime regions where the sea state changes rapidly, thus imposing stringent technical requirements on the design of long-range, reliable, low-latency, and persistent sensing systems. This study proposes a wireless sensor network architecture for sea surface drifting nodes, which is termed Drift-Aware Routing and Clustering with Recovery (DARCR). The proposed system consists of three major components: (1) an enhanced dynamic drift model that more accurately predicts node movement for realistic ocean conditions; (2) a cluster-based framework that prevents disconnection and minimizes delay, which improves cluster stability and adaptability to dynamic environments through refined clustering and route setup mechanisms; and (3) a self-recovery routing strategy for re-establishing communication after disconnection. The proposed method is evaluated using ocean current data from the Copernicus Ocean Data Center simulating a 60-h drifting scenario around the central Taiwan Strait. The experimental results show that the average hourly disconnection rate is maintained at 6.2%, with a variance of 0.31%, and the transmission of newly sensed data is completed within 3 to 5 s, with a maximum delay of approximately 10 s. These findings demonstrate the feasibility of maintaining communication stability and low-latency data transmission for sea surface WSNs that operate in highly dynamic marine conditions. Full article

Advancements in communication technologies and the proliferation of smart devices have significantly increased the demand for wireless sensor networks (WSNs). These networks play an important role in the IoT environment. The wireless sensor network has many sensor nodes that are used to monitor the surrounding environment. Energy consumption is the main issue in WSN due to the difficulty in recharging or replacing batteries in the sensor nodes. Cluster head selection is one of the most effective approaches to reduce overall network energy consumption. In recent years, quantum technology has become a growing research area. Various quantum-based algorithms have been developed by researchers for clustering. This article introduces a novel, energy-efficient clustering scheme called the quantum-inspired clustering scheme (QICS), which is based on the Quantum Grover algorithm. It is mainly used to improve the performance of cluster head selection in a wireless sensor network. The research conducted simulations that compared the proposed cluster selection method against established algorithms, LEACH, GSACP, and EDS-KHO. The simulation environment used 100 nodes connected via specific energy and communication settings. QICS stands out as the superior clustering method since it extends the lifetime of the network by 30.5%, decreases energy usage by 22.4%, and increases the packet delivery ratios by 19.8%. The quantum method achieved an increase in speed with its clustering procedure. This study proves how quantum-inspired techniques have become an emerging approach to handling WSN energy restrictions, thus indicating future potential for IoT systems with energy awareness and scalability. Full article

Recently, high-precision WSN (wireless sensor network) ranging and positioning algorithms based on RSSI (Received Signal Strength Indicator) in complex indoor environments have become a popular research topic. This is because RSSI is easy to obtain and more suitable for the large-scale deployment of WSNs. However, WSN ranging and positioning algorithms using RSSI are severely affected by the presence of noise and multipath effects in complex indoor environments. To reduce multipath effects, a multi-channel ranging algorithm was developed. This algorithm must obtain accurate initial parameter values or the target–reference distance in advance; otherwise, it will fall into local optima. We propose an environment-adaptive algorithm for multi-channel ranging optimization based on an innovative evolutionary model with multiple objectives and an existing adaptive extended Kalman filter. This novel model includes a newly created objective function of the relationship between weighted multi-channel RSSI and node distance, which allows it to achieve globally optimal results without requiring extensive training to obtain accurate initial parameter values or the target–reference distance beforehand. Extensive simulations and experiments show that our proposed algorithm always has much higher ranging accuracy than the existing algorithm, regardless of whether the multi-channel RSSI is regular or the number of paths matches. Full article

Maximizing the lifetimes of Wireless Sensor Networks (WSNs) is a prominent area of research. The energy hole problem is a major cause of network shutdown, where nodes within the Sink coverage deplete their energy faster due to the high energy cost of forwarding data from distant nodes to the Sink. Several research works have proposed solutions to address this issue, including the use of a mobile Sink to balance energy consumption throughout the network. However, most Sink mobility models overlook the energy consumption caused by overhearing, which is a critical factor in WSNs. In this paper, we introduce Linear Programming (LP) and Cuckoo Search (CS) metaheuristic optimization-based solutions to maximize the lifetime of WSNs by determining the optimal Sink sojourn points and associated durations. The proposed approaches consider the energy consumption levels of both reception and transmission, in addition to accounting for overhearing as an additional source of energy consumption. This allows for a comparison between the LP and CS solutions in terms of their effectiveness. To further enhance our solution, we apply the Travel Salesman Problem (TSP) to find the shortest path between the Sink sojourn points. By incorporating the TSP, we can optimize the routing path for the mobile Sink, thereby minimizing energy consumption and maximizing network lifetime. Test results demonstrate that the LP solution provides more accurate Sink sojourn times and locations, while the CS solution is faster, particularly for large WSNs. Moreover, our findings indicate that overlooking overhearing leads to a 48% decrease in WSN lifetime, making it essential to consider this factor if one is to achieve realistic results. Full article

Wireless Sensor Networks (WSNs) face persistent challenges of uneven energy depletion, limited scalability, and reduced network lifetime, all of which hinder their effectiveness in Internet of Things (IoT) applications. This paper introduces a hybrid framework that integrates Bluetooth Low-Energy (BLE) mesh networking with Ant Colony Optimization (ACO) to deliver energy-aware, adaptive routing over a standards-compliant mesh fabric. BLE mesh contributes a resilient many-to-many topology with Friend/Low-Power Node roles that minimize idle listening, while ACO dynamically selects next hops based on residual energy, distance, and link quality to balance load and prevent hot spots. Using large-scale simulations with 1000 nodes over a 1000 × 1000 m field, the proposed BLE-ACO system reduced overall energy consumption by approximately 35%, extended network lifetime by 40%, and improved throughput by 25% compared with conventional BLE forwarding, while also surpassing a LEACH-like clustering baseline. Confidence interval analysis confirmed the statistical robustness of these results. The findings demonstrate that BLE-ACO is a scalable, sustainable, and standards-aligned solution for energy-constrained IoT deployments, particularly in smart cities, industrial automation, and environmental monitoring, where long-term performance and adaptability are critical. Full article