A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Reliable and energy-efficient routing protocol in dense wireless sensor networks
International Journal of Sensor Networks
IEEE Transactions on Mobile Computing
Multi-hop mesh cooperative structure based data dissemination for wireless sensor networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
IEEE Transactions on Communications
Cooperative Protocols Design for Wireless Ad-Hoc Networks with Multi-hop Routing
Mobile Networks and Applications
Cooperative communications with relay selection for QoS provisioning in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A game theory approach to selection diversity in wireless ad-hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Game theory for cognitive radio networks: An overview
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multinode Cooperative Communications in Wireless Networks
IEEE Transactions on Signal Processing
Cooperative Communications with Outage-Optimal Opportunistic Relaying
IEEE Transactions on Wireless Communications
A game-theoretic analysis of decode-and-forward user cooperation
IEEE Transactions on Wireless Communications - Part 2
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative communication in wireless networks
IEEE Communications Magazine
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
For full cooperative diversity gains to be achieved while still maintaining spectral and energy efficiency, relay assignment schemes for cooperative communications have been extensively studied in recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. However, it is challenging to find the optimal relay in distributed wireless networks because of the dynamic nature of such networks. In this paper, we first formulate the problem of relay assignment as a noncooperative, mixed-strategy, repeated game, where relaying candidates are modeled as rational players. We then propose a game-theory-based relay assignment scheme GTRA, in which each player plays against all the other players and determines whether to cooperate with a communication link on a packet-by-packet basis in a distributed manner. To adapt to dynamic environments, players utilized an adaptive learning algorithm, that is, modified-regret-matching algorithm, to learn optimal strategies of relay assignment, as well as to orient the game to converge to a set of correlated equilibriums, which is often more system efficient than a Nash equilibrium. To evaluate the performance of GTRA, we compare it with BR, a fictitious two-player game-based approach. Simulation results have shown that GTRA outperforms BR in terms of network throughput, especially in environments where the channel fading becomes severe. It is also shown that GTRA can converge to a correlated equilibrium in a short period that enables the GTRA to work well in dynamic environments. Copyright © 2011 John Wiley & Sons, Ltd.