Na Lyu

Prof. Na Lyu

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 January 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
WPWu Pan
Wu Pan
NLNa Lyu
Na Lyu
BHBei Hou
Bei Hou
ZRZhiyuan Ren
Zhiyuan Ren
In this paper, we utilize multi-hop UAV relay networks to provide data relay forwarding services for ground heterogeneous users who are hard to build direct communication links. This paper studies the resource allocation and deployment optimization problem of multi-hop UAV relay network in order to satisfy the various needs of heterogeneous users and lower the outage probability of multi-hop transmission link. First, based on the characteristics of air-to-ground channels, we establish an information transmission model between UAV and ground users. Given heterogeneous users with various data volume requirements, we propose a method for allocating time and power resources so that UAV can serve as many heterogeneous users as it can while still satisfying user service requirements needs. Second, the calculation for the outage probability in a multi-hop relay network is constructed based on the properties of the air-to-air channel, and the optimal placement of the multi-hop relay network with the lowest outage probability is solved. Finally, an experimental comparative analysis was used to confirm the effectiveness of the proposed method when applied to the multi-hop relay model serving heterogeneous users.

18 April 2023 in IEEE Access
Verified
Journal Article
Open access
WPWu Pan
Wu Pan
NLNa Lyu
Na Lyu
By relaying messages between users, unmanned aerial vehicles (UAVs), which are frequently utilized in the communication industry, can be used as airborne communication relays to resolve connectivity problems. In order to effectively connect a large number of heterogeneous users dispersed on the ground, we deploy a large number of UAVs for reliable relay coverage and message transmission between users. We initially put forth a relay coverage algorithm that continuously optimizes the position of UAVs and the cell division of terrestrial users in order to provide users with full coverage. Second, we study several relay message forwarding methods between UAVs while taking into account the features of heterogeneous users. A relay selection method, which takes the relay link throughput as the optimization goal, is proposed to ensure full connectivity between UAVs. Finally, we contrast and analyze how various relay forwarding methods affect the effectiveness of the relay network. The experimental results demonstrate that the proposed relay coverage algorithm can balance the UAV relay load better and reduce transmission delay, while the suggested relay selection strategy can minimize the number of isolated UAVs and maximize the throughput of UAV relay links.

27 February 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
YGYang Gao
Yang Gao
NLNa Lyu
Na Lyu
Target threat assessment provides support for combat decision making. The multi-target threat assessment method based on a three-way decision can obtain threat classification while receiving threat ranking, thus avoiding the limitation of traditional two-way decisions. However, the heterogeneous situation information, attribute relevance, and adaptive information processing needs in complex battlefield environment bring challenges to existing methods. Therefore, this paper proposes a new multi-target three-way threat assessment method with heterogeneous information and attribute relevance. Firstly, dynamic assessment information is represented by heterogeneous information, and attribute weights are calculated by heterogeneous Criteria Importance Through Intercriteria Correlation (CRITIC). Then, the conditional probability is calculated by the heterogeneous weighted Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), and the adaptive risk avoidance coefficients are constructed by calculating the uncertainty of the assessment value, and then the relative loss function matrices are constructed. Finally, the comprehensive loss function matrices are obtained by the weighted Heronian mean (HM) operator, and the comprehensive thresholds are calculated to obtain the three-way rules. The case study shows that compared with the existing methods, the proposed method can effectively handle the heterogeneous information and attribute relevance, and obtain the risk avoidance coefficients without presetting or field subjective settings, which is more suitable for the complex mission environment.

7 June 2022 in Ad Hoc Networks
Verified
Journal Article
Closed access
MZMeng-Yuan Zhu
Meng-Yuan Zhu
KCKe-Fan Chen
Ke-Fan Chen
ZCZhuo Chen
Zhuo Chen
NLNa Lyu
Na Lyu

9 September 2018 in International Journal of Aerospace Engineering
Verified
Journal Article
Open access
PDF file
KCKefan Chen
Kefan Chen
SZShanghong Zhao
Shanghong Zhao
NLNa Lyu
Na Lyu
Aviation swarm is considered to be a promising organization of air combat forces to execute combat and noncombat air missions. As a critical component of an aviation swarm, airborne tactical network (ATN) provides the communication capability. Considering the deficiencies of today’s ATNs, it is unable to meet the communication demands of an aviation swarm, which motivates us to employ the software-defined networking (SDN) paradigm and design a SDN-enabled airborne tactical network (SD-ATN). For the SDN paradigm, network monitoring information (M-info) is the source of knowledge that forms the globe network view of the control plane; therefore, how to ensure that the control plane collects M-info from the data plane in a reliable and real-time way is a fundamental problem of designing the SD-ATN. To address this issue, a transmission framework called the MCF-SD-ATN is first designed, which makes it practical to provide dedicated quality of service (QoS) guarantees for the M-info collection. Then, a communication protocol called the MCP-SD-ATN is designed to implement the M-info collection work based on the MCF-SD-ATN. We implement the MCF-SD-ATN and the MCP-SD-ATN in EXata 5.1 for simulation. Simulation results show that the proposed solution is appropriate for M-info collection in the SD-ATN.

16 September 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
JMJingcheng Miao
Jingcheng Miao
NLNa Lyu
Na Lyu
KCKefan Chen
Kefan Chen
QGQi Gao
Qi Gao
XWXiang Wang
Xiang Wang
Airborne tactical networks (ATNs) built on network virtualization (NV) can enable efficient information sharing for network-centric warfare by breaking the tight coupling between applications and network infrastructure and thus solving the network ossification problem. With dynamic changes during military missions, the application of virtualization is challenged by the changing demands on network resources when instantiating multiple virtual networks (VNs) on a shared substrate network (SN), known as virtual network embedding (VNE). However, existing dynamic VNE algorithms, mostly designed for wired networks, focus on the dynamic changes of single VN and do not consider the dynamic changes of different VNs. The proper processing of changes of different VNs is beneficial to improve the embedding profits of VNs. On these backgrounds, we investigate the dynamic wireless VNE that processes the dynamic changes of different VNs in the wireless environment of ATNs. A relationship matrix-based dynamic wireless VNE (DWVNE-RM) algorithm is proposed in order to maximize the acceptance ratio of VN requests. The dynamic changes of different VNs are classified into negative changes (requiring resource) and positive changes (releasing resource). Then, the relationship matrix between negative and positive changes is constructed to properly process the resource relationship among different changes in order to improve the acceptance ratio. In addition, the complex interference of ATNs is considered in the mapping or remapping of virtual nodes and links to improve the reliability. Through extensive simulation, DWVNE-RM is compared with multiple existing dynamic algorithms and outperforms over others.