China Communications

Archive

  • Select all
    |
    Modified
  • Modified
    Survey on Quantum Information Security
    Huanguo Zhang, Zhaoxu Ji, Houzhen Wang, Wanqing Wu
    2019, 16(10): 1-36.
    Abstract ( )   Knowledge map   Save
    The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above.
    • COMMUNICATIONS THEORIES & SYSTEMS
  • COMMUNICATIONS THEORIES & SYSTEMS
    A Novel Beam Design Method for mmWave Multi- Antenna Arrays with Mutual Coupling Reduction
    Weizhi Zhong, Lei Xu, Qiuming Zhu, Xiaomin Chen, Jianjiang Zhou
    2019, 16(10): 37-44.
    Abstract ( )   Knowledge map   Save
    To overcome the mutual coupling (MC) of multiple antennas in millimeter wave (mmWave) communication systems, a novel beam design method with low complexity is proposed in this paper. Firstly, an equivalent channel model incorporating the effect of MC is analyzed and established, and then an optimal precoding / combiner vector for beamforming is derived. On this basis, by using greedy geometric (GG) algorithm, a novel hybrid beam design method is proposed. Finally, the performance of proposed method is analyzed and compared with other traditional ones. The simulation results show that the proposed method has better suppression of the MC effect as well as lower complexity.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Hybrid Precoding for mmWave Massive MIMO Systems with Different Antenna Arrays
    Qingfeng Ding, Yuqian Deng, Xinpeng Gao, Mengxia Liu
    2019, 16(10): 45-55.
    Abstract ( )   Knowledge map   Save
    In this paper, the performance of hybrid precoding is investigated for mmWave massive MIMO systems with different antenna arrays. The hybrid precoding with partially connected architecture (PCA) is adopted. The spectral efficiency (SE) and received energy efficiency (EE) are investigated by considering four types of antenna arrays, including uniform linear array (ULA), uniform rectangular planar array (URPA), uniform hexagonal planar array (UHPA), and uniform circular planar array (UCPA), respectively. We focus on analysis at the antenna response vector and utilize the idea of orthogonal matching pursuit algorithm to seek the optimal hybrid precoder. Furthermore, the trade-off of precoding architectures is studied between SE and received EE. Simulation results show that if the uniform planar array antenna is more concentrated, the SE and receive EE will be higher. Considering SE and received EE, the performance of planar arrays outperform linear array. There exist different optimal radio-frequency chain numbers to maximize the SE for planar array and linear array. In addition, the PCA can achieve relatively higher received EE while the SE is close to the fully connected architecture and the full digital architecture.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Cooperative Beamforming for Multi-Relay Networks with Limited Feedback
    Jia Zhu, Ying Yao, Yulong Zou*, Tong Wu
    2019, 16(10): 56-64.
    Abstract ( )   Knowledge map   Save
    In this paper, we consider a multi-relay cooperative communication network that consists of a source node transmitting to its destination with the help of multiple decode-and- forward (DF) relays. Specifically, the DF relays that succeed in decoding the source signal are allowed to re-transmit their decoded results simultaneously to the destination in a cooperative beamforming manner. In order to carry out the cooperative beamforming, the destination needs to send the quantized channel state information (CSI) to the relays through a limited feedback channel in the face of channel quantization errors (CQE). We propose a CQE oriented multi-relay beamforming (MRB) scheme, denoted CQE-MRB for short, for the sake of improving the throughput of relay-destination transmissions. An effective throughput defined as the difference between the transmission rate and the feedback rate is used to measure an outage probability of the source-destination transmission. Simulation results demonstrate that the outage performance of proposed CQE-MRB scheme is improved substantially with an increasing number of relays. Moreover, it is shown that the number of channel quantization bits can be further optimized to minimize the outage probability of proposed CQE-MRB scheme.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Improved MPEG-4 High-Efficiency AAC With Variable-Length Soft-Decision Decoding of the Quantized Spectral Coefficients
    Sai Han, Hongbing Ma, Ping Zhang, Tim Fingscheidt
    2019, 16(10): 65-82.
    Abstract ( )   Knowledge map   Save
    MPEG-4 High-Efficiency Advanced Audio Coding (HE-AAC) is designed for low bit rate applications, such as audio streaming in mobile communications. The HE-AAC audio codec offers a better coding efficiency since variable-length codes (VLCs) are adopted. However, HE-AAC has originally been designed for storage and error-free transmission conditions. For the transmission over bit error-prone channels, error propagation is a serious problem for the VLCs. Therefore, a robust HE-AAC decoder is desired, especially for mobile communications. In contrast to traditional hard-decision decoding, utilizing bit-wise channel reliability information, softdecision (SD) decoding has been known to offer better audio quality. In HE-AAC, the global gain parameter is coded with fixed-length codes (FLCs), while the scale factors and quantized spectral coefficients are coded with VLCs. In this work, we apply FL/SD decoding to the global gain parameter, VL/SD decoding to the parameters scale factors and quantized spectral coefficients. Especially, in order to apply VL/SD decoding to the quantized spectral coefficients, a new modified trellis representation in VL/SD decoding is proposed. An improved HE-AAC performance is clearly observed, with the support of both instrumental measurements and a subjective listening test.
  • COMMUNICATIONS THEORIES & SYSTEMS
    An Efficient Outlier Detection Approach on Weighted Data Stream Based on Minimal Rare Pattern Mining
    Saihua Cai, Ruizhi Sun, Shangbo Hao, Sicong Li, Gang Yuan
    2019, 16(10): 83-99.
    Abstract ( )   Knowledge map   Save
    The distance-based outlier detection method detects the implied outliers by calculating the distance of the points in the dataset, but the computational complexity is particularly high when processing multidimensional datasets. In addition, the traditional outlier detection method does not consider the frequency of subsets occurrence, thus, the detected outliers do not fit the definition of outliers (i.e., rarely appearing). The pattern mining-based outlier detection approaches have solved this problem, but the importance of each pattern is not taken into account in outlier detection process, so the detected outliers cannot truly reflect some actual situation. Aimed at these problems, a two-phase minimal weighted rare pattern mining-based outlier detection approach, called MWRPM-Outlier, is proposed to effectively detect outliers on the weight data stream. In particular, a method called MWRPM is proposed in the pattern mining phase to fast mine the minimal weighted rare patterns, and then two deviation factors are defined in outlier detection phase to measure the abnormal degree of each transaction on the weight data stream. Experimental results show that the proposed MWRPM-Outlier approach has excellent performance in outlier detection and MWRPM approach outperforms in weighted rare pattern mining.
  • COMMUNICATIONS THEORIES & SYSTEMS
    V2X-Communication Assisted Interference Minimization for Automotive Radars
    Jingxuan Huang, Zesong Fei, Tianxiong Wang, Xinyi Wang, Fan Liu, Haijun Zhou, J. Andrew Zhang, Guohua Wei
    2019, 16(10): 100-111.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the development of automated driving vehicles, more and more vehicles will be fitted with more than one automotive radars, and the radar mutual interference will become very significant. Vehicle to everything (V2X) communication is a potential way for coordinating automotive radars and reduce the mutual interference. In this paper, we analyze the positional relation of the two radars that interfere with each other, and evaluate the mutual interference for different types of automotive radars based on Poisson point process (PPP). We also propose a centralized framework and the corresponding algorithm, which relies on V2X communication systems to allocate the spectrum resources for automotive radars to minimize the interference. The minimum spectrum resources required for zero-interference are analyzed for different cases. Simulation results validate the analysis and show that the proposed framework can achieve near-zero-interference with the minimum spectrum resources.
    • NETWORKS & SECURITY
  • NETWORKS & SECURITY
    A Novel Shilling Attack Detection Model Based on Particle Filter and Gravitation
    Lingtao Qi, Haiping Huang, Feng Li, Reza Malekian, Ruchuan Wang
    2019, 16(10): 112-132.
    Abstract ( )   Knowledge map   Save
    With the rapid development of e-commerce, the security issues of collaborative filtering recommender systems have been widely investigated. Malicious users can benefit from injecting a great quantities of fake profiles into recommender systems to manipulate recommendation results. As one of the most important attack methods in recommender systems, the shilling attack has been paid considerable attention, especially to its model and the way to detect it. Among them, the loose version of Group Shilling Attack Generation Algorithm (GSAGenl) has outstanding performance. It can be immune to some PCC (Pearson Correlation Coefficient)-based detectors due to the nature of anti-Pearson correlation. In order to overcome the vulnerabilities caused by GSAGenl, a gravitation-based detection model (GBDM) is presented, integrated with a sophisticated gravitational detector and a decider. And meanwhile two new basic attributes and a particle filter algorithm are used for tracking prediction. And then, whether an attack occurs can be judged according to the law of universal gravitation in decision-making. The detection performances of GBDM, HHT-SVM, UnRAP, AP-UnRAP Semi-SAD, SVM-TIA and PCA-P are compared and evaluated. And simulation results show the effectiveness and availability of GBDM.
  • NETWORKS & SECURITY
    TVIDS: Trusted Virtual IDS With SGX
    Juan Wang, Shirong Hao, Yi Li, Zhi Hong, Fei Yan, Bo Zhao, Jing Ma, Huanguo Zhang
    2019, 16(10): 133-150.
    Abstract ( )   Knowledge map   Save
    Network functions such as intrusion detection systems (IDS) have been increasingly deployed as virtual network functions or outsourced to cloud service providers so as to achieve the scalability and agility, and reducing equipment costs and operational cost. However, virtual intrusion detection systems (VIDS) face more serious security threats due to running in a shared and virtualized environment instead of proprietary devices. Cloud service providers or malicious tenants may illegally access and tamper with the policies, packet information, and internal processing states of intrusion detection systems, thereby violating the privacy and security of tenant’s networks. To address these challenges, we use Intel Software Guard Extensions (SGX) to build a Trusted Virtual Intrusion Detection System (TVIDS). For TVIDS, to prevent cloud service providers from accessing sensitive information about the users’ network, we build a trusted execution environment for security policy, packets processing, and internal state so that cloud service providers and other malicious tenants can’t access the protected code, policy, processing states, and packets information of the intrusion detection system. We implemented TVIDS on the basis of the Snort which is a famous open-source IDS and evaluated its results on real SGX hardware. The results show that our method can protect the security of the virtual IDS and brings acceptable performance overhead.
  • NETWORKS & SECURITY
    A Sensing Layer Network Resource Allocation Model Based on Trusted Groups
    Bei Gong, Xipeng Zhang, Shen He, Nan Tian, Yubo Wang
    2019, 16(10): 151-173.
    Abstract ( )   Knowledge map   Save
    There are many heterogeneous sensing nodes in the sensing layer of the Internet of Things, and the amount of data transmission is huge, which puts high requirements on the allocation of network bandwidth. At the same time, untrusted sensing nodes maliciously invade network resources. Therefore, how to confirm whether a sensing node is trusted and reasonably allocate network resources is an urgent problem to be solved. To resolve this issue, this paper proposes a sensing network resource allocation model based on trusted groups. Through the sensing node computing environment and behavior measurement, we can identify and exclude untrusted nodes, so the trusted group can be built. Then the network resources are distributed from a global perspective. Based on the available bandwidth of the link, a network resource fusion model of IPv4 and IPv6 is proposed. On this basis, a global network resource allocation model is further proposed. Afterwards, real-time monitoring of data transmission behavior ensures data security during transmission. Simulation experiments show that this mechanism can effectively optimize the bandwidth allocation in the data transmission process and has little effect on the running efficiency of existing network applications. At the same time, it can effectively guarantee the trust of nodes and achieve trusted data transmission.
  • NETWORKS & SECURITY
    New Identity Based Proxy Re-Encryption Scheme from Lattices
    Liqiang Wu, Xiaoyuan Yang, Minqing Zhang, Longfei Liu
    2019, 16(10): 174-190.
    Abstract ( )   Knowledge map   Save
    Identity-Based Proxy Re-Encryption (IB-PRE) allows a semi-trusted proxy to convert the ciphertext encrypted under Alice’s identity into Bob’s ciphertext of the same message without leaking plaintext. Lattice-based cryptography enjoys potential resistance to quantum analysis and low computational complexity. A multi-hop and unidirectional IB-PRE from lattices is presented. We split the functions of decryption and ciphertext transformation separately, and design the double private keys mechanism, where two keys are generated for each user, one key is used to decrypt the ciphertext by Pre-Image Sampling technique, and the other is used to generate the re-encryption key by Bonsai Trees technique. The generation of the re-encryption key is non-interactive and collusion resistant. Moreover, its IND-sID-CPA security over the decisional Learning With Errors (LWE) assumption under the standard model is proved. Compared with some previous IB-PRE schemes from Bilinear Pairings, the format of transformed ciphertext in our scheme remains unchanged, furthermore, it can also resist quantum analysis. Compared with some existing IB-PRE schemes from lattices with similar properties, the space of the message in our scheme is a vector of length l and the encryption process remains a lower encryption blowup factor. At last, a proof-of-concept implementation is provided.
    • EMERGING TECHNOLOGIES & APPLICATIONS
  • EMERGING TECHNOLOGIES & APPLICATIONS
    A Real Plug-and-Play Fog: Implementation of Service Placement in Wireless Multimedia Networks
    Jianwen Xu, Kaoru Ota, Mianxiong Dong
    2019, 16(10): 191-201.
    Abstract ( )   Knowledge map   Save
    Initially as an extension of cloud computing, fog computing has been inspiring new ideas about moving computing tasks to the edge of networks. In fog, we often repeat the procedure of placing services because of the geographical distribution of mobile users. We may not expect a fixed demand and supply relationship between users and service providers since users always prefer nearby service with less time delay and transmission consumption. That is, a plug-and-play service mode is what we need in fog. In this paper, we put forward a dynamic placement strategy for fog service to guarantee the normal service provision and optimize the Quality of Service (QoS). The simulation results show that our strategy can achieve better performance under metrics including energy consumption and end-to-end latency. Moreover, we design a real Plug-and-Play Fog (PnPF) based on Raspberry Pi and OpenWrt to provide fog services for wireless multimedia networks.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    Distributed Optimal Control for Traffic Networks with Fog Computing
    Yijie Wang, Lei Wang, Saeed Amir, Qing-Guo Wang
    2019, 16(10): 202-213.
    Abstract ( )   Knowledge map   Save
    This paper presents a distributed optimization strategy for large-scale traffic network based on fog computing. Different from the traditional cloud-based centralized optimization strategy, the fog-based distributed optimization strategy distributes its computing tasks to individual sub-processors, thus significantly reducing computation time. A traffic model is built and a series of communication rules between subsystems are set to ensure that the entire transportation network can be globally optimized while the subsystem is achieving its local optimization. Finally, this paper numerically simulates the operation of the traffic network by mixed-Integer programming, also, compares the advantages and disadvantages of the two optimization strategies.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    Application of Neural Network in Fault Location of Optical Transport Network
    Tianyang Liu, Haoyuan Mei, Qiang Sun, Huachun Zhou
    2019, 16(10): 214-225.
    Abstract ( )   Knowledge map   Save
    Due to the increasing variety of information and services carried by optical networks, the survivability of network becomes an important problem in current research. The fault location of OTN is of great significance for studying the survivability of optical networks. Firstly, a three-channel network model is established and analyzing common alarm data, the fault monitoring points and common fault points are carried out. The artificial neural network is introduced into the fault location field of OTN and it is used to judge whether the possible fault point exists or not. But one of the obvious limitations of general neural networks is that they receive a fixed-size vector as input and produce a fixed-size vector as the output. Not only that, these models is even fixed for mapping operations (for example, the number of layers in the model). The difference between the recurrent neural network and general neural networks is that it can operate on the sequence. In spite of the fact that the gradient disappears and the gradient explodes still exist in the neural network, the method of gradient shearing or weight regularization is adopted to solve this problem, and choose the LSTM (long-short term memory networks) to locate the fault. The output uses the concept of membership degree of fuzzy theory to express the possible fault point with the probability from 0 to 1. Priority is given to the treatment of fault points with high probability. The concept of F-Measure is also introduced, and the positioning effect is measured by using location time, MSE and F-Measure. The experiment shows that both LSTM and BP neural network can locate the fault of optical transport network well, but the overall effect of LSTM is better. The localization time of LSTM is shorter than that of BP neural network, and the F1-score of LSTM can reach 0.961566888396156 after 45 iterations, which meets the accuracy and real-time requirements of fault location. Therefore, it has good application prospect and practical value to introduce neural network into the fault location field of optical transport network.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    A Satellite Communication System Transmission Scheme Based on Probabilistic Shaping
    Wei Zhang, Xia Sheng, Xishuo Wang, Qi Zhang
    2019, 16(10): 226-233.
    Abstract ( )   Knowledge map   Save
    In this paper, A transmission scheme based on probabilistic shaping applied to satellite communication systems is proposed. 16QAM is taken as an example to establish a 1GBaud ROF experimental system working in Ka-band. The experiment results show that the PS-16QAM signal has better performance in terms of bit error rate than the uniform 16QAM, and its performance is close to the uniform 8QAM scheme.