Di Zhang

Di Zhang

Auto-generated profile, based on publicly available information

Di Zhang

School of Software Engineering, Beijing Jiaotong University, Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 December 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JHJunyi He
Junyi He
DZDi Zhang
Di Zhang
YZYuezhi Zhou
Yuezhi Zhou
YZYaoxue Zhang
Yaoxue Zhang
Collaborative computation offloading in Mobile Edge Computing (MEC) where edge users offload tasks opportunistically to resourceful neighboring mobile devices (MDs), offers a promising solution to satisfy low-latency requirements. However, most existing works assume that those MDs volunteer to help edge users without an incentive mechanism. In this paper, we propose an auction-based incentive mechanism, where users and MDs participate in the system dynamically. Our auction mechanism runs in the online fashion and optimizes the long-term system welfare without knowledge of future information, e.g, task start time, task length, resource demand, and valuation, etc. We prove that the proposed online mechanism achieves the desired properties, including individual rationality, truthfulness, and computational tractability. Moreover, the theoretical competitive ratio shows that our online mechanism achieves near-optimal long-term social welfare close to the offline optimum. Extensive experiments based on real-world traces demonstrate the efficiency of the proposed online mechanism.

26 October 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
DZDi Zhang
Di Zhang
YFYujian Fang
Yujian Fang
YZYuezhi Zhou
Yuezhi Zhou
JHJunyi He
Junyi He
YZYaoxue Zhang
Yaoxue Zhang
Device-to-device (D2D) content sharing holds great promise to alleviate the growing strain on cellular networks, as it offloads popular content data onto direct peer-to-peer links. However, it is still unexplored how content sharing could benefit from utilizing multihop rather than the conventional single-hop D2D communications. As a step towards this end, this paper proposes a game theoretic approach to enable D2D content sharing with multihop communication capabilities. Given a subset of participants, a Nash bargaining game is modeled to provide the routing and pricing graphs, where a novel incentive mechanism is adopted to stimulate cooperation. By iteratively evaluating the solution of the Nash bargaining subgame, participants that include content sources and transmission relays are determined, which ensures that all participants make contributions to the content sharing process. An additional procedure termed pricing plan is introduced to make sure that the final pricing graph is practical and feasible in terms of D2D communication. Experimental results are presented to demonstrate that the proposed game theoretic approach could not only jointly deal with the participants selection, routing, and pricing problems in multihop D2D content sharing, but also effectively restrict utilities and transmission resources to only contributive participants.

18 April 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JHJunyi He
Junyi He
DZDi Zhang
Di Zhang
JRJu Ren
Ju Ren
YZYuezhi Zhou
Yuezhi Zhou
YZYaoxue Zhang
Yaoxue Zhang
User-initiated mobile data trading, where mobile devices trade their mobile data quota via personal hotspots, is a promising approach to improve resource utilization. Most existing works only consider the data size, while ignoring the data rate and temporal requirements. To fill this void, we propose a novel data trading marketplace, where mobile users trade Internet access continuously for a time period with a specific data rate with neighboring mobile devices. Each request is characterized by an arrival time, departure time, the demanded data rate, and a value for getting services. To achieve the most system efficiency, we formulate an integer linear programming problem to maximize the total social welfare, which takes the data rate and temporal requirements into account. We next consider two request models: 1) a homogeneous request model and 2) a heterogeneous request model. In the homogeneous request model, all the requests demand the overall system lifetime, and we propose a computationally efficient auction that makes allocation decisions for all the requests simultaneously. In the heterogeneous request model, all the requests require different Internet access periods and dynamic arrive. Upon requests’ arrival, the system must make real-time allocations without the availability of future information. To jointly deal with requesters’ multidimensional private information (i.e., the arrival/departure time, demanded data rate, and the value), and the uncertainty about future arrival requests, we propose a multi-round online auction. Theoretical analysis shows that both the auctions satisfy the desired properties, including individual rationality, truthfulness, and computational efficiency. Simulation results show the efficiency of the proposed auctions.

10 April 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MGMin Guo
Min Guo
DZDi Zhang
Di Zhang
WXWeiwei Xing
Weiwei Xing
Xun ShaoXun Shao
Xun Shao
ZLZhi Liu
Zhi Liu
YZYaoxue Zhang
Yaoxue Zhang
By caching and transcoding video files on edge servers, video edge caching (VEC) can alleviate network congestion and improve user experience. To achieve this, VEC needs to address resource allocation and pricing problems and develop caching and transcoding strategies. However, existing works have not effectively coordinated and resolved these issues. Towards this end, we propose a game-theoretic multi-bitrate video caching and processing method for VEC. Specifically, to address these interdependent issues concurrently, we first incorporate multidimensional strategies into the system model and formalize the profit maximization problems of the network service provider and multiple video providers (VPs) as a constrained multi-objective optimization problem. Second, we transform the problem into a Stackelberg game and identify a Nash equilibrium as the solution. To solve the game problem, we decompose the game process into two stages focusing on resource competition and price determination, respectively. Then, we address the problems of transcoding and caching strategies development, and resource allocation in parallel across varying resource price conditions. The transcoding strategy is determined based on the constraints imposed by delay, value, and the source video. For the caching strategy development and resource allocation, we transform them into two grouped knapsack problems and apply the “dominant strategy" from game theory to identify the “feasible strategy" of VPs. Finally, we determine the resource prices in a traversal manner. Theoretical analysis shows that our proposed method achieves the optimal solution. Experimental results show that our algorithm achieve a 6.04% increase in overall profit compared to the greedy strategy algorithm.