Relay Selection Strategy in the Secure Cooperative Communications System

With the low cost and low hardware complex considerations,cooperative systems are a tendency in the future communications.This work considers the secure cooperative communications systems.For a practical situation in the system,the scenario includes multiple source stations,multiple relay stations,multiple destination stations,and eavesdroppers.To analyze the optimal relay selection in the system,we begin with the performance analysis for a single source station and a single destination station.By applying two cooperative models,the amplify-andforward（AF） mode and decode-and-forward（DF）mode,the secrecy capacity is derived.Then,we apply the derived results to the considered environment to find the optimal relay assignment.By the way,the relay selection can be obtained by the exhaustive search algorithm.However,there are a lot of steps needed if the number of source stations is large.Hence,applying the characters of the cooperative modes in the relay selection,the pre-selection step is proposed with a mathematical derivation.It could be used for the practical situation without a long-time calculation.

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

Reversible Data Hiding Based on Greedy Pairing Prediction-Error Expansion

Reversible data hiding(RDH)is a method to embed messages into an image that human eyes are difficult to recognize the differences between the original image and the embedded image.The method needs to make sure that the original image and the embedded information can be exactly recovered.The prediction-error expansion(PEE)is a successful way to realize RDH.However,it is fixed when pairing the conventional twodimensional prediction-error histogram(2D-PEH).So,the embedding capacity(EC)and embedding distortion(ED)are not satisfactory.In this study,we propose a method called greedy pairing prediction-error expansion(GPPEE)based on pairwise RDH and demonstrate GPPEE can achieve a more efficient embedding goal and reduce ED.

Exploration of the Relation between Input Noise and Generated Image in Generative Adversarial Networks

In this paper,we propose a hybrid model aiming to map the input noise vector to the label of the generated image by the generative adversarial network(GAN).This model mainly consists of a pre-trained deep convolution generative adversarial network(DCGAN)and a classifier.By using the model,we visualize the distribution of two-dimensional input noise,leading to a specific type of the generated image after each training epoch of GAN.The visualization reveals the distribution feature of the input noise vector and the performance of the generator.With this feature,we try to build a guided generator(GG)with the ability to produce a fake image we need.Two methods are proposed to build GG.One is the most significant noise(MSN)method,and the other utilizes labeled noise.The MSN method can generate images precisely but with less variations.In contrast,the labeled noise method has more variations but is slightly less stable.Finally,we propose a criterion to measure the performance of the generator,which can be used as a loss function to effectively train the network.

Modeling and Verification of a Sentiment Analysis System Using Aspect-Oriented Petri Nets

An increasing number of social media and networking platforms have been widely used. People usually post the online comments to share their own opinions on the networking platforms with social media. Business companies are increasingly seeking effective ways to mine what people think and feel regarding their products and services. How to correctly understand the online customers’ reviews becomes an important issue. This study aims to propose a method with the aspect-oriented Petri nets(AOPN) to improve the examination correctness without changing any process and program. We collect those comments from the online reviews with Scrapy tools, perform sentiment analysis using SnowNLP, and examine the analysis results to improve the correctness. In this paper, we apply our method for a case of the online movie comments. The experimental results have shown that AOPN is helpful for the sentiment analysis and verifying its correctness.