2008 IEEE International Conference on Communications 2008
DOI: 10.1109/icc.2008.475
|View full text |Cite
|
Sign up to set email alerts
|

An Asynchronous Distributed Dynamic Channel Assignment Scheme for Dense WLANs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
18
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 5 publications
3
18
0
Order By: Relevance
“…In other words, all the APs are now allowed to perform the algorithm and channel switching asynchronously. Results in [2] show that our proposed scheme not only converges significantly faster and requires less channel switches, but also achieves better throughput in dynamic load environments.…”
Section: Introductionmentioning
confidence: 90%
See 2 more Smart Citations
“…In other words, all the APs are now allowed to perform the algorithm and channel switching asynchronously. Results in [2] show that our proposed scheme not only converges significantly faster and requires less channel switches, but also achieves better throughput in dynamic load environments.…”
Section: Introductionmentioning
confidence: 90%
“…In an earlier work, we proposed an asynchronous, distributed and dynamic channel assignment scheme in [2], which improves on the work by Lou and Shankaranarayanan in [3]. Our proposed scheme has the following key features: (1) simple to implement, (2) does not require any knowledge of the throughput function (i.e.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…Therefore, if f T (n)/n is a monotonically decreasing function, the maximization in (2) can now be rewritten as [10] max ( ) arg max ( ) ( ) = arg max ( ( ) ( )) ( ) ( ) arg min ( )…”
Section: Minimum Neighbour With Extended Kalman Filter Estimator mentioning
confidence: 99%
“…Fitness function (15) is based on the objective function of the problem defined by equations (4) to (7). Another way is to define the fitness function based on the objective function of the problem defined by equations (8) to (11).…”
Section: B Genetic Algorithm Approachmentioning
confidence: 99%