Please wait a minute...

Current Issue

    25 December 2016, Volume 37 Issue 12
    Academic paper
    Opposition-based particle swarm optimization with adaptive elite mutation and nonlinear inertia weight
    Wen-yong DONG,Lan-lan KANG,Yu-hang LIU,Kang-shun LI
    2016, 37(12):  1-10.  doi:10.11959/j.issn.1000-436x.2016224
    Asbtract ( 452 )   HTML ( 20)   PDF (1330KB) ( 1016 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An opposition-based particle swarm optimization with adaptive elite mutation and nonlinear inertia weight (OPSO-AEM&NIW) was proposed to overcome the drawbacks, such as falling into local optimization, slow convergence speed of opposition-based particle swarm optimization. Two strategies were introduced to balance the contradiction be-tween exploration and exploitation during its iterations process. The first one was nonlinear adaptive inertia weight (NIW), which aim to accelerate the process of convergence of the algorithm by adjusting the active degree of each parti-cle using relative information such as particle fitness proportion. The second one was adaptive elite mutation strategy (AEM), which aim to avoid algorithm trap into local optimum by trigging particle's activity. Experimental results show OPSO-AEM&NIW algorithm has stronger competitive ability compared with opposition-based particle swarm optimiza-tions and its varieties in both calculation accuracy and computation cost.

    Performance analysis of MIMO DUCA multiple antenna system
    Gen-fu SHAO,Ying-li YAO,Jie ZHOU,Kikuchi HISAKAZU
    2016, 37(12):  11-20.  doi:10.11959/j.issn.1000-436x.2016226
    Asbtract ( 343 )   HTML ( 5)   PDF (2648KB) ( 999 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A MIMO multi-antenna system of compact double uniform circular array (DUCA) in three dimensional direc-tional frequency non-selective Rayleigh fading channel was analyzed and investigated. Equivalent network model of MIMO multi-antenna array considering MC effect was established, general expressions of correlations were derived and the relationship between correlations with and without MC was classfied. Then, the results were compared with general uniform linear array (ULA) and uniform circular array (UCA). It was concluded that the deployment of antennas plays a decisive role in correlations between antennas. The research has a good sense on designation of spatial massive MIMO multi-antenna array and system optimization.

    Uplink scheduling scheme for cloud service based on software-defined wireless network
    Su PAN,Bang XIAO,Yu-qing CHEN,Sheng-mei LIU
    2016, 37(12):  21-31.  doi:10.11959/j.issn.1000-436x.2016232
    Asbtract ( 317 )   HTML ( 7)   PDF (1426KB) ( 345 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A LTE uplink scheduling scheme matching the features of wireless cloud services was proposed for the SDWN (software-defined wireless network). The scheme first solved the resource allocation problem by using the binary integer programming method, and then calculated the optimal transmission rate of cloud services in each time slot using the method of dynamic programming, finally adjusted the transmission rate of cloud services proportional to the current channel status using QoS control method in the framework of SDWN. The proposed scheme minimizes the energy con-sumption of cloud services while ensuring the transmission rate demand of multiple services. The performance of the al-gorithm is verified by simulation.

    Vehicle density based multihop broadcast protocol in VANET
    Jia-wei HUANG,Shao-hua ZHONG,Lian-hai LIU,Jian-xin WANG
    2016, 37(12):  32-41.  doi:10.11959/j.issn.1000-436x.2016233
    Asbtract ( 348 )   HTML ( 1)   PDF (1287KB) ( 620 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In vehicular ad hoc networks (VANET), the medium access control (MAC) protocol was of crucial importance to provide time-critical multihop broadcast. Contemporary multihop broadcast protocols in VANET usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, it was demonstrated that the farthest forwarder may experience long contention delay in case of high vehicle density. An IEEE 802.11p-based multihop broadcast protocol vehicle density based forwarding (VDF) was proposed, which adaptively chose the forwarder according to the vehicle density. The evaluation results in safety warning and online game applications show that, VDF could shorten broadcast delay by achieving the proper trade-off between the contention delay and coverage speed.

    Novel method based on fractional lower-order correntropy-analogous statistics for parameter jointly estimation in bistatic MIMO radar
    Li LI,Tian-shuang QIU,Ming-yan HE
    2016, 37(12):  42-49.  doi:10.11959/j.issn.1000-436x.2016236
    Asbtract ( 331 )   HTML ( 0)   PDF (2113KB) ( 508 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the performance degradation problem of parameter estimation algorithm in the Alpha stable dis-tribution noise, inspired by the concept of correntropy, a new class of statistics, namely, the fractional lower-order cor-rentropy-analogous statistics (FCAS) was proposed. By employing the fractional lower-order correntropy-analogous sta-tistics based cost function in parallel factor (PARAFAC), the FCAS-PARAFAC algorithm was deduced which can be utilized for the parallel factor under impulsive noise environments. The FCAS-PARAFAC algorithm was applied to pa-rameter estimation in bistatic MIMO radar under impulsive noise environment. The proposed method can suppress the impulse noise interference and has better estimation performance. Furthermore, the estimated parameters are automati-cally paired without the additional pairing method. Simulation results are presented to verify the effectiveness of the pro-posed method.

    Calculating the feature method of short text based on analytic hierarchy process
    Xue-qiang ZOU,Xiu-guo BAO,Xiao-jun HUANG,Hong-yuan MA,Qing-sheng YUAN
    2016, 37(12):  50-55.  doi:10.11959/j.issn.1000-436x.2016239
    Asbtract ( 343 )   HTML ( 4)   PDF (615KB) ( 1120 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to model the accurate interest preference of microblog users and discover user groups with similar in-terest, a new method was proposed which considered the total amount of retweets, comments and attitudes of each mi-croblog for text feature calculation with utilizing classic analytical hierarchy process method. The proposed method used three indicators to evaluate the importance of the text feature representation and made an improvement on traditional tf-idf feature calculation method to fit for short text. Furthermore, this method was also implemented in the traditional clustering algorithm. Experimental results show that, compared with the traditional tf-idf method, the improved approach has a better clustering effect on the average scattering for clusters and the total separation between clusters.

    Resource allocation algorithm for situation awareness based on multiple-choice quadratic knapsack
    Yan-wei SUN,Yun-chuan GUO,Ling-cui ZHANG,Bin-xing FANG
    2016, 37(12):  56-66.  doi:10.11959/j.issn.1000-436x.2016272
    Asbtract ( 377 )   HTML ( 12)   PDF (956KB) ( 589 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to deal with the potential cyber-threat and improve the security situation by using limited resource properly, the optimal allocation of resource focused on cyber security situation. The coherence of network situation lead to the fact that the enhancement of certain item may also affect some other items, and different amount of investment may also result in different degree of impact, therefore, the problem was extracted into the multiple-choice quadratic knapsack problem. The characteristics of quadratic knapsack problem was used to model the interactions among the situation indi-cator items, meanwhile used the multiple choice knapsack problem to model the multiple investment choice for each item. A branch and bound algorithm was conducted by using the semi-definite relaxation. The experiment results show the ac-curacy and efficiency of proposed algorithm.

    Load balancing geographic routing strategy for aeronautical ad hoc networks
    Bo ZHENG,Heng-yang ZHANG,Bao-liang WANG,Wei ZHAO
    2016, 37(12):  67-76.  doi:10.11959/j.issn.1000-436x.2016273
    Asbtract ( 513 )   HTML ( 8)   PDF (1284KB) ( 732 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In aeronautical ad hoc networks, the traditional greedy perimeter stateless routing (GPSR) protocol poses sev-eral issues. For example, it is difficult to adapt to the highly-dynamic network environment, and it is prone to cause con-gestions. In order to address the problems, a TTE (time to enter the communication range of the destination)-based load balancing geographic routing (LBGR) protocol was presented. Taking TTE as the main routing decision metrics, this pro-tocol included the TTE-based packet forwarding scheme, multi-path traffic allocation scheme, and local optimum han-dling scheme. Furthermore, the multi-path traffic allocation scheme employing the queueing theory was modeled, and the mathematical expressions of some metrics were derived, such as the mean queue size, mean number of packets waiting in the queue, and mean waiting time. Finally, the analysis of the OMNeT++ simulations shows LBGR protocol has advan-tages over GPSR and some other protocols in terms of the packet delivery ratio and end-to-end delay, and is more suitable for the highly-dynamic aeronautical environment.

    Cookie based online tracing method for cyberlockers resource
    Hai-lun LIN,Yan LI,Wei-ping WANG,Yin-liang YUE,Zheng LIN
    2016, 37(12):  77-85.  doi:10.11959/j.issn.1000-436x.2016274
    Asbtract ( 309 )   HTML ( 3)   PDF (1157KB) ( 910 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Cyberlockers have recently become an Internet-based agent of information dissemination. In light of the non-negligible fraction accounted by the traffic flows originating from cyberlocks, it is necessary to trace them for net-work security. An efficient and scalable cookie based online cyberlockers resource tracing method was proposed, called CookieTracing. It can achieve an efficient association between cyberlockers resource and its download redirect chain by construction of index table between cookie and HTTP sessions in massive HTTP sessions. Meanwhile, through cumula-tive hash algorithm, it can speed up the validation of tracing results. Experimental results show that this method performs good efficiency and scalability.

    Stochastic job stream scheduling method for cipher chip with multi-cryptography
    Li LI,Guo-zhen SHI,Kui GENG,Xiu-ze DONG,Xuan WANG,Feng-hua LI
    2016, 37(12):  86-94.  doi:10.11959/j.issn.1000-436x.2016275
    Asbtract ( 366 )   HTML ( 0)   PDF (630KB) ( 887 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the rich of safety requirements of tasks which resulting in random cross access to multi cipher algorithms, a hierarchical hardware scheduling method was presented with associated control based on data identifica-tion. The first level was responsible for distributing tasks to different cipher clusters, and by optimizing the search logic to achieve rapid distribution of data. The second level was responsible for completing the context-related tasks in scheduling order by adding an association control module and association queues. Intermediate state storage module realized the saving of the intermediate state in serial cipher algorithm modes, which was indexed by task ID. Pre-processing module process data inputted by the succeeding tasks. It is proved that the proposed scheduling algo-rithm solves the problem of random cross encryption and decryption in many-to-many communication model of high-speed data stream.

    Malicious attack-resistant secure localization algorithm for wireless sensor network
    Kun XU,Hong-li LIU,Jie ZHAN,Zi-ji MA
    2016, 37(12):  95-102.  doi:10.11959/j.issn.1000-436x.2016276
    Asbtract ( 317 )   HTML ( 0)   PDF (1627KB) ( 418 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In hostile environments, localization often suffers from malicious attacks that may distort transmit power and degrade positioning accuracy significantly for wireless sensor network. A robust semidefinite relaxation secure localiza-tion algorithm RSRSL was proposed to improve the location accuracy against malicious attacks. On the assumption of unknown transmit power, which is undoubtedly approximate to the fact of WSN, a novel secure location probability model was introduced for single-target and multi-target sensor networks, respectively. Taking the computational complexity of RSRSL into account, the nonlinear and non-convex optimization problem was simplified into a semidefinite programming problem. According to the results from both simulations and field experiments, it is clearly demonstrated that the proposed RSRSL has better performance on location accuracy, in contrast to the conventional localization algorithms.

    FilterFA: a multiple string matching algorithm based on specification of character set
    Ping ZHANG,Hui-min HE,Chun-yan ZHANG,Cong CAO,Yan-bing LIU,Jian-long TAN
    2016, 37(12):  103-114.  doi:10.11959/j.issn.1000-436x.2016277
    Asbtract ( 311 )   HTML ( 3)   PDF (1066KB) ( 823 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multiple string matching is one of the core techniques of intrusion detection system, where Aho-Corasick al-gorithm is widely used. To solve the problem that huge storage overhead of AC would influence performance deeply, an improved algorithm ——FilterFA, based on specification of character set was proposed. This algorithm compressed large character by the character set mapping function, and constructed a new automata based on the mapped character set,then space complexity decreased to O(|P||Σ′|). Experiments on synthetic datasets and real-world datasets (such as ClamAV) show that the storage overhead of FilterFA is only about 3% of that of AC, while the size of the character set is 8, and the false recognition rate is less than 2%.

    Design of a novel sextuple band-notched UWB antenna
    Han LIU,Cheng-you YIN,Qi-meng FAN
    2016, 37(12):  115-123.  doi:10.11959/j.issn.1000-436x.2016278
    Asbtract ( 545 )   HTML ( 20)   PDF (2662KB) ( 1008 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel sextuple band-notched UWB antenna was designed. Sextuple band-notched characteristics could be realized by adding a T-shaped stub, a bent stub, and etching a U-shaped slot on the patch, adding a C-shaped stub, an anti-C shaped stub near microstrip line and etching a pair of L-shaped slots on the ground plane,which effectively sup-presses the interference between narrow band systems and UWB systems. The influence of the proposed structures on band-notched characteristics was studied, and band-notched principle was explained by antenna surface current and equivalent circuit. Finally the antenna was fabricated and measured. The measured results of VSWR, radiation patterns and gains agree well with the simulated results, which demonstrates the correctness of the design method. The proposed antenna has good performance and can be widely used due to its sextuple band-notched characteristics.

    Overview
    Research progress on location privacy-preserving techniques
    Sheng WAN,Feng-hua LI,Ben NIU,Zhe SUN,Hui LI
    2016, 37(12):  124-141.  doi:10.11959/j.issn.1000-436x.2016279
    Asbtract ( 869 )   HTML ( 57)   PDF (1325KB) ( 3075 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    While providing plenty of convenience for users in daily life, the increasingly popular location-based ser-vice(LBS) posed a serious threat to users' privacy. The research about privacy-preserving techniques for LBS is becoming a hot spot, and there are a large number of research results. First, background information of privacy protection for LBS was introduced, including application scenarios of LBS, the LBS framework, objects of privacy protection and system architectures of privacy protection. Second, adversary models and metrics for privacy protection in LBS was discussed. Third, four types of privacy-preserving techniques based on generalization and obfuscation for LBS were analyzed and summarized thoroughly. Finally, the potential research directions for privacy-preserving techniques for LBS in the future were shown.

    Academic communication
    Design of a tensile-type 3-D multi-scroll chaotic system and its application in secure communication
    Jun-peng MA,Li-dan WANG,Shu-kai DUAN,Jie-ning WU
    2016, 37(12):  142-155.  doi:10.11959/j.issn.1000-436x.2016280
    Asbtract ( 471 )   HTML ( 9)   PDF (4495KB) ( 526 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A kind of tensile-type 3-D multi-scroll chaotic attractor based on Chua's circuit was successfully designed. The chaos generation mechanism was studied by analyzing the symmetry and invariance, the existence of the dissipation, as well as the system equilibrium and stability. Then, some basic dynamical properties, such as Lyapunov exponents, fractal dimension, chaotic dynamical behaviors of the new chaotic system were introduced, either numerically or analytically. At the same time, the chaotic circuit of this system was realized by PSPICE. Finally, based on Lyapunov theorem and unidi-rectionally coupled method, the synchronization of the chaotic system has also been investigated. With this approach, the novel system can be applied to secure communication, which can achieve the purpose of covering specific signals. The experimental results are in agreement with numerical simulation results, which verifies the availability and feasibility of this method.

    Dummy trajectory privacy protection scheme for trajectory publishing based on the spatiotemporal correlation
    Kai-yue LEI,Xing-hua LI,Hai LIU,Zhuo-xiong PEI,Jian-feng MA,Hui LI
    2016, 37(12):  156-164.  doi:10.11959/j.issn.1000-436x.2016281
    Asbtract ( 508 )   HTML ( 15)   PDF (1055KB) ( 888 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The spatiotemporal correlation was analyzed between neighboring locations and the trajectories similarity from the movement direction, the reachable time between neighboring locations and the movement distance, and a dummy trajectory privacy protection scheme based on the spatiotemporal correlation was proposed. Security analysis shows that the presented scheme successfully confuses the user's real trajectory with dummy trajectories, thereby pro-tecting the user's trajectory privacy. Furthermore, extensive experiments indicate that the presented scheme not only has the limited computation cost, but also ensures that the generated dummy trajectories are similar to the user's real trajectory.

    Reducing false positives of steganalysis via classification of image-acquiring sources
    Pei-tao YANG,Wei-ming ZHANG,Neng-hai YU
    2016, 37(12):  165-170.  doi:10.11959/j.issn.1000-436x.2016282
    Asbtract ( 322 )   HTML ( 0)   PDF (680KB) ( 580 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the real world, reducing false positive rates in the case of cover source mismatch (CSM) was a big challenge for steganalysis. A novel model was proposed to solve the problem. The proposed method determines the im-age-acquiring source firstly by a source detector and then detecting the steg images in each source with a steganalyzer trained for this source. The false positive rate was reduced by solving a parameter model. The experimental results show that this novel method can reach lower false positive rates for larger true positive rates.

    Method of individual communication transmitter identification based on maximum correntropy
    Zhe TANG,Ying-ke LEI
    2016, 37(12):  171-175.  doi:10.11959/j.issn.1000-436x.2016283
    Asbtract ( 347 )   HTML ( 9)   PDF (1060KB) ( 804 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To measure the similarity between the fine features of communication transmitters, a method of individual communication transmitter identification based on maximum correntropy was put forward. Firstly, the square integral bispectra was extracted to characterise the communication transmitters, and then optimization function based on maximum correntropy criterion was constructed. Secondly, the half-quadratic technique transformed the nonlinear op-timization problem to a weighted linear least squares problem. Finally, for identifying the communication transmitters, the sparse coefficient computed by active set algorithm was utilized to construct the classifier. Using the FM radios with same manufacturer and model, the actually collected data sets verified the feasibility and effectiveness of the method.

    Multi-hop wireless network oriented multiple jammers localization algorithm
    Qi-ping WANG,Xiang-lin WEI,Jian-hua FAN,Tong-xiang WANG,Fei HU
    2016, 37(12):  176-186.  doi:10.11959/j.issn.1000-436x.2016284
    Asbtract ( 397 )   HTML ( 9)   PDF (2086KB) ( 1606 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multiple jammer localization algorithm in multi-hop wireless networks was proposed. The proposed algo-rithm contained three steps, packet delivery ratio (PDR) valley point determination based on gradient descent algorithm, received jamming signal strength (RJSS) peak point determination based on gradient ascent algorithm and cluster analysis. Firstly, the algorithm started from a few initial nodes and moved along the gradient descent direction of PDR to approach the jammers until reaches the PDR valley point. Then, the algorithm moved toward the jammers using power adaptation technique based on RJSS gradient ascent process until it reached the RJSS peak point. Finally, through applying cluster analysis on the neighbour nodes which fail to communicate with RJSS peak points, the number and positions of the jam-mers can be estimated. Experimental results have verified that the proposed algorithm can improve the accuracy of local-ization compared with existed localization algorithms. Furthermore, the performance of the proposed algorithm is promi-nent when the distance of jammers accords with constraint condition.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: