Auction-based Resource Allocation For Wireless Cooperative Relay Networks

Cooperative Communication using diversity technique against fading effects will be widely usedon wireless communications in future. Increasing number of studies concentrate on resourceallocation for cooperative relay networks because it is closely related to the system performance.The auction mechanism achieves optimal allocation of resources based on global optimal strategy.Power allocation for amplify-and-forward cooperative relay networks is considered in the firstplace. This thesis proposes an improved algorithm that aims at maximizing user’s utility andreducing the computational burden of users. The relay node, as an auctioneer, auctions off its power.A new pricing strategy is also designed for the auction. Simulation results illustrate the fastconvergence speed and wider coverage of the relay node using the proposed algorithm whichincreases the transmission capacity effectively.This thesis also discusses bandwidth allocation with the application of auction mechanism, andproposes an auction-based bandwidth allocation algorithm to enhance the network transmissioncapacity while ensuring fairness among different users. The process of bandwidth allocation forwireless cooperative network and the optimal bid for each user are analyzed in detailed. Simulationresults show that auction mechanism achieves the efficient bandwidth allocation in distributedfashion, and the complexity of the algorithm is low enough to meet computing performance forusers in distributed networks.In summary, this thesis researches on resource allocation based on auction mechanism forcooperative relay networks. The new algorithm widens coverage of relay nodes, and reducescomputational burden of users in distributed networks. The transmission capacity of the networkgets improved noticeably. Simulation results demonstrate the practical value of the new algorithm.