Decision-based link scheduling approximation algorithm with SINR relaxation for wireless mesh network

The crucial issue in the design of resource allocation algorithms for wireless mesh network is computational complexity. A high capacity algorithm with low computational complexity is desired, especially for dynamic topology adaptation in mobile mesh networks and also for the issue of low energy consumption. This paper proposes a new approach in the designing of a low complexity spatial time division multiple access link scheduling algorithm for wireless mesh network. In this paper, link scheduling is considered as a decision-making problem. This approach is contrary to physical interference model that requires SINR evaluation in global network. We propose the mesh coverage probability as a new performance metric in the design of mesh link scheduling algorithm. Based on this approach, we provide the tradeoff between spatial reuse and mesh coverage probability, which can be used as a benchmark in the design of scheduling algorithms for wireless mesh network.