PoS - Proceedings of Science
Volume 300 - Information Science and Cloud Computing (ISCC 2017) - Session I machine learning
Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network
W. Zhang*, J. He, G. Gao, L. Ren and X. Shen
Full text: pdf
Pre-published on: February 26, 2018
Published on: March 08, 2018
Abstract
Considering the channel dependence. this paper designs greedy algorithm in Multi-Channel Allocation joint scheduling and routing. Unlike the traditional multi-channel Wireless Mesh channel allocation, the proposed scheme considers scheduling and routing, and the network is divided into two states by network segmentation. The linear planning allocation method is used to minimize the average end-to-end delay for the maximum transmission link number for the total channel resource and routing scheduling problem for link consumption that adopt the integer linear programming method modelling, the greedy heuristic algorithm can be used. The simulation analysis shows that the algorithm of this paper can effectively improve the throughput of the network.
DOI: https://doi.org/10.22323/1.300.0002
How to cite

Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.

Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.