Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
IEEE Transactions on Communications
Linear detection for the nonorthogonal amplify and forward protocol
IEEE Transactions on Wireless Communications
Distributed relay-source matching for cooperative wireless networks using two-sided market games
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Multicast scaling laws with hierarchical cooperation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity Scaling in Mobile Wireless Ad Hoc Network with Infrastructure Support
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Speed Improves Delay-Capacity Trade-Off in MotionCast
IEEE Transactions on Parallel and Distributed Systems
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
CoopMAC: A Cooperative MAC for Wireless LANs
IEEE Journal on Selected Areas in Communications
Coalitions in Cooperative Wireless Networks
IEEE Journal on Selected Areas in Communications
A Game Theoretical Framework for Dynamic Pricing-Based Routing in Self-Organized MANETs
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
In this paper, an assignment game approach is proposed for relay selection and stimulating the cooperative behaviors of the relays in wireless networks. The sources should pay the relays for their cost energy in cooperative transmissions. The relays compete with each other to earn virtual currency from the assisted sources. The equilibrium concept in such games is called core. Such solutions correspond to the price-lists that competitively balance the benefits of all sources and relays. When the price assumes only discrete values, the core is transformed into discrete core. The non-empty core is ensured by the generalized condition named Gross Substitute (GS). We show that when one source is allowed to select at most one relay, GS always holds. However, if one source can select multiple relays, whether GS holds or not depends on the nature of the cooperative protocol and utility functions of the sources. We explore a scenario where GS does not hold for a multi-relay protocol. Subsequently, under GS condition, the Distributed Source-Relay Assignment (DSRA) Algorithm is proposed to get a discrete core solution of the game. With small enough measurement of price, the algorithm can achieve the optimal performance compared with centralized one in terms of total profit of the system.