Scholarlink

This paper investigates performance of a multicast scheme using Fountain Codes (FCs) with multiple users. In the proposed scheme, the source node employs FCs to transmit the same data to a group of destination nodes. Meanwhile, multiple eavesdroppers attempt to intercept the source’s data. To ensure secure communication, the source adjusts its transmit power to keep the intercept probability (IP) below a specified threshold. We derive exact analytical expressions to evaluate outage probability (OP) of the proposed model over Independent but Not Identically Distributed (INID) Rayleigh fading channel. Monte Carlo simulations are carried out to validate the analytical results and to analyze the impact of system parameters—such as the IP threshold, the number of destination nodes, and the number of eavesdroppers—on the OP performance.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Performance Evaluation of Fountain Codes-Based Multicast Scheme in Presence of Multiple Passive Eavesdroppers Over INID Rayleigh Fading Channels

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Tran Dinh Dat,
  • Tran Trung Duy,
  • Nguyen Trung Hieu,
  • Phan Ngoc An,
  • Nguyen Luong Nhat,
  • Phu Tran Tin

摘要

This paper investigates performance of a multicast scheme using Fountain Codes (FCs) with multiple users. In the proposed scheme, the source node employs FCs to transmit the same data to a group of destination nodes. Meanwhile, multiple eavesdroppers attempt to intercept the source’s data. To ensure secure communication, the source adjusts its transmit power to keep the intercept probability (IP) below a specified threshold. We derive exact analytical expressions to evaluate outage probability (OP) of the proposed model over Independent but Not Identically Distributed (INID) Rayleigh fading channel. Monte Carlo simulations are carried out to validate the analytical results and to analyze the impact of system parameters—such as the IP threshold, the number of destination nodes, and the number of eavesdroppers—on the OP performance.