30 June 2020 in Wireless Communications and Mobile Computing
In the scenario of mobile fog computing (MFC), communication between vehicles and fog layer, which is called vehicle-to-fog (V2F) communication, needs to use bandwidth resources as much as possible with low delay and high tolerance for errors. In order to adapt to these harsh scenarios, there are important technical challenges concerning the combination of network coding (NC) and multipath transmission to construct high-quality V2F communication for cloud-aware MFC. Most NC schemes exhibit poor reliability in burst errors that often occur in high-speed movement scenarios. These can be improved by using interleaving technology. However, most traditional interleaving schemes for multipath transmission are designed based on round robin (RR) or weighted round robin (WRR), in practice, which can waste a lot of bandwidth resources. In order to solve those problems, this paper proposes a novel multipath transmission scheme for cloud-aware MFC, which is called Bidirectional Selection Scheduling (BSS) scheme. Under the premise of realizing interleaving, since BSS can be used in conjunction with a lot of path scheduling algorithms based on Earliest Delivery Path First (EDPF), it can make better use of bandwidth resources. As a result, BSS has high reliability and bandwidth utilization in harsh scenarios. It can meet the high-quality requirements of cloud-aware MFC for transmission.
10 April 2025 in IEEE Internet of Things Journal
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.