Maximum-weighted subset of communication requests schedulable without spectral splitting

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

2 Scopus Citations
View graph of relations

Author(s)

  • Peng-Jun Wan
  • Huaqiang Yuan
  • Xiaohua Jia
  • Jiliang Wang
  • Zhu Wang

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationINFOCOM 2017 - IEEE Conference on Computer Communications
PublisherIEEE
ISBN (Electronic)978-1-5090-5336-0
Publication statusPublished - May 2017

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

Title2017 IEEE Conference on Computer Communications, INFOCOM 2017
PlaceUnited States
CityAtlanta
Period1 - 4 May 2017

Abstract

Consider a set of point-to-point communication requests in a multi-channel multihop wireless network, each of which is associated with a traffic demand of at most one unit of transmission time, and a weight representing the utility if its demand is fully met. A subset of requests is said to be schedulable without spectral splitting if they can be scheduled within one unit of time subject to the constraint each request is assigned with a unique channel throughout its transmission. This paper develops efficient and provably good approximation algorithms for finding a maximum-weighted subset of communication requests schedulable without spectral splitting.

Citation Format(s)

Maximum-weighted subset of communication requests schedulable without spectral splitting. / Wan, Peng-Jun; Yuan, Huaqiang; Jia, Xiaohua; Wang, Jiliang; Wang, Zhu.

INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE, 2017. 8056982 (Proceedings - IEEE INFOCOM).

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review