scholarly journals Energy-Efficient Adaptive Sensing Scheduling in Wireless Sensor Networks using Fibonacci Tree Optimization Algorithm

2021 ◽  
Author(s):  
Liangshun Wu ◽  
Hengjin Cai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Average Energy ◽  
Wireless Sensor ◽  
Scheduling Strategy ◽  
Adaptive Sensing ◽  
Tree Optimization ◽  
Fibonacci Tree

Wireless sensor networks are attractive largely because they need no wired infrastructure. But precisely this feature makes them energy constrained. Recent studies find that sensing behaviors that are otherwise deemed efficient consume comparable energy with communication. The duty cycle scheduling is perceived as contributing to achieving energy efficiency of sensing. Because of different research assumptions and objectives, various scheduling schemes have various emphases. This paper designed an adaptive sensing scheduling strategy. The objective function of the scheduling strategy includes minimizing average energy expenditure and maximizing sensing coverage (reducing event miss-rate), and it requires relatively loose assumptions. We determine the functional relationship between the variables of the objective function and the step-size parameters of the proposed strategy through the numerical fitting. We found that the objective function aggregated by the fitting functions is a bivariate multi-peak function that favors the Fibonacci tree optimization algorithm. Once the optimization of parameters is done, the strategy can be easily deployed and behaves consistently in the coming hours. We name the proposed strategy as “FTOS”. The experimental results show that the Fibonacci tree optimization algorithm gets a better optimistic effect than the comprehensive learning particle swarm optimization (CLPSO) algorithm and differential evolution (DE) algorithm. The FTOS strategy is superior to the fixed time scheduling strategy in achieving the scheduling objectives. It also outperforms other strategies with the same scheduling objectives such as LDAS, BS, DSS and PECAS.

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

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5002
Author(s):  
Liangshun Wu ◽  
Hengjin Cai
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Wireless Sensor ◽  
Swarm Optimization ◽  
Adaptive Sensing ◽  
Tree Optimization ◽  
Fibonacci Tree

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.

A MAC Layer Optimization Algorithm in Wireless Sensor Networks

2012 ◽  
Vol 35 (3) ◽  
pp. 529-539 ◽  
Author(s):  
Yun-Lu LIU ◽  
Ju-Hua PU ◽  
Wei-Wei FANG ◽  
Zhang XIONG
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Wireless Sensor ◽  
Mac Layer

scholarly journals An Uneven Node Self-Deployment Optimization Algorithm for Maximized Coverage and Energy Balance in Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1368 ◽  
Author(s):  
Luoheng Yan ◽  
Yuyao He ◽  
Zhongmin Huangfu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Optimization Algorithm ◽  
Growth Ring ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Connected Network ◽  
Deployment Optimization

The underwater wireless sensor networks (UWSNs) have been applied in lots of fields such as environment monitoring, military surveillance, data collection, etc. Deployment of sensor nodes in 3D UWSNs is a crucial issue, however, it is a challenging problem due to the complex underwater environment. This paper proposes a growth ring style uneven node depth-adjustment self-deployment optimization algorithm (GRSUNDSOA) to improve the coverage and reliability of UWSNs, meanwhile, and to solve the problem of energy holes. In detail, a growth ring style-based scheme is proposed for constructing the connective tree structure of sensor nodes and a global optimal depth-adjustment algorithm with the goal of comprehensive optimization of both maximizing coverage utilization and energy balance is proposed. Initially, the nodes are scattered to the water surface to form a connected network on this 2D plane. Then, starting from sink node, a growth ring style increment strategy is presented to organize the common nodes as tree structures and each root of subtree is determined. Meanwhile, with the goal of global maximizing coverage utilization and energy balance, all nodes depths are computed iteratively. Finally, all the nodes dive to the computed position once and a 3D underwater connected network with non-uniform distribution and balanced energy is constructed. A series of simulation experiments are performed. The simulation results show that the coverage and reliability of UWSN are improved greatly under the condition of full connectivity and energy balance, and the issue of energy hole can be avoided effectively. Therefore, GRSUNDSOA can prolong the lifetime of UWSN significantly.

scholarly journals A Novel Bioinspired Multiobjective Optimization Algorithm for Designing Wireless Sensor Networks in the Internet of Things

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Jun Huang ◽  
Liqian Xu ◽  
Cong-cong Xing ◽  
Qiang Duan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Internet Of Things ◽  
Multiobjective Optimization ◽  
Optimization Algorithm ◽  
Chaotic Behavior ◽  
Ant Colony ◽  
Wireless Sensor ◽  
The Internet ◽  
The Internet Of Things

The design of wireless sensor networks (WSNs) in the Internet of Things (IoT) faces many new challenges that must be addressed through an optimization of multiple design objectives. Therefore, multiobjective optimization is an important research topic in this field. In this paper, we develop a new efficient multiobjective optimization algorithm based on the chaotic ant swarm (CAS). Unlike the ant colony optimization (ACO) algorithm, CAS takes advantage of both the chaotic behavior of a single ant and the self-organization behavior of the ant colony. We first describe the CAS and its nonlinear dynamic model and then extend it to a multiobjective optimizer. Specifically, we first adopt the concepts of “nondominated sorting” and “crowding distance” to allow the algorithm to obtain the true or near optimum. Next, we redefine the rule of “neighbor” selection for each individual (ant) to enable the algorithm to converge and to distribute the solutions evenly. Also, we collect the current best individuals within each generation and employ the “archive-based” approach to expedite the convergence of the algorithm. The numerical experiments show that the proposed algorithm outperforms two leading algorithms on most well-known test instances in terms of Generational Distance, Error Ratio, and Spacing.

scholarly journals Improved whale optimization algorithm and its application in heterogeneous wireless sensor networks

2021 ◽  
Vol 17 (5) ◽  
pp. 155014772110181
Author(s):  
Yinggao Yue ◽  
Hairong You ◽  
Shuxin Wang ◽  
Li Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Whale Optimization Algorithm ◽  
Wireless Sensor ◽  
Network Coverage ◽  
Coverage Optimization ◽  
Network Cost ◽  
Whale Optimization ◽  
Heterogeneous Wireless Sensor Networks

Aiming at the problems of node redundancy and network cost increase in heterogeneous wireless sensor networks, this article proposes an improved whale optimization algorithm coverage optimization method. First, establish a mathematical model that balances node utilization, coverage, and energy consumption. Second, use the sine–cosine algorithm to improve the whale optimization algorithm and change the convergence factor of the original algorithm. The linear decrease is changed to the nonlinear decrease of the cosine form, which balances the global search and local search capabilities, and adds the inertial weight of the synchronous cosine form to improve the optimization accuracy and speed up the search speed. The improved whale optimization algorithm solves the heterogeneous wireless sensor network coverage optimization model and obtains the optimal coverage scheme. Simulation experiments show that the proposed method can effectively improve the network coverage effect, as well as the utilization rate of nodes, and reduce network cost consumption.

Sign in / Sign up

Export Citation Format

Share Document