 |
Handler et al [9]. first simulated the gateway deployment problem as the K-centre location problem, and then proposed to use the set coverage algorithm to obtain K covering circles, which can cover network nodes
In [10], The authors propose a solution to the network maximum coverage and network connectivity problem using binary integer programming for gateway deployment selection at optional locations given in advance.
In [11], The authors propose a genetic algorithm to solve the problem of deploying a minimum number of APs for service area coverage. The network deployment designed and implemented by the authors in the paper uses the minimum number of AP nodes within the required network performance parameters, and when faced with subsequent network expansion and performance optimisation aspects, the deployment conclusions designed using this algorithm need to be recalculated and considered, and the deployed network lacks scalability and has average practical performance Xhafa et al [12]. used genetic algorithm to solve the node deployment optimization problem. The algorithm was optimized to maximize network connectivity and use coverage, and the algorithm greatly improved the solving efficiency of node location deployment optimization of WMNs router.
|
IEEE/ICACT20220099 Slide.06
[Big Slide]
[YouTube]