Junhao Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Junhao Feng has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Zhenyu Zhou
North China Electric Power University
6 shared publications - Shahid Mumtaz
Silesian University of Technology
3 shared publications Jonathan Rodriguez
University of South Wales, PontyPridd, U.K.
2 shared publications- Mohsen Guizani
Mohamed bin Zayed University of Artificial Intelligence
2 shared publications - Bo Ai
Beijing Jiaotong University
1 shared publication Bo Gu
Department of Information and Communications Engineering, Kogakuin University, Tokyo, 192-0015, Japan
1 shared publication
Latest Publications
- 15 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (5) , 5087-5099
Energy-Efficient Edge Computing Service Provisioning for Vehicular Networks: A Consensus ADMM Approach
In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via vehicle-to-infrastructure links. However, how to determine the optimal portion of workload to be offloaded based on the dynamic states of energy consumption and latency in local computing, data transmission, workload execution and handover, is still an open issue. In this paper, we study the energy-efficient workload offloading problem and propose a low-complexity distributed solution based on consensus alternating direction method of multipliers. By incorporating a set of local variables for each UE, the original problem, in which the optimization variables of UEs are coupled together, is transformed into an equivalent general consensus problem with separable objectives and constraints. The consensus problem can be further decomposed into a bunch of subproblems, which are distributed across UEs and solved in parallel simultaneously. Finally, the proposed solution is validated based on a realistic road topology of Beijing, China. Simulation results have demonstrated that significant energy saving gain can be achieved by the proposed algorithm.
- 15 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (5) , 5087-5099
Energy-Efficient Edge Computing Service Provisioning for Vehicular Networks: A Consensus ADMM Approach
In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via vehicle-to-infrastructure links. However, how to determine the optimal portion of workload to be offloaded based on the dynamic states of energy consumption and latency in local computing, data transmission, workload execution and handover, is still an open issue. In this paper, we study the energy-efficient workload offloading problem and propose a low-complexity distributed solution based on consensus alternating direction method of multipliers. By incorporating a set of local variables for each UE, the original problem, in which the optimization variables of UEs are coupled together, is transformed into an equivalent general consensus problem with separable objectives and constraints. The consensus problem can be further decomposed into a bunch of subproblems, which are distributed across UEs and solved in parallel simultaneously. Finally, the proposed solution is validated based on a realistic road topology of Beijing, China. Simulation results have demonstrated that significant energy saving gain can be achieved by the proposed algorithm.
- Top Cited Papers
- 23 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (4) , 3113-3125
Computation Resource Allocation and Task Assignment Optimization in Vehicular Fog Computing: A Contract-Matching Approach
Vehicular fog computing (VFC) has emerged as a promising solution to relieve the overload on the base station and reduce the processing delay during the peak time. The computation tasks can be offloaded from the base station to vehicular fog nodes by leveraging the under-utilized computation resources of nearby vehicles. However, the wide-area deployment of VFC still confronts several critical challenges, such as the lack of efficient incentive and task assignment mechanisms. In this paper, we address the above challenges and provide a solution to minimize the network delay from a contract-matching integration perspective. First, we propose an efficient incentive mechanism based on contract theoretical modeling. The contract is tailored for the unique characteristic of each vehicle type to maximize the expected utility of the base station. Next, we transform the task assignment problem into a two-sided matching problem between vehicles and user equipment. The formulated problem is solved by a pricing-based stable matching algorithm, which iteratively carries out the “propose” and “price-rising” procedures to derive a stable matching based on the dynamically updated preference lists. Finally, numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
- 23 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (4) , 3113-3125
Top Cited PapersComputation Resource Allocation and Task Assignment Optimization in Vehicular Fog Computing: A Contract-Matching Approach
Vehicular fog computing (VFC) has emerged as a promising solution to relieve the overload on the base station and reduce the processing delay during the peak time. The computation tasks can be offloaded from the base station to vehicular fog nodes by leveraging the under-utilized computation resources of nearby vehicles. However, the wide-area deployment of VFC still confronts several critical challenges, such as the lack of efficient incentive and task assignment mechanisms. In this paper, we address the above challenges and provide a solution to minimize the network delay from a contract-matching integration perspective. First, we propose an efficient incentive mechanism based on contract theoretical modeling. The contract is tailored for the unique characteristic of each vehicle type to maximize the expected utility of the base station. Next, we transform the task assignment problem into a two-sided matching problem between vehicles and user equipment. The formulated problem is solved by a pricing-based stable matching algorithm, which iteratively carries out the “propose” and “price-rising” procedures to derive a stable matching based on the dynamically updated preference lists. Finally, numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
- Top Cited Papers
- 19 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5526-5538
When Mobile Crowd Sensing Meets UAV: Energy-Efficient Task Assignment and Route Planning
With increasing popularity of unmanned aerial vehicles (UAVs), it is foreseen that they will play an important role in broadening the horizon of mobile crowd sensing (MCS). Specifically, UAV-aided MCS allows autonomous data collection anytime anywhere due to the capability of fast deployment and controllable mobility. However, the on-board battery capacity of UAVs imposes a limitation on their endurance capability and performance. In this paper, we consider the fixed-wing UAV-aided MCS system, and investigate the corresponding joint route planning and task assignment problem from an energy efficiency perspective. The formulated joint optimization problem is transformed into a two-sided two-stage matching problem, in which the route planning problem is solved in the first stage based on either dynamic programming (DP) or genetic algorithms (GA), and the task assignment problem is addressed in the second stage by exploring the Gale-Shapley (GS) algorithm. We provide a comprehensive theoretical analysis, and elaborate the procedures of practical implementation. Numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
- 19 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5526-5538
Top Cited PapersWhen Mobile Crowd Sensing Meets UAV: Energy-Efficient Task Assignment and Route Planning
With increasing popularity of unmanned aerial vehicles (UAVs), it is foreseen that they will play an important role in broadening the horizon of mobile crowd sensing (MCS). Specifically, UAV-aided MCS allows autonomous data collection anytime anywhere due to the capability of fast deployment and controllable mobility. However, the on-board battery capacity of UAVs imposes a limitation on their endurance capability and performance. In this paper, we consider the fixed-wing UAV-aided MCS system, and investigate the corresponding joint route planning and task assignment problem from an energy efficiency perspective. The formulated joint optimization problem is transformed into a two-sided two-stage matching problem, in which the route planning problem is solved in the first stage based on either dynamic programming (DP) or genetic algorithms (GA), and the task assignment problem is addressed in the second stage by exploring the Gale-Shapley (GS) algorithm. We provide a comprehensive theoretical analysis, and elaborate the procedures of practical implementation. Numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1024-1029
Time-Dependent Pricing for On-Demand Bandwidth Slicing in Software Defined Networks
In this paper, we propose a time-dependent pricing (TDP) scheme for bandwidth consumption scheduling of multimedia streaming applications. By decoupling the network control functions from data delivery, software defined network (SDN) enables multimedia streaming users to negotiate their QoS parameters in a on-demand basis. Our key idea is to employ TDP as an incentive mechanism in SDN to motivate users to shift their delay-tolerant traffic demand, and free up resources for delay-sensitive applications in peak-time. Then, a Stackelberg game is formulated to analyze the interactions between the ISP and users. Next, we proposed a greedy algorithm to obtain the optimal congestion price and bandwidth slicing in each time slot based on real-time traffic load as well as users' preferences for delay. Finally, simulation results confirm that the proposed method can significantly flatten out traffic fluctuation.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1024-1029
Time-Dependent Pricing for On-Demand Bandwidth Slicing in Software Defined Networks
In this paper, we propose a time-dependent pricing (TDP) scheme for bandwidth consumption scheduling of multimedia streaming applications. By decoupling the network control functions from data delivery, software defined network (SDN) enables multimedia streaming users to negotiate their QoS parameters in a on-demand basis. Our key idea is to employ TDP as an incentive mechanism in SDN to motivate users to shift their delay-tolerant traffic demand, and free up resources for delay-sensitive applications in peak-time. Then, a Stackelberg game is formulated to analyze the interactions between the ISP and users. Next, we proposed a greedy algorithm to obtain the optimal congestion price and bandwidth slicing in each time slot based on real-time traffic load as well as users' preferences for delay. Finally, simulation results confirm that the proposed method can significantly flatten out traffic fluctuation.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Two-Stage Matching for Energy-Efficient Resource Management in D2D Cooperative Relay Communications
Device-to-device (D2D) cooperative relay can assist users with inferior channel conditions to implement multi-hop transmissions, improving network coverage and throughput. However, energy efficiency is an important issue to be optimized because of the limited battery capacity of handheld equipments. Considering a two-hop D2D relay communication scenario, this paper proposes a resource management approach that jointly optimizes relay selection, spectrum allocation, and power control, so that the total energy efficiency of D2D links is maximized while guaranteeing the quality of service (QoS) requirements of D2D and cellular links at the same time. Since the formulated joint optimization problem involves a four-dimensional matching that is NP-hard, we propose a pricing-based two-stage matching algorithm to reduce dimensionality and provide a tractable solution. In the first stage, the spectrum resources reused by relay-to-receiver links are determined by a two-dimensional matching. Then, a three- dimensional matching is conducted to match users, relays, and the spectrum resources reused by transmitter-to-relay links. The optimal transmit power is solved during the preference establishment process in the second stage. As shown in simulation results, the proposed algorithm not only performs good on energy efficiency, but also enhances the average number of served users in comparison to the case without any relay.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Two-Stage Matching for Energy-Efficient Resource Management in D2D Cooperative Relay Communications
Device-to-device (D2D) cooperative relay can assist users with inferior channel conditions to implement multi-hop transmissions, improving network coverage and throughput. However, energy efficiency is an important issue to be optimized because of the limited battery capacity of handheld equipments. Considering a two-hop D2D relay communication scenario, this paper proposes a resource management approach that jointly optimizes relay selection, spectrum allocation, and power control, so that the total energy efficiency of D2D links is maximized while guaranteeing the quality of service (QoS) requirements of D2D and cellular links at the same time. Since the formulated joint optimization problem involves a four-dimensional matching that is NP-hard, we propose a pricing-based two-stage matching algorithm to reduce dimensionality and provide a tractable solution. In the first stage, the spectrum resources reused by relay-to-receiver links are determined by a two-dimensional matching. Then, a three- dimensional matching is conducted to match users, relays, and the spectrum resources reused by transmitter-to-relay links. The optimal transmit power is solved during the preference establishment process in the second stage. As shown in simulation results, the proposed algorithm not only performs good on energy efficiency, but also enhances the average number of served users in comparison to the case without any relay.
- 18 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 6 (1) , 278-287
Cross-Layer Optimization for Cooperative Content Distribution in Multihop Device-to-Device Networks
With the ubiquity of wireless network and the intelligentization of machines, Internet of Things (IoT) has come to people's horizon. Device-to-device (D2D), as one advanced technique to achieve the vision of IoT, supports a high speed peer-to-peer transmission without fixed infrastructure forwarding which can enable fast content distribution in local area. In this paper, we address the content distribution problem by multihop D2D communication with decentralized content providers locating in the networks. We consider a cross-layer multidimension optimization involving frequency, space, and time, to minimize the network average delay. Considering the multicast feature, we first formulate the problem as a coalitional game based on the payoffs of content requesters, and then, propose a time-varying coalition formation-based algorithm to spread the popular content within the shortest possible time. Simulation results show that the proposed approach can achieve a fast content distribution across the whole area, and the performance on network average delay is much better than other heuristic approaches.
- 18 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 6 (1) , 278-287
Cross-Layer Optimization for Cooperative Content Distribution in Multihop Device-to-Device Networks
With the ubiquity of wireless network and the intelligentization of machines, Internet of Things (IoT) has come to people's horizon. Device-to-device (D2D), as one advanced technique to achieve the vision of IoT, supports a high speed peer-to-peer transmission without fixed infrastructure forwarding which can enable fast content distribution in local area. In this paper, we address the content distribution problem by multihop D2D communication with decentralized content providers locating in the networks. We consider a cross-layer multidimension optimization involving frequency, space, and time, to minimize the network average delay. Considering the multicast feature, we first formulate the problem as a coalitional game based on the payoffs of content requesters, and then, propose a time-varying coalition formation-based algorithm to spread the popular content within the shortest possible time. Simulation results show that the proposed approach can achieve a fast content distribution across the whole area, and the performance on network average delay is much better than other heuristic approaches.