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

Mohamed Elwekeil, Masoud Alghoniemy, Hiroshi Furukawa, Osamu Muta

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

2 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトル2013 International Conference on Computing, Networking and Communications, ICNC 2013
ページ138-142
ページ数5
DOI
出版ステータス出版済み - 2013
イベント2013 International Conference on Computing, Networking and Communications, ICNC 2013 - San Diego, CA, 米国
継続期間: 1月 28 20131月 31 2013

出版物シリーズ

名前2013 International Conference on Computing, Networking and Communications, ICNC 2013

その他

その他2013 International Conference on Computing, Networking and Communications, ICNC 2013
国/地域米国
CitySan Diego, CA
Period1/28/131/31/13

!!!All Science Journal Classification (ASJC) codes

  • コンピュータ ネットワークおよび通信
  • 通信

フィンガープリント

「Lagrangian relaxation approach for low complexity channel assignment in multi-cell wlans」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル