2005
DOI: 10.1145/1094549.1094554
|View full text |Cite
|
Sign up to set email alerts
|

Weighted coloring based channel assignment for WLANs

Abstract: Abstract-We propose techniques to improve the usage of wireless spectrum in the context of wireless local area networks (WLANs) using new channel assignment methods among interfering Access Points (APs). We identify new ways of channel re-use that are based on realistic interference scenarios in WLAN environments. We formulate a weighted variant of the graph coloring problem that takes into account realistic channel interference observed in wireless environments, as well as the impact of such interference on w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
227
0
3

Year Published

2005
2005
2015
2015

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 293 publications
(235 citation statements)
references
References 15 publications
1
227
0
3
Order By: Relevance
“…This objective leads to a more even spreading of interference across all available channels. A similar objective has been considered in the past in other contexts [30,26].…”
Section: It Is This Need To Balance Between Interference Reductionmentioning
confidence: 88%
See 2 more Smart Citations
“…This objective leads to a more even spreading of interference across all available channels. A similar objective has been considered in the past in other contexts [30,26].…”
Section: It Is This Need To Balance Between Interference Reductionmentioning
confidence: 88%
“…A similar problem also arises in the context of wireless LANs for allocating multiple channels among access points (APs) [26]. In both cellular networks and wireless LANs, maintaining connectivity between cells is not a concern during channel allocation as base stations and APs are interconnected by a wired backbone.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Into the class of standard LS algorithms we may also include a dynamic MI-FAP application to WLAN design (Mishra et al 2005). The move is the classical 1-exchange which however is applied in a distributed environment to each antenna independently.…”
Section: Local Search (Ls)mentioning
confidence: 99%
“…In LCCS, upon its initialization, the AP scans the channels in its vicinity and selects the least congested channel. Mishra et al in [27] formulated the channel assignment as a weighted vertex coloring problem. The authors of [28] addressed the problem of distributed channel assignment in uncoordinated wireless environments, and proposed a dynamic channel hopping protocol that distributively assig the channel of an AP.…”
Section: Related Workmentioning
confidence: 99%