A maxmin model for solving channel assignment problem in IEEE 802.11 networks

Mohamed Elwekeil; Masoud Alghoniemy; Osamu Muta; Adel Abdel-Rahman; Hiroshi Furukawa; Haris Gacanin

A maxmin model for solving channel assignment problem in IEEE 802.11 networks

Mohamed Elwekeil, Masoud Alghoniemy, Osamu Muta, Adel Abdel-Rahman, Hiroshi Furukawa, Haris Gacanin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014
Publisher	European Signal Processing Conference, EUSIPCO
Pages	146-150
Number of pages	5
ISBN (Electronic)	9780992862619
Publication status	Published - Nov 10 2014
Event	22nd European Signal Processing Conference, EUSIPCO 2014 - Lisbon, Portugal Duration: Sep 1 2014 → Sep 5 2014

Publication series

Name	European Signal Processing Conference
ISSN (Print)	2219-5491

Other

Other	22nd European Signal Processing Conference, EUSIPCO 2014
Country/Territory	Portugal
City	Lisbon
Period	9/1/14 → 9/5/14

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering

Cite this

Elwekeil, M., Alghoniemy, M., Muta, O., Abdel-Rahman, A., Furukawa, H., & Gacanin, H. (2014). A maxmin model for solving channel assignment problem in IEEE 802.11 networks. In 2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014 (pp. 146-150). [6952008] (European Signal Processing Conference). European Signal Processing Conference, EUSIPCO.

A maxmin model for solving channel assignment problem in IEEE 802.11 networks. / Elwekeil, Mohamed; Alghoniemy, Masoud; Muta, Osamu et al.

2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014. European Signal Processing Conference, EUSIPCO, 2014. p. 146-150 6952008 (European Signal Processing Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Elwekeil, M, Alghoniemy, M, Muta, O, Abdel-Rahman, A, Furukawa, H & Gacanin, H 2014, A maxmin model for solving channel assignment problem in IEEE 802.11 networks. in 2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014., 6952008, European Signal Processing Conference, European Signal Processing Conference, EUSIPCO, pp. 146-150, 22nd European Signal Processing Conference, EUSIPCO 2014, Lisbon, Portugal, 9/1/14.

@inproceedings{2128107e20b2468abc57c11343d295bf,

title = "A maxmin model for solving channel assignment problem in IEEE 802.11 networks",

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.",

author = "Mohamed Elwekeil and Masoud Alghoniemy and Osamu Muta and Adel Abdel-Rahman and Hiroshi Furukawa and Haris Gacanin",

note = "Publisher Copyright: {\textcopyright} 2014 EURASIP.; 22nd European Signal Processing Conference, EUSIPCO 2014 ; Conference date: 01-09-2014 Through 05-09-2014",

year = "2014",

month = nov,

day = "10",

language = "English",

series = "European Signal Processing Conference",

publisher = "European Signal Processing Conference, EUSIPCO",

pages = "146--150",

booktitle = "2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014",

}

TY - GEN

T1 - A maxmin model for solving channel assignment problem in IEEE 802.11 networks

AU - Elwekeil, Mohamed

AU - Alghoniemy, Masoud

AU - Muta, Osamu

AU - Abdel-Rahman, Adel

AU - Furukawa, Hiroshi

AU - Gacanin, Haris

PY - 2014/11/10

Y1 - 2014/11/10

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:84911877747

T3 - European Signal Processing Conference

SP - 146

EP - 150

BT - 2014 Proceedings of the 22nd European Signal Processing Conference, EUSIPCO 2014

PB - European Signal Processing Conference, EUSIPCO

T2 - 22nd European Signal Processing Conference, EUSIPCO 2014

Y2 - 1 September 2014 through 5 September 2014

ER -

A maxmin model for solving channel assignment problem in IEEE 802.11 networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this