Comparison between Vertex Merge Algorithm and Dsatur Algorithm
Handrizal , A. Noraziah and Ahmed N. Abdalla
DOI : 10.3844/jcssp.2011.664.670
Journal of Computer Science
Volume 7, Issue 5
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.
© 2011 Handrizal , A. Noraziah and Ahmed N. Abdalla. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.