Opportunistic user cooperative relaying in TDMA-based wireless networks

This paper proposes a novel protocol based on cooperative relaying between users. The protocol takes advantage of the fact that data traffic is bursty and silent periods exist between data bursts. Rather than wasting these idle time slots, users can take advantage of them to perform cooperative relaying, obviating the need for dedicated system resources for relaying, hence using the spectrum more efficiently. The benefit of this user cooperation for the higher network layers is analyzed. The system was modeled in terms of the maximum stability region and the maximum stable throughput. Our results show that our proposed protocol provides significant performance gains compared to conventional time-division multiple-access (TDMA) systems, as well as cooperative relaying protocols, namely selection relaying and incremental relaying. Copyright © 2009 John Wiley & Sons, Ltd. A cooperative relaying protocol for user in TDMA-based wireless networks by taking advantage of the idle time-slot is proposed. The theoretical models for evaluating the impacts caused by user cooperation to the upper network layers are characterized. These models describe the relationship between cooperation benefit and system parameters, such as user resource allocation ratio and traffic arrival rate and they can be used to instruct the resource allocation in the wireless networks with user cooperative relaying.

[1]  Aria Nosratinia,et al.  Diversity through coded cooperation , 2006, IEEE Transactions on Wireless Communications.

[2]  Anthony Ephremides,et al.  On the stability of interacting queues in a multiple-access system , 1988, IEEE Trans. Inf. Theory.

[3]  Aria Nosratinia,et al.  Grouping and partner selection in cooperative wireless networks , 2007, IEEE Journal on Selected Areas in Communications.

[4]  B. Hassibi,et al.  Distributed space-time codes in wireless relay networks , 2004, Processing Workshop Proceedings, 2004 Sensor Array and Multichannel Signal.

[5]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[6]  K. J. Ray Liu,et al.  Multinode Cooperative Communications in Wireless Networks , 2007, IEEE Transactions on Signal Processing.

[7]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[9]  Frank H. P. Fitzek,et al.  Defining 4G technology from the users perspective , 2006, IEEE Network.

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

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

[12]  Tinku Mohamed Rasheed,et al.  A Novel Dimension of Cooperation in 4G , 2008, IEEE Technology and Society Magazine.

[13]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[14]  Yindi Jing,et al.  Distributed Space-Time Coding in Wireless Relay Networks , 2006, IEEE Transactions on Wireless Communications.

[15]  Tian He,et al.  Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links , 2007, SenSys '07.

[16]  Aria Nosratinia,et al.  Cooperative communication in wireless networks , 2004, IEEE Communications Magazine.

[17]  Aggelos Bletsas,et al.  A simple Cooperative diversity method based on network path selection , 2005, IEEE Journal on Selected Areas in Communications.

[18]  Anthony Ephremides,et al.  On the throughput, capacity, and stability regions of random multiple access , 2005, IEEE Transactions on Information Theory.

[19]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[20]  Stephen B. Wicker,et al.  Game theory and the design of self-configuring, adaptive wireless networks , 2001, IEEE Commun. Mag..

[21]  Wei Luo,et al.  Stability of N interacting queues in random-access systems , 1999, IEEE Trans. Inf. Theory.

[22]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  K. J. Ray Liu,et al.  Cognitive multiple access via cooperation: Protocol design and performance analysis , 2007, IEEE Transactions on Information Theory.

[24]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..