Welcome to the InfoSci Platform
Reference Hub1
Optimal Channel Assignment Algorithm for Least Interfered Wireless Mesh Networks

Optimal Channel Assignment Algorithm for Least Interfered Wireless Mesh Networks

Tarik Mountassir, Bouchaib Nassereddine, Abdelkrim Haqiq, Samir Bennani
Copyright: © 2014 |Volume: 6 |Issue: 1 |Pages: 14
ISSN: 1937-9412|EISSN: 1937-9404|EISBN13: 9781466655577|DOI: 10.4018/ijmcmc.2014010103
Cite Article Cite Article

MLA

Mountassir, Tarik, et al. "Optimal Channel Assignment Algorithm for Least Interfered Wireless Mesh Networks." IJMCMC vol.6, no.1 2014: pp.54-67. http://doi.org/10.4018/ijmcmc.2014010103

APA

Mountassir, T., Nassereddine, B., Haqiq, A., & Bennani, S. (2014). Optimal Channel Assignment Algorithm for Least Interfered Wireless Mesh Networks. International Journal of Mobile Computing and Multimedia Communications (IJMCMC), 6(1), 54-67. http://doi.org/10.4018/ijmcmc.2014010103

Chicago

Mountassir, Tarik, et al. "Optimal Channel Assignment Algorithm for Least Interfered Wireless Mesh Networks," International Journal of Mobile Computing and Multimedia Communications (IJMCMC) 6, no.1: 54-67. http://doi.org/10.4018/ijmcmc.2014010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Unlike most of proposed solutions that usually consider the overall throughput as the main optimization, Channel Assignment in Wireless Mesh Networks has to ensure connectivity, minimize interference level and guarantee an acceptable throughput. This problem must be solved taking into account all the parameters that influence the output of the proposed algorithm. In this paper, the authors propose an efficient multi-objective optimization model that, simultaneously, optimizes two conflicting objective functions in order to assign channel to radio interfaces subject to connectivity, interference and bandwidth requirements. Then they use the Multi-Objective Particle Swarm Optimization Technique to resolve this problem and provide a non-dominated set of near optimal solutions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.