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

Dejun Yang; Xi Fang; Nan Li; Guoliang Xue

doi:10.1109/GLOCOM.2009.5425262

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 proceeding › Conference contribution

12 Scopus citations

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 language	English (US)
Title of host publication	GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
DOIs	https://doi.org/10.1109/GLOCOM.2009.5425262
State	Published - 2009
Event	2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States Duration: Nov 30 2009 → Dec 4 2009

Publication series

Name	GLOBECOM - IEEE Global Telecommunications Conference

Other

Other	2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
Country/Territory	United States
City	Honolulu, HI
Period	11/30/09 → 12/4/09

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/GLOCOM.2009.5425262

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 2009 - 2009 IEEE Global Telecommunications Conference., 5425262, GLOBECOM - IEEE Global Telecommunications Conference, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United States, 11/30/09. https://doi.org/10.1109/GLOCOM.2009.5425262

@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",

series = "GLOBECOM - IEEE Global Telecommunications Conference",

booktitle = "GLOBECOM 2009 - 2009 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

AN - SCOPUS:77951553374

SN - 9781424441488

T3 - GLOBECOM - IEEE Global Telecommunications Conference

BT - GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

T2 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009

Y2 - 30 November 2009 through 4 December 2009

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this