Chattopadhyay, Arpan and Chockalingam, A (2010) Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks. In: International Conference on Signal Processing and Communications, JUL 18-21, 2010, Indian Inst Sci, Bangalore, INDIA.
Past.pdf - Published Version
Restricted to Registered users only
Download (165Kb) | Request a copy
Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||06 Apr 2011 10:30|
|Last Modified:||06 Apr 2011 10:30|
Actions (login required)