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...
Main Authors: | Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/3654/ http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf |
Similar Items
-
An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2016) -
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
by: Fayaz, Muhammad, et al.
Published: (2016) -
Study on security of IPv6 address management in enterprise WLAN
by: Jarot, Sigit Puspito Wigati, et al.
Published: (2012) -
Improving PRESENT lightweight algorithms
by: AlDabbagh, Sufyan Salim Mahmood, et al.
Published: (2013) -
An Improved Genetic Clustering Algorithm for Categorical Data
by: Jasni, Mohamad Zain, et al.
Published: (2013)