Memory-Based LT Codes for Efficient 5G Networks and Beyond

The next-generation networks (5G and beyond) require robust channel codes to support their high specifications, such as low latency, low complexity, significant coding gain, and flexibility. In this paper, we propose using a fountain code as a promising solution to 5G and 6G networks, and then we propose using a modified version of the fountain codes (Luby transform codes) over a network topology (Y-network) that is relevant in the context of the 5G networks. In such a network, the user can be connected to two different cells at the same time. In addition, the paper presents the necessary techniques for analyzing the system and shows that the proposed scheme enhances the system performance in terms of decoding success probability, error probability, and code rate (or overhead). Furthermore, the analyses in this paper allow us to quantify the trade-off between overhead, on the one hand, and the decoding success probability and error probability, on the other hand. Finally, based on the analytical approach and numerical results, our simulation results demonstrate that the proposed scheme achieves better performance than the regular LT codes and the other schemes in the literature.

Improving the data recovery for short length LT codes

Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.

An Efficient Secure and Flexible Data Sharing in Cloud Computing using Asymmetric Algorithm

Cloud Security is a technique of safeguarding applications, infrastructures and data involved in cloud computing. Cloud security uses a set of technologies, policies and controls to protect data and application from unauthorized access. RSA encryption and decryption algorithm is presented here for cloud security. The cloud can access the data only after receiving the user’s encrypted message using RSA algorithm. However, while transmitting the encrypted message more bandwidth is consumed as the message is transmitted over wireless channel. To minimize the bandwidth, the encrypted message is transmitted into a number of encoded bits and the cloud service provider can append the bits and recover the original message. The performance results for RSA algorithm and the RSA algorithm using Fountain Code are simulated. The results show that the energy, end-to-delay are minimized while using Fountain Code RSA algorithm. In addition, the packet loss ratio decrease and the packet delivery ratio increase.