Extensions of the Access Point Allocation Algorithm for Wireless Mesh Networks

Previously, we have proposed an access point (AP) allocation algorithm in indoor environments for the Wireless Internet-access Mesh NETwork (WIMNET) using one gateway (GW) to the Internet. WIMNET consists of multiple APs that are connected wirelessly mainly by the Wireless Distribution System (WDS), to expand the coverage area inexpensively and flexibly. In this paper, we present two extensions of this algorithm to enhance the applicability to the large-scale WIMNET. One is the multiple GW extension of the algorithm to increase the communication bandwidth with multiple GWs, where all the rooms in the network field are first partitioned into a set of disjoint GW clusters and then, our previous allocation algorithm is applied to each GW cluster sequentially. The APs in a GW cluster share the same GW. The other is the dependability extension to assure the network function by maintaining the connectivity and the host coverage, even if one link/AP fault occurs, where redundant APs are added to the AP allocation by our previous algorithm. The effectiveness of our proposal in terms of the number of APs and the throughput is verified through simulations using the WIMNET simulator.

[1]  Musa A. Mammadov,et al.  Coverage in WLAN with Minimum Number of Access Points , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[2]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[3]  T. Ibaraki,et al.  A Variable Depth Search Algorithm for the Generalized Assignment Problem , 1999 .

[4]  Srinivasan Keshav,et al.  Detection and repair of faulty access points , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[5]  Raghupathy Sivakumar,et al.  On multi-gateway association in wireless mesh networks , 2006 .

[6]  Akira Watanabe,et al.  Proposal and evaluation of multiple gateways distribution method for wireless mesh network , 2009, ICUIMC '09.

[7]  H. T. Kung,et al.  Load-balancing routing for wireless access networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Nobuo Funabiki,et al.  A minimum-delay routing tree algorithm for access-point communications in Wireless Mesh Networks , 2008, 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies.

[9]  Surajit Chaudhuri,et al.  Capacity performance of dynamic provisioning in optical networks , 2001 .

[10]  Upkar Varshney,et al.  Multilevel fault tolerance in infrastructure-oriented wireless networks: framework and performance evaluation , 2006, Int. J. Netw. Manag..

[11]  Go Hasegawa,et al.  Routing Method for Gateway Load Balancing in Wireless Mesh Networks , 2009, 2009 Eighth International Conference on Networks.

[12]  Nobuo Funabiki,et al.  An Access Point Allocation Algorithm for Indoor Environments in Wireless Mesh Networks , 2009, IEICE Trans. Commun..

[13]  Yu-Chee Tseng,et al.  A Two-Tier Heterogeneous Mobile Ad Hoc Network Architecture and Its Load-Balance Routing Problem , 2004, Mob. Networks Appl..

[14]  Jangeun Jun,et al.  The nominal capacity of wireless mesh networks , 2003, IEEE Wirel. Commun..

[15]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..