Analysis of the Virtual-Timestamp-Based Scheduling for Multi-Hop Wireless Backhaul Networks

A common problem of a multi-hop wireless backhaul network (WBN) is the end-to-end throughput of a relay node is location-dependent. That is, the closest relay node to the gateway gets the most bandwidth. The location-dependent problem may be solved by adopting the concept of virtual-timestamp-based scheduling. This paper presents a queueing model to analyze the performance of the proposed concept. The accuracy of the analysis is verified via computer simulation. Simulation results indicate the accuracy of the analysis and the effectiveness of the proposed concept.