Centralized Spatial Reuse Designing for Fixed Multihop Relay Wireless Access Networks

In this paper, we consider the problem of routing and scheduling to form a centralized spatial reuse designing framework for fixed multihop relay wireless access networks. Both minimal hopcount and maximal signal strength strategies to construct a routing tree are investigated. New scheduling algorithm is presented to schedule links on a tree level basis. In contrast with graph coloring, the new method is more feasible to enable efficient spatial reuse while avoiding primary and secondary interferences to a great extent. The proposed scheme also has the property that it guarantees fairness among downlink relay queues of each fixed relay node. Simulation results of network throughput and average active link number show that the new policy utilizes network resources more efficiently than the normal fair scheduling mechanism. The effect of routing strategies on tree level scheduling is also studied through experiment