An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems

A mobile cloud computing system is composed of heterogeneous services and resources to be allocated by the cloud service provider to mobile cloud users. On one hand, some of these resources are substitutable (e.g., users can use storage from different places) that they have similar functions to the users. On the other hand, some resources are complementary that the user will need them as a bundle (e.g., users need both wireless connection and storage for online photo posting). In this paper, we first model the resource allocation process of a mobile cloud computing system as an auction mechanism with premium and discount factors. The premium and discount factors indicate complementary and substitutable relations among cloud resources provided by the service provider. Then, we analyze the individual rationality and incentive compatibility (truthfulness) properties of the users in the proposed auction mechanism. The optimal solutions of the resource allocation and cost charging schemes in the auction mechanism is discussed afterwards

Cloud Compute-and-Forward with Relay Cooperation

We study a cloud network with M distributed receiving antennas and L users, which transmit their messages towards a centralized decoder (CD), where M>=L. We consider that the cloud network applies the Compute-and-Forward (C&F) protocol, where L antennas/relays are selected to decode integer equations of the transmitted messages. In this work, we focus on the best relay selection and the optimization of the Physical-Layer Network Coding (PNC) at the relays, aiming at the throughput maximization of the network. Existing literature optimizes PNC with respect to the maximization of the minimum rate among users. The proposed strategy maximizes the sum rate of the users allowing nonsymmetric rates, while the optimal solution is explored with the aid of the Pareto frontier. The problem of relay selection is matched to a coalition formation game, where the relays and the CD cooperate in order to maximize their profit. Efficient coalition formation algorithms are proposed, which perform joint relay selection and PNC optimization. Simulation results show that a considerable improvement is achieved compared to existing results, both in terms of the network sum rate and the players' profits.Comment: Submitted to IEEE Transactions on Wireless Communication