Auction Game-Based Bandwidth Allocation for Relay Networks in a Crowded Environment

Abstract

This paper addresses the problem that the operator cannot provide satisfactory network services in the high-load crowded areas. The mobile devices were exploited as relays to help the operator forward data, which enhances the quality of the network services and expand the operator's business scope. However, the devices are selfish users and the bandwidth resources are scarcity and limited. To incent the devices working as relays, we built a novel auction game to maximize both the utilities of the operator and the relays, and make the maximum use of bandwidth resources. To derive the game equilibrium, we proposed a novel distributed dynamic iterative ascending algorithm where we first derive an optimal bandwidth allocation strategy for the operator based on the operator utility function and the relays' resource charging prices. Second, the optimal pricing strategy is obtained for each relay through deriving the game equilibrium. Finally, with the economic transactions, the selected relays complete the data transmission with the allocated bandwidth. Simulations demonstrate that the proposed auction game based non-equal bandwidth allocation strategy can significantly improve the operator's and the relays' utilities compared to traditional unchanged pricing strategies.