Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks

Diamond relay network model, as a basic transmission model, has recently been attracting considerable attention in wireless ad hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes for the Rayleigh fading scenario in the diamond relay network. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will be verified that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds. Copyright © 2009 John Wiley & Sons, Ltd. We put forward a new processing strategy in which buffers are employed at both relays in SRP mode. Theoretical analysis have shown that the throughput can be greatly improved at a cost of queuing delay by using this developed scheme. We also consider the tradeoff between the throughput and the additional queuing delay in theory.

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

[2]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[3]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[4]  Ashutosh Sabharwal,et al.  Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints , 2003, IPSN.

[5]  Eytan Modiano,et al.  Improving Delay in Ad-Hoc Mobile Networks Via Redundant Packet Transfers , 2003 .

[6]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[8]  Feng Xue,et al.  Cooperation in a Half-Duplex Gaussian Diamond Relay Channel , 2007, IEEE Transactions on Information Theory.

[9]  A. El Gamal,et al.  Relay-without-delay , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[11]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

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

[13]  Randall Berry,et al.  Throughput optimal control of cooperative relay networks , 2005, ISIT.

[14]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[15]  R. Gallager,et al.  The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[16]  J. Medhi,et al.  Stochastic models in queueing theory , 1991 .

[17]  Rick S. Blum,et al.  Delay-limited throughput of ad hoc networks , 2004, IEEE Transactions on Communications.

[18]  Rick S. Blum,et al.  Delay limited capacity of ad hoc networks: asymptotically optimal transmission and relaying strategy , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[20]  Abbas El Gamal,et al.  Relay Networks With Delays , 2007, IEEE Transactions on Information Theory.