Double auction-based optimal relay assignment for many-to-many cooperative wireless networks

Recently, as it can increase the capacity of wireless networks greatly through spatial diversity by taking advantage of antennas on other nodes, cooperative communication (CC) has been obtaining more and more attention. However, as the selfish nature, the wireless node may be unwilling to serve as relay node if they can't get the corresponding reward. In this paper, we constructs a real double-auction scenario between source nodes and relay nodes instead of idealized truthful market which may obtain relatively lower system performance. We consider the system performance involving (1) successful source-relay pairs, (2) system capacity and (3) social welfare (SW). We transform the double auction-based optimal relay assignment problem into Maximum Matching (MM) and Maximum Weighted Matching (MWM) problem respectively and solve them using corresponding algorithms. Extensive experiments show that this mechanism can achieve higher system efficiency than truthful auction.