DocumentCode :
148133
Title :
A maxmin model for solving channel assignment problem in IEEE 802.11 networks
Author :
Elwekeil, Mohamed ; Alghoniemy, Masoud ; Muta, Osamu ; Abdel-Rahman, Adel ; Furukawa, Hiroshi ; Gacanin, Haris
Author_Institution :
Electron. & Commun. Eng. Dept., Egypt-Japan Univ. of Sci. & Technol. (E-JUST), Alexandria, Egypt
fYear :
2014
fDate :
1-5 Sept. 2014
Firstpage :
146
Lastpage :
150
Abstract :
In this paper, an optimization model for solving the channel assignment problem in multi-cell WLANs is proposed. This model is based on maximizing the minimum distance between access points (APs) that work on the same channel. The proposed model is formulated in the form of a mixed integer linear program (MILP). The main advantage of the proposed algorithm is that it ensures non-overlapping channel assignment with no overhead power measurements. The proposed channel assignment algorithm can be implemented within practical time frames for different topology sizes. Simulation results indicate that the proposed algorithm exhibits better performance than that of the pick-first greedy algorithm and the single channel assignment method.
Keywords :
cellular radio; channel allocation; integer programming; linear programming; wireless LAN; AP; IEEE 802.11 networks; MILP; access points; channel assignment problem; maxmin model; minimum distance maximization; mixed integer linear program; multicell WLAN; nonoverlapping channel assignment; optimization model; pick-first greedy algorithm; single-channel assignment method; time frame; topology size; Abstracts; Buildings; Companies; Indexes; Integrated optics; IEEE 802.11; WLAN; channel assignment; integer programming; maxmin problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European
Conference_Location :
Lisbon
Type :
conf
Filename :
6952008
Link To Document :
بازگشت