Link scheduling in multi-transmit-receive wireless networks

Hong Ning DAI*, Soung Chang LIEW, Liqun FU

*Corresponding author for this work

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

5 Citations (Scopus)

Abstract

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 publicationProceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011
Pages199-202
Number of pages4
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event36th Annual IEEE Conference on Local Computer Networks, LCN 2011 - Bonn, Germany
Duration: 4 Oct 20117 Oct 2011

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Conference

Conference36th Annual IEEE Conference on Local Computer Networks, LCN 2011
Country/TerritoryGermany
CityBonn
Period4/10/117/10/11

Fingerprint

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

Cite this