An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks

Md Ezharul Islam, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Recently, many organizations such as universities and companies are deploying multiple wireless local area networks (WLANs) even in the same building. In these WLANs, wireless access-points (APs) are usually managed independently by different groups such as laboratories or departments. In this overlapped WLAN environment, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost. To solve this problem, previously, we have proposed the AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. However, the minimization of active APs may excessively degrade the performance of WLANs, where more active APs can usually increase it. In this paper, we propose an extension of the AP aggregation algorithm to ensure the minimum average throughput for each host in the field. This average throughput is estimated using the cost function defined in the algorithm, and the number of active APs is increased when it does not reach the given threshold. We verify the effectiveness of this extension through extensive simulations in two network instances using the WIMNET simulator.

Original languageEnglish
Title of host publicationProceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013
Pages141-147
Number of pages7
DOIs
Publication statusPublished - 2013
Event2013 1st International Symposium on Computing and Networking, CANDAR 2013 - Matsuyama, Ehime, Japan
Duration: Dec 4 2013Dec 6 2013

Other

Other2013 1st International Symposium on Computing and Networking, CANDAR 2013
CountryJapan
CityMatsuyama, Ehime
Period12/4/1312/6/13

Fingerprint

Wireless local area networks (WLAN)
Agglomeration
Throughput
Cost functions
Simulators
Communication
Costs
Industry

Keywords

  • access-point aggregation
  • heuristic algorithm
  • IEEE 802.11n
  • minimum host throughput
  • virtual access-point
  • Wireless local area network

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Islam, M. E., Funabiki, N., Nakanishi, T., & Watanabe, K. (2013). An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks. In Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013 (pp. 141-147). [6726889] https://doi.org/10.1109/CANDAR.2013.27

An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks. / Islam, Md Ezharul; Funabiki, Nobuo; Nakanishi, Toru; Watanabe, Kan.

Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013. 2013. p. 141-147 6726889.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Islam, ME, Funabiki, N, Nakanishi, T & Watanabe, K 2013, An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks. in Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013., 6726889, pp. 141-147, 2013 1st International Symposium on Computing and Networking, CANDAR 2013, Matsuyama, Ehime, Japan, 12/4/13. https://doi.org/10.1109/CANDAR.2013.27
Islam ME, Funabiki N, Nakanishi T, Watanabe K. An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks. In Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013. 2013. p. 141-147. 6726889 https://doi.org/10.1109/CANDAR.2013.27
Islam, Md Ezharul ; Funabiki, Nobuo ; Nakanishi, Toru ; Watanabe, Kan. / An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks. Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013. 2013. pp. 141-147
@inproceedings{f61e438b3fc845c892b9c0d7bd145755,
title = "An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks",
abstract = "Recently, many organizations such as universities and companies are deploying multiple wireless local area networks (WLANs) even in the same building. In these WLANs, wireless access-points (APs) are usually managed independently by different groups such as laboratories or departments. In this overlapped WLAN environment, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost. To solve this problem, previously, we have proposed the AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. However, the minimization of active APs may excessively degrade the performance of WLANs, where more active APs can usually increase it. In this paper, we propose an extension of the AP aggregation algorithm to ensure the minimum average throughput for each host in the field. This average throughput is estimated using the cost function defined in the algorithm, and the number of active APs is increased when it does not reach the given threshold. We verify the effectiveness of this extension through extensive simulations in two network instances using the WIMNET simulator.",
keywords = "access-point aggregation, heuristic algorithm, IEEE 802.11n, minimum host throughput, virtual access-point, Wireless local area network",
author = "Islam, {Md Ezharul} and Nobuo Funabiki and Toru Nakanishi and Kan Watanabe",
year = "2013",
doi = "10.1109/CANDAR.2013.27",
language = "English",
isbn = "9781479927951",
pages = "141--147",
booktitle = "Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013",

}

TY - GEN

T1 - An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks

AU - Islam, Md Ezharul

AU - Funabiki, Nobuo

AU - Nakanishi, Toru

AU - Watanabe, Kan

PY - 2013

Y1 - 2013

N2 - Recently, many organizations such as universities and companies are deploying multiple wireless local area networks (WLANs) even in the same building. In these WLANs, wireless access-points (APs) are usually managed independently by different groups such as laboratories or departments. In this overlapped WLAN environment, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost. To solve this problem, previously, we have proposed the AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. However, the minimization of active APs may excessively degrade the performance of WLANs, where more active APs can usually increase it. In this paper, we propose an extension of the AP aggregation algorithm to ensure the minimum average throughput for each host in the field. This average throughput is estimated using the cost function defined in the algorithm, and the number of active APs is increased when it does not reach the given threshold. We verify the effectiveness of this extension through extensive simulations in two network instances using the WIMNET simulator.

AB - Recently, many organizations such as universities and companies are deploying multiple wireless local area networks (WLANs) even in the same building. In these WLANs, wireless access-points (APs) are usually managed independently by different groups such as laboratories or departments. In this overlapped WLAN environment, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost. To solve this problem, previously, we have proposed the AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. However, the minimization of active APs may excessively degrade the performance of WLANs, where more active APs can usually increase it. In this paper, we propose an extension of the AP aggregation algorithm to ensure the minimum average throughput for each host in the field. This average throughput is estimated using the cost function defined in the algorithm, and the number of active APs is increased when it does not reach the given threshold. We verify the effectiveness of this extension through extensive simulations in two network instances using the WIMNET simulator.

KW - access-point aggregation

KW - heuristic algorithm

KW - IEEE 802.11n

KW - minimum host throughput

KW - virtual access-point

KW - Wireless local area network

UR - http://www.scopus.com/inward/record.url?scp=84894149318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894149318&partnerID=8YFLogxK

U2 - 10.1109/CANDAR.2013.27

DO - 10.1109/CANDAR.2013.27

M3 - Conference contribution

AN - SCOPUS:84894149318

SN - 9781479927951

SP - 141

EP - 147

BT - Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013

ER -