A hybrid algorithm for optimal wireless sensor network deployment with the minimum number of sensor nodes

DOI10.3390/a10030080zbMath1433.90080OpenAlexW2736658921WikidataQ57834867 ScholiaQ57834867MaRDI QIDQ1657033

Yasser El Khamlichi, Francisco Palomo-Lozano, Anouar Abtoy, Inmaculada Medina-Bulo, Abderrahim Tahiri

Publication date: 13 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10030080

zbMATH Keywords

simulated annealinggradient methodcoverageminimum sensor nodessystem connectivityWSN deployment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems

Cites Work

• The minimum scheduling time for convergecast in wireless sensor networks

This page was built for publication: A hybrid algorithm for optimal wireless sensor network deployment with the minimum number of sensor nodes