Skip to content

Meta-heuristic approaches for solving the mesh routers placement problem with service priority in wireless mesh networks

Sep 2026 · Computing · Vol 108 · 0 citations · 36 references

TL;DR

Three approaches were suggested to solve the Mesh Routers (MRs) placement problem with service priority, where the main objective is to determine the optimal positions of the MRs in order to maximize the weighted coverage while satisfying the connectivity requirement, depending on a given set of Mesh Client (MCs) weights and locations.

View source

Similar papers

Open access Oct 2026

Mesh router node placement using somersault based giant armadillo optimization

Wireless mesh networks (WMNs) have rapidly advanced in the last decade because of their ease of experimentation at minimum cost, simple network maintenance, and consistent provision coverage. However, the placement of router nodes remains a critical research challenge for network operators, as it directly impacts the o...

Kaata Ranjith Kumar, B. K., K. Srinivas · 0 citations
Open access Aug 2026

LLM-Assisted Initial Population Generation for Multi-Objective Joint Service Placement and Traffic Routing in 6G Networks

In forthcoming 6G networks beyond 5G, services with increasingly stringent performance requirements are expected to emerge, requiring dynamic and flexible service placement and traffic routing. Furthermore, the integration of non-terrestrial networks for global coverage introduces continuously changing network topologi...

Doyoung Lee · 0 citations
Open access Sep 2026

Optimal-Repair Large Neighborhood Search for the Planning of Extensive Fault-Tolerant Distribution Networks

Background: Planning power distribution networks is crucial in contemporary infrastructure development. Current distribution paradigms require not only cost minimization but also reliability and fault tolerance. However, designing meshed network topologies is a computationally demanding combinatorial optimization probl...

Renato Bruni, A. Geri, M. Maccioni et al. · 0 citations
Open access Aug 2026

Cooperative co-evolution with adaptive decomposition schemes for large scale capacitated electric vehicle routing problem

A cooperative co-evolution algorithm, containing novel problem decomposition and charging scheduling strategies, that successfully updated the majority of best-known solutions to the large instances of the capacitated electric vehicle routing problem.

Yu-Zhou Zhang, Yi Mei, Wen-Jie Xiao et al. · 0 citations
Conference Sep 2026

Hybrid PSO-ACO Algorithm for Routing Optimization in Ultra-Dense 5G MANET Networks

This paper presents a hybrid metaheuristic routing algorithm integrating Particle Swarm Optimization (PSO) with Ant Colony Optimization (ACO) for mobile ad-hoc networks (MANETs) in the context of 5G communications. The proposed algorithm employs a two-phase architecture in which PSO initializes candidate paths using a...

Jozef Badár, Ján Papaj · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.