Link scheduling in wireless cooperative communication networks

Chenxi Qiu; Haiying Shen

doi:https://doi.org/10.1109/MASS.2015.75

Link scheduling in wireless cooperative communication networks

Chenxi Qiu, Haiying Shen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	American English
Title of host publication	Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	462-464
Number of pages	3
ISBN (Electronic)	9781467391009
DOIs	https://doi.org/10.1109/MASS.2015.75
State	Published - Dec 28 2015
Externally published	Yes
Event	12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015 - Dallas, United States Duration: Oct 19 2015 → Oct 22 2015

Publication series

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

Other

Other	12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
Country/Territory	United States
City	Dallas
Period	10/19/15 → 10/22/15

ASJC Scopus subject areas

Instrumentation
Computer Networks and Communications
Signal Processing

Access to Document

https://doi.org/10.1109/MASS.2015.75

Cite this

Qiu, C., & Shen, H. (2015). Link scheduling in wireless cooperative communication networks. In Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015 (pp. 462-464). [7366969] (Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MASS.2015.75

Qiu, Chenxi ; Shen, Haiying. / Link scheduling in wireless cooperative communication networks. Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 462-464 (Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015).

@inproceedings{7643ec4e6eb24c4289bd3975576a4229,

title = "Link scheduling in wireless cooperative communication networks",

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

author = "Chenxi Qiu and Haiying Shen",

note = "Funding Information: This research was supported in part by U.S. NSF grants NSF-1404981, IIS-1354123, CNS-1254006, CNS-1249603, and Microsoft Research Faculty Fellowship 8300751. Publisher Copyright: {\textcopyright} 2015 IEEE.; 12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015 ; Conference date: 19-10-2015 Through 22-10-2015",

year = "2015",

month = dec,

day = "28",

doi = "https://doi.org/10.1109/MASS.2015.75",

language = "American English",

series = "Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "462--464",

booktitle = "Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015",

address = "United States",

}

Qiu, C & Shen, H 2015, Link scheduling in wireless cooperative communication networks. in Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015., 7366969, Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Institute of Electrical and Electronics Engineers Inc., pp. 462-464, 12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Dallas, United States, 10/19/15. https://doi.org/10.1109/MASS.2015.75

Link scheduling in wireless cooperative communication networks. / Qiu, Chenxi; Shen, Haiying.

Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 462-464 7366969 (Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Link scheduling in wireless cooperative communication networks

AU - Qiu, Chenxi

AU - Shen, Haiying

N1 - Funding Information: This research was supported in part by U.S. NSF grants NSF-1404981, IIS-1354123, CNS-1254006, CNS-1249603, and Microsoft Research Faculty Fellowship 8300751. Publisher Copyright: © 2015 IEEE.

PY - 2015/12/28

Y1 - 2015/12/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964674961&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964674961&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/MASS.2015.75

DO - https://doi.org/10.1109/MASS.2015.75

M3 - Conference contribution

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

SP - 462

EP - 464

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 19 October 2015 through 22 October 2015

ER -

Qiu C, Shen H. Link scheduling in wireless cooperative communication networks. In Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 462-464. 7366969. (Proceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015). doi: https://doi.org/10.1109/MASS.2015.75

Link scheduling in wireless cooperative communication networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this