Search

Unmanned aerial vehicles (UAVs) are widely deployed to enhance the wireless network capacity and to provide communication services to mobile users beyond the infrastructure coverage. Recently, with the help of a promising technology called network virtualization, multiple service providers (SPs) can share the infrastructures and wireless resources owned by the mobile network operators (MNOs). Then, they provide specific services to their mobile users using the resources obtained from MNOs. However, wireless resource sharing among SPs is challenging as each SP wants to maximize their utility/profit selfishly while satisfying the QoS requirement of their mobile users. Therefore, in this paper, we propose joint users association and wireless resource sharing problem in the cell-free UAVs-assisted wireless networks with the objective of maximizing the total network utility of the SPs while ensuring QoS constraints of their mobile users and the resource constraints of the UAVs deployed by MNOs. To solve the proposed mixed-integer non-convex problem, we decompose the proposed problem into two subproblems: users association, and resource sharing problems. Then, a two-sided matching algorithm is deployed in order to solve users association problem. We further deploy the whale optimization and Lagrangian relaxation algorithms to solve the resource sharing problem. Finally, extensive numerical results are provided in order to show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Inspired by the shared infrastructure of colocation data centers and the growth of Mobile Edge Computing (MEC), colocation MEC businesses have thrived to offer an economical and low latency solution for MEC based tenants. In colocation MEC, a colocation service provider leases spaces at the base stations (BSs) to tenants for housing their servers. Although the tenants fully manage their own servers, they still need to purchase bandwidth from the network provider to via bandwidth purchasing market to serve their users. As a result, tenants should consider the trade-off between delay and energy consumption, which are related to bandwidth and server computing speed, respectively. In this paper, an auction framework is used to model the interaction between the network provider and tenants in the bandwidth market. The network provider determines the bandwidth amount and corresponding payment by tenants based on their submitted bids, in which the valuation of the bandwidth amount in each bid is based on the coupling between bandwidth and server computing speed. The networking provider also seeks winners in the social welfare maximization problem, which is NP-hard. To solve this problem, we propose a solution based on the randomized auction mechanism, which is proved to be approximately truthful, individually rational, and computationally efficient. Simulation results verify the effectiveness of our proposed randomized auction scheme in bandwidth trading. [ABSTRACT FROM AUTHOR]