A simple greedy algorithm for link scheduling with the physical interference model

Dejun Yang, Xi Fang, Nan Li, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: Nov 30 2009Dec 4 2009

Other

Other2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
CountryUnited States
CityHonolulu, HI
Period11/30/0912/4/09

Fingerprint

Scheduling
Scheduling algorithms
Wireless networks
Time division multiple access
Network protocols

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Yang, D., Fang, X., Li, N., & Xue, G. (2009). A simple greedy algorithm for link scheduling with the physical interference model. In GLOBECOM - IEEE Global Telecommunications Conference [5425262] https://doi.org/10.1109/GLOCOM.2009.5425262

A simple greedy algorithm for link scheduling with the physical interference model. / Yang, Dejun; Fang, Xi; Li, Nan; Xue, Guoliang.

GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5425262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, D, Fang, X, Li, N & Xue, G 2009, A simple greedy algorithm for link scheduling with the physical interference model. in GLOBECOM - IEEE Global Telecommunications Conference., 5425262, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United States, 11/30/09. https://doi.org/10.1109/GLOCOM.2009.5425262
Yang D, Fang X, Li N, Xue G. A simple greedy algorithm for link scheduling with the physical interference model. In GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5425262 https://doi.org/10.1109/GLOCOM.2009.5425262
Yang, Dejun ; Fang, Xi ; Li, Nan ; Xue, Guoliang. / A simple greedy algorithm for link scheduling with the physical interference model. GLOBECOM - IEEE Global Telecommunications Conference. 2009.
@inproceedings{2318ecb1e28d407f823b629f658a3ee0,
title = "A simple greedy algorithm for link scheduling with the physical interference model",
abstract = "In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20{\%}-30{\%} when the density of links is high.",
author = "Dejun Yang and Xi Fang and Nan Li and Guoliang Xue",
year = "2009",
doi = "10.1109/GLOCOM.2009.5425262",
language = "English (US)",
isbn = "9781424441488",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - A simple greedy algorithm for link scheduling with the physical interference model

AU - Yang, Dejun

AU - Fang, Xi

AU - Li, Nan

AU - Xue, Guoliang

PY - 2009

Y1 - 2009

N2 - In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.

AB - In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.

UR - http://www.scopus.com/inward/record.url?scp=77951553374&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951553374&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2009.5425262

DO - 10.1109/GLOCOM.2009.5425262

M3 - Conference contribution

SN - 9781424441488

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -