Link scheduling in wireless cooperative communication networks

Chenxi Qiu, Haiying Shen

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

Abstract

In this paper, we study the link scheduling problem in wireless cooperative communication networks, in which receivers are allowed to combine copies of a message from different senders to combat fading. We formulate a problem called cooperative link scheduling problem (CLS), which aims to find a schedule of links that uses the minimum number of time slots to inform all the receivers. As a solution, we propose an algorithm for CLS with g(K) approximation ratio, where g(K) is so called diversity of key links. Simulation results indicate that our cooperative link scheduling approaches outperform noncooperative ones.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages462-464
Number of pages3
ISBN (Electronic)9781467391009
DOIs
StatePublished - Dec 28 2015
Externally publishedYes
Event12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015 - Dallas, United States
Duration: Oct 19 2015Oct 22 2015

Publication series

NameProceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015

Conference

Conference12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
Country/TerritoryUnited States
CityDallas
Period10/19/1510/22/15

All Science Journal Classification (ASJC) codes

  • Instrumentation
  • Computer Networks and Communications
  • Signal Processing

Fingerprint

Dive into the research topics of 'Link scheduling in wireless cooperative communication networks'. Together they form a unique fingerprint.

Cite this