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 条
  • [31] Static pairwise annihilation in complex networks
    Laguna, MF
    Aldana, M
    Larralde, H
    Parris, PE
    Kenkre, VM
    PHYSICAL REVIEW E, 2005, 72 (02):
  • [32] On the existence and uniqueness of pairwise stable networks
    Tim Hellmann
    International Journal of Game Theory, 2013, 42 : 211 - 237
  • [33] Correction to: The computation of pairwise stable networks
    P. Jean-Jacques Herings
    Yang Zhan
    Mathematical Programming, 2024, 203 (1-2) : 475 - 476
  • [34] Collaborative List-and-Pairwise Filtering From Implicit Feedback
    Yu, Runlong
    Liu, Qi
    Ye, Yuyang
    Cheng, Mingyue
    Chen, Enhong
    Ma, Jianhui
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (06) : 2667 - 2680
  • [35] Pairwise mergers in bipartite matching games with an application in collaborative logistics
    Hezarkhani, Behzad
    OPERATIONS RESEARCH LETTERS, 2016, 44 (06) : 818 - 822
  • [36] Pairwise Probabilistic Matrix Factorization for Implicit Feedback Collaborative Filtering
    Li Gai
    Li Gai
    2014 INTERNATIONAL CONFERENCE ON SECURITY, PATTERN ANALYSIS, AND CYBERNETICS (SPAC), 2014, : 181 - 190
  • [37] Pairwise probabilistic matrix factorization for implicit feedback collaborative filtering
    Li, Gai
    Ou, Weihua
    NEUROCOMPUTING, 2016, 204 : 17 - 25
  • [38] On the heat-capacity change of pairwise hydrophobic interactions
    Graziano, G
    JOURNAL OF CHEMICAL PHYSICS, 2005, 123 (03):
  • [39] A comparison of algorithms for the pairwise alignment of biological networks
    Clark, Connor
    Kalita, Jugal
    BIOINFORMATICS, 2014, 30 (16) : 2351 - 2359
  • [40] Pairwise Gaussian Loss for Convolutional Neural Networks
    Qin, Yuxiang
    Yan, Chungang
    Liu, Guanjun
    Li, Zhenchuan
    Jiang, Changjun
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (10) : 6324 - 6333