Distributed Matching Schemes for Multi-source and Multi-relay Cooperative Wireless Networks

Abstract

In this paper, we investigate how to assign source-relay pairs to achieve cooperative diversity for multi-source and multi-relay wireless networks. The problem of interest is formulated as a matching problem which can be modeled by a two-sided one-to-one matching game, i.e., a branch of coalitional games. The deferred acceptance procedure is introduced to solve the matching problem, and it turns out that a solution can always be found and is proved in the core of the coalitional game. Consequently, each node is satisfied with its final state and has no incentive to deviate, which leads to a stable matching state. Simulation results demonstrate that the proposed matching scheme has linear time complexity, which means the scheme is easy to implement. However, it can achieve comparable performance to that employing centralized optimal scheme in terms of total profit of the system.