Optimizing sleep scheduling in wireless sensor networks via node utility and critical target prioritization

Abstract

Energy-efficient coverage remains a critical challenge in wireless sensor networks (WSNs), particularly under probabilistic sensing models and resource-constrained environments. To address this, we propose a novel sleep scheduling algorithm that integrates node utility with a priority strategy for critical coverage targets. Our approach begins by constructing a hierarchical disjoint cover set (H-DCS) to reduce computational complexity and decouple global coverage constraints. We then introduce a utility-prioritized key target optimization (UPKO) framework, which dynamically balances node residual energy against coverage contribution, while ensuring that targets with minimal predicted lifetime are prioritized. The integrated algorithm, termed UCTF-SS, selectively activates a subset of nodes to maintain full coverage while maximizing network lifetime. Extensive simulations across multiple network scales and parameter settings demonstrate that UCTF-SS significantly outperforms existing methods, including MUA-WPT and GA-based scheduling, in terms of energy consumption, coverage sustainability, and network longevity. The proposed method also exhibits strong scalability and adaptability to large-scale deployments, offering a practical and efficient solution for energy-aware WSN operations.