MLMeng Li

Meng Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Meng Li has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Joint Trajectory and Resource Optimization for Covert Communication in UAV-Enabled Relaying Systems

    by Meng Li, Xiaofeng Tao, Huici Wu, Na Li

    A novel covert communication framework is proposed to enhance the privacy of the unmanned aerial vehicle (UAV)-enabled relaying systems. Specifically, the full-duplex (FD) UAV covertly relays data from each ground sensor to remote base station (BS) against a warden (Willie). Considering a noise uncertainty model, the minimum detection error probability (DEP) of Willie is first derived. Under the constraint of the derived DEP, the minimum average covert transmission rate (ACTR) is then maximized by jointly designing the sensor association, the UAV transmit power, and the UAV trajectory. A low-complexity algorithm based on the penalty successive convex approximation (P-SCA) is further invoked to achieve the locally optimal solution. Finally, numerical results show the effectiveness of the proposed framework and reveal some insights, i.e., increasing uncertainty at Willie can improve the covertness performance.


  • Energy-Efficient Covert Communication With the Aid of Aerial Reconfigurable Intelligent Surface

    by Meng Li, Xiaofeng Tao, Na Li, Huici Wu

    In this letter, a novel aerial reconfigurable intelligent surface (ARIS) assisted covert communication framework is proposed, where RIS is mounted on unmanned aerial vehicle (UAV) to enhance the covert performance of ground transceivers in the presence of a warden. The detection performance of warden is first analyzed, and then a covert energy efficiency (CEE) maiximization problem is formulated by jointly optimizing power control, passive beamforming, and UAV trajectory. To solve the non-convex problem, an algorithm based on alternating optimization is devised to achieve the suboptimal solution. Numerical evaluations show that the proposed scheme has a larger CEE gain than the scheme without RIS under the condition of more reflecting elements. Moreover, the proposed scheme can achieve near-same covertness performance at a lower energy consumption cost compared with covert transmission rate maximization scheme.


  • Eavesdropping and Anti-Eavesdropping Game in UAV Wiretap System: A Differential Game Approach

    by Huici Wu, Meng Li, Qiuyue Gao, Zhiqing Wei, Ning Zhang, Xiaofeng Tao

    Despite its advantages of flexility and low-cost networking, unmanned aerial vehicle (UAV) communications face various attacks such as eavesdropping. Existing studies on secure UAV communications assume fix-located eavesdroppers and rarely consider interactions between legitimate nodes and eavesdroppers. In this paper, we investigate eavesdropping and anti-eavesdropping interaction between a UAV-enabled eavesdropper (UAV-E) and a UAV-enabled base station (UAV-BS) in a downlink wiretap system. The UAV-E aims to wiretap downlink signals by adaptively adjusting its trajectory while the UAV-BS aims to maximize secrecy-sum-rate with minimum power consumption by jointly optimizing user scheduling, power control, and trajectory. Dynamic differential equations are formulated to characterize motions of UAVs, following which a zero-sum differential game is formulated to model the “pursuit-evasion” interaction between the UAV-BS and the UAV-E. Definition and existence of Nash equilibrium (NE) are provided. To obtain the NE, Pontryagins minimum principle is leveraged to solve the trajectory design problem. Further, Gauss-Seidel-like implicit finite-difference method is leveraged to obtain saddle-point strategies at NE. Finally, numerical results are provided to verify the effectiveness of the proposed game model. It is revealed that the differential game can well-characterize the strategy interactions between UAVs. Moreover, results show that the initial positions and weights of UAVs, the energy consumption factor, and the user scheduling have key impacts on motion interactions between the UAV-BS and the UAV-E and further on UAV-BS’s power control.


  • Secrecy Energy Efficiency Maximization in UAV-Enabled Wireless Sensor Networks Without Eavesdropper’s CSI

    by Meng Li, Xiaofeng Tao, Na Li, Huici Wu, Jin Xu

    Unmanned aerial vehicles (UAVs) are anticipated to be a potential data collection solution for wireless sensor networks (WSNs). The main challenges of integrating UAVs in WSNs are security threats and UAV’s onboard energy limitation. To cope with these two challenges, this article examines the secrecy energy efficiency (SEE) maximization problem in UAV-enabled WSN. Specifically, a full-duplex (FD) UAV gathers confidential information from ground sensor nodes (SNs) in the uplink while sending jamming signals to confound a ground eavesdropper (Eve) in the downlink. Considering a passive eavesdropping scenario lacking Eve’s instantaneous channel state information (CSI), the resulting problem is subject to the constraints of connection outage probability (COP), secrecy outage probability (SOP), securely collected bits, and flight trajectory. To tackle the intractable nonconvex problem, we first derive the optimal codeword rate and redundancy rate in closed-form expressions and then develop a low-complexity algorithm using the block coordinate descent (BCD) approach to alternatively optimize the SN scheduling, SN transmit power, UAV transmit power, and UAV trajectory. Simulation results verify the performance gains of the proposed scheme compared with the benchmark schemes. In particular, the proposed scheme achieves nearly the same secrecy rate gains at a lower UAV’s energy consumption cost than the sum secrecy rate maximization (SSRM) baseline. Moreover, it is revealed that trajectory optimization of the proposed scheme plays a crucial role in improving SEE performance compared with the circle trajectory (CT) baseline.


  • Intelligent Reflecting Surface Assisted NOMA With Heterogeneous Internal Secrecy Requirements

    by Na Li, Meng Li, Yuanwei Liu, Chaoying Yuan, Xiaofeng Tao

    The intelligent reflecting surface (IRS) technology can significantly enhance the flexibility of non-orthogonal multiple access (NOMA) by reconfiguring the channel gains according to the users' communication requirements. We propose to use IRS to enhance the internal secrecy among NOMA users in the multiple-input-single-output downlink networks. The objective is to minimize the total transmit power under heterogeneous secrecy constraints, by jointly optimizing the beamforming vectors and the IRS reflecting factors. To efficiently solve this non-convex problem, an alternating optimization based iterative algorithm is proposed by leveraging the successive convex approximation and the semi-definite relaxation techniques. Simulation results show that our proposed IRS-assisted NOMA can effectively guarantee the internal secrecy of users with significantly reduced transmit power compared to the convectional NOMA without IRS and the orthogonal multiple access with or without IRS.


  • A Physical Layer Spoofing Attack in Spatial Modulation

    by Xiaohui Wang, Na Li, Meng Li, Xiaofeng Tao

    Spoofing is a general attack in wireless communication and can cause further attacks like denial of service, node hijack and so on. Extensive studies have focused on the performance analysis under specific spoofing attack, or the countermeasures to detect and remove the spoofing attacks. Modulation based spoofing has proven to be an effective attack at the physical layer. Meanwhile, spatial modulation (SM) has high spectral efficiency and low complexity capabilities. And relay cooperation was introduced to further enhance the security of SM, under a basic assumption that all relays are trusted and fully cooperative. However, malicious relay may destroy the advantage of SM. This is the first time that the spoofing problem is studied for SM. We first model the modulation based spoofing attack particular to SM, and then derive the average spoofing- symbol-success-rate (SSSR) to describe the spoofer successfully modify the symbol. Numerical results show that the spoofing attack can badly destroy the communication.


  • On the Maximization of Secrecy Energy Efficiency in Full-Duplex Bidirectional System With SWIPT

    by Meng Li, Na Li, Huici Wu, Xiaofeng Tao

    This paper studies the secrecy energy efficiency (SEE) maximization problem in a full-duplex (FD) bidirectional system, where an FD base station (BS) communicates with an FD user equipment (UE) with the existence of an external user who harvests energy from the ambient radio frequency (RF) signal with SWIPT and acts as a potential eavesdropper. To balance the secrecy rate and the energy efficiency, an SEE maximization problem is formulated subject to the minimum secrecy rate, the maximum transmitted power and the minimum harvested energy. The formulated non-convex problem is solved with a two-layer optimization algorithm, where Dinkelbach method is employed to deal with the fractional programming of the outer problem and a convex approximation method based on Taylor expansion is applied to transfer the inner problem into a convex iterative program. Numerical results demonstrate the effectiveness of the proposed algorithm and the advantages of FD operation in improving SEE.


  • Incentive design for collaborative jamming using contract theory in physical layer security

    by Meng Li, Yanru Zhang, Li Wang, Mei Song, Zhu Han

    Cooperative jamming is a promising technology for improving information secrecy at the physical layer. The increase of secrecy capacity heavily depends on the participation of the jammer and its geographical locations. However, the jammer's geographical location might not be known to others such as the source node due to privacy, and the asymmetric information will lead to inefficiency in jamming. Thus, incentive mechanisms for cooperative jamming are on demand. In this paper, a solution based on contract theory is proposed to solve the problem of motivating efficient friendly jamming. First, we classify the diverse potential locations of the jammer into a finite number of types under the framework of contract theory. Second, we analyze the feasible conditions which guarantee that a jammer will provide service and select the contract bundle designed only for its corresponding type. Finally, an optimal contract is proposed targeting to maximize the source node's utility. Numerical results verify the performances of our proposed scheme.