On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol

In this paper, we consider large multi-pair relay networks with K fixed source-destination pairs and M relays randomly distributed in a given area, where each node is equipped with a single antenna and works on half duplex. Each source communicates with its corresponding destination under the aid of...

Full description

Bibliographic Details
Main Authors: Yu Zhang, Zhaoyang Zhang, Li Ping, Xiaoming Chen, Caijun Zhong
Format: Article
Language:English
Published: IEEE 2017-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/7891545/
id doaj-a121db6664d947138b249d6829184f54
record_format Article
spelling doaj-a121db6664d947138b249d6829184f542021-03-29T20:08:33ZengIEEEIEEE Access2169-35362017-01-0155882589510.1109/ACCESS.2017.26903107891545On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying ProtocolYu Zhang0https://orcid.org/0000-0002-9736-8244Zhaoyang Zhang1Li Ping2Xiaoming Chen3https://orcid.org/0000-0002-1818-2135Caijun Zhong4College of Information Engineering, Zhejiang University of Technology, Hangzhou, ChinaCollege of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, ChinaDepartment of Electronic Engineering, City University of Hong Kong, Hong KongCollege of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, ChinaCollege of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, ChinaIn this paper, we consider large multi-pair relay networks with K fixed source-destination pairs and M relays randomly distributed in a given area, where each node is equipped with a single antenna and works on half duplex. Each source communicates with its corresponding destination under the aid of the relays. With the conventional two-slot relaying protocol, the sum capacity was found to scale as (K/2) log(M) + O(1), where K is fixed and M → ∞. This paper proves that the capacity scaling law can be further improved to K log(M) + O(1) with successive relaying protocol, as if the relays became "full duplex." To prove the scaling law, a distributed amplify-and-forward scheme is proposed, which only requires local channel state information (CSI) at each relay and statistical global CSI at the sources and destinations. Furthermore, we prove that imperfect CSI at the relays would not affect the scaling law.https://ieeexplore.ieee.org/document/7891545/Large relay networkscapacity scaling lawsuccessive relaying protocolamplify-and-forward
collection DOAJ
language English
format Article
sources DOAJ
author Yu Zhang
Zhaoyang Zhang
Li Ping
Xiaoming Chen
Caijun Zhong
spellingShingle Yu Zhang
Zhaoyang Zhang
Li Ping
Xiaoming Chen
Caijun Zhong
On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
IEEE Access
Large relay networks
capacity scaling law
successive relaying protocol
amplify-and-forward
author_facet Yu Zhang
Zhaoyang Zhang
Li Ping
Xiaoming Chen
Caijun Zhong
author_sort Yu Zhang
title On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
title_short On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
title_full On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
title_fullStr On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
title_full_unstemmed On the Capacity Scaling of Large Multipair Relay Networks With Successive Relaying Protocol
title_sort on the capacity scaling of large multipair relay networks with successive relaying protocol
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2017-01-01
description In this paper, we consider large multi-pair relay networks with K fixed source-destination pairs and M relays randomly distributed in a given area, where each node is equipped with a single antenna and works on half duplex. Each source communicates with its corresponding destination under the aid of the relays. With the conventional two-slot relaying protocol, the sum capacity was found to scale as (K/2) log(M) + O(1), where K is fixed and M → ∞. This paper proves that the capacity scaling law can be further improved to K log(M) + O(1) with successive relaying protocol, as if the relays became "full duplex." To prove the scaling law, a distributed amplify-and-forward scheme is proposed, which only requires local channel state information (CSI) at each relay and statistical global CSI at the sources and destinations. Furthermore, we prove that imperfect CSI at the relays would not affect the scaling law.
topic Large relay networks
capacity scaling law
successive relaying protocol
amplify-and-forward
url https://ieeexplore.ieee.org/document/7891545/
work_keys_str_mv AT yuzhang onthecapacityscalingoflargemultipairrelaynetworkswithsuccessiverelayingprotocol
AT zhaoyangzhang onthecapacityscalingoflargemultipairrelaynetworkswithsuccessiverelayingprotocol
AT liping onthecapacityscalingoflargemultipairrelaynetworkswithsuccessiverelayingprotocol
AT xiaomingchen onthecapacityscalingoflargemultipairrelaynetworkswithsuccessiverelayingprotocol
AT caijunzhong onthecapacityscalingoflargemultipairrelaynetworkswithsuccessiverelayingprotocol
_version_ 1724195227660451840