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
N1 - Funding Information:
This work is partially supported by KAKENHI (22500059).
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 - NP-complete
KW - Wireless mesh network
KW - active access-point selection
KW - algorithm
KW - throughput maximization
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
SN - 0219-2659
VL - 12
SP - 137
EP - 154
JO - Journal of Interconnection Networks
JF - Journal of Interconnection Networks
IS - 3
ER -