UMP Institutional Repository

An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

Mr, Handrizal and Mr, Muhammad Zarlis and Noraziah, Ahmad and Abdalla, Ahmed N. (2012) An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm. In: International Conference on Computational Science and Information Management (ICoCSIM), 3-5 December 2012 , Toba Lake, North Sumatera, Indonesia. pp. 205-213..

[img]
Preview
PDF (FSKKP-2012-Noraziah-improved of channel)
41ICoCSIM.pdf

Download (780kB)

Abstract

Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). Through this algorithm, each access point (AP) that adjacent will be given different channels based on colours available. Degree of saturation (Dsatur) is the popular algorithms being used for channel allocation in this domain. However, this algorithm has its weaknesses in terms of minimum number of channel required. In this study, channel allocation called Vertex Merge Algorithm (VMA) is proposed by considering only channel allocation on WLAN. It is based on logical structure of vertex/access point in order to a colouring the graph. Each vertex on the graph will be arranged based on decreasing number of degree. The vertex in the first place on the set will be given a colour, and then these vertices are merged with not adjacent vertex. This process will be continued to repeat until all vertices are given colour. The assignment provides a minimum number of channels required. A series of experiment was carried out by using one computer. Vertex Merge Algorithm (VMA) simulation is developed under Linux platform. It was carried out in PHP programming integrated with GIMP for open and edit image. The experimental results showed that the proposed algorithm work successfully in channel allocation on wireless local area network (WLAN) when no failures occurred.

Item Type: Conference or Workshop Item (Speech)
Additional Information: Proceedings of the First International Conference on Computational Science and Information Management (ICoCSIM2012) ISBN 978-967-0120-60-7 Vol. 1 Profesor Madya Dr. Ahmed N Abd Alla (A. N. Abdalla)
Uncontrolled Keywords: Graph colouring; Vertex merge; Spread spectrum; WLAN; Channel allocation
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty/Division: Faculty of Civil Engineering & Earth Resources
Faculty of Electrical & Electronic Engineering
Unspecified
Depositing User: NOR NADIA SHAHIDA ZAKRIA
Date Deposited: 15 Jul 2013 05:21
Last Modified: 03 Oct 2018 07:38
URI: http://umpir.ump.edu.my/id/eprint/3654
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item