Cover Image

An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.
Format: Conference or Workshop Item
Language:English
Published: 2012
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf
http://umpir.ump.edu.my/id/eprint/3654/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ump.umpir.3654
record_format eprints
spelling my.ump.umpir.36542018-10-03T07:38:43Z http://umpir.ump.edu.my/id/eprint/3654/ An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm Mr, Handrizal Mr, Muhammad Zarlis Noraziah, Ahmad Abdalla, Ahmed N. QA75 Electronic computers. Computer science 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. 2012-12-03 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf 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..
institution Universiti Malaysia Pahang
building UMP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Pahang
content_source UMP Institutional Repository
url_provider http://umpir.ump.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Mr, Handrizal
Mr, Muhammad Zarlis
Noraziah, Ahmad
Abdalla, Ahmed N.
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
description 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.
format Conference or Workshop Item
author Mr, Handrizal
Mr, Muhammad Zarlis
Noraziah, Ahmad
Abdalla, Ahmed N.
author_facet Mr, Handrizal
Mr, Muhammad Zarlis
Noraziah, Ahmad
Abdalla, Ahmed N.
author_sort Mr, Handrizal
title An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
title_short An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
title_full An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
title_fullStr An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
title_full_unstemmed An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
title_sort improved of channel allocation for wlan using vertex merge algorithm
publishDate 2012
url http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf
http://umpir.ump.edu.my/id/eprint/3654/
_version_ 1643664849434050560
score 13.211869

Similar Items