A Traffic-Demand-Aware Routing and Scheduling for CSMA-based Wireless Mesh Networks

With variety of Wireless Mesh Networks (WMNs) services and applications, seeking optimized network performance and traffic delivery become increasingly important. In this paper, we focus on the CSMA(Carrier Sense Multiple Access)based wireless mesh networks loaded by given traffic demands, and design a reasonable routing schedule to cope with the demands without collision. Because this problem is NP-hard, we mathematically formulate it as a mixed-integer linear optimization problem (MILP) to solve it. In doing this work, we choose a slotted CSMA model and propose a new scheduling algorithm called DA-CATBS (Demand-Aware CATBS). DA-CATBS can generate reasonable routing schedules according to different traffic patterns. Compared with CATBS(CSMA-Aware Time-Boundable Scheduling), DA-CATBS has better performance, which has flexibility against variety of traffic patterns and improves the capacity of networks under real traffic.