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...
| Egile Nagusiak: | , , , |
|---|---|
| Formatua: | Conference or Workshop Item |
| Hizkuntza: | English |
| Argitaratua: |
2012
|
| Gaiak: | |
| Sarrera elektronikoa: | http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf |
| _version_ | 1825821420000641024 |
|---|---|
| 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 |
| collection | UMP |
| 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. |
| first_indexed | 2024-03-06T11:41:16Z |
| format | Conference or Workshop Item |
| id | UMPir3654 |
| institution | Universiti Malaysia Pahang |
| language | English |
| last_indexed | 2024-03-06T11:41:16Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | UMPir36542018-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.. (Published) |
| 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 |
| title | 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_short | An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm |
| title_sort | improved of channel allocation for wlan using vertex merge algorithm |
| topic | QA75 Electronic computers. Computer science |
| url | http://umpir.ump.edu.my/id/eprint/3654/1/41ICoCSIM.pdf |
| work_keys_str_mv | AT mrhandrizal animprovedofchannelallocationforwlanusingvertexmergealgorithm AT mrmuhammadzarlis animprovedofchannelallocationforwlanusingvertexmergealgorithm AT noraziahahmad animprovedofchannelallocationforwlanusingvertexmergealgorithm AT abdallaahmedn animprovedofchannelallocationforwlanusingvertexmergealgorithm AT mrhandrizal improvedofchannelallocationforwlanusingvertexmergealgorithm AT mrmuhammadzarlis improvedofchannelallocationforwlanusingvertexmergealgorithm AT noraziahahmad improvedofchannelallocationforwlanusingvertexmergealgorithm AT abdallaahmedn improvedofchannelallocationforwlanusingvertexmergealgorithm |