On the Capacity of Pairwise Collaborative Networks

被引:0
|
作者
Astaneh, Saeed A. [1 ]
Gazor, Saeed [1 ]
Behrooz, Hamid [2 ]
机构
[1] Queens Univ, Dept Elect & Comp Engn, Kingston, ON, Canada
[2] Queens Univ, Dept Math Stat, Kingston, ON, Canada
关键词
Pairwise collaborative network; rate splitting; decode and forward;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We derive expressions for the achievable rate region of a collaborative coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network (PCN) where one transmitter and receiver pair, namely relay pair, assists the other pair, namely the source pair, by partially decoding and forwarding the transmitted message to the intended receiver. The relay pair provides such assistance while handling a private message. We assume that users can use the past channel outputs and can transmit and receive at the same time and in the same frequency band. In this collaborative scheme, the transmitter of the source pair splits its information into two independent parts. Ironically, the relay pair employs the decode and forward coding to assist the source pair in delivering a part of its message and re-encodes the decoded message along with private message, which is intended to the receiver of the relay pair, and broadcasts the results. The receiver of the relay pair decodes both messages, retrieves the private message, re-encodes and transmits the decoded massage to the intended destination. We also characterize the achievable rate region for Gaussian PCN. Finally, we provide numerical results to study the rate trade off for the involved pairs. Numerical result shows that the collaboration offers gain when the channel gain between the users of the relay pair are strong. It also shows that if the channel conditions between transmitters or between the receivers of the relay and source pairs are poor, such a collaboration is not beneficial.
引用
收藏
页码:1327 / 1331
页数:5
相关论文
共 50 条
  • [21] Interference Reduction and Capacity Improvement in Collaborative Beamforming Networks via Directivity Optimization
    Jayaprakasam, Suhanya
    Rahim, Sharul Kamal Abdul
    Leow, Chee Yen
    Ting, Tiew On
    2015 2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS, AND CONTROL TECHNOLOGY (I4CT), 2015,
  • [22] Pairwise colliding permutations and the capacity of infinite graphs
    Körner, J
    Malvenuto, C
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (01) : 203 - 212
  • [23] Collaborative Network Capacity
    Mischen, Pamela A.
    PUBLIC MANAGEMENT REVIEW, 2015, 17 (03) : 380 - 403
  • [25] Maximally informative pairwise interactions in networks
    Fitzgerald, Jeffrey D.
    Sharpee, Tatyana O.
    PHYSICAL REVIEW E, 2009, 80 (03)
  • [26] Pairwise alignment of protein interaction networks
    Koyutürk, M
    Kim, Y
    Topkara, U
    Subramaniam, S
    Szpankowski, W
    Grama, A
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (02) : 182 - 199
  • [27] On the existence of pairwise stable weighted networks
    Bich, Philippe
    Morhaim, Lisa
    Mathematics of Operations Research, 2020, 45 (04): : 1393 - 1404
  • [28] Pairwise Relational Networks for Face Recognition
    Kang, Bong-Nam
    Kim, Yonghyun
    Kim, Daijin
    COMPUTER VISION - ECCV 2018, PT II, 2018, 11206 : 646 - 663
  • [29] Designing networks with bounded pairwise distance
    Massachusetts Inst of Technology, United States
    Conf Proc Annu ACM Symp Theory Comput, (750-759):
  • [30] On the Existence of Pairwise Stable Weighted Networks
    Bich, Philippe
    Morhaim, Lisa
    MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (04) : 1393 - 1404