Combinatorial optimization
Concurrent auctions across the supply chain
Proceedings of the 3rd ACM conference on Electronic Commerce
Truthful and Competitive Double Auctions
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal relay assignment for cooperative communications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Achieving budget-balance with Vickrey-based payment schemes in exchanges
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Auction-Based Resource Allocation for Cooperative Communications
IEEE Journal on Selected Areas in Communications
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
On one hand, cooperative communication has been gaining more and more popularity since it has great potential to increase the capacity of wireless networks. On the other hand, the applications of cooperative communication technology are rarely seen in reality, even in some scenarios where the demands for bandwidth-hungry applications have pushed the system designers to develop innovative network solutions. A main obstacle lying between the potential capability of channel capacity improvement and the wide adoption of cooperative communication is the lack of incentives for the participating wireless nodes to serve as relay nodes. Hence, in this paper, we design TASC, an auction scheme for the cooperative communications, where wireless node can trade relay services. TASC makes an important contribution of maintaining truthfulness while fulfilling other design objectives. We show analytically that TASC is truthful and has polynomial time complexity. Extensive experiments show that TASC can achieve multiple economic properties without significant performance degradation compared with pure relay assignment algorithms.