A genetic algorithm method for improving suboptimal sensor arrangements in coverage and connectivity problems

This paper is concerned with the solution of a Coverage and Connectivity Problem (CCP). The proposed method performs the placement of sensors forming a connected Wireless Sensor Network (WSN) to fully cover a Field of Interest (FoI). Full coverage is attained despite the presence of opaque obstacles...

Celý popis

Podrobná bibliografia

Vydané v:	Applied soft computing Ročník 166; s. 112047
Hlavní autori:	de Assis, Pedro A.Q., Rodrigues, Leonardo R., Galvão, Roberto K.H., Afonso, Rubens J.M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2024
Predmet:	Computational geometry Coverage and connectivity problem (CCP) Genetic algorithm (GA) Integer Linear Programming (ILP) Wireless Sensor Network (WSN) Wireless Sensor Network (WSN) Computational geometry Genetic algorithm (GA) Coverage and connectivity problem (CCP) Integer Linear Programming (ILP)
ISSN:	1568-4946
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!