Cargando…

Application of NSGA-II to Obtain the Charging Current-Time Tradeoff Curve in Battery Based Underwater Wireless Sensor Nodes

In this paper, a novel application of the Nondominated Sorting Genetic Algorithm II (NSGA II) is presented for obtaining the charging current–time tradeoff curve in battery based underwater wireless sensor nodes. The selection of the optimal charging current and times is a common optimization proble...

Descripción completa

Detalles Bibliográficos
Autores principales: Rodríguez García, Daniel, Montiel-Nelson, Juan-A., Bautista, Tomás, Sosa, Javier
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8399456/
https://www.ncbi.nlm.nih.gov/pubmed/34450764
http://dx.doi.org/10.3390/s21165324
Descripción
Sumario:In this paper, a novel application of the Nondominated Sorting Genetic Algorithm II (NSGA II) is presented for obtaining the charging current–time tradeoff curve in battery based underwater wireless sensor nodes. The selection of the optimal charging current and times is a common optimization problem. A high charging current ensures a fast charging time. However, it increases the maximum power consumption and also the cost and complexity of the power supply sources. This research studies the tradeoff curve between charging currents and times in detail. The design exploration methodology is based on a two nested loop search strategy. The external loop determines the optimal design solutions which fulfill the designers’ requirements using parameters like the sensor node measurement period, power consumption, and battery voltages. The inner loop executes a local search within working ranges using an evolutionary multi-objective strategy. The experiments proposed are used to obtain the charging current–time tradeoff curve and to exhibit the accuracy of the optimal design solutions. The exploration methodology presented is compared with a bisection search strategy. From the results, it can be concluded that our approach is at least four times better in terms of computational effort than a bisection search strategy. In terms of power consumption, the presented methodology reduced the required power at least 3.3 dB in worst case scenarios tested.