A graph coloring model to maximize the number of communicating mobiles in wireless networks

Channel allocation in wireless networks has been an active research area in the past years. Resources (frequencies) are increasingly scarce due to the large number of wireless applications, and the amount of users is in constant augmentation. The quality of wireless networks therefore relies more and more on efficient optimization technique. A graph coloring model to maximize the number of simultaneously communicating mobiles in a wireless network is proposed. Since the considered problem in NP-hard, various heuristic algorithms are described, and their performance is analyzed in comparison with standard decentralized channel assignment strategies.

Important

Nous vous remercions de confirmer votre présence ici.