Performance of Wireless Mesh Networks with Centralized Multihop Scheduling for Intelligent Transportation Systems

We consider the problem of centralized multihop scheduling in wireless mesh networks for solutions to realize intelligent transportation systems. A scheduling tree construction strategy is investigated, which could use any predetermined selection metrics, while avoiding primary and secondary interferences to a great extent. Two centralized multihop scheduling algorithms are presented to schedule nodes on the constructed scheduling tree. In contrast with FIFO algorithm, the fair algorithm has the property that it guarantees fairness among downlink relay queues of each relay node, while making an efficient utilization of free mini-slots. The feasibility of scheduling tree construction strategy with both minimal hop count and maximal signal strength metrics for a mesh cell is studied through experiment. Simulation results of network throughput and average active link number show that the Fair algorithm utilizes network resources more efficiently than the FIFO algorithm