Research Article Open Access

Comparison between Vertex Merge Algorithm and Dsatur Algorithm

Handrizal 1, A. Noraziah1 and Ahmed N. Abdalla2
  • 1 ,
  • 2 , Afganistan
Journal of Computer Science
Volume 7 No. 5, 2011, 664-670

DOI: https://doi.org/10.3844/jcssp.2011.664.670

Submitted On: 5 January 2011 Published On: 7 May 2011

How to Cite: Handrizal, Noraziah, A. & Abdalla, A. N. (2011). Comparison between Vertex Merge Algorithm and Dsatur Algorithm. Journal of Computer Science, 7(5), 664-670. https://doi.org/10.3844/jcssp.2011.664.670

Abstract

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.

  • 1,234 Views
  • 2,442 Downloads
  • 0 Citations

Download

Keywords

  • Spread spectrum
  • channel allocation
  • Dsatur algorithm
  • frequency hopping
  • coloring admissible
  • adjacency matrix