Gateway Node Selection for Improving Traffic Delivery Ratio in Wireless Mesh Networks

DOI

10.2991/iccnce.2013.24How to use a DOI?

Keywords

WMN, mathematical programming, greedy algorithm, k-median algorithm

Abstract

In this paper, we establish the gateway selection problem in the single radio single channel wireless mesh network: given a wireless mesh network and a desired delivery ratio, the goal is to select minimal number of non-gateway nodes and upgrade them to gateway nodes in order to improve the delivery ratio of the network to a given threshold. This problem is different with the previous gateway placement or deployment problem for we focus on the number of gateway nodes in an existing network. We formulate this problem as a mathematical programming and show that it’s NP-hard. Then we propose three algorithms to solve this problem and give the simulation results to evaluate the performance of these three algorithms.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jie Hu
PY  - 2013/07
DA  - 2013/07
TI  - Gateway Node Selection for Improving Traffic Delivery Ratio in Wireless Mesh Networks
BT  - Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)
PB  - Atlantis Press
SP  - 98
EP  - 102
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccnce.2013.24
DO  - 10.2991/iccnce.2013.24
ID  - Hu2013/07
ER  -