Abstract

A static channel assignment algorithm in multi-radio multi-channel WMN (Wireless Mesh Network) is proposed aiming to minimize the maximum link interference. The proposed algorithm is an approximation algorithm since the problem is NP-hard. We prove that the greedy channel assignment algorithm is a factor (2−1/k) algorithm, where k is the number of available orthogonal channels. Additionally, the greedy algorithm is compared with the simply sequential and random channel assignment algorithms. The simulation results show that the greedy channel assignment algorithm outperforms the sequential and random channel assignment algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.