Research Article
An Efficient Deployment Model for Maximizing Coverage of Heterogeneous Wireless Sensor Network Based on Harmony Search Algorithm
| Parameter | Value |
| Area of interest (AoI) | AoI 1 | | AoI 2 | | Size of each cell | 10 m | Maximum iterations number (MItr) | 60000 iterations | Experiments number | AoI 1 | 12 runs of each scenario | AoI 2 | 10 runs of each scenario | Coverage threshold () | 0.9 | Parameters describing the sensing nodes. | | 1 | | 0 | | 1 | | 0.5 | Uncertainty range () | 5 and 2.5 | Harmony memory size (HMS) | AoI 1 | 30 vectors | AoI 2 | 50 vectors | Harmony memory consideration rate (HMCR) | 90% | Pitch adjustment rate (PAR) | 0.3 | Bandwidth distance (BWrange) | 0.2 | Runs | Over 30 runs |
|
|