Link scheduling in multi-transmit-receive wireless networks

Hong-Ning Dai, Soung Chang Liew, Liqun Fu

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

6 Citations (Scopus)


This paper investigates the problem of link scheduling to meet traffic demands with minimum airtime in a multi-transmit-receive (MTR) wireless network. MTR networks are a new class of networks, in which each node can simultaneously transmit to a number of other nodes, or simultaneously receive from a number of other nodes. The MTR capability can be enabled by the use of multiple directional antennas or multiple channels. Potentially, MTR can boost the network capacity significantly. However, link scheduling that makes full use of the MTR capability must be in place before this can happen. We show that optimal link scheduling can be formulated as a linear program (LP). However, the problem is NP-hard because we need to find all the maximal independent sets in a graph first. We propose two computationally efficient algorithms, called Heavy-Weight-First (HWF) and Max-Degree-First (MDF) to solve this problem. Simulation results show that both HWF and MDF can achieve superior performance in terms of runtime and optimality.
Original languageEnglish
Title of host publication2011 IEEE 36th Conference on Local Computer Networks
Number of pages4
ISBN (Electronic)9781612849287, 9781612849270
ISBN (Print)9781612849263
Publication statusPublished - Oct 2011
Event2011 IEEE 36th Conference on Local Computer Networks - Bonn, Germany
Duration: 4 Oct 20117 Oct 2011

Publication series

NameConference on Local Computer Networks (LCN)
ISSN (Print)0742-1303
ISSN (Electronic)0742-1303


Conference2011 IEEE 36th Conference on Local Computer Networks
Internet address


Dive into the research topics of 'Link scheduling in multi-transmit-receive wireless networks'. Together they form a unique fingerprint.

Cite this