- Tytuł:
- A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks
- Autorzy:
-
Dolińska, I.
Jakubowski, M.
Masiukiewicz, A.
Rządkowski, G.
Piórczyński, K. - Powiązania:
- https://bibliotekanauki.pl/articles/226434.pdf
- Data publikacji:
- 2016
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
channel selection
channel assignment
802.11 home networks
greedy algorithm - Opis:
- 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.
- Źródło:
-
International Journal of Electronics and Telecommunications; 2016, 62, 4; 379-388
2300-1933 - Pojawia się w:
- International Journal of Electronics and Telecommunications
- Dostawca treści:
- Biblioteka Nauki
Artykuł