TY - GEN
T1 - Minimal smart access-point selection for maximal throughput in wireless mesh networks
AU - Funabiki, Nobuo
AU - Takebayashi, Tatsuya
AU - Nakanishi, Toru
PY - 2011/7/26
Y1 - 2011/7/26
N2 - The architecture and design optimization issues of the Wireless Internet-access Mesh NETwork (WIMNET) has been studied to provide a scalable wireless Internet access network. WIMNET may utilize two types of APs as wireless mesh routers to achieve the scalability with sufficient bandwidth while reducing costs. One is an expensive, programmable smart AP (SAP) that can use plural channels for wireless communications and has various functions for the Internet access. Another is an inexpensive, non-programmable conventional AP (CAP) that can use only one channel. To enhance the performance of WIMNET with a small number of costly SAPs, we have previously proposed the SAP selection algorithm of selecting a fixed number of SAPs from a given set of allocated APs. The simulation result observed the existence of a minimal SAP set providing the maximal throughput. In this paper, we propose the extension of this algorithm to finding the minimal SAP set with the maximal throughput. We verify the effectiveness of our proposal through simulations in four instances using the WIMNET simulator.
AB - The architecture and design optimization issues of the Wireless Internet-access Mesh NETwork (WIMNET) has been studied to provide a scalable wireless Internet access network. WIMNET may utilize two types of APs as wireless mesh routers to achieve the scalability with sufficient bandwidth while reducing costs. One is an expensive, programmable smart AP (SAP) that can use plural channels for wireless communications and has various functions for the Internet access. Another is an inexpensive, non-programmable conventional AP (CAP) that can use only one channel. To enhance the performance of WIMNET with a small number of costly SAPs, we have previously proposed the SAP selection algorithm of selecting a fixed number of SAPs from a given set of allocated APs. The simulation result observed the existence of a minimal SAP set providing the maximal throughput. In this paper, we propose the extension of this algorithm to finding the minimal SAP set with the maximal throughput. We verify the effectiveness of our proposal through simulations in four instances using the WIMNET simulator.
KW - Algorithm
KW - Allocation
KW - Communication route
KW - Smart access point
KW - Wireless mesh network
UR - http://www.scopus.com/inward/record.url?scp=79960615090&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960615090&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:79960615090
SN - 9789881821034
T3 - IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011
SP - 594
EP - 599
BT - IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011
T2 - International MultiConference of Engineers and Computer Scientists 2011, IMECS 2011
Y2 - 16 March 2011 through 18 March 2011
ER -