China Communications

Archive

  • Select all
    |
    COMMUNICATIONS SYSTEMS AND THEORIES
  • COMMUNICATIONS SYSTEMS AND THEORIES
    Impacts of Packet Collisions on Link Throughput in CSMA Wireless Networks
    Caihong Kai, Shengli Zhang, Lusheng Wang
    2018, 15(3): 1-14.
    Abstract ( )   Knowledge map   Save
    It is known that packet collisions in wireless networks will deteriorate system performance, hence substantial efforts have been made to avoid collision in multi-user access designs. Also, there have been many studies on throughput analysis of CSMA wireless networks. However, for a typical CSMA network in which not all nodes can sense each other, it is still not well investigated how link throughputs are affected by collisions. We note that in practical 802.11-like networks, the time is divided into mini-timeslots and packet collisions are in fact unavoidable. Thus, it is desirable to move forward to explore how collisions in such a network will affect system performance. Based on the collision-free ideal CSMA network (ICN) model, this paper attempts to analyze link throughputs when taking the backoff collisions into account and examine the effect of collisions on link throughputs. Specifically, we propose an Extended Ideal CSMA Network (EICN) model to characterize the collision effects as well as the interactions and dependency among links in the network. Based on EICN, we could directly compute link throughputs and collision probabilities. Simulations show that the EICN model is of high accuracy. Under various network topologies and protocol parameter settings, the computation error of link throughputs using EICN is kept to 4% or below. Interestingly, we find that unlike expected, the effect of collisions on link throughputs in a modest CSMA wireless network is not significant, which enriches our understanding on practical CSMA wireless networks such as Wi-Fi.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    Minimum Cost Multi-Path Parallel Transmission with Delay Constraint by Extending Openflow
    Kuangyu Qin, Chuanhe Huang, N. Ganesan, Kewei Liu , Xi Chen
    2018, 15(3): 15-26.
    Abstract ( )   Knowledge map   Save
    Sometimes user has the requirement to run a high bandwidth application over a low bandwidth network. But its implementation is not easy as the traditional network transmits data with only one path where its bandwidth is lower than the demand. Although the current network technology like SDN has the ability to precisely control the data transmission in the network, but till now the standard openflow protocol does not support splitting one flow to multiple flows. In this paper, a flow splitting algorithm is proposed. The algorithm splits a data flow to multiple sub-flows by extending the openflow protocol. A multiple paths routing algorithm is also proposed to implement the multi-path parallel transmission in the paper. The algorithm selects multiple paths and minimizes the cost of transmission under the constraint of maximum delay and delay variance. The simulations show the algorithms can significantly improve the transmission performance.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    D-S Evidence Theory Based Trust Ant Colony Routing in WSN
    Ziwen Sun, Zhiwei Zhang, Cheng Xiao, Gang Qu
    2018, 15(3): 27-41.
    Abstract ( )   Knowledge map   Save
    This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods,the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    Navigation Route Based Stable Clustering for Vehicular Ad Hoc Networks
    Zhiwei Yang, Weigang Wu, Yishun Chen, Xiaola Lin, Xiang Chen
    2018, 15(3): 42-56.
    Abstract ( )   Knowledge map   Save
    Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    A New Multi-Resource Allocation Mechanism: A Tradeoff between Fairness and Efficiency in Cloud Computing
    Lihua Zhao, Minghui Du, Lin Chen
    2018, 15(3): 57-77.
    Abstract ( )   Knowledge map   Save
    This paper addresses multi-resource fair allocation: a fundamental research topic in cloud computing. To improve resource utilization under well-studied fairness constraints, we propose a new allocation mechanism called Dominant Resource with Bottlenecked Fairness (DRBF), which generalizes Bottleneck-aware Allocation (BAA) to the settings of Dominant Resource Fairness (DRF). We classify users into different queues by their dominant resources. The goals are to ensure that users in the same queue receive allocations in proportion to their fair shares while users in different queues receive allocations that maximize resource utilization subject to well-studied fairness properties such as those in DRF. Under DRBF, no user 1) is worse off sharing resources than dividing resources equally among all users; 2) prefers the allocation of another user; 3) can improve their own allocation without reducing other users’ allocations; and (4) can benefit by misreporting their resource demands. Experiments demonstrate that the proposed allocation policy performs better in terms of high resource utilization than does DRF.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    Improved Prefix Based Format-Preserving Encryption for Chinese Names
    Junwei Zou, Peng Wang, Hong Luo
    2018, 15(3): 78-90.
    Abstract ( )   Knowledge map   Save
    In the era of big data, government, business and personal digital information will be possible for data mining. Data mining requires massive data as a support. However, the direct release of the original mass data, which usually contain some sensitive information of personal or analysis, will result in leakage of user privacy. Therefore, it is becoming increasingly important to protect privacy information in data publishing. In this paper, we focus on the multi-type self-identified format-preserving encryption. First, we introduce a multi-type self-identified format-preserving encryption system and discuss the encryption of various types of data in this system. Then, for the format preserving encryption (FPE) about Chinese name, we study from the encryption model construction and basic encryption scheme. The format-preserving encryption model about Chinese name is constructed and the concept of the name library is presented. Based on this, it is used to not only limit the message space to reduce complexity, but also ensure the cipher in accordance with the Chinese naming habits. In addition, according to the encryption and decryption model, format-preserving encryption process of Chinese name is designed. In order to add new names, the algorithm of name space expansion is proposed. Based on the Prefix, this paper put forward an algorithm named Cycle-Prefix, which enhances the security and dynamics of FPE by using two adjustment factors and the circular encryption. Compared with the traditional Prefix algorithm, experiments show that Cycle-Prefix can not only complete the task of FPE for Chinese name, but also encrypt same plain text into different ciphers under the premise of similar efficiency with Prefix.
  • COMMUNICATIONS SYSTEMS AND THEORIES
    Ranging Error Correction Based on a Prior Error Model
    Xiaofei Wang*, Hongkun He, Yan Xu, Yang Lei
    2018, 15(3): 91-99.
    Abstract ( )   Knowledge map   Save
    Wireless technology provides accurate positioning in indoor environments using time of arrival (TOA) based ranging techniques. However, the positioning accuracy is degraded due to the ranging errors caused by multipath and non-line-of-sight (NLOS) propagation. In this paper, a ranging error correction method is proposed to improve positioning performance. A TOA ranging error model (TREM) is built to provide the prior information for ranging error correction first. The mean value of TREM within a certain interval is used as the ranging error correction value (RECV). As the RECV may be unreasonable sometimes, we adjust it according to the actual positioning situation and then exploit the final RECV to correct ranging data. The experimental results show that the proposed method could well reduce ranging errors antime of arrival (TOA); TOA ranging error model (TREM); ranging error correction value (RECV); the adjustment of the RECVdata.
    • SIGNAL PROCESSING FOR COMMUNICATIONS
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Beamforming and Interference Cancellation for D2D Communication Assisted by Two-Way Decode-and-Forward Relay Node
    Yiyang Ni, Jie Zhao, Yuxi Wang, Hongbo Zhu
    2018, 15(3): 100-111.
    Abstract ( )   Knowledge map   Save
    This paper investigates the device-to-device (D2D) communication underlaying cellular network assisted by a two-way decode-and-forward relay node. We assume the base station (BS) is equipped with - antenna and serves its own cellular user while the D2D users communicate via a two-way decode-and-forward relay node. Both beamforming (BF) and interference cancellation (IC) strategies at the BS are considered to improve the performance for the cellular link and D2D link, respectively. We first analyze the received signal-to-interference-plus-noise for the cellular link under BF and IC strategies and then derive the exact closed-form expressions for the cellular link. Asymmetric and symmetric cases are discussed for various locations of each user. Finally, the approximations for high signal-to-noise regime are also presented. Numerical results demonstrate the accuracy of the analytical and asymptotic results.
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Spectral Efficiency and Power Allocation for Mixed-ADC Massive MIMO System
    Mengjiao Zhang, Weiqiang Tan, Junhui Gao, Shi Jin
    2018, 15(3): 112-127.
    Abstract ( )   Knowledge map   Save
    This paper investigates the achievable uplink spectral efficiency (SE) of a massive multi-input multi-output (MIMO) system with a mixed analog-to-digital converter (ADC) receiver architecture, in which some antennas are equipped with full-resolution ADCs while others are deployed with low-resolution ADCs. We derive the theoretical results and corresponding approximate expressions of the achievable SE in multi-cell systems with maximum ratio combining (MRC) detector and in single-cell systems with zero-forcing (ZF) detector. Based on approximated results, the effects of physical parameters, including the transmit power, the number of antennas, the proportion of full-resolution ADCs and the quantization precision of the low-resolution ADCs on the achievable SE are revealed. Furthermore, we propose the power allocation algorithms based on the lower bound and upper bound of approximate achievable SE. Our results show that the total achievable SE improves by increasing the number of BS antennas, the signal-to-noise ratio (SNR), and the quantization precision. Results showcase that proposed power allocation algorithms remarkably improve the total achievable SE comparing to the equal power allocation algorithm, which verifies the effectiveness of our proposed schemes.
  • SIGNAL PROCESSING FOR COMMUNICATIONS
    Impact of Phase Noise on TDMS Based Calibration for Spaceborne Multi-Beam Antennas
    Yujie Lin, Xiangyuan Bu, Shuai Wang, Yuan Chai, Jianping An
    2018, 15(3): 128-136.
    Abstract ( )   Knowledge map   Save
    For spaceborne multi-beam antennas (MBAs), time division multiplexed switching (TDMS) based calibration receiver can reduce implementation costs effectively and is very suitable for large-scale applications. However, in practice, random phase noise imposed by noisy local oscillators can cause significant performance degradation in TDMS-based calibration systems. Characterization of phase noise effects is therefore crucial for practical applications. In this paper, we analyze the impact of phase noise on the calibration performance for a MBA system. Specifically, we derive the relationship between the probability of correct amplitude/phase estimation and various practical factors involving the signal-to-noise ratio (SNR), the standard deviation of phase noise, the given tolerance region, and the length of the spreading code. The results provide high efficiency for evaluating the calibration performance of the MBAs based on TDMS, especially for precisely anticipating the impact of phase noise. Finally, the accuracy of the derived results is assessed by simulations in different scenarios.
    • COMMUNICATIONS TECHNOLOGIES & APPLICATIONS
  • COMMUNICATIONS TECHNOLOGIES & APPLICATIONS
    A Novel Roll Compensation Method for Two-Axis Transportable Satellite Antennas
    Laiding Zhao , Jidong Xie , Xiaodong Bai , Zhicheng Qu
    2018, 15(3): 137-148.
    Abstract ( )   Knowledge map   Save
    Two-axis transportable satellite antennas (TATSAs) have been widely adopted owing to its simple structure and low cost. However, by searching in a wide range, it will take a very long searching time. Under extreme conditions, it will even fail to work. In this paper, we propose a novel roll compensation (RC) method for the low-cost TATSAs to achieve faster tracking even if when the antenna has no azimuth sensor. By analyzing the influence of roll axis on the system performance, details of the compensation method are derived. Simulation and measurement results indicate that the proposed RC method can effectively reduce the initial searching time for satellite communication. In addition, tracking along with the ellipse path with the RC method provides the highest tracking efficiency.
  • COMMUNICATIONS TECHNOLOGIES & APPLICATIONS
    Coordinated Resource Allocation for Satellite-Terrestrial Coexistence Based on Radio Maps
    Yanmin Wang*, Zhou Lu
    2018, 15(3): 149-156.
    Abstract ( )   Knowledge map   Save
    Coexistence of satellite and terrestrial wireless communication systems in the same frequency band is quite promising for addressing the challenge of spectrum scarcity. To cope with the inevitable inter-system interference, radio resource allocation at both sides should be carefully re-optimized. In this paper, we focus on a scenario where a satellite communication system and a terrestrial distributed antenna system (DAS) coexist via spectrum sharing. We particularly utilize the radio map (RM) to reduce the system overhead for channel acquisition. Based on the large-scale channel state information at the transmitter (CSIT), which is derived from the RM, we propose an optimized power allocation scheme to improve the achievable sum rate of the terrestrial system. For the satellite side, an opportunistic user scheduling scheme is presented, to reduce the harmful leakage interference to the terrestrial mobile users. Simulation results demonstrate that the proposed RM-based coordination scheme can significantly promote the performance of satellite terrestrial coexistence, although the small-scale channel fading has been ignored in the formulated optimization.
  • COMMUNICATIONS TECHNOLOGIES & APPLICATIONS
    Service Function Chain in Small Satellite-Based Software Defined Satellite Networks
    Taixin Li, Huachun Zhou, Hongbin Luo, Qi Xu, Si Hua, Bohao Feng
    2018, 15(3): 157-167.
    Abstract ( )   Knowledge map   Save
    Software Defined Satellite Networks (SDSN) are proposed to solve the problems in traditional satellite networks, such as time-consuming configuration and inflexible traffic scheduling. The emerging application of small satellite and research of SDSN make it possible for satellite networks to provide flexible network services. Service Function Chain (SFC) can satisfy this need. In this paper, we are motivated to investigate applying SFC in the small satellite-based SDSN for service delivery. We introduce the structure of the multi-layer constellation-based SDSN. Then, we describe two deployment patterns of SFC in SDSN, the Multi-Domain (MD) pattern and the Satellite Formation (SF) pattern. We propose two algorithms, SFP-MD, and SFP-SF, to calculate the Service Function Path (SFP). We implement the algorithms and conduct contrast experiments in our prototype. Finally, we summarize the applicable conditions of two deployment patterns according to the experimental results in terms of hops, delay, and packet loss rate.
    • REVIEW PAPERS
  • REVIEW PAPERS
    A Survey on Smart Collaborative Identifier Networks
    Haifeng Li, Hongke Zhang
    2018, 15(3): 168-185.
    Abstract ( )   Knowledge map   Save
    The current Internet architecture was designed on the basis of a triple bindings model, which could meet the needs of the early Internet. However, with the tremendous growth of the Internet and the continuous innovations of applications, the triple bindings (namely, control/data binding, resource/location binding and user/network binding) have given rise to many problems for the Internet, such as scalability, mobility, and security. In order to solve these problems, many network techniques have been developed. Besides, novel future Internet architectures including Information-Centric Networks and Software-Defined Networks have emerged. However, these architectures only partially decouple the triple bindings. To completely separate the triple bindings, Smart Collaborative Identifier Networks (SINET) is proposed. There have been many research efforts on SINET, which built the foundation of SINET being a promising future Internet. In this paper, we comprehensively introduce SINET and these related research works. We start by introducing the motivation for SINET, explain its fundamental concepts and how it can make a difference. Next, we present in details the design principles of every layer in SINET, explaining how it can decouple the triple bindings and solve the problems of the current Internet. Finally, we discuss the state-of-the-art challenges in SINET. We investigate the ongoing research works and commercial products in SINET, with aspects such as scalability, mobility, security and reliability.
  • REVIEW PAPERS
    Heuristic Solutions of Virtual Network Embedding: A Survey
    Haotong Cao, Han Hu, Zhicheng Qu, Longxiang Yang
    2018, 15(3): 186-219.
    Abstract ( )   Knowledge map   Save
    Network virtualization (NV) is considered as an enabling tool to remove the gradual ossification of current Internet. In the network virtualization environment, a set of heterogeneous virtual networks (VNs), isolated from each other, share the underlying resources of one or multiple substrate networks (SNs) according to the resource allocation strategy. This kind of resource allocation strategy is commonly known as so called Virtual Network Embedding (VNE) algorithm in network virtualization. Owing to the common sense that VNE problem is NP-hard in nature, most of VNE algorithms proposed in the literature are heuristic. This paper surveys and analyzes a number of representative heuristic solutions in the literature. Apart from the analysis of representative heuristic solutions, a taxonomy of the heuristic solutions is also presented in the form of table. Future research directions of VNE, especially for the heuristics, are emphasized and highlighted at the end of this survey.
  • REVIEW PAPERS
    Stochastic Dynamic Modeling of Rain Attenuation: A Survey
    Zhicheng Qu, Gengxin Zhang, Haotong Cao, Jidong Xie
    2018, 15(3): 220-234.
    Abstract ( )   Knowledge map   Save
    Satellite communication systems (SCS) operating on frequency bands above 10GHz are sensitive to atmosphere physical phenomena, especially rain attenuation. To evaluate impairments in satellite performance, stochastic dynamic modeling (SDM) is considered as an effective way to predict real-time satellite channel fading caused by rain. This article carries out a survey of SDM using stochastic differential equations (SDEs) currently in the literature. Special attention is given to the different input characteristics of each model to satisfy specific local conditions. Future research directions in SDM are also suggested in this paper.