Optimal channel assignment with aggregation in multi-channel systems: A resilient approach to adjacent-channel interference

Gulnur Selda Uyanik, Mohammad J. Abdel-Rahman, Marwan M Krunz

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel interference (ACI). To prevent such interference between different users in a network, guard-bands (GBs) are needed. Introducing GBs has significant impact on spectrum efficiency. In this paper, we present channel assignment mechanisms that aim at maximizing the spectrum efficiency. More specifically, these mechanisms attempt to minimize the amount of additional GB-related spectrum that is needed to accommodate a new link. Similar to the IEEE 802.11n and the upcoming IEEE 802.11ac standards, our assignment mechanisms support channel bonding, and more generally, channel aggregation. We first consider sequential assignment (i.e., one link at a time), and we formulate the optimal ACI-aware channel assignment that maximizes the spectrum efficiency as a subset-sum problem. An exact exponential-time dynamic programming (DP) algorithm, a polynomial-time greedy heuristic, and an ε-approximation are presented and compared. Second, considering a set of links (batch assignment), we derive the optimal ACI-aware exponential-time assignment that maximizes the network's spectrum efficiency. The optimal batch assignment is compared with the sequential assignment. Results reveal that our proposed algorithms achieve considerable improvement in spectrum efficiency compared to previously proposed schemes.

Original languageEnglish (US)
Pages (from-to)64-76
Number of pages13
JournalAd Hoc Networks
Volume20
DOIs
StatePublished - 2014

Fingerprint

Agglomeration
Dynamic programming
Wireless networks
Polynomials

Keywords

  • Channel assignment
  • Dynamic programming
  • Greedy algorithms
  • Multiple subset-sum problem
  • Spectrum efficiency
  • ε-Approximate algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Optimal channel assignment with aggregation in multi-channel systems : A resilient approach to adjacent-channel interference. / Uyanik, Gulnur Selda; Abdel-Rahman, Mohammad J.; Krunz, Marwan M.

In: Ad Hoc Networks, Vol. 20, 2014, p. 64-76.

Research output: Contribution to journalArticle

@article{e06086f5db044eaca8599e6918e03d79,
title = "Optimal channel assignment with aggregation in multi-channel systems: A resilient approach to adjacent-channel interference",
abstract = "Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel interference (ACI). To prevent such interference between different users in a network, guard-bands (GBs) are needed. Introducing GBs has significant impact on spectrum efficiency. In this paper, we present channel assignment mechanisms that aim at maximizing the spectrum efficiency. More specifically, these mechanisms attempt to minimize the amount of additional GB-related spectrum that is needed to accommodate a new link. Similar to the IEEE 802.11n and the upcoming IEEE 802.11ac standards, our assignment mechanisms support channel bonding, and more generally, channel aggregation. We first consider sequential assignment (i.e., one link at a time), and we formulate the optimal ACI-aware channel assignment that maximizes the spectrum efficiency as a subset-sum problem. An exact exponential-time dynamic programming (DP) algorithm, a polynomial-time greedy heuristic, and an ε-approximation are presented and compared. Second, considering a set of links (batch assignment), we derive the optimal ACI-aware exponential-time assignment that maximizes the network's spectrum efficiency. The optimal batch assignment is compared with the sequential assignment. Results reveal that our proposed algorithms achieve considerable improvement in spectrum efficiency compared to previously proposed schemes.",
keywords = "Channel assignment, Dynamic programming, Greedy algorithms, Multiple subset-sum problem, Spectrum efficiency, ε-Approximate algorithms",
author = "Uyanik, {Gulnur Selda} and Abdel-Rahman, {Mohammad J.} and Krunz, {Marwan M}",
year = "2014",
doi = "10.1016/j.adhoc.2014.03.007",
language = "English (US)",
volume = "20",
pages = "64--76",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",

}

TY - JOUR

T1 - Optimal channel assignment with aggregation in multi-channel systems

T2 - A resilient approach to adjacent-channel interference

AU - Uyanik, Gulnur Selda

AU - Abdel-Rahman, Mohammad J.

AU - Krunz, Marwan M

PY - 2014

Y1 - 2014

N2 - Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel interference (ACI). To prevent such interference between different users in a network, guard-bands (GBs) are needed. Introducing GBs has significant impact on spectrum efficiency. In this paper, we present channel assignment mechanisms that aim at maximizing the spectrum efficiency. More specifically, these mechanisms attempt to minimize the amount of additional GB-related spectrum that is needed to accommodate a new link. Similar to the IEEE 802.11n and the upcoming IEEE 802.11ac standards, our assignment mechanisms support channel bonding, and more generally, channel aggregation. We first consider sequential assignment (i.e., one link at a time), and we formulate the optimal ACI-aware channel assignment that maximizes the spectrum efficiency as a subset-sum problem. An exact exponential-time dynamic programming (DP) algorithm, a polynomial-time greedy heuristic, and an ε-approximation are presented and compared. Second, considering a set of links (batch assignment), we derive the optimal ACI-aware exponential-time assignment that maximizes the network's spectrum efficiency. The optimal batch assignment is compared with the sequential assignment. Results reveal that our proposed algorithms achieve considerable improvement in spectrum efficiency compared to previously proposed schemes.

AB - Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel interference (ACI). To prevent such interference between different users in a network, guard-bands (GBs) are needed. Introducing GBs has significant impact on spectrum efficiency. In this paper, we present channel assignment mechanisms that aim at maximizing the spectrum efficiency. More specifically, these mechanisms attempt to minimize the amount of additional GB-related spectrum that is needed to accommodate a new link. Similar to the IEEE 802.11n and the upcoming IEEE 802.11ac standards, our assignment mechanisms support channel bonding, and more generally, channel aggregation. We first consider sequential assignment (i.e., one link at a time), and we formulate the optimal ACI-aware channel assignment that maximizes the spectrum efficiency as a subset-sum problem. An exact exponential-time dynamic programming (DP) algorithm, a polynomial-time greedy heuristic, and an ε-approximation are presented and compared. Second, considering a set of links (batch assignment), we derive the optimal ACI-aware exponential-time assignment that maximizes the network's spectrum efficiency. The optimal batch assignment is compared with the sequential assignment. Results reveal that our proposed algorithms achieve considerable improvement in spectrum efficiency compared to previously proposed schemes.

KW - Channel assignment

KW - Dynamic programming

KW - Greedy algorithms

KW - Multiple subset-sum problem

KW - Spectrum efficiency

KW - ε-Approximate algorithms

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

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

U2 - 10.1016/j.adhoc.2014.03.007

DO - 10.1016/j.adhoc.2014.03.007

M3 - Article

AN - SCOPUS:84901196956

VL - 20

SP - 64

EP - 76

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

ER -