PERBANDINGAN ALGORITMA DSATUR DAN ALGORITMA VERTEX MERGE UNTUK MENENTUKAN CHANNEL WLAN
(1) STIKOM Tunas Bangsa Pematangsiantar
(*) Corresponding Author
Abstract
Full Text:
PDFReferences
Al Mamun, K.M.A. dkk. 2009. An Efficient Variable Channel Allocation Technique for WLAN IEEE 802.11 Standard, in Proceedings Conference on Circuits, Communication and System, pp.92-95.
André, M., G. Pesant dan S. Pierre, 2005. A Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless Networks. J. Comput. Sci., 1: 175-181.
Brelaz, D. 1979. New Methods to Color the Vertices of a graph, on Communication of the ACM, no.22, pp.251-256
Diestel, R., 2006. Graph Theory (Graduate Texts and Mathematics). 3rd Edn., Springer, USA., ISBN:10: 3540261834, pp: 415.
Duan, Z. dkk. 2010 Optimal Channel Assignment for Wireless Networks Modelled as Hexagonal and Square Grids. International Conference on Networks Security Wireless Communications and Trusted Computing.
Handrizal,dan Heri Santoso, 2012. Algoritma vertex merge untuk menentukan alokasi channel pada akses point wireless LAN. Seminar Nasional Ilmu Komputer 2012
Juhos dan Jano, I. 2006. Increasing the efficiency of graph coloring algorithms with a representation based on vector operations. J. Software, pp: 1.
Ming, H. dkk. 2009. Hierarchical genetic algorithm for dynamic channel units allocation in td-cdma/tdd system. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2. pp.103-116.
Riihijarvi, J. dkk. 2006. Performance Evaluation of Automatic Channel Assignment Mechanism for IEEE 802.11 Base on Graph Coloring, in Proceedings The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Communications, pp.1-5.
DOI: http://dx.doi.org/10.30645/jurasik.v1i1.4
DOI (PDF): http://dx.doi.org/10.30645/jurasik.v1i1.4.g2
Refbacks
- There are currently no refbacks.
JURASIK (Jurnal Riset Sistem Informasi dan Teknik Informatika)
Published Papers Indexed/Abstracted By: