Genetic Algorithm versus Discrete Particle Swarm Optimization Algorithm for Energy-Efficient Moving Object Coverage Using Mobile Sensors

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 insuffic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied sciences Jg. 12; H. 7; S. 3340
Hauptverfasser: Chen, Hao-Wei, Liang, Chiu-Kuo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.04.2022
Schlagworte:
Communication
Connectivity
discrete particle swarm optimization
Energy consumption
genetic algorithm
Genetic algorithms
Heuristic
mobile sensor networks
moving object coverage
Optimization algorithms
Performance evaluation
Sensors
Sleep
Unmanned aerial vehicles
Wireless networks
ISSN:2076-3417, 2076-3417
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app12073340