Channel assignment schemes for infrastructure-based 802.11 WLANs: A survey

Chieochan, Surachai; Hossain, Ekram; Diamond, Jeffrey E.

doi:10.1109/surv.2010.020110.00047

Cited by 165 publications

(104 citation statements)

References 22 publications

Supporting

Mentioning

102

Contrasting

Unclassified

Order By: Relevance

“…where β k is a Lagrangian multiplier chosen to saturate the power constraints (2). Note that this result shows the connections between the notion of NE and the well-known water-filling PA policy [13].…”

Section: Determination Of the Nementioning

confidence: 64%

“…Assume also that ∀k ∈ K, p k,max = p max and ∀s ∈ S, σ 2 s = σ 2 and B s = . The number of players is K = 3 and the number of actions is S = 2, under the condition φ(p (2) ) > φ(p (6) ) > φ(p (1) ) > φ(p (5) ) > φ(p (4) ) > φ(p (7) ) > φ(p (8) ) > φ(p (3) ). Total number of vertices: …”

Section: The 2-transmitter 2-channel Casementioning

confidence: 99%

“…First step: Assume that the action profile p = p 1 , p 2 , with p 1 = (p 11 , p 12 ) and p 2 = (p 21 , p 22 ) is an NE of the game G (a) , and assume that for all (k, s) ∈ K × S, p k,s > 0, with strict inequality. Then, from the best response correspondence, it holds that ∀(k, s) ∈ K × S,…”

mentioning

confidence: 99%

See 2 more Smart Citations

Equilibria of channel selection games in parallel multiple access channels

Perlaza

Lasaulce

Debbah

2013

J Wireless Com Network

View full text Add to dashboard Cite

In this article, the parallel multiple access channel is studied under the assumption that transmitters maximize their individual spectral efficiency by selfishly tuning their power allocation policy. Two particular scenarios are studied: (a) transmitters are allowed to use all the available channels; and (b) transmitters are constrained to use a single channel. Both scenarios are modeled by one-shot games and the corresponding sets of Nash equilibria (NE) are fully characterized under the assumption that the receiver treads the multiple access interference as noise. In both cases, the set of NE is non-empty. In the case in which transmitters use a single channel, an upper bound of the cardinality of the NE set is provided in terms of the number of transmitters and number of channels. In particular, it is shown that in fully loaded networks, the sum spectral efficiency at the NE in scenario (a) is at most equal to the sum spectral efficiency at the NE in scenario (b). A formal proof of this observation, known in general as a Braess paradox, is provided in the case of two transmitters and two channels. In general scenarios, we conjecture that the same effect holds as long as the network is kept fully loaded, as shown by numerical examples. Moreover, the price of anarchy and the price of stability in both games are also studied. Interestingly, under certain conditions on the channel gains, Pareto optimality can be achieved at some NE if and only if the number of channels equals or exceeds the number of transmitters. Finally, simulations are presented to verify the theoretical results.

show abstract

Section: Determination Of the Nementioning

confidence: 64%

Section: The 2-transmitter 2-channel Casementioning

confidence: 99%

See 1 more Smart Citation

Equilibria of channel selection games in parallel multiple access channels

Perlaza

Lasaulce

Debbah

2013

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…However, the comparison of channel allocation algorithms is based on traffic distribution, implementation cost, network-awareness, efficiency, scalability, robustness, and acquisition delay. S. Chieochan et al [102] conducted survey on channel assignment schemes for infrastructure-based 802.11 WLANs. The authors classified the channel assignment schemes into two categories: a) channel assignment schemes in centrally managed environment and b) channel assignment schemes in uncoordinated environment.…”

Section: Comparison Of Surveys On Channel Assignment Problem In mentioning

confidence: 99%

Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges

Ahmed

Gani

Abolfazli

et al. 2016

IEEE Commun. Surv. Tutorials

154

View full text Add to dashboard Cite

Abstract-The cognitive radio is an emerging technology that enables dynamic spectrum access in wireless networks. The cognitive radio is capable of opportunistically using the available portions of a licensed spectrum to improve the application performance for unlicensed users. The opportunistic use of the available channels in the wireless environment requires dynamic channel assignment to efficiently utilize the available resources while minimizing the interference in the network. A challenging aspect of such algorithms is the incorporation of the channels' diverse characteristics, highly dynamic network conditions with respect to primary users' activity, and different fragmented sizes of the available channels. This paper presents a comprehensive survey on the state-of-the-art channel assignment algorithms in cognitive radio networks. We also classify the algorithms by presenting a thematic taxonomy of the current channel assignment algorithms in cognitive radio networks. Moreover, the critical aspects of the current channel assignment algorithms in cognitive radio networks are analyzed to determine the strengths and weaknesses of such algorithms. The similarities and differences of the algorithms based on the important parameters, such as routing dependencies, channel models, assignment methods, execution model, and optimization objectives, are also investigated. We also discuss open research issues and challenges of channel assignment in the cognitive radio networks.

show abstract

“…Since we are interested not only in small value of Ftot but also in even distribution of Fk,n values, it would be beneficial to check how efficiently a given algorithm assigns channels from that point of view. To this end, for each APk, a critical value Fc_k is defined as: where 0.3 is the CRC value for the channel distance equal to 3 (see Table I (2) and then, they are summed up to obtain the Ftot value. The major advantage of such approach is that optimal assignment of channels will always be found.…”

Section: B Algorithm Description 1) Modeling a Set Of Aps As A Graphmentioning

confidence: 99%

A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks

Dolińska¹,

Jakubowski²,

Masiukiewicz³

et al. 2016

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

Abstract-Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim's algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.

show abstract

Channel assignment schemes for infrastructure-based 802.11 WLANs: A survey

Cited by 165 publications

References 22 publications

Equilibria of channel selection games in parallel multiple access channels

Equilibria of channel selection games in parallel multiple access channels

Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges

A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks

Contact Info

Product

Resources

About