Distributed Resource Allocation in 5G Cellular Networks

Abstract

of economics, is a promising concept for distributed resource management in wireless networks. The matching theory allows low-complexity algorithmic manipulations to provide a decentralized self-organizing solution to the resource allocation problems. In matching-based resource allocation, each of the agents (e.g., radio resources and transmitter nodes) ranks the opposite set using a preference relation. The solution of the matching is able to assign the resources with the transmitters depending on the preferences. The message passing approach for resource allocation provides low (e.g., polynomial time) complexity solution by distributing the computational load among the nodes in the network. In the radio resource allocation problems, the decision making agents (e.g., radio resources and the transmitters) form a virtual graphical structure. Each node computes and exchanges simple messages with neighboring nodes in order to nd the solution of the resource allocation problem. Similar to matching based allocation, auction method is also inherited from economics and used in wireless resource allocation problems. Resource allocation algorithms based on auction method provides polynomial complexity solution which are shown to output near-optimal performance. The auction process evolves with a bidding process, in which unassigned agents (e.g., transmitters) raise the cost and bid for resources simultaneously. Once the bids from all the agents are available, the resources are assigned to the highest bidder. We illustrate each of the modeling schemes with respect to a practical radio resource allocation problem. In particular, we consider a multi-tier network consisting a macro base station (MBS), a set of small cell