8 September 2020 in IEEE Transactions on Vehicular Technology
Multi-access edge computing (MEC) has emerged as a promising paradigm because of its good performance for computation-intensive and latency-critical applications. However, the enormous computing requests from computation service subscribers (CSSs) still cannot be satisfied by pre-existing edge computation nodes (ECNs). To fully utilize the advantage of the MEC network, a hierarchical computation offloading framework is developed under network virtualization (NV) scenario. Accordingly, a two-step sequential process is designed to stimulate the proposed framework. In the first step, an incentive mechanism is proposed in which more temporary ECNs can be motivated by MEC operator and then join the MEC network. Without perfect ECN information, the optimal contract items (the ECN's CPU contribution and reward) between the MEC operator and ECNs can be achieved by taking account of individual rationality (IR) and incentive compatible (IC) constraints. After acquiring the ECNs' CPU contributions, the computing resource allocation problem between the ECNs and CSSs is then considered in the second step. Since the CSSs have private information, a Bayesian matching game with externality is leveraged to model the problem. Whereas, the conventional resident-oriented Gale-Shapley (RGS) algorithm cannot ensure the stability. Hence, an iterative matching algorithm that can always converge to stable results is developed. Finally, simulation results demonstrate that our proposed two-step sequential decision process can significantly improve social welfare considering the practical scenarios, with reasonable computational complexity.
27 May 2020 in IEEE Transactions on Intelligent Transportation Systems
Electric Vehicle (EV) public charging is important to meet the exploding charging demand and to address the range anxiety issue. In this paper, we focus on the EV public charging market with heterogeneous charging stations (CSs) under the time-based billing model. We jointly consider the charging time optimization for EVs, the EV-CS pairing, and the pricing mechanism for CSs. A hierarchical game, which mathematically corresponds to an equilibrium problem with equilibrium constraints (EPEC), is then developed to formulate the three coupled problems. In the proposed hierarchical game, each CS sets the charging price to maximize its own revenue first, then the EVs choose their desired CSs and determine the charging time. We analyze the optimal charging time strategies for EVs, and a many-to-one matching algorithm is applied to solve the EV-CS pairing problem. Besides, a block coordinate descent (BCD) based algorithm is applied for each CS to solve the pricing problem. Simulation results show that our proposed schemes can achieve the performance improvement of the charging system.
1 May 2025 in IEEE Sensors Journal
Underwater acoustic sensor networks (UASNs) play a crucial role in marine data collection. However, due to harsh underwater channel conditions and the finite energy supply of sensor nodes, underwater data transmission faces difficulties such as low reliability, limited spectrum, and constrained energy resources. How to ensure the performance of UASNs, such as network lifetime and energy efficiency (EE), under limited resources is a critical problem that needs to be addressed. To tackle these challenges, a matching game-based approach for relay selection and power allocation is proposed in this paper. Specifically, we model the network lifetime maximization (NLM) problem under resource constraints as a matching game problem, and develop an iterative matching algorithm based on NLM to ensure stable outcomes for relay selection and power allocation. Additionally, we devise a power allocation algorithm focused on energy efficiency to enhance system EE while guaranteeing NLM. The simulation results show that the proposed strategy greatly surpasses other benchmark algorithms in extending network lifetime and optimizing EE, validating its effectiveness and practicality.
29 December 2023 in IEEE Internet of Things Journal
With the rapid development of autonomous driving and edge computing, vehicular edge computing (VEC) has become an emerging paradigm that allows vehicles with abundant computational resources to work as edge nodes. By introducing vehicles as infrastructures, VEC has the potential to improve users’ quality of experience and decrease operator’s deployment expenditure, especially for hot spots. In this article, a novel VEC-based resource reservation framework is designed to handle the time-varying computation requests. To articulate realistic scenarios, the online durations of provider vehicles (PVs) are assumed to be different. Besides, the PVs will not always be online to wait for the reservation assignment for the limited revenue, i.e., the PVs are dynamic and the computational resource reservation points (CRRPs) are static. In this way, dynamic matching is leveraged to model the interaction between the PVs and CRRPs. To prevent the CRRPs from manipulating their preferences for better partners, a strategy-proof and stable resource reservation algorithm is proposed to ensure all CRRPs are truthful during the resource reservation procedure. Finally, numerical simulation results are presented to validate the proofness, truthfulness, and performance of our proposed resource reservation algorithm.