Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm
DOI10.1007/s00500-015-1822-2zbMath1381.68012OpenAlexW1081206723MaRDI QIDQ1701611
Yuyu Zhou, Zhen Zhang, Yang Li, Rensheng Fan, Shu-qiang Huang
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1822-2
particle swarm optimization algorithmwireless mesh networkgateway deploymentgeometric \(K\)-center problemmaximum coupling subgraphrepresentative point
Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Unit disk graph recognition is NP-hard
- The joint gateway placement and spatial reuse problem in wireless mesh networks
- Gateway selection and routing in wireless mesh networks
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- Wireless mesh networks: a survey
- On the Complexity of Some Common Geometric Location Problems
- On the computational complexity of centers locating in a graph
This page was built for publication: Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm
