Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm

DOI10.1016/J.JCSS.2014.12.018zbMath1328.68022OpenAlexW2073022350MaRDI QIDQ494027

Makoto Takizawa, Christian Sánchez, Admir Barolli, Fatos Xhafa

Publication date: 31 August 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.12.018

zbMATH Keywords

optimizationtabu searchwireless mesh networkssize of giant componentnode placementmesh router nodeuser coverage, QoS

Mathematics Subject Classification ID

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) Internet topics (68M11)

Related Items (1)

Deployment optimization of multi-hop wireless networks based on substitution graph

Cites Work

• Unnamed Item
• Optimization models and methods for planning wireless mesh networks
• \(k\)-center problems with minimum coverage
• Future paths for integer programming and links to artificial intelligence
• Wireless mesh networks: a survey

This page was built for publication: Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm