| Summary: | In a communication network, channel assignment is an essential component that can be divided into three categories which are static, dynamic, and hybrid channel allocation. In this paper, we focus on the dynamic channel allocation that is applied in Wireless Mesh Networks (WMN) where communication between two nodes occurs when they are both assigned the same channel. Wireless networking is a way to connect various equipment without having to install expensive cables throughout a place. Channel assignment in the networks is an application of graph theory on the vertex coloring. Three types of interference are considered in our work which are adjacent channel, cochannel and cosite constraints. The channels are allocated in such a way to minimize the interference and maximizing the performance of the networks. The interference is said to be minimized when all the constraints are considered, so that the interference can be avoided. The network is optimized if the interference reduced with a minimum number of the channel used. An algorithm called Improved Greedy Algorithm was proposed to solve the multi-channel assignments in wireless mesh networks by considering the adjacent channel, cochannel and cosite constraints. The Improved Greedy Algorithm has been tested with different values of constraints. From the results, it can be seen that the Improved Greedy Algorithm perform significantly well for the channel assignment problem. © 2024 Author(s).
|
|---|