Linear programming 1: introduction
Linear programming 1: introduction
IEEE Transactions on Mobile Computing
IEEE Transactions on Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Pricing for enabling forwarding in self-configuring ad hoc networks
IEEE Journal on Selected Areas in Communications
A simple Cooperative diversity method based on network path selection
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.00 |
In this paper, we address the incentive-based relay-selection problem over multi-source and multi-relay wireless networks. A two-side market game approach is employed to jointly consider the benefits of all sources and relays. The equilibrium concept in such games is called core. The outcomes in the core of the game cannot be improved upon by any subset of players. These outcomes correspond exactly to the price-lists that competitively balance the benefits of all sources and relays. When the price assumes only discrete values, the core of the game is defined as discrete core. The Distributed Source-Relay Assignment (DSRA) algorithm is proposed for competitive price adjustment and converges to the discrete core 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.