Fading-Resistant Link Scheduling in Wireless Networks

Chenxi Qiu, Haiying Shen

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

9 Scopus citations

Abstract

In this paper, we study the link scheduling problem considering the fluctuating fading effect in transmissions. We extend the previous deterministic physical interference model to the Rayleigh-fading model that uses the stochastic propagation to address fading effects. Based on this model, we formulate a problem called Fading-Resistant Link Scheduling (Fading-R-LS) problem, which aims to maximize the throughput of all links in a single time slot. We prove that this problem is NP-hard. Based on the geometric structure of Fading-R-LS, we then propose two centralized schemes with O(g(L)) and O(1) performance guarantee, respectively, where g(L) is the number of magnitudes of transmission link lengths. Our experimental results show that the superior performance of our proposed schemes compared to previous schemes.

Original languageEnglish (US)
Title of host publicationProceedings - 46th International Conference on Parallel Processing, ICPP 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages312-321
Number of pages10
ISBN (Electronic)9781538610428
DOIs
StatePublished - Sep 1 2017
Externally publishedYes
Event46th International Conference on Parallel Processing, ICPP 2017 - Bristol, United Kingdom
Duration: Aug 14 2017Aug 17 2017

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

Conference46th International Conference on Parallel Processing, ICPP 2017
Country/TerritoryUnited Kingdom
CityBristol
Period8/14/178/17/17

All Science Journal Classification (ASJC) codes

  • Software
  • General Mathematics
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Fading-Resistant Link Scheduling in Wireless Networks'. Together they form a unique fingerprint.

Cite this