Energy-Efficient Adaptive Sensing Scheduling in Wireless Sensor Networks Using Fibonacci Tree Optimization Algorithm

Abstract

Wireless sensor networks are appealing, largely because they do not need wired infrastructure, but it is precisely this feature that renders them energy-constrained. The duty cycle scheduling is perceived as a contributor to the energy efficiency of sensing. This paper developed a novel paradigm for modeling wireless sensor networks; in this context, an adaptive sensing scheduling strategy is proposed depending on event occurrence behavior, and the scheduling problem is framed as an optimization problem. The optimization objectives include reducing energy depletion and optimizing detection accuracy. We determine the explicit form of the objective function by numerical fitting and found that the objective function aggregated by the fitting functions is a bivariate multimodal function that favors the Fibonacci tree optimization algorithm. Then, with the optimal parameters optimized by the Fibonacci tree optimization algorithm, the scheduling scheme can be easily deployed, and it behaves consistently in the coming hours. The proposed “Fibonacci Tree Optimization Strategy” (“FTOS”) outperforms lightweight deployment-aware scheduling (LDAS), balanced-energy scheduling (BS), distributed self-spreading algorithm (DSS) and probing environment and collaborating adaptive sleeping (PECAS) in achieving the aforementioned scheduling objectives. The Fibonacci tree optimization algorithm has attained a better optimistic effect than the artificial bee colony (ABC) algorithm, differential evolution (DE) algorithm, genetic algorithm (GA) algorithm, particle swarm optimization (PSO) algorithm, and comprehensive learning particle swarm optimization (CLPSO) algorithm in multiple runs.

Keywords

• sensing
• energy-saving
• duty cycles
• Fibonacci tree optimization