Lianfeng Shen

Lianfeng Shen

Auto-generated profile, based on publicly available information

Lianfeng Shen

National Mobile Communications Research Laboratory, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
15 June 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZDZhaoming Ding
Zhaoming Ding
LSLianfeng Shen
Lianfeng Shen
HCHongyang Chen
Hongyang Chen
FYFeng Yan
Feng Yan
NANirwan Ansari
Nirwan Ansari
In this paper, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for internet of things (IoT) applications. First, the time-varying features of SDWSNs are investigated from which the state-transition probability (STP) of the node is calculated based on a Markov chain. Second, a dynamic link weight is designed for DRA-EERS by incorporating both the link reward and the link cost, where the link reward is related to the link energy efficiency (EE) and the node STP, while the link cost is affected by the locations of nodes. Moreover, one adjustable coefficient is used to balance the link reward and the link cost. Last, the energy-efficient routing problem can be formulated as an optimization problem, and DRA-EERS is performed to find the best relay according to the energy-efficient RS criteria derived from the designed link weight. Simulation results demonstrate that the path EE obtained by DRA-EERS through an available coefficient adjustment outperforms that by the Dijkstra’s shortest path algorithm. Again, a tradeoff between the EE and the throughput can be achieved by adjusting the coefficient of the link weight, i.e., increasing the impact of the link reward to improve the EE, and otherwise to improve the throughput.

6 April 2016 in Sensors
Verified
Journal Article
Open access
PDF file
MMMohamed Mohsen M.Nasr
Mohamed Mohsen M.Nasr
AAAbdeldime Mohamed Salih Abdelgader
Abdeldime Mohamed Salih Abdelgader
Zhigong WangZhigong Wang
Zhigong Wang
LSLian-Feng Shen
Lian-Feng Shen
In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms.

3 January 2021 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
WXWeiwei Xia
Weiwei Xia
LSLianfeng Shen
Lianfeng Shen

9 September 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
WXWeiwei Xia
Weiwei Xia
FYFeng Yan
Feng Yan
SXSong Xing
Song Xing
LSLianfeng Shen
Lianfeng Shen
In order to identify non-line-of-sight (NLOS) propagations for a high-resolution localization system in wireless networks, a strong NLOS classifier is proposed via a machine learning meta algorithm named AdaBoost. Signal features are extracted to characterize the distinctions between line-of-sight (LOS) and NLOS, based on which a series of weak learners are primarily given. By training and re-sampling data iteratively, weak learners with the minimal classification error are selected and the weighted sum is boosted into a strong classifier. Simulations demonstrate that the proposed AdaBoost-based NLOS classifier can improve NLOS identification performance, leading to reduced positioning errors.

16 August 2018 in China Communications
Verified
Journal Article
Closed access
WXWeiwei Xia
Weiwei Xia
LSLianfeng Shen
Lianfeng Shen
The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility of users as well as satisfy the required quality of service (QoS) such as the end-to-end response latency experienced by each user. We formulate the problem of joint resource allocation as a combinatorial optimization problem. Three evolutionary approaches are considered to solve the problem: genetic algorithm (GA), ant colony optimization with genetic algorithm (ACO-GA), and quantum genetic algorithm (QGA). To decrease the time complexity, we propose a mapping process between the resource allocation matrix and the chromosome of GA, ACO-GA, and QGA, search the available radio and cloud resource pairs based on the resource availability matrixes for ACO-GA, and encode the difference value between the allocated resources and the minimum resource requirement for QGA. Extensive simulation results show that our proposed methods greatly outperform the existing algorithms in terms of running time, the accuracy of final results, the total utility, resource utilization and the end-to-end response latency guaranteeing.

1 October 2017
Verified
Conference Paper
Closed access
Jing ZhangJing Zhang
Jing Zhang
WXWeiwei Xia
Weiwei Xia
ZCZhixu Cheng
Zhixu Cheng
QZQian Zou
Qian Zou
Bonan HuangBonan Huang
Bonan Huang
LSLianfeng Shen
Lianfeng Shen
This paper mainly focuses on developing a joint cloud and wireless resource allocation algorithm based on evolutionary game (JRA-EG) considering mobile terminals' energy consumption and time delay as well as monetary cost in mobile edge computing environment. The mobile terminals (MTs) in different service areas form different populations. In addition, the competition among populations of MTs in different service areas is to share the limited amount of bandwidth and computation resources in the accessible service providers (SPs). We analyse the stability property of the evolutionary game model and obtain the evolutionary equilibrium (EE). EE is acquired by replicator dynamics approach. Simulation results show that our JRA-EG algorithm can converge to the EE rapidly. Compared with the existing algorithms, the algorithms can save more energy and have less time delay when input data size becomes larger.