Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
38 result(s) for "Chen, Dechuan"
Sort by:
Short-Packet Communications in Multi-Antenna Cooperative NOMA Networks with Hardware Impairments
This work examines the performance of a multi-antenna cooperative non-orthogonal multiple access (NOMA) network that employs short-packet communications and operates under the effect of hardware impairments. Specifically, a multi-antenna source transmits superposition-coded NOMA signals to a near user and a far user. Acting as a decode-and-forward (DF) relay, the near user adopts successive interference cancellation (SIC) to decode and subsequently forward the message intended for the far user. In addition, the transmission strategy at the source is the maximum ratio transmission (MRT) and the reception strategy at the far user is selection combining (SC). For Nakagami-m fading channels, closed-form expressions for the average block error rate (BLER) and effective throughput are derived. Then, the effective throughput is maximized through the optimization of the blocklength, accounting for constraints on transmission latency and reliability. The results obtained from simulations confirm the analytical findings and demonstrate that the proposed scheme, with a two-antenna source configuration, achieves a superior effective throughput, reaching up to 240% at a transmit signal-to-noise ratio (SNR) of 33 dB, compared to the existing NOMA scheme in the literature.
ARQ-Enhanced Short-Packet NOMA Communications with STAR-RIS
To address the rigorous requirements of ultra-reliable low-latency communication (URLLC) in beyond 5G/6G networks, we propose an innovative architecture combining automatic repeat request (ARQ) protocol with a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) to enhance short-packet non-orthogonal multiple access (NOMA) communications. Specifically, retransmission mechanism provided by ARQ is utilized to mitigate packet errors stemming from practical system imperfections, i.e., imperfect channel state information (ipCSI), imperfect successive interference cancellation (ipSIC), and hardware impairments. Using the analytical foundation provided by finite blocklength (FBL) theory, expressions for two key performance metrics, i.e., the average block error rate (BLER) and effective throughput, are derived for two NOMA users. Simulation results validate the analytical derivations and demonstrate that the ARQ scheme provides significant reliability gains for each user and achieves synergistic gain with STAR-RIS technology. In addition, the effective throughput exhibits a peak at an optimal blocklength, balancing the reliability gain from a longer blocklength against the spectral efficiency loss from a lower coding rate. This optimal blocklength decreases with more STAR-RIS elements, as improved channel conditions reduce the need for long blocklengths.
Cooperative NOMA with RIS Assistance for Short-Packet Communications Under Hardware Impairments
Ultra-reliable low-latency communication (URLLC) presents significant challenges in simultaneously guaranteeing stringent latency bounds, ultra-high reliability, and efficient resource utilization under dynamic channel conditions. To address these joint constraints, a novel framework that integrates a reconfigurable intelligent surface (RIS) with cooperative non-orthogonal multiple access (NOMA) is proposed for short-packet communications. Two distinct phase configuration designs for the RIS are considered, i.e., a near-user priority strategy (NUPS) and a far-user priority strategy (FUPS). The NUPS configures the RIS to enhance the received signal power for the near user, while the FUPS optimizes the phase shifts to maximize the received power for the far user. Closed-form expressions that characterize the average block error rate (BLER) of the near and far users under the two proposed strategies in the presence of hardware impairments are derived. Specifically, the analysis for the far user considers both selection combining (SC) and maximum ratio combining (MRC) reception schemes. Based on the average BLER, we then derive a closed-form expression for the effective throughput. Simulation findings reveal the following: (1) The far user in the proposed cooperative NOMA achieves a lower average BLER than in the non-cooperative NOMA. (2) When the RIS is deployed in close proximity to the base station (BS), the NUPS can effectively leverage the RIS to enhance the far user’s signal quality through cooperation, without sacrificing the near user’s priority; and (3) SC serves as a low-complexity alternative that achieves near-optimal performance when inter-user channel conditions are favorable.
Optimal Channel Training Design for Secure Short-Packet Communications
Physical layer security is a promising technique to ensure the confidentiality of short-packet communications, since no additional channel uses are needed. Motivated by the fact of finite coding blocklength in short-packet communications, we attempt to investigate the problem of how many the channel uses utilized for channel training should be allocated to perform secure communications. Based on the finite blocklength information theory, we derive a closed-form expression to approximate the average achievable secrecy throughput. To gain more insights, we also present the asymptotic average secrecy throughput under two special cases, i.e., high signal-to-noise ratio (SNR) and infinite blocklength. Moreover, we determine the optimal channel training length to maximize the average secrecy throughput under the reliability constraint and given blocklength. Numerical results are provided to validate the analysis and demonstrate that the performance gain achieved by the optimal channel training length is remarkable, relative to other benchmark schemes.
Secure short-packet communications in power beacon-assisted IoT networks over Nakagami-m fading channels
In this work, we investigate short-packet communications in power beacon (PB)-assisted Internet-of-Things (IoT) networks, where an energy-constrained actuator first harvests energy from a dedicated PB, and then transmits confidential signals to a desired controller in the presence of an eavesdropper. We derive a closed-form lower bound approximation expression for the average achievable effective secrecy rate (AESR) over Nakagami-m fading channels. To gain more insights, we also present the asymptotic average AESR in the high signal-to-noise ratio (SNR) regime. Specifically, analytical results indicate that an average AESR floor appears with the increase of SNR. Moreover, a low complexity one-dimensional search method is employed to maximize the average AESR by optimizing the energy harvesting length. Monte-Carlo simulations are provided to corroborate our analysis.
Secure Transmission for Simultaneous Wireless Information and Power Transfer in AF Untrusted Relay Networks
This paper investigates secure communications of energy harvesting untrusted relay networks, where the destination assists jamming signal to prevent the untrusted relay from eavesdropping and to improve the forwarding ability of the energy constrained relay. Firstly, the source and the destination transmit the signals to the relay with maximal ratio transmission (MRT) technique or transmit antenna selection (TAS) technique. Then, the destination utilizes maximal ratio combining (MRC) technique or receive antenna selection (RAS) technique to receive the forwarded information. Therefore, four transmission and reception schemes are considered. For each scheme, the closed-form expressions of the secrecy outage probability (SOP) and the connection outage probability (COP) are derived. Besides, the effective secrecy throughput (EST) metric is analyzed to achieve a good tradeoff between security and reliability. In addition, the asymptotic performance of EST is also considered at the high signal-to-noise ratio (SNR). Finally, simulation results illustrate that: (1) the EST of the system with MRT and MRC scheme are superior to other schemes, however, in the high SNR regime, the EST of the system with MRT scheme is inferior to TAS; and (2) for the source node, there exists an optimal number of antennas to maximize the EST of the proposed schemes.
Secure Transmission of Cooperative Zero-Forcing Jamming for Two-User SWIPT Sensor Networks
In this paper, the secrecy performance of the two-user simultaneous wireless information and power transfer (SWIPT) sensor networks is studied and a novel secure transmission scheme of cooperative zero-forcing (ZF) jamming is proposed. The two sensors opportunistically conduct the SWIPT and cooperative ZF jamming, respectively, where the energy required for jamming the eavesdropper is provided by the SWIPT operation so as to keep the energy balance at the sensors in the long run. By deriving the exact closed-form expressions of the secrecy outage probability and the secrecy throughout, we provide an effective approach to precisely assess the impacts of key parameters on the secrecy performance of the system. It has been shown that the secrecy outage probability is a monotonically increasing function of the growth of secrecy rate ( R s ), and a monotonically decreasing function of the increase of the transmit signal-to-noise ratio ( γ S ), and energy conversion efficiency ( η ). Furthermore, the secrecy throughput could be enhanced when η increases, which becomes especially obvious when a large γ S is provided. Moreover, the existence of an optimum R s maximizing the secrecy throughput is depicted, which also grows with the increase of γ S . Simulations are provided for the validation of the analysis.
Multi-Antenna Jammer-Assisted Secure Short Packet Communications in IoT Networks
In this work, we exploit a multi-antenna cooperative jammer to enable secure short packet communications in Internet of Things (IoT) networks. Specifically, we propose three jamming schemes to combat eavesdropping, i.e., the zero forcing beamforming (ZFB) scheme, null-space artificial noise (NAN) scheme, and transmit antenna selection (TAS) scheme. Assuming Rayleigh fading, we derive new closed-form approximations for the secrecy throughput with finite blocklength coding. To gain further insights, we also analyze the asymptotic performance of the secrecy throughput in the case of infinite blocklength. Furthermore, we investigate the optimization problem in terms of maximizing the secrecy throughput with the latency and reliability constraints to determine the optimal blocklength. Simulation results validate the accuracy of the approximations and evaluate the impact of key parameters such as the jamming power and the number of antennas at the jammer on the secrecy throughput.
On Secrecy Outage Probability and Average Secrecy Rate of Large-Scale Cellular Networks
We investigate the secrecy performance in large-scale cellular networks, where both Base Stations (BSs) and eavesdroppers follow independent and different homogeneous Poisson point processes (PPPs). Based on the distances between the BS and user, the intended user selects the nearest BS as serving BS to transmit the confidential information. We first derive closed-formed expressions of secrecy outage probability and average secrecy rate of a single-antenna system for both noncooperative and cooperative eavesdroppers scenarios. Then, to further improve the secrecy performance through additional spatial degrees of freedom, the above analyses generalize to the multiantenna scenario, where BSs employ the transmit antenna selection (TAS) scheme. Finally, the results show the small-scale fading has a considerable effect on the secrecy performance in certain density of eavesdroppers and small path loss exponent environment, and when the interference caused by BS is considered, the secrecy performance will be reduced. Moreover, the gap of secrecy performance between noncooperative and cooperative eavesdroppers cases is nearly invariable as the number of antennas increases.
Cooperative Secure Transmission in the Presence of Untrusted Relay
Considering a nonregenerative untrusted relay network, we investigate three different secure transmission strategies, for example, noncooperative strategy, conventional amplify-and-forward (AF) strategy, and cooperative jamming (CJ) strategy. To thoroughly assess the secrecy performance achieved by the three strategies, we derive the closed-form expressions for the connection outage probability and secrecy outage probability regarding each strategy. Based on these expressions, the reliability and security tradeoff (RST) is examined to facilitate the design of the transmitting parameters. We then present the closed-form expression for the effective secrecy throughput (EST) and characterize the overall efficiency of these transmission strategies. Furthermore, we conduct the asymptotic analysis for the secrecy throughput, which enables us to determine the optimal transmission strategy under different scenarios. Our analytical and numerical results demonstrate that compared with the noncooperative and AF strategies, the CJ strategy possesses the best performance in terms of RST. Additionally, we also find that the EST performance of the AF strategy is nearly invariable when the quality of the second hop changes.