TY - GEN
T1 - Link scheduling in cooperative communication with SINR-based interference
AU - Qiu, Chenxi
AU - Shen, Haiying
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/14
Y1 - 2016/9/14
N2 - Though intensive research efforts have been devoted to the study of the link scheduling problem in wireless networks, no previous work has discussed this problem for cooperative communication networks, in which receivers are allowed to combine messages from different senders to combat transmission errors. 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 to combat fading. We formulate two problems named cooperative link scheduling problem (CLS) and one-shot cooperative link scheduling problem (OCLS). The first problem aims to find a schedule of links that uses the minimum number of time slots to inform all the receivers. The second problem aims to find a set of links that can inform the maximum number of receivers in one time slot. As a solution, we propose an algorithm for both CLS and OCLS with g(K) approximation ratio, where g(K) is so called diversity of key links. In addition, we propose a greedy algorithm with O(1) approximation ratio for OCLS when the number of links for each receiver is upper bounded by a constant. Simulation results indicate that our cooperative link scheduling approaches outperform non-cooperative ones.
AB - Though intensive research efforts have been devoted to the study of the link scheduling problem in wireless networks, no previous work has discussed this problem for cooperative communication networks, in which receivers are allowed to combine messages from different senders to combat transmission errors. 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 to combat fading. We formulate two problems named cooperative link scheduling problem (CLS) and one-shot cooperative link scheduling problem (OCLS). The first problem aims to find a schedule of links that uses the minimum number of time slots to inform all the receivers. The second problem aims to find a set of links that can inform the maximum number of receivers in one time slot. As a solution, we propose an algorithm for both CLS and OCLS with g(K) approximation ratio, where g(K) is so called diversity of key links. In addition, we propose a greedy algorithm with O(1) approximation ratio for OCLS when the number of links for each receiver is upper bounded by a constant. Simulation results indicate that our cooperative link scheduling approaches outperform non-cooperative ones.
UR - http://www.scopus.com/inward/record.url?scp=84991822126&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84991822126&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2016.7568540
DO - 10.1109/ICCCN.2016.7568540
M3 - Conference contribution
AN - SCOPUS:84991822126
T3 - 2016 25th International Conference on Computer Communications and Networks, ICCCN 2016
BT - 2016 25th International Conference on Computer Communications and Networks, ICCCN 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th International Conference on Computer Communications and Networks, ICCCN 2016
Y2 - 1 August 2016 through 4 August 2016
ER -