An active access-point selection approach for dependable wireless mesh networks

Nobuo Funabiki, Junki Shimizu, Masaharu Hata, Shigeru Tomisato, Toru Nakanishi, Kan Watanabe

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

As an inexpensive, flexible, and scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET) that adopts multiple access-points (APs) connected through wireless links. WIMNET can improve the dependability to failures of APs and/or their links by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for connectivity between the hosts and the Internet gateway should be activated in communications. In this paper, we first define the active AP selection problem of selecting the minimum number of active APs, and prove the NP-completeness of its decision version through reduction from the known minimum set cover problem. Then, we propose an active AP selection algorithm of deactivating APs one by one until no more AP can be deactivated. Due to the limited transmission capacity in WIMNET, we further present an algorithm extension for throughput maximization. We verify the effectiveness of our proposal through simulations in three instances, where the number of active APs is reduced by more than 40% and the throughput is improved by more than 10% from the original in any instance.

Original languageEnglish
Pages (from-to)137-154
Number of pages18
JournalJournal of Interconnection Networks
Volume12
Issue number3
DOIs
Publication statusPublished - Sep 2011

Fingerprint

Wireless mesh networks (WMN)
Internet
Throughput
Radio interference
Gateways (computer networks)
Radio
Telecommunication links
Wireless networks
Network protocols
Costs and Cost Analysis
Communication
Costs

Keywords

  • active access-point selection
  • algorithm
  • NP-complete
  • throughput maximization
  • Wireless mesh network

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

An active access-point selection approach for dependable wireless mesh networks. / Funabiki, Nobuo; Shimizu, Junki; Hata, Masaharu; Tomisato, Shigeru; Nakanishi, Toru; Watanabe, Kan.

In: Journal of Interconnection Networks, Vol. 12, No. 3, 09.2011, p. 137-154.

Research output: Contribution to journalArticle

Funabiki, Nobuo ; Shimizu, Junki ; Hata, Masaharu ; Tomisato, Shigeru ; Nakanishi, Toru ; Watanabe, Kan. / An active access-point selection approach for dependable wireless mesh networks. In: Journal of Interconnection Networks. 2011 ; Vol. 12, No. 3. pp. 137-154.
@article{2cd81f191b2343d59e116dc481c130c7,
title = "An active access-point selection approach for dependable wireless mesh networks",
abstract = "As an inexpensive, flexible, and scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET) that adopts multiple access-points (APs) connected through wireless links. WIMNET can improve the dependability to failures of APs and/or their links by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for connectivity between the hosts and the Internet gateway should be activated in communications. In this paper, we first define the active AP selection problem of selecting the minimum number of active APs, and prove the NP-completeness of its decision version through reduction from the known minimum set cover problem. Then, we propose an active AP selection algorithm of deactivating APs one by one until no more AP can be deactivated. Due to the limited transmission capacity in WIMNET, we further present an algorithm extension for throughput maximization. We verify the effectiveness of our proposal through simulations in three instances, where the number of active APs is reduced by more than 40{\%} and the throughput is improved by more than 10{\%} from the original in any instance.",
keywords = "active access-point selection, algorithm, NP-complete, throughput maximization, Wireless mesh network",
author = "Nobuo Funabiki and Junki Shimizu and Masaharu Hata and Shigeru Tomisato and Toru Nakanishi and Kan Watanabe",
year = "2011",
month = "9",
doi = "10.1142/S0219265911002915",
language = "English",
volume = "12",
pages = "137--154",
journal = "Advanced healthcare materials",
issn = "2192-2640",
publisher = "John Wiley and Sons Ltd",
number = "3",

}

TY - JOUR

T1 - An active access-point selection approach for dependable wireless mesh networks

AU - Funabiki, Nobuo

AU - Shimizu, Junki

AU - Hata, Masaharu

AU - Tomisato, Shigeru

AU - Nakanishi, Toru

AU - Watanabe, Kan

PY - 2011/9

Y1 - 2011/9

N2 - As an inexpensive, flexible, and scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET) that adopts multiple access-points (APs) connected through wireless links. WIMNET can improve the dependability to failures of APs and/or their links by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for connectivity between the hosts and the Internet gateway should be activated in communications. In this paper, we first define the active AP selection problem of selecting the minimum number of active APs, and prove the NP-completeness of its decision version through reduction from the known minimum set cover problem. Then, we propose an active AP selection algorithm of deactivating APs one by one until no more AP can be deactivated. Due to the limited transmission capacity in WIMNET, we further present an algorithm extension for throughput maximization. We verify the effectiveness of our proposal through simulations in three instances, where the number of active APs is reduced by more than 40% and the throughput is improved by more than 10% from the original in any instance.

AB - As an inexpensive, flexible, and scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET) that adopts multiple access-points (APs) connected through wireless links. WIMNET can improve the dependability to failures of APs and/or their links by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for connectivity between the hosts and the Internet gateway should be activated in communications. In this paper, we first define the active AP selection problem of selecting the minimum number of active APs, and prove the NP-completeness of its decision version through reduction from the known minimum set cover problem. Then, we propose an active AP selection algorithm of deactivating APs one by one until no more AP can be deactivated. Due to the limited transmission capacity in WIMNET, we further present an algorithm extension for throughput maximization. We verify the effectiveness of our proposal through simulations in three instances, where the number of active APs is reduced by more than 40% and the throughput is improved by more than 10% from the original in any instance.

KW - active access-point selection

KW - algorithm

KW - NP-complete

KW - throughput maximization

KW - Wireless mesh network

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

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

U2 - 10.1142/S0219265911002915

DO - 10.1142/S0219265911002915

M3 - Article

AN - SCOPUS:84861369433

VL - 12

SP - 137

EP - 154

JO - Advanced healthcare materials

JF - Advanced healthcare materials

SN - 2192-2640

IS - 3

ER -