Combinatorial Routing and Scheduling Scheme for Multiple Concurrent Flows in Wireless Mesh Networks

To solve the interference conflict and resource competition caused by the simultaneous transmission of multiple paths in wireless mesh networks, a combinatorial routing and scheduling scheme based on the channel layering is proposed. Firstly, a feasible scheme for path discovery is given, and a path selection criterion based on the available resources of the mesh networks is presented. Then, the channel allocation scheme of multiple paths for concurrent transmission is determined. Finally, a combined optimization scheduling scheme (COSS), combining routing, channel allocation and scheduling, is developed to find as many compatible paths as possible in each time slot with the heuristic method to realize the combined optimal scheduling of compatible paths. In order to verify the performance of the COSS algorithm, simulation experiments are performed under different network resource configurations and multiple traffic requests. The experimental results show that the COSS algorithm has a good performance in terms of throughput, transmission delay and transmission completion time and that, compared with AODV routing protocol, the COSS algorithm effectively improves the throughput.