Simple and effective scheduling in wireless networks under the physical interference model

Dejun Yang, Xi Fang, Guoliang Xue, Afsheen Irani, Satyajayant Misra

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

9 Scopus citations

Abstract

In this paper, we study the problem of maximizing the number of concurrent requests and the problem of minimizing the number of time-slots needed to schedule all requests in wireless networks under the physical interference model. It has been proved that both problems are NP-complete in [7]. Thus either approximation algorithms with guaranteed approximation factors or effective heuristics with practically good performances are desirable. We focus on the latter and present simple and effective heuristic algorithms for these two problems. Extensive experiments show that our algorithm for the first problem outperforms the best approximation algorithm by 62%-72% on average, and our two algorithms for the second problem give the best results among existing algorithms.

Original languageEnglish (US)
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
DOIs
StatePublished - 2010
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: Dec 6 2010Dec 10 2010

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other53rd IEEE Global Communications Conference, GLOBECOM 2010
CountryUnited States
CityMiami, FL
Period12/6/1012/10/10

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Simple and effective scheduling in wireless networks under the physical interference model'. Together they form a unique fingerprint.

Cite this