Yanwen Lan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yanwen Lan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dongyu Wang
Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications - Xiaoxiang Wang
Beijing University of Posts and Telecommunications
3 shared publications - Yibo Zhang
Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Qi Li
School of Information Science and Technology, Beijing University of Technology, Beijing, China
2 shared publications Xiaoxiang Wang
Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publicationsZhaolin Liu
Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 6 December 2019
- Published by MDPI AG in Electronics
- Vol. 8 (12) , 1491
Analysis of an SDN-Based Cooperative Caching Network with Heterogeneous Contents
The ubiquity of data-enabled mobile devices and wireless-enabled data applications has fostered the rapid development of wireless content caching, which is an efficient approach to mitigating cellular traffic pressure. Considering the content characteristics and real caching circumstances, a software-defined network (SDN)-based cooperative caching system is presented. First, we define a new file block library with heterogeneous content attributes [file popularity, mobile user (MU) preference, file size]. An SDN-based three-tier caching network is presented in which the base station supplies control coverage for the entire macrocell and cache helpers (CHs), MUs with cache capacities offer data coverage. Using the ‘most popular content’ and ‘largest diversity content’, a distributed cooperative caching strategy is proposed in which the caches of the MUs store the most popular contents of the file block library to mitigate the effect of MU mobility, and those of the CHs store the remaining contents in a probabilistic caching manner to enrich the content diversity and reduce the MU caching pressure. The request meet probability (RMPro) is subsequently proposed, and the optimal caching distribution of the contents in the probabilistic caching strategy is obtained via optimization. Finally, using the result of RMPro optimization, we also analyze the content retrieval delays that occur when a typical MU requests a file block or a whole file. Simulation results demonstrate that the proposed caching system can achieve quasi-optimal revenue performance compared with other contrasting schemes.
- 6 December 2019
- Published by MDPI AG in Electronics
- Vol. 8 (12) , 1491
Open AccessAnalysis of an SDN-Based Cooperative Caching Network with Heterogeneous Contents
The ubiquity of data-enabled mobile devices and wireless-enabled data applications has fostered the rapid development of wireless content caching, which is an efficient approach to mitigating cellular traffic pressure. Considering the content characteristics and real caching circumstances, a software-defined network (SDN)-based cooperative caching system is presented. First, we define a new file block library with heterogeneous content attributes [file popularity, mobile user (MU) preference, file size]. An SDN-based three-tier caching network is presented in which the base station supplies control coverage for the entire macrocell and cache helpers (CHs), MUs with cache capacities offer data coverage. Using the ‘most popular content’ and ‘largest diversity content’, a distributed cooperative caching strategy is proposed in which the caches of the MUs store the most popular contents of the file block library to mitigate the effect of MU mobility, and those of the CHs store the remaining contents in a probabilistic caching manner to enrich the content diversity and reduce the MU caching pressure. The request meet probability (RMPro) is subsequently proposed, and the optimal caching distribution of the contents in the probabilistic caching strategy is obtained via optimization. Finally, using the result of RMPro optimization, we also analyze the content retrieval delays that occur when a typical MU requests a file block or a whole file. Simulation results demonstrate that the proposed caching system can achieve quasi-optimal revenue performance compared with other contrasting schemes.
- Open Access
- 30 November 2019
- Published by MDPI AG in Electronics
- Vol. 8 (12) , 1430
Collaborative Computation Offloading and Resource Allocation in Cache-Aided Hierarchical Edge-Cloud Systems
The hierarchical edge-cloud enabled paradigm has recently been proposed to provide abundant resources for 5G wireless networks. However, the computation and communication capabilities are heterogeneous which makes the potential advantages difficult to be fully explored. Besides, previous works on mobile edge computing (MEC) focused on server caching and offloading, ignoring the computational and caching gains brought by the proximity of user equipments (UEs). In this paper, we investigate the computation offloading in a three-tier cache-assisted hierarchical edge-cloud system. In this system, UEs cache tasks and can offload their workloads to edge servers or adjoining UEs by device-to-device (D2D) for collaborative processing. A cost minimization problem is proposed by the tradeoff between service delay and energy consumption. In this problem, the offloading decision, the computational resources and the offloading ratio are jointly optimized in each offloading mode. Then, we formulate this problem as a mixed-integer nonlinear optimization problem (MINLP) which is non-convex. To solve it, we propose a joint computation offloading and resource allocation optimization (JORA) scheme. Primarily, in this scheme, we decompose the original problem into three independent subproblems and analyze their convexity. After that, we transform them into solvable forms (e.g., convex optimization problem or linear optimization problem). Then, an iteration-based algorithm with the Lagrange multiplier method and a distributed joint optimization algorithm with the adoption of game theory are proposed to solve these problems. Finally, the simulation results show the performance of our proposed scheme compared with other existing benchmark schemes.
- 30 November 2019
- Published by MDPI AG in Electronics
- Vol. 8 (12) , 1430
Open AccessCollaborative Computation Offloading and Resource Allocation in Cache-Aided Hierarchical Edge-Cloud Systems
The hierarchical edge-cloud enabled paradigm has recently been proposed to provide abundant resources for 5G wireless networks. However, the computation and communication capabilities are heterogeneous which makes the potential advantages difficult to be fully explored. Besides, previous works on mobile edge computing (MEC) focused on server caching and offloading, ignoring the computational and caching gains brought by the proximity of user equipments (UEs). In this paper, we investigate the computation offloading in a three-tier cache-assisted hierarchical edge-cloud system. In this system, UEs cache tasks and can offload their workloads to edge servers or adjoining UEs by device-to-device (D2D) for collaborative processing. A cost minimization problem is proposed by the tradeoff between service delay and energy consumption. In this problem, the offloading decision, the computational resources and the offloading ratio are jointly optimized in each offloading mode. Then, we formulate this problem as a mixed-integer nonlinear optimization problem (MINLP) which is non-convex. To solve it, we propose a joint computation offloading and resource allocation optimization (JORA) scheme. Primarily, in this scheme, we decompose the original problem into three independent subproblems and analyze their convexity. After that, we transform them into solvable forms (e.g., convex optimization problem or linear optimization problem). Then, an iteration-based algorithm with the Lagrange multiplier method and a distributed joint optimization algorithm with the adoption of game theory are proposed to solve these problems. Finally, the simulation results show the performance of our proposed scheme compared with other existing benchmark schemes.
- Open Access
- 16 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 104876-104891
Task Caching, Offloading, and Resource Allocation in D2D-Aided Fog Computing Networks
In this paper, we investigate the allocation of resource in D2D-aided Fog computing system with multiple mobile user equipments (MUEs). We consider each MUE has a request for task from a task library and needs to make a decision on task performing with a selection of three processing modes which include local mode, fog offloading mode, and cloud offloading mode. Two scenarios are considered in this paper, which mean task caching and its optimization in off-peak time, task offloading, and its optimization in immediate time. In particular, task caching refers to cache the completed task application and its related data. In the first scenario, to maximize the average utility of MUEs, a task caching optimization problem is formulated with stochastic theory and is solved by a GA-based task caching algorithm. In the second scenario, to maximize the total utility of system, the task offloading and resource optimization problem is formulated as a mixed integer nonlinear programming problem (MINLP) with a joint consideration of the MUE allocation policy, task offloading policy, and computational resource allocation policy. Due to the nonconvex of the problem, we transform it into multi-MUEs association problem (MMAP) and mixed Fog/Cloud task offloading optimization problem (MFCOOP). The former problem is solved by a Gini coefficient-based MUEs allocation algorithm which can select the most proper MUEs who contribute more to the total utility. The task offloading optimization problem is proved as a potential game and solved by a distributed algorithm with Lagrange multiplier. At last, the simulations show the effectiveness of the proposed scheme with the comparison of other baseline schemes.
- 16 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 104876-104891
Open AccessTask Caching, Offloading, and Resource Allocation in D2D-Aided Fog Computing Networks
In this paper, we investigate the allocation of resource in D2D-aided Fog computing system with multiple mobile user equipments (MUEs). We consider each MUE has a request for task from a task library and needs to make a decision on task performing with a selection of three processing modes which include local mode, fog offloading mode, and cloud offloading mode. Two scenarios are considered in this paper, which mean task caching and its optimization in off-peak time, task offloading, and its optimization in immediate time. In particular, task caching refers to cache the completed task application and its related data. In the first scenario, to maximize the average utility of MUEs, a task caching optimization problem is formulated with stochastic theory and is solved by a GA-based task caching algorithm. In the second scenario, to maximize the total utility of system, the task offloading and resource optimization problem is formulated as a mixed integer nonlinear programming problem (MINLP) with a joint consideration of the MUE allocation policy, task offloading policy, and computational resource allocation policy. Due to the nonconvex of the problem, we transform it into multi-MUEs association problem (MMAP) and mixed Fog/Cloud task offloading optimization problem (MFCOOP). The former problem is solved by a Gini coefficient-based MUEs allocation algorithm which can select the most proper MUEs who contribute more to the total utility. The task offloading optimization problem is proved as a potential game and solved by a distributed algorithm with Lagrange multiplier. At last, the simulations show the effectiveness of the proposed scheme with the comparison of other baseline schemes.
- Open Access
- 29 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 43356-43368
Mobility-Aware Task Offloading and Migration Schemes in Fog Computing Networks
- 29 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 43356-43368
Open AccessMobility-Aware Task Offloading and Migration Schemes in Fog Computing Networks
- Open Access
Analysis and Design of SCMA-Based Hybrid Unicast-Multicast Relay-Assisted Networks
This paper studies a multi-user network model based on sparse code multiple access (SCMA), where both unicast and multicast services are considered. In the direct transmission scheme, the communication between the base station (BS) and the users is completed with one stage, in which the relay is inexistent. In the two-stage cooperative transmission scheme, any number of relays are placed to improve the reliability of wireless communication system. The BS broadcasts the requested message to users and relays in the first stage, and the successful relays forward the message to unsuccessful users in the second stage. To characterize the performance of these two schemes, we derive the exact and approximate expressions of average outage probability. Furthermore, to take full advantage of the cooperative diversity, an optimal power allocation and relay location strategy in the high signal-to-noise ratio (SNR) regime is studied. The outage probability reaches the minimum value when the first stage occupies half of the total energy consumed. Simulation and analysis results are presented to demonstrate the performance of these two schemes. The results show that the two-stage cooperative scheme effectively reduce the average outage probability in SCMA network, especially in the high SNR region.
Open AccessAnalysis and Design of SCMA-Based Hybrid Unicast-Multicast Relay-Assisted Networks
This paper studies a multi-user network model based on sparse code multiple access (SCMA), where both unicast and multicast services are considered. In the direct transmission scheme, the communication between the base station (BS) and the users is completed with one stage, in which the relay is inexistent. In the two-stage cooperative transmission scheme, any number of relays are placed to improve the reliability of wireless communication system. The BS broadcasts the requested message to users and relays in the first stage, and the successful relays forward the message to unsuccessful users in the second stage. To characterize the performance of these two schemes, we derive the exact and approximate expressions of average outage probability. Furthermore, to take full advantage of the cooperative diversity, an optimal power allocation and relay location strategy in the high signal-to-noise ratio (SNR) regime is studied. The outage probability reaches the minimum value when the first stage occupies half of the total energy consumed. Simulation and analysis results are presented to demonstrate the performance of these two schemes. The results show that the two-stage cooperative scheme effectively reduce the average outage probability in SCMA network, especially in the high SNR region.