Searcharxiv⌕ Search

arXiv subjects

Tiankui Zhang

Publications and source records attributed to Tiankui Zhang.

20 records · Page 2Linked to original sources

Joint Computation and Communication Design for UAV-Assisted Mobile Edge Computing in IoT

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is a prominent concept, where a UAV equipped with a MEC server is deployed to serve a number of terminal devices (TDs) of Internet of Things (IoT) in a finite period. In this paper, each TD has a certain latency-critical computation task in each time slot to complete. Three computation strategies can be available to each TD. First, each TD can operate local computing by itself. Second, each TD can partially offload task bits to the UAV for computing. Third, each TD can choose to offload task bits to access point (AP) via UAV relaying. We propose a new optimization problem formulation that aims to minimize the total energy consumption including communication-related energy, computation-related energy and UAV's flight energy by optimizing the bits allocation, time slot scheduling and power allocation as well as UAV trajectory design. As the formulated problem is non-convex and difficult to find the optimal solution, we solve the problem by two parts, and obtain the near optimal solution with within a dozen of iterations. Finally, numerical results are given to validate the proposed algorithm, which is verified to be efficient and superior to the other benchmark cases.

eess.SP↗

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

In device-to-device (D2D)-enabled caching cellular networks, the user terminals (UTs) collaboratively store and share a large volume of popular contents from the base station (BS) for traffic offloading and delivery delay reduction. In this article, the multi-winner auction based caching placement in D2D-enabled caching cellular networks is investigated for UT edge caching incentive and content caching redundancy reduction. Firstly, a multi-winner once auction for UT edge caching is modeled which auctions multiple contents for multiple UTs. Then the optimization problem for content caching revenue maximization is formulated. Specifically, the "cache conflict" restriction relationship among UTs is used as one of the constraints in the problem to reduce the content caching redundancy in a UT movement scenario. The problem is solved by semidefinite programming (SDP) relaxation to obtain an approximate optimal caching placement. Moreover, the payment strategy of the auction is developed as a Nash bargaining game for personal profit fairness among the UTs who win the auction for content caching. Subsequently, a multi-winner once auction based caching (MOAC) placement algorithm is proposed. In addition, due to the high complexity of MOAC, we further propose a heuristic multi-winner repeated auction based caching placement (MRAC) algorithm, which can greatly reduce the complexity with only tiny performance loss. Simulation results show that the proposed algorithms can reduce the traffic load and average content access delay effectively compared with the existing caching placement algorithms.

cs.NI↗