TY  - JOUR
AU  - Handrizal, 
AU  - Noraziah, A. 
AU  - Abdalla, Ahmed N. 
PY  - 2011
TI  - Comparison between Vertex Merge Algorithm and Dsatur Algorithm
JF  - Journal of Computer Science
VL  - 7
IS  - 5
DO  - 10.3844/jcssp.2011.664.670
UR  - https://thescipub.com/abstract/jcssp.2011.664.670
AB  - Problem statement: In this study, the channel allocation problem in direct sequence spread
spectrum was investigated. First, Coloring in channel allocation has been discussed in detail. Second; a
new graph model is proposed that namely Vertex Merge Algorithm (VMA). Approach: VMA try to
solve channel allocation based on graph theory. Results: The problem is to assign channel to Access
Point (AP) in such away that interference among access point is eliminated and the total number of
channel is minimized. The proposed algorithm is also compared with Dsatur algorithm by input three
graphs that are graph1, graph2 and graph3. Conclusion/Recommendations: Simulation results shows
that the new graph model can provide minimum needed channel compared to Dsatur algorithm.