A new scaling law on throughput and delay performance of wireless mobile relay networks over parallel fading channels

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing mobile relay network. The proposed scheme achieves the maximum throughput of Θ(log K) at a cost of O(1) total transmission power and O(K=q) average end-to-end packet delay, where 0 ≪ q ≤ ½ measures the speed of relays' mobility. It can be proved that this system throughput is unattainable for the existing designs with low relay mobility. Therefore, the proposed relay scheme can exploit the time diversity and relays' mobility more efficiently.

[1]  Sanjeev R. Kulkarni,et al.  Broadcast-relay channel: capacity region bounds , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[3]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[4]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[6]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[7]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[8]  Helmut Bölcskei,et al.  Capacity scaling laws in MIMO relay networks , 2006, IEEE Transactions on Wireless Communications.

[9]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[10]  A. Host-Madsen,et al.  A new achievable rate for cooperative diversity based on generalized writing on dirty paper , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[11]  Zhen Zhang,et al.  Partial converse for a relay channel , 1988, IEEE Trans. Inf. Theory.

[12]  Yingbin Liang,et al.  Rate Regions for Relay Broadcast Channels , 2006, IEEE Transactions on Information Theory.

[13]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[14]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[15]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[16]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[17]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple level relay channel , 2004, ISIT.

[20]  Venkatesh Saligrama,et al.  Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime , 2006, IEEE Transactions on Information Theory.

[21]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[22]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.