A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.

Optimal router node placement (RNP) is an effective method for improving the performance of wireless mesh networks (WMN). However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heurist...

Full description

Saved in:
Bibliographic Details
Main Authors: Le Huu Binh, Thuy-Van T Duong, Vuong M Ngo
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2025-01-01
Series:PLoS ONE
Online Access:https://doi.org/10.1371/journal.pone.0318247
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832540222499323904
author Le Huu Binh
Thuy-Van T Duong
Vuong M Ngo
author_facet Le Huu Binh
Thuy-Van T Duong
Vuong M Ngo
author_sort Le Huu Binh
collection DOAJ
description Optimal router node placement (RNP) is an effective method for improving the performance of wireless mesh networks (WMN). However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. In this study, we propose a new and effective method for solving the RNP problem. The idea behind this method is to solve the RNP problem in two stages using an optimal algorithm with fewer variables than the original RNP problem. In stage 1, we build an RNP sub problem using 15% to 20% of the number of routers, with the objective function of minimizing coverage overlap between routers to form a core network. Stage 2 is built into another RNP sub problem with the remaining number of routers, and the objective function is to maximize the network connectivity. Each sub problem was solved using an approximate optimal algorithm. The experimental results demonstrate that, in terms of client coverage and network connectivity, our proposed method outperforms widely used RNP problem-solving methods.
format Article
id doaj-art-f4a5d36a0b604aeda927bc74ccd8940b
institution Kabale University
issn 1932-6203
language English
publishDate 2025-01-01
publisher Public Library of Science (PLoS)
record_format Article
series PLoS ONE
spelling doaj-art-f4a5d36a0b604aeda927bc74ccd8940b2025-02-05T05:31:58ZengPublic Library of Science (PLoS)PLoS ONE1932-62032025-01-01201e031824710.1371/journal.pone.0318247A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.Le Huu BinhThuy-Van T DuongVuong M NgoOptimal router node placement (RNP) is an effective method for improving the performance of wireless mesh networks (WMN). However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. In this study, we propose a new and effective method for solving the RNP problem. The idea behind this method is to solve the RNP problem in two stages using an optimal algorithm with fewer variables than the original RNP problem. In stage 1, we build an RNP sub problem using 15% to 20% of the number of routers, with the objective function of minimizing coverage overlap between routers to form a core network. Stage 2 is built into another RNP sub problem with the remaining number of routers, and the objective function is to maximize the network connectivity. Each sub problem was solved using an approximate optimal algorithm. The experimental results demonstrate that, in terms of client coverage and network connectivity, our proposed method outperforms widely used RNP problem-solving methods.https://doi.org/10.1371/journal.pone.0318247
spellingShingle Le Huu Binh
Thuy-Van T Duong
Vuong M Ngo
A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
PLoS ONE
title A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
title_full A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
title_fullStr A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
title_full_unstemmed A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
title_short A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.
title_sort novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms
url https://doi.org/10.1371/journal.pone.0318247
work_keys_str_mv AT lehuubinh anovelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms
AT thuyvantduong anovelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms
AT vuongmngo anovelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms
AT lehuubinh novelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms
AT thuyvantduong novelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms
AT vuongmngo novelapproachfortherouternodesplacementinwirelessmeshnetworksusingphasingwithapproximationoptimizationalgorithms