A Secure Transmission Scheme Based on Efficient Transmission Fountain Code

FCMPR:A multi-path secure transmission method based on link security assessment and fountain coding

This paper investigates Fountain codes and applications to wireless broadcast. In this paper, we extend Fountain codes on erasure channels to arbitrary channel types by first taking into account the symbol information and Belief Propagation (BP) algorithm. We propose a rateless-coding framework based on Fountain codes, which allow reliable wireless broadcast communications and asynchronous data access simultaneously. Considering the flexible code rate characteristic, we find a new measurement to evaluate the performance of Fountain codes in the wireless environment. Via comparing the performance of two types of Fountain codes: Luby Transform (LT) codes and Raptor codes within this framework, we get the conclusion that Fountain codes will be sufficient to fulfill both requirements in a wireless system. We also demonstrate such a framework has advantages in efficiency, reliability, and robustness.

In this paper, we study the problem of secure communication over the broadcast channel with receiver side information, under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). Several coding schemes are proposed by extending known results in broadcast channels to this secrecy setting. In particular, individual secrecy provided via one-time pad signal is utilized in the coding schemes. As a result, we obtain an achievable rate region together with a characterization of the capacity region for special cases of either a weak or strong eavesdropper (compared to both legitimate receivers). Interestingly, the capacity region for the former corresponds to a line and the latter corresponds to a square with missing corners; a phenomenon occurring due to the coupling between user’s rates. At the expense of having a weaker notion of security, positive secure transmission rates are always guaranteed, unlike the case of the joint secrecy constraint.

We propose a new nonlinear Rao-Nam like symmetric key encryption scheme. In our design, we employ a specific type of coded modulation schemes namely quasi-cyclic low-density parity-check (QC-LDPC) lattice-codes which have low-complexity encoding and decoding algorithms. Due to the application of coded modulation schemes in our design, the proposed scheme performs encryption, encoding and modulation simultaneously. Therefore, we regard the proposed scheme as a joint cryptosystem. The proposed joint cryptosystem withstands all variants of chosen plaintext attacks applied on Rao-Nam like cryptosystems due to its nonlinearity. Moreover, some conditions implying the uniformity of the ciphertexts distribution are introduced through our analysis. Our scheme is efficient and admits small key size. These features are obtained due to several reasons including the quasi-cyclic form of the generator and the parity-check matrices of QC-LDPC lattice-codes, and the simple hardware structure for generating the permutation matrix, the intentional error vector and the nonlinear functions used in our design. The QC-LDPC lattice-codes facilitate high-rate transmission which is suitable for bandlimited AWGN channels. Our simulations indicate that QC-LDPC lattice-codes outperform the error performance of high-order coded modulation schemes based on QAM modulations. Hence, our scheme provides secure, reliable and efficient data transmission in bandlimited AWGN channels.

Introduction: Data transmission reliability analysis when using noise-immune coding in channels with grouping of errors (in particular, in radio channels with interference and fading of the received signals) is complicated by the need to use discrete data transmission channel models which take into account the error grouping, differing from the traditional binomial model. The complexity of the analytical description of such models leads to the fact that the quality indicators of data transmission over channels with error grouping are usually analyzed by simulation methods, and the development of analytical models of data transmission discrete channels with grouping of errors is one of the modern direction in the noise-immune coding theory development. Purpose: Finding the additive boundary of a bit error probability for data transmission discrete channel with grouping of symbol errors, described by Elliot — Hilbert model. Results: For the case of data transmission using a group noise-immune code, analytical expressions are obtained for calculating the additive boundary of a bit error probability in a discrete data transmission channel with grouping of symbol errors. The obtained expressions take into account the features of data transmission over a channel with error grouping, in particular, the fact that the probabilities of various combinations of the same number of errors are not equal to each other. Examples are presented of calculating a bit error probability for the case of using noise-immune codes which correct errors. It is shown that for any code length, the use of the Elliot — Hilbert model allows you to substantially refine the results of calculating the probabilistic indicators of the reliability of data transmission in channels with error grouping, as compared to the original binomial model. The obtained results are compared to the results of the simulation. Practical relevance: The results can be used in the design and analysis of the characteristics of data transmission systems for various purposes, operating under conditions of error grouping. Using analytical expressions to calculate the probability indicators of the reliability of data transfer allows you to abandon complex simulation modeling of transmitting data in channels with error grouping at the stage of choosing a noise-immune code and its parameters.

Internet of Medical Things (IoMT) is a breakthrough technology in the transfer of medical data via a communication system. Wearable sensor devices collect patient data and transfer them through mobile internet, that is, the IoMT. Recently, the shift in paradigm from manual data storage to electronic health recording on fog, edge, and cloud computing has been noted. These advanced computing technologies have facilitated medical services with minimum cost and available conditions. However, the IoMT raises a high concern on network security and patient data privacy in the health care system. The main issue is the transmission of health data with high security in the fog computing model. In today's market, the best solution is blockchain technology. This technology provides high-end security and authentication in storing and transferring data. In this research, a blockchain-based fog computing model is proposed for the IoMT. The proposed technique embeds a block chain with the yet another consensus (YAC) protocol building security infrastructure into fog computing for storing and transferring IoMT data in the network. YAC is a consensus protocol that authenticates the input data in the block chain. In this scenario, the patients and their family members are allowed to access the data. The empirical outcome of the proposed technique indicates high reliability and security against dangerous threats. The major advantages of using the blockchain model are high transparency, good traceability, and high processing speed. The technique also exhibits high reliability and efficiency in accessing data with secure transmission. The proposed technique achieves 95% reliability in transferring a large number of files up to 10,000.

Solving channel equalization problem in communication systems is based on adaptive ltering algorithms. Today,Mobile Agents (MAs) with Recurrent Neural Networks (RNNs) can be also adopted for e ective interferencereduction in modern wireless communication systems (WCSs). In this paper MAs with RNNs are proposed asnovel computing algorithms for reducing interferences in WCSs performing an adaptive channel equalization.The method to provide it is so called MAs-RNNs. We perform the implementation of this new paradigm forinterferences reduction. Simulations results and evaluations demonstrates the e ectiveness of this approach andas better transmission performance in wireless communication network can be achieved by using the MAs-RNNsbased adaptive ltering algorithm.Keywords: Wireless communication systems, Mobile Agents, Recurrent Neural Networks, interferences reduc-tion, channel equalization 1. INTRODUCTION New challenges in modern communication is to conceive highly reliable and fast communication system deprivedfrom problems caused by multipath fading in wireless channels. A very important problem in data commu-nications is channel equalization. i.e., the removal of interferences introduced by linear or nonlinear messagecorrupting mechanisms. Thus the originally transmitted symbols can be recovered correctly at the receiver.New techniques to provide the optimal detection under bad channel estimation and solving the channel equal-ization must be developed and evaluated. To achieve fast and reliable wireless digital communication, as forinter-symbol interference (ISI), studies must concern adaptive equalization to minimize the communication errors

Fountain codes, as a kind of rateless codes, can be used to transmit information over any unstable channels. In wireless communications, the channels may suffer from different kinds of fading, which results in unpredictable performance in some scenarios. In this paper, we start to investigate the performance of fountain codes over wireless channels by taking its encoding mechanism into account. Here three different random encoding generators are considered. Some simulation results indicated that the selection of random encoding generators has a certain impact on the performance of LT codes for different signal-to-noise ratio over AWGN channels.

We study the transmission of a common message and three confidential messages over a broadcast channel with two legitimate receivers and an eavesdropper. Each legitimate receiver is interested in decoding two of the three confidential messages, while having the third one as side information. In order to measure the ignorance of the eavesdropper about the confidential messages, we investigate two different secrecy criteria: joint secrecy and individual secrecy. For both criteria, we provide a general achievable rate region. We establish both the joint and individual secrecy capacity if the two legitimate receivers are less noisy than the eavesdropper. We further investigate the scenario where the eavesdropper is less noisy than the two legitimate receivers. It is known that the joint secrecy constraints can not be fulfilled under this scenario, however, we manage to establish a non vanishing capacity region for the individual secrecy case.

In this paper, we first analyse bit error rate (BER) bounds of the distributed network coding (DNC) scheme based on the Luby-transform (LT) codes, which is a class of fountain codes, for wireless sensor networks (WSNs). Then we investigate the effect from two parameters of the degree distributions, i.e., the degree value and the proportion of odd degree, to the performance of the LT-based DNC scheme. Based on the analysis and investigation results, a degree distribution design criteria is proposed for the DNC scheme based on fountain codes over Rayleigh fading channels. We compare the performance of the DNC scheme based on fountain codes using degree distributions designed in this paper with other schemes given in the literature. The comparison results show that the degree distributions designed by using the proposed criteria have better performance.

The Joint Photographic Experts Group (JPEG) standard is widely used for coding still images. The JPEG standard includes two basic compression methods. A DCT-based method is specified for `lossy' compression, and a predictive method for `lossless' compression. JPEG features a simple lossy technique known as the Baseline method which has been by far the most widely implemented method for large number of applications. It is very sensitive to transmission errors and can be employed successfully only when the transmission channel is nearly error free. Wireless communication channels are characterized by long bursts of data errors, and average bit error rates (BERs) of 10-3 to 10-4. This paper presents an efficient scheme to transmit JPEG coded images over wireless channels. The compressed image is protected against various channel effects of wireless channel using Reed Solomon block code and transmitted over wireless channel.

The paper develops existing mathematical models for assessing the radio channel's operational conditions, taking into account the zones of electromagnetic availability of radio radiation sources, which is a key factor in organizing stable radio communication at a tactical depth of up to 5–10 km. A methodology for determining the conditions of unavailability of radio means for suppression and the conditions of sufficiency of their protection is proposed, which is based on an energy approach and takes into account the power of radio transmitters, the sensitivity of receivers, the characteristics of antenna directional patterns and the loss of radio wave propagation. Based on the specified methodology, a computer program for operational support of interference-proof operation of the mobile radio communication channel of the security forces of Ukraine has been implemented. The software tool allows you to determine the zones of electromagnetic availability, analyze the impact of the system of sources of intentional interference on the radio channel, and calculate the boundaries of interference-proof radio communication between the control point and the mobile group on a topographic map. Examples of scenarios are given that demonstrate the change in interference immunity depending on the type of antenna beam patterns and the spatial mutual arrangement of objects. The results obtained confirm that the correct choice of azimuth angles and the type of antenna beam pattern allows to significantly increase the security of the radio channel even in the presence of several sources of intentional interference. The obtained practical results can be used in the work of the control bodies of the security forces of Ukraine during crisis situations to ensure interference-resistant and intelligence-protected transmission of operational information during the preparation and conduct of operations of troops (forces), in scientific research works when designing new systems for protecting radio networks, in the educational process when training officers in the management of radio communication units.

Erythrocyte membrane-camouflaged carrier-free nanoassembly of FRET photosensitizer pairs with high therapeutic efficiency and high security for programmed cancer synergistic phototherapy

Wireless communication plays a crucial role in the automation process in the industrial environment. However, the open nature of wireless communication renders industrial wireless sensor networks susceptible to malicious attacks that impersonate authorized nodes. The heterogeneity of the wireless transmission channel, coupled with hardware and software limitations, further complicates the issue of secure authentication. This form of communication urgently requires a lightweight authentication technique characterized by low complexity and high security, as inadequately secure communication could jeopardize the evolution of industrial devices. These requirements are met through the introduction of physical layer authentication. This article proposes novel deep learning (DL) models designed to enhance physical layer authentication by autonomously learning from the frequency domain without relying on expert features. Experimental results demonstrate the effectiveness of the proposed models, showcasing a significant enhancement in authentication accuracy. Furthermore, the study explores the efficacy of various DL architecture settings and traditional machine learning approaches through a comprehensive comparative analysis.

The demand for wireless communication has grown in recent years due to increase use of mobile services. The wireless communication channel constitutes the basic physical link established in the transmitter and the receiver. It is the challenging situation to model any wireless channel for radio wave propagation over tough geographical terrain like hilly areas, sea surface, mountains, etc. Channel modeling is one of the most fundamental aspects for study of optimization and design of transmitter and receiver. The operating environment factors like fading, multipath propagation, types of geographical areas limit the performance of wireless communication system. In this paper, wireless channel is modeled by randomly time-variant linear systems. The behavioral analysis of the channel model is performed for both the Rayleigh and Rician fading channels in terms of error probability, and it is shown that in small-scale fading, the Rayleigh fading can be preferred over Rician fading due to high SNR.