Return
Genetic Algorithm versus Discrete Particle Swarm Optimization Algorithm for Energy-Efficient Moving Object Coverage Using Mobile Sensors
DOI:10.3390/app12073340.png)
Abstract
En 中文
This paper addresses the challenge of moving objects in a mobile wireless sensor network, considering the deployment of a limited number of mobile wireless sensor nodes within a predetermined area to provide coverage for moving objects traveling on a predetermined trajectory. Because of the insufficient number and limited sensing range of mobile wireless sensors, the entire object's trajectory cannot be covered by all deployed sensors. To address this problem and provide complete coverage, sensors must move from one point of the trajectory to another. The frequent movement quickly depletes the sensors' batteries. Therefore, solving the moving object coverage problem requires an optimized movement repertoire where (1) the total moving distance is minimized and (2) the remaining energy is also as balanced as possible for mobile sensing. Herein, we used a genetic algorithm (GA) and a discrete particle swarm optimization algorithm (DPSO) to manage the complexity of the problem, compute feasible and quasi-optimal trajectories for mobile sensors, and determine the demand for movement among nodes. Simulations revealed that the GA produced trajectories significantly superior to those produced by the DPSO in terms of total traveled distance and balance of residual energy.
Keywords:
moving object coverage
mobile sensor networks
genetic algorithm
discrete particle swarm optimization
Journal
A
IF:
2.5
Papers:
1.9K
Citations:
15.9W
Organization
Cited Papers
Assessment of pain after subcutaneous injection of erythropoietin in patients receiving haemodialysis.
BMJ
IF0
Vibrational and impedance spectroscopic analysis of poly(vinyl alcohol)-based solid polymer electrolytes
Ionics
IF0
Recombinant Human Erythropoietin in Anemic Patients on Maintenance Hemodialysis: Comparison between Intravenous and Subcutaneous Administration
Nephron
IF0

