Lagrangian relaxation approach for low complexity channel assignment in multi-cell wlans

Mohamed Elwekeil, Masoud Alghoniemy, Hiroshi Furukawa, Osamu Muta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The Channel assignment problem for multi-cell WLANs is important due to the lack of free available channels. Usually, this problem can be formulated as a mixed integer linear program (MILP) which requires high combinatorial complexity. In this paper, a lagrangian relaxation technique is used in order to transform the MILP into a low complexity linear program. Simulation results show that the proposed channel assignment algorithm provides significant reduction in complexity compared to the MILP counterpart at the expense of insignificant increase in total interference-sum at Access Points (APs). It is also suggested that the benefits of reduced complexity outweigh the increased interference.

Original languageEnglish
Title of host publication2013 International Conference on Computing, Networking and Communications, ICNC 2013
Pages138-142
Number of pages5
DOIs
Publication statusPublished - 2013
Event2013 International Conference on Computing, Networking and Communications, ICNC 2013 - San Diego, CA, United States
Duration: Jan 28 2013Jan 31 2013

Publication series

Name2013 International Conference on Computing, Networking and Communications, ICNC 2013

Other

Other2013 International Conference on Computing, Networking and Communications, ICNC 2013
CountryUnited States
CitySan Diego, CA
Period1/28/131/31/13

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Lagrangian relaxation approach for low complexity channel assignment in multi-cell wlans'. Together they form a unique fingerprint.

Cite this