Application of Fountain Code to High-Rate Delay Tolerant Networks

Douglass, Noah P.; Langel, John; Moore, Weiland J.; Ng, Lawrence; Dudukovich, Rachel M.; Mal-Sarkar, Sanchita

doi:10.1109/access.2023.3315659

Cited by 3 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some organizations or companies really need confidential data [1] [2]. Data confidentiality is the sustainability of programs and performance, Especially in licensing and regulatory document data, which contains papers pertaining to permits and rules issued by aviation authorities, such as operating permits and aircraft certification [3].…”

Section: Introductionmentioning

confidence: 99%

Implementation of the Asymmetric Fountain Code Algorithm to Secure Aviation Licensing and Regulatory Document Data

Daniel D Rumani

2024

JITCSE

View full text Add to dashboard Cite

Several agencies, both government and private, require the security of personal data, especially as this information can only be accessed or transmitted to authorized people or organizations. Likewise with license and regulatory records, these materials are exceedingly confidential. Documents pertaining to permissions and regulations issued by aviation authorities, such as operating permits and aircraft certification, However, the difficulty is that when data is distributed using an internet connection, it can slip into the hands of unscrupulous people. Implementation of the Asymmetric Fountain Code Algorithm to safeguard confidential text data is used to safeguard license and regulatory document data with encryption and description methods using the Fountain Code Algorithm, which has two keys to access plaintext and ciphertext documents using SharpDevelop 5.1 software in the C# language. This research reveals that the outputs of the Fountain Code algorithm can restore plaintext data in its entirety. So it can be inferred that the asymmetric Fountain Code algorithm meets good data integrity and is safe; the complexity of the algorithm is simpler; and the amount of plaintext is exactly related to time.

show abstract

Section: Introductionmentioning

confidence: 99%

Implementation of the Asymmetric Fountain Code Algorithm to Secure Aviation Licensing and Regulatory Document Data

Daniel D Rumani

2024

JITCSE

View full text Add to dashboard Cite

show abstract

“…On the receiver side, they only need to collect a sufficient number of encoded packets to decode the transmitted messages. It, thus, is very suitable for serving multicast and/or broadcast networks where re-transmission a huge number of packets will become the bottleneck of the whole networks [4]. As a result, in the present paper, we investigate the satellite-terrestrial communications employing FCs.…”

Section: Introductionmentioning

confidence: 99%

On the Security and Reliability Trade-off of the Satellite Terrestrial Networks with Fountain Codes and Friendly Jamming

Nguyen,

Tran

et al. 2023

EAI Endorsed Trans Ind Net Intel Syst

View full text Add to dashboard Cite

The performance of the satellite-terrestrial network with Fountain codes (FCs) is conducted in the present work. More precisely, the air-to-ground link is modeled according to the shadow-Rician distribution to capture the strong light-of-sight (LOS) path as well as the impact of the shadowing. As a result, we employ the directional beamforming at both the satellite and relay to mitigate such an ultra-long transmission distance. We investigate the trade-off between the reliability and security aspects. Particularly, we derive the outage probability (OP) and intercept probability (IP) in the closed-form expressions. To further facilitate the security of the considered networks, the friendly jamming scheme is deployed as well. Finally, simulation results based on the Monte-Carlo method are given to corroborate the exactness of the developed mathematical framework and to identify key parameters such as antenna gain, and transmit power that have a big impact on the considered networks.

show abstract