Research Article
Security-Reliability Analysis of Multi-hop LEACH Protocol with Fountain Codes and Cooperative Jamming
@ARTICLE{10.4108/eai.28-3-2019.157120, author={Dang The Hung and Tran Trung Duy and Do Quoc Trinh}, title={Security-Reliability Analysis of Multi-hop LEACH Protocol with Fountain Codes and Cooperative Jamming}, journal={EAI Endorsed Transactions on Industrial Networks and Intelligent Systems}, volume={6}, number={18}, publisher={EAI}, journal_a={INIS}, year={2019}, month={3}, keywords={Fountain Codes, LEACH networks, physical-layer security, cooperative jamming, outage probability, intercept probability}, doi={10.4108/eai.28-3-2019.157120} }- Dang The Hung
Tran Trung Duy
Do Quoc Trinh
Year: 2019
Security-Reliability Analysis of Multi-hop LEACH Protocol with Fountain Codes and Cooperative Jamming
INIS
EAI
DOI: 10.4108/eai.28-3-2019.157120
Abstract
In this paper, we investigate trade-off between security and reliability of Fountain codes (FCs) based low-energy adaptive clustering hierarchy (LEACH) networks, where the encoded packets are sent to the destination by using a cluster-based multi-hop transmission scheme with the assistance of cluster heads (CHs). With presence of an eavesdropper, a cooperative harvest-to-jam technique is employed to reduce the quality of the eavesdropping channels. Particularly, each cluster randomly selects a cluster node that generates artificial noises on the eavesdropper. For performance evaluation, we derive exact closed-form expressions of outage probability (OP) and intercept probability (IP) over Rayleigh fading channels. We then perform Monte Carlo simulations to verify the theoretical results, and compare the performance of the proposed scheme with that of the conventional LEACH scheme without using the jamming technique.
Copyright © 2019 Dang The Hung et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
