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 will get the most bandwidth. This paper presents a location-independent scheduling mechanism (LISM) for WBNs. LISM adopts a simple time-stamp-based approach to resolve the location-dependent problem and utilizes a dual-queue approach to minimize the sorting complexity. Simulation results indicate that LISM successfully solves the location-dependent problem.
['Li-Hung Liao', 'Ray-Guang Cheng', 'Kuo-Lun Hua']
Location-Independent Scheduling Mechanism for Multi-hop Wireless Backhaul Networks