Minimum Length Scheduling in Single-Hop Multiple Access Wireless Networks

Date Added: Sep 2009
Format: PDF

In this paper, the authors address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol or Physical model of interference, this paper studies the scheduling problem in multiple access (multi-access) networks. In this kind of network, the receiver node can decode multiple transmissions simultaneously if the transmission rates of concurrent transmitters lie inside the capacity region of the receiver node. They propose a linear programming model that minimizes the schedule length.