China Communications

Archive

  • Select all
    |
    FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    Outage Performance of Non-Orthogonal Multiple Access Based Unmanned Aerial Vehicles Satellite Networks
    Ting Qi, Wei Feng, Youzheng Wang
    2018, 15(5): 1-8.
    Abstract ( )   Knowledge map   Save
    With rapid development of unmanned aerial vehicles (UAVs), more and more UAVs access satellite networks for data transmission. To improve the spectral efficiency, non-orthogonal multiple access (NOMA) is adopted to integrate UAVs into the satellite network, where multiple satellites cooperatively serve the UAVs and mobile terminal using the Ku-band and above. Taking into account the rain fading and the fading correlation, the outage performance is first analytically obtained for fixed power allocation and then efficiently calculated by the proposed power allocation algorithm to guarantee the user fairness. Simulation results verify the outage performance analysis and show the performance improvement of the proposed power allocation scheme.
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    Outage Probability Minimization for Low-Altitude UAV-Enabled Full-Duplex Mobile Relaying Systems
    Meng Hua, Yi Wang,Zhengming Zhang, Chunguo Li, Yongming Huang, Luxi Yang
    2018, 15(5): 9-24.
    Abstract ( )   Knowledge map   Save
    In this paper, a novel unmanned aerial vehicle (UAV)-enabled full duplex decode-and-forward (DF) technique is used in mobile relaying system. Compared with conventional static relaying, mobile relaying provides more degree of freedom for experiencing better channel conditions and further improving the system reliable performance. The source and relay transmit power as well as relay trajectory are jointly optimized for sum outage probability minimization in mobile relaying system. Due to the non-convex nature of the original problem, block coordinate decent optimization techniques are employed to decompose it into two sub-problems, which leads to an efficient iterative algorithm. Specifically, for the pre-determined relay trajectory, the optimal transmit power of source and relay are obtained by solving Karush-Kuhn-Tucker (KKT) conditions. For the given source/relay power allocation, the optimal UAV trajectory is obtained by solving dual problem. Based on the two steps, an iterative algorithm is proposed to jointly optimize source/relay power allocation and UAV trajectory alternately. Numerical results show the performance gain of our proposed scheme.
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    Optimal Deployment Density for Maximum Coverage of Drone Small Cells
    Chao Dong, Jiejie Xie,Haipeng Dai, Qihui Wu, Zhen Qin, Zhiyong Feng
    2018, 15(5): 25-40.
    Abstract ( )   Knowledge map   Save
    With the proliferation of small and mini drones, Drone Small Cells (DSCs) can cooperative multiple drones to provide communication service for ground users as emergency means or supplementary ones of traditional terrestrial cellular networks. In this paper, we study the fundamental problem of optimizing the deployment density of DSCs to achieve the maximum coverage performance. Most related works do not consider cumulative inter-cell interference when studying the coverage performance of DSCs. First, we derive an approximate and closed-form expression of the cumulative inter-cell interference which comes from both probabilistic Line-of-Sight (LoS) and Non-Line-of-Sight (NLoS) links. Then, we analyze the coverage performance of DSCs and derive the transcendental function of optimal deployment density to obtain the maximum coverage. Last, we propose an algorithm to get the optimal deployment density with low complexity. We conduct both field experiments and Matlab simulations to verify the correctness of theoretical analysis. In addition, we show the impact of some factors on the relation between the deployment density and coverage performance through extensive numerical simulations.
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    Energy Efficient Multi-Antenna UAV-Enabled Mobile Relay
    Qingheng Song,Fuchun Zheng
    2018, 15(5): 41-50.
    Abstract ( )   Knowledge map   Save
    In this paper, we study an energy efficient multi-antenna unmanned aerial vehicle (UAV)-enabled half-duplex mobile relaying system under Rician fading channels. By assuming that the UAV follows a circular trajectory at fixed altitude and applying the decode-and-forward relaying strategy, we maximize the energy efficiency by jointly designing beamforming, power allocation, circular radius and flight speed, subject to the sum transmit power constraint on source node and UAV relay node. First, we maximize the end-to-end signal-to-noise ratio by jointly designing beamforming and statistical power allocation. Based on the obtained beamforming and power allocation results, we then obtain a semi closed-form expression of energy efficiency, and finally maximize energy efficiency by optimizing flight speed and circular radius, allowing optimal circular radius to be obtained via numerical computation. Numerical results demonstrate that the proposed scheme can effectively enhance the system energy efficiency.
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    Energy-Efficient Trajectory Planning for UAV-Aided Secure Communication
    Qian Wang, Zhi Chen, Hang Li
    2018, 15(5): 51-60.
    Abstract ( )   Knowledge map   Save
    Wireless communication with unmanned aerial vehicles (UAVs) has aroused great research interest recently. This paper is concerned with the UAV’s trajectory planning problem for secrecy energy efficiency maximization (SEEM) in the UAV communication system. Specifically, we jointly consider the secrecy throughput and UAV’s energy consumption in a three-node (fixed-wing UAV-aided source, destination, and eavesdropper) wiretap channel. By ignoring the energy consumption on radiation and signal processing, the system’s secrecy energy efficiency is defined as the total secrecy rate normalized by the UAV’s propulsion energy consumption within a given time horizon. Nonetheless, the SEEM problem is nonconvex and thus is intractable to solve. As a compromise, we propose an iterative algorithm based on sequential convex programming (SCP) and Dinkelbach’s method to seek a suboptimal solution for SEEM. The algorithm only needs to solve convex problems, and thus is computationally efficient to implement. Additionally, we prove that the proposed algorithm has Karush-Kuhn-Tucker (KKT) point convergence guarantee. Lastly, simulation results demonstrate the efficacy of our proposed algorithm in improving the secrecy energy efficiency for the UAV communication system.
  • FEATURE TOPIC: NETWORK-CONNECTED UAV COMMUNICATIONS
    An Enhanced Direct Anonymous Attestation Scheme with Mutual Authentication for Network-Connected UAV Communication Systems
    Liquan Chen, Sijie Qian, Ming Lim, Shihui Wang
    2018, 15(5): 61-76.
    Abstract ( )   Knowledge map   Save
    In network-connected UAV (NC-UAV) communication systems, user authentication is replaced by platform identity authentication and integrity check because many NC-UAVs are operated without human intervention. Direct anonymous attestation (DAA) is an attractive cryptographic scheme that provides an elegant balance between platform authentication and anonymity. However, because of the low-level computing capability and limited transmission bandwidth in UAV, the existing DAA schemes are not suitable for NC-UAV communication systems. In this paper, we propose an enhanced DAA scheme with mutual authentication (MA-DAA scheme), which meets the security requirements of NC-UAV communication systems. The proposed MA-DAA scheme, which is based on asymmetric pairings, bundles the identities of trusted platform module (TPM) and Host to solve the malicious module changing attacks. Credential randomization, batch proof and verification, and mutual authentication are realized in the MA-DAA scheme. The computational workload in TPM and Host is reduced in order to meet the low computation and resource requirements in TPM and Host. The entire scheme and protocols are presented, and the security and efficiency of the proposed MA-DAA scheme are proved and analyzed. Our experiment results also confirm the high efficiency of the proposed scheme.
    • COMMUNICATIONS THEORIES & SYSTEMS
  • COMMUNICATIONS THEORIES & SYSTEMS
    Horizontal-Based Orchestration for Multi-Domain SFC in SDN/NFV-Enabled Satellite/Terrestrial Networks
    Guanglei Li, Huachun Zhou, Bohao Feng, Guanwen Li, Qi Xu
    2018, 15(5): 77-91.
    Abstract ( )   Knowledge map   Save
    It’s promising to use Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) to integrate satellite and terrestrial networks. To construct network service function chains in such a multi-domain environment, we propose a horizontal-based Multi-domain Service Function Chaining (Md-SFC) orchestration framework. In this framework, multi-domain orchestrators can coordinate with each other to guarantee the end-to-end service quality. Intra-domain orchestrators also coordinate SDN controllers and NFV management components to implement intra-domain service function chains. Based on this, we further propose a heuristic SFC mapping algorithm with a cooperative inter-domain path calculation method to map service function chains to infrastructures. In this method, master multi-domain orchestrator and intra-domain orchestrators coordinate to select proper inter-domain links. We compare the cooperative method with a naive uncooperative way that domains’ topology information is provided to the master multi-domain orchestrator and it calculates the shortest inter-domain path between intra-domain service function chains directly. Simulation results demonstrate that our solution is feasible. It is able to construct end-to-end performance guaranteed service function chain by horizontal-based cooperation. The cooperative inter-domain path calculation method decreases the mapping load for the master orchestrator and gets the same end-to-end performance.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Individualization of Head Related Impulse Responses Using Division Analysis
    Wei Chen,Ruimin Hu,Xiaochen Wang,Cheng Yang,Lian Meng,
    2018, 15(5): 92-103.
    Abstract ( )   Knowledge map   Save
    For Virtual Reality (VR) to be truly immersive, it needs convincing sound to match. Due to the diversity of individual’s anthropometric measurements, the individualized customization technology is needed to get convincing sound. In this paper, we proposed a simple and effective method for modeling relationships between anthropometric measurements and Head-related Impulse Response (HRIR). Considering the relationship between anthropometric measurements and different HRIR parts is complicated, we divided the HRIRs into small segments and carried out regression analysis between anthropometric measurements and each segment to establish relationship model. The results of objective simulation and subjective test indicate that the model can generate individualize HRIRs from a series of anthropometric measurements. With the individualized HRIRs, we can get more accurate acoustic localization sense than using non-individualized HRIRs.
  • COMMUNICATIONS THEORIES & SYSTEMS
    A Highly Isolated Co-Polarized Co-Located Electric and Magnetic Dipoles and Its MIMO Performance
    Xingning Jia, Dazhi Piao
    2018, 15(5): 104-110.
    Abstract ( )   Knowledge map   Save
    In this paper, a co-polarized, co-located electric and magnetic dipoles (CCEMD) with high isolation is presented. The antenna consists of a loop based on segmented line and two independent feeding ports. Two modes of the antenna are exited separately, the first one has a radiation pattern equivalent to an electric dipole by exciting anti-phase current with symmetric distribution, and the second one is like a magnetic dipole by exciting uniform and in-phase currents along the loop. The antenna is fabricated and tested. Its measured common -10 dB impedance bandwidth at two ports is 280 MHz (2.32 - 2.6 GHz) with isolation better than 41 dB. Its MIMO performance in terms of capacity gain (CG) over the SISO system is investigated in a multipath rich environment containing two parallel PEC planes by both measurements and image theory based simulations. Results show that, in free space, the CG results are just slightly larger than 1, however, in the multipath rich channel, the CG values are very close to 2, which indicates that two separate subchannels can be achieved by the proposed CCEMD. The measured results of CG agree well with that obtained by simulation.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Guaranteed Rendezvous Algorithms for Cognitive Radio Networks
    Li Gou, Xiaohua Xu, Chongqing Zhang, Min Song
    2018, 15(5): 111-127.
    Abstract ( )   Knowledge map   Save
    Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence.The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Cooperative Spectrum Sensing over Generalized Fading Channels Based on Energy Detection
    He Huang, Chaowei Yuan
    2018, 15(5): 128-137.
    Abstract ( )   Knowledge map   Save
    This paper analyzes the unified performance of energy detection (ED) of spectrum sensing (SS) over generalized fading channels in cognitive radios (CRs). The detective performance of SS will be obviously affected by fading channels among communication nodes, and ED has the advantages of fast implementation, no requirement of priori received information and low complexity, so it is meaningful to investigate ED over various fading channels. The probability density function (p.d.f.) of α-κ-μ distribution is derived to evaluate energy efficiency for sensing systems. The detection probability with Marcum-Q function has been derived and the close-form expressions with moment generating function (MGF) method are deduced to achieve SS. Furthermore, exact closed-form analytic expressions for average area under the receiver operating characteristics curve () also have been deduced to analyze the performance characteristics of ED over α-κ-μ fading channels. Besides, cooperative spectrum sensing (CSS) with diversity reception has been applied to improve the detection accuracy and mitigate the shadowed fading features with OR-rule. At last, the results show that the detection capacity of ED will be evidently affected by α-κ-μ fading channels, but appropriate channel parameters can improve sensing performance. In addition, the established ED-fading pattern is approved by simulations, and it can significantly enhance the detection performance of proposed algorithms.
    • NETWORKS & SECURITY
  • NETWORKS & SECURITY
    Exploration of Influential People for Viral Marketing
    Muhammad Azam Zia,Zhongbao Zhang, Liutong Chen, Muhammad Hashim, Sen Su
    2018, 15(5): 138-148.
    Abstract ( )   Knowledge map   Save
    Exploration of influential people is really a hot issue for effective viral marketing these days. Prior studies overlooked to consider the influence of interaction between users and the authority of users during information dissemination. In this article, we proposed an innovative concept by employing communication strength and authority in order to explore the influential people. First, we calculated communication strength by three kinds of actions including retweets, comments and mentions. Second, we deliberated authority metric by employing total times getting re-tweeted, number of tweets and followers of a user. Then, we propose a novel algorithm called Influential People Label Propagation Algorithm (IPLPA) that considers the proposed metric to explore the influential people in micro-blog networks. We performed extensive experiments to measure the influence and rank of each person within micro-blog network. The comparative study presents that IPLPA depicted effective people while baseline algorithms retrieved low influenced people at top rank. Additionally, influence dissemination also measured for obtained influential people in order to validate proposed concept. The findings of this study would be useful for viral marketing and advertisement campaigns.
  • NETWORKS & SECURITY
    Towards Incremental Deployment of Diverse Network Architectures on the Internet
    Ming Chen, Ke Ding,Changyou Xing,Honghua Zhao,Qinghua Wu, Gaogang Xie
    2018, 15(5): 149-161.
    Abstract ( )   Knowledge map   Save
    In the past decades, many clean-slate future network architectures have gained limited deployment in current Internet, due to the stability and rigidity of TCP/IP, the narrow waist of the Internet. We first propose three principles that the future Internet architecture should obey to be well-defined network architecture, i.e. supporting service innovation and enabling evolvability. By abstracting different modes from TCP/IP network and SDN technology, we argue that the centric-distributed-centric (CDC) mode has great potential for the well-defined future network architecture in which diverse network architectures could be incrementally deployed and coexist with each other. Prototype system regulated by CDC mode was developed. Experimental results reveal that CDC can support diverse architectures to coexist in the current Internet and thus enables the Internet to evolve.
  • NETWORKS & SECURITY
    RPL Based on Triangle Module Operator for AMI Networks
    Yanan Cao, Muqing Wu
    2018, 15(5): 162-172.
    Abstract ( )   Knowledge map   Save
    the routing protocol for low-power and lossy networks (RPL) has been used in advanced metering infrastructure (AMI) which could provide two-way communication between smart meters and city utilities. To improve the network performance of AMI networks, this paper proposed an improved algorithm of RPL based on triangle module operator (IAR-TMO). IAR-TMO proposes membership functions of the following five typical routing metrics: end-to-end delay, number of hops, expected transmission count (ETX), node remaining energy, and child node count. Moreover, IAR-TMO uses triangle module operator to fuse membership functions of these routing metrics. Then, IAR-TMO selects preferred parents (the next hop) based on the triangle module operator. Theoretical analysis and simulation results show that IAR-TMO has a great improvement when compared with two recent representative algorithms: ETXOF (ETX Objective Function) and OF-FL (Objective Function based on Fuzzy Logic), in terms of network lifetime, average end-to-end delay, etc. Consequently, the network performances of AMI networks can be improved effectively.
  • NETWORKS & SECURITY
    Software Defect Distribution Prediction Model Based on NPE-SVM
    Hua Wei,Chun Shan, Changzhen Hu, Huizhong Sun,Min Lei,
    2018, 15(5): 173-182.
    Abstract ( )   Knowledge map   Save
    During the prediction of software defect distribution, the data redundancy caused by the multi-dimensional measurement will lead to the decrease of prediction accuracy. In order to solve this problem, this paper proposed a novel software defect prediction model based on neighborhood preserving embedded support vector machine (NPE-SVM) algorithm. The model uses SVM as the basic classifier of software defect distribution prediction model, and the NPE algorithm is combined to keep the local geometric structure of the data unchanged in the process of dimensionality reduction. The problem of precision reduction of SVM caused by data loss after attribute reduction is avoided. Compared with single SVM and LLE-SVM prediction algorithm, the prediction model in this paper improves the F-measure in aspect of software defect distribution prediction by 3%~4%.
    • SIGNAL PROCESSING FOR COMMUNICATIONS
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Approximate Iteration Detection and Precoding in Massive MIMO
    Chuan Tang,Yerong Tao, Yancang Chen, Cang Liu, Luechao Yuan, Zuocheng Xing
    2018, 15(5): 183-196.
    Abstract ( )   Knowledge map   Save
    Massive multiple-input multiple-output provides improved energy efficiency and spectral efficiency in 5G. However it requires large-scale matrix computation with tremendous complexity, especially for data detection and precoding. Recently, many detection and precoding methods were proposed using approximate iteration methods, which meet the demand of precision with low complexity. In this paper, we compare these approximate iteration methods in precision and complexity, and then improve these methods with iteration refinement at the cost of little complexity and no extra hardware resource. By derivation, our proposal is a combination of three approximate iteration methods in essence and provides remarkable precision improvement on desired vectors. The results show that our proposal provides 27%-83% normalized mean-squared error improvement of the detection symbol vector and precoding symbol vector. Moreover, we find the bit-error rate is mainly controlled by soft-input soft-output Viterbi decoding when using approximate iteration methods. Further, only considering the effect on soft-input soft-output Viterbi decoding, the simulation results show that using a rough estimation for the filter matrix of minimum mean square error detection to calculating log-likelihood ratio could provide enough good bit-error rate performance, especially when the ratio of base station antennas number and the users number is not too large.
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    A Particle Filter Based Compressive Sensing Method for Tracking Moving Wideband Sound Sources
    Juan Wei, Fengli Yue, Runyu Li, Wenjing Wang, Dan Gao
    2018, 15(5): 197-210.
    Abstract ( )   Knowledge map   Save
    Tracking moving wideband sound sources is one of the most challenging issues in the acoustic array signal processing which is based on the direction of arrival (DOA) estimation. Compressive sensing (CS) is a recent theory exploring the signal sparsity representation, which has been proved to be superior for the DOA estimation. However, the spatial aliasing and the offset at endfire are the main obstacles for CS applied in the wideband DOA estimation. We propose a particle filter based compressive sensing method for tracking moving wideband sound sources. First, the initial DOA estimates are obtained by wideband CS algorithms. Then, the real sources are approximated by a set of particles with different weights assigned. The kernel density estimator is used as the likelihood function of particle filter. We present the results for both uniform and random linear array. Simulation results show that the spatial aliasing is disappeared and the offset at endfire is reduced. We show that the proposed method can achieve satisfactory tracking performance regardless of using uniform or random linear array.
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Wireless Channel Parameter Estimation Algorithms: Recent Advances and Future Challenges
    Rui Feng, Yu Liu, Jie Huang, Jian Sun, Cheng-Xiang Wang,George Goussetis
    2018, 15(5): 211-228.
    Abstract ( )   Knowledge map   Save
    Temporal and three-dimensional (3D) spatial information is important for the characterization of wireless channels. In this paper, the commonly used array signal processing (ASP) methods to estimate channel parameters are summarized. Firstly, algorithms that can be used to estimate azimuth angle of arrival (AAoA) and elevation AoA (EAoA) are introduced. They include multiple signal classification (MUSIC), estimation of signal parameter via rotational invariance techniques (ESPRIT), and Unitary ESPRIT algorithms. Secondly, algorithms that can be used to jointly estimate delay, AAoA, and EAoA are given. They include joint angle and delay estimation (JADE) MUSIC, JADE ESPRIT, shift-invariance (SI) JADE, and space-alternating generalized expectation-maximization (SAGE) algorithms. We also propose an improved SI-JADE algorithm to further reduce computation complexity by incorporating with the Unitary ESPRIT algorithm. Performance of the above algorithms to extract only spatial information and to jointly extract temporal and spatial information is compared in both synthetic and 60 GHz real channel environments. Simulation results show that with the inclusion of delay estimation, the joint temporal and spatial estimation algorithms can provide better resolution than algorithms estimating only angles. Measurement data processing results show that MUSIC algorithm can provide comparable results with SAGE algorithm in estimating AAoA and EAoA. SI-JADE and the improved SI-JADE algorithms are also applicable to process 60 GHz channel measurement data. However, MUSIC, SI-JADE, and the improved SI-JADE algorithms can greatly reduce computational burden compared with SAGE algorithm. At last, some future directions are pointed out.
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Geometric Mean Decomposition Based Hybrid Precoding for Millimeter-Wave Massive MIMO
    Tian Xie, Linglong Dai,Xinyu Gao, Muhammad Zeeshan Shakir, Jianjun Li
    2018, 15(5): 229-238.
    Abstract ( )   Knowledge map   Save
    Hybrid precoding can reduce the number of required radio frequency (RF) chains in millimeter-Wave (mmWave) massive MIMO systems. However, existing hybrid precoding based on singular value decomposition (SVD) requires the complicated bit allocation to match the different signal-to-noise-ratios (SNRs) of different sub-channels. In this paper, we propose a geometric mean decomposition (GMD)-based hybrid precoding to avoid the complicated bit allocation. Specifically, we seek a pair of analog and digital precoders sufficiently close to the unconstrained fully digital GMD precoder. To achieve this, we fix the analog precoder to design the digital precoder, and vice versa. The analog precoder is designed based on the orthogonal matching pursuit (OMP) algorithm, while GMD is used to obtain the digital precoder. Simulations show that the proposed GMD-based hybrid precoding achieves better performance than the conventional SVD-based hybrid precoding with only a slight increase in complexity.