Please wait a minute...

Current Issue

    25 January 2014, Volume 35 Issue 1
    academic paper
    Improved artificial fish-swarm algorithm based on adaptive vision for solving the shortest path problem
    Xian-min MA,IUN L
    2014, 35(1):  1-6.  doi:10.3969/j.issn.1000-436x.2014.01.001
    Asbtract ( 419 )   HTML ( 7)   PDF (863KB) ( 764 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve basic artificial fish-swarm algorithm(AFSA)’s drawbacks of low convergence rate in the latter stage,a large amount of computation and easiness of trapping in local optimal solution,caused by the constant vision of the artificial fish,an improved artificial fish-swarm algorithm based on adaptive vision(AVAFSA) was proposed.The improved algorithm only adjusted the vision of the preying behavior of artificial fish to make the vision gradually decrease with the increase of the number of iterations of the algorithm.When the value became less than half the initial value,it made the value be equal to half the initial value.The proposed improved artificial fish swarm algorithm was applied to the static shortest path problem based on road network to provide customers with the best path.Simulation results depict the improved algorithm has higher convergence rate,a smaller amount of calculation,and is more accurate and stable than the basic AFSA and ant colony optimization(ACO).

    Research on end-to-end network link delay inference based on link reconstruction-destruction
    Yong-sheng LIANG,Bo GAO,Yue ZOU,Ji-hong ZHANG,Nai-tong ZHANG
    2014, 35(1):  7-15.  doi:10.3969/j.issn.1000-436x.2014.01.002
    Asbtract ( 237 )   HTML ( 2)   PDF (933KB) ( 557 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on two assumptions,inference model and end-to-end delay data acquisition,an approach to end-to-end network internal link delay inference based on link reconstruction-deconstruction (LRD) was proposed.Pseudo likelihood estimation (PLE) was adopted and the inference problem was divided into independent sub-problems.Inference units with definite solution are determined by LRD.By means of controlling average sampling precision and decreasing inference unit links,the computation complexity of link delay inference was significantly lowered.Experimental study was performed based on model computation and NS2 simulation platform.Theoretical analysis and experimental results show that the approach is accurate and effective.

    Algorithm study of digital HPA predistortion using one novel memory type BP neural network
    Chun-hui HUANG,Yong-jie WEN
    2014, 35(1):  16-23.  doi:10.3969/j.issn.1000-436x.2014.01.003
    Asbtract ( 347 )   HTML ( 8)   PDF (1478KB) ( 563 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the characteristic analysis of the high power amplifier (HPA) in wide-band CMMB repeater stations,a novel neural network was proposed which can respectively process the memory effect and the nonlinear of power amplifier.The novel model based on real-valued time-delay neural networks(RVTDNN) uses the Levenberg-Marquardt (LM) optimization to iteratively update the coefficients of the neural network.Due to the new parameters w0in the novel NN model,the modified formulas of LM algorithm were provided.Next,in order to eliminate the over-fitting of LM algorithm,the Bayesian regularization algorithm was applied to the predistortion system.Additionally,the predistorter of CMMB repeater stations based on the indirect learning method was constructed to simulate the nonlinearity and memory effect of HPA.Simulation results show that both the NN models can improve system performance and reduce ACEPR (adjacent channel error power ratio ) by about 30 dB.Moreover,with the mean square error less than 10?6,the coefficient of network for FIR-NLNNN is about half of that for RVTDNN.Similarly,the times of multiplication and addition in the iterative process of FIR-NLNNN are about 25% of that for RVTDNN.

    Pilot contamination reduction in very large MIMO cellular network
    Hai-rong WANG,Yu-hui WANG,Yong-ming HUANG,Lv-xi YANG
    2014, 35(1):  24-33.  doi:10.3969/j.issn.1000-436x.2014.01.004
    Asbtract ( 328 )   HTML ( 6)   PDF (2342KB) ( 960 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Two pilot contamination reduction methods in very large MIMO cellular network were proposed by dividing all cells into two types of one-dimensional very large MIMO network.The same pilot sequences were used in cells in the same category while orthogonal pilot sequences were used between these two categorie.Then the pilot power control method can be used to achieve the purpose of alleviating pilot contamination.By coordinating among base stations,the nearly optimal length of pilot sequences and assignment of pilot transmission could be found through minimizing the sum of channel estimation mean square error of all base stations.Thus,much better performance of channel estimation could be obtained,greatly enhancing the sum rate in downlink in all cells.

    Securely redundant scheduling policy for MapReduce based on dynamic domains partition
    Qing-ni SHEN,Si-han QING,Zhong-hai WU,Li-zhe ZHANG,Ya-hui YANG
    2014, 35(1):  34-46.  doi:doi:10.3969/j.issn.1000-436x.2014.01.005
    Asbtract ( 199 )   HTML ( 2)   PDF (1070KB) ( 297 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics
    Blind data recovery of single-channel mixed signals based on Turbo equalization and channel estimation
    Dong-ling ZHANG,Yong YANG,Jing LI,Lin-dong GE
    2014, 35(1):  47-53.  doi:10.3969/j.issn.1000-436x.2014.01.006
    Asbtract ( 339 )   HTML ( 8)   PDF (1290KB) ( 894 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The timing synchronization is the key technique of the single-channel blind signal receiver.The single-channel blind recovery algorithm based on Turbo equalization was proposed,which does not require the timing synchronization.In the algorithm,the timing offset is taken as inter-symbol interference channel,which can improve the restorability of source signals by the feedback soft information between channel estimation and the turbo equalization.The primary works include the research on initial blind equalization algorithm,the channel estimation algorithm,MMSE equalization algorithm for the mixed signals and the soft information interaction among those three algorithms.The proposed algorithm has low computational complexity and small computational load,which can be applied to high-order modulated signals.Simulation results show that,good performance could be achieved for BPSK,QPSK and 8PSK modulated signals.In addition,the proposed algorithm is suitable for both equal power and unequal power signals.

    Evolution game model of offense-defense for network security based on system dynamics
    Jian-ming ZHU,Biao SONG,Qi-fa HUANG
    2014, 35(1):  54-61.  doi:3969/j.issn.1000-436x.2014.01.007
    Asbtract ( 560 )   HTML ( 27)   PDF (1476KB) ( 1325 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An offense-defense game model with learning mechanism in the case of asymmetric information was proposed based on non-cooperation evolution game theory.Combined with utility function,the existence and uniqueness of Nash equilibrium in the offense-defense process were proved.Simulation by system dynamics shows that there is Nash equilibrium in evolutionary game model after introducing the dynamic penalty strategy of the third party.Therefore,when improving all kinds of security technology,promoting attacker tracing technology,enhancing the censorship of network attack behaviors and dynamic penalty are fundamental ways to information security.

    Data aggregation scheduling algorithm based on twice maximum independent set
    Jian XU,Geng YANG,Zheng-yu CHEN,Hai-yong WANG,Zhen YANG
    2014, 35(1):  62-71.  doi:10.3969/j.issn.1000-436x.2014.01.008
    Asbtract ( 253 )   HTML ( 3)   PDF (1690KB) ( 313 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The main task in designing a data aggregation schedule was to get a good trade-off between QoS and weighted fairness guarantee.In order to address this problem,a novel data aggregation scheduling algorithm,MISS,was proposed,which could produce a collision-free TDMA schedule for data aggregation based on twice Maximum Independent Set (MIS).In the first phase,a tree structure based on MIS was constructed,and then it was adjusted according to the energy consumption forecast of each node,forming the balanced data aggregation tree.In the second phase,the approximate maximum weighted Independent set (WMIS) was utilized of all selected links to allocate time slots for each communication link.The results of simulation demonstrate that MISS not only improves the aggregation delay and lifetime of the network,but also gives weighted fairness guarantee.

    Improving energy efficiency and network performance in IaaS cloud with virtual machine placement
    Jian-kang DONG,Hong-bo WANG,Yang-yang LI,Shi-duan CHENG
    2014, 35(1):  72-81.  doi:10.3969/j.issn.1000-436x.2014.01.009
    Asbtract ( 290 )   HTML ( 4)   PDF (1067KB) ( 699 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existing virtual machine(VM) placement schemes mostly reduce energy consumption by optimizing utilization of physical server or network element.However,the aggressive consolidation of these resources may lead to network performance degradation.In view of this,a VM placement scheme was proposed to achieve two objectives.One is to minimize the number of activating physical machines and network elements to reduce the energy consumption,and the other is to minimize the maximum link utilization to improve the network performance.This scheme is able to reduce the energy consumption caused by physical servers and network equipment while optimizing the network performance,making a trade off between energy efficiency and network performance.A novel two-stage heuristic algorithm for a solution was designed.Firstly,the hierarchical clustering algorithm based on minimum cut and best fit algorithm was used to optimize energy efficiency,and then,local search algorithm was used to minimize the maximum link utilization.The simulations show that this solution achieves good results.

    Recognition method of digital modulation signals over non-Gaussian noise in cognitive radio
    Ming-qian LIU,Bing-bing LI,Chao-feng CAO,Zhao LI
    2014, 35(1):  82-88.  doi:10.3969/j.issn.1000-436x.2014.01.010
    Asbtract ( 355 )   HTML ( 20)   PDF (1321KB) ( 627 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In cognitive radio system,the traditional methods of digital modulation signals recognition with Alpha stable distribution noise have the problems of poor performance and high computation complexity.A novel recognition method based on correlation coefficient of fractional lower order cyclic spectrum was proposed to solve this problem.The method extracts the recognition characteristic parameters which are five correlation coefficients of the fractional lower order cyclic spectrum’s section and frequency spectrum’s section and projection planes of both,and then decision tree was used as a classifier to achieve digital modulation signals recognition.Simulation results show that the proposed method not only has higher recognition rates and better robustness but also has lower computation complexity in an Alpha stable distribution noise environment,which is more suitable for cognitive radio system.

    Multi-scale analysis of social network based on diffusion wavelets
    Guo-wei SHEN,Wu YANG,Wen-ting HUANG,Wei WANG,Li DING,Miao YU
    2014, 35(1):  89-98.  doi:10.3969/j.issn.1000-436x.2014.01.011
    Asbtract ( 278 )   HTML ( 10)   PDF (2031KB) ( 510 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new multi-scale framework based on diffusion wavelets was proposed to analyze the homogeneous relationships,which can be used to conduct multi-scale analysis on structures,contents and user behaviors.The diffusion operator of diffusion wavelet only considers the local similarity in this framework.The experiments on both synthetic and real-world networks show that the proposed algorithm outperforms the typical algorithms in multi-scale analysis without parameters.

    GMM-based localization algorithm under NLOS conditions
    Wei CUI,Cheng-dong WU,Yun-zhou ZHANG,Zi-xi JIA,Long CHENG
    2014, 35(1):  99-106.  doi:10.3969/j.issn.1000-436x.2014.01.012
    Asbtract ( 368 )   HTML ( 8)   PDF (1111KB) ( 1830 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at indoor node localizations of WSN,a node localization algorithm,where priori-knowledge is not necessary,was proposed.on basis of analyzing the error model,combined with Gaussian mixture model (GMM).By training the distance measurements containing NLOS errors,the more accurate range estimations can be obtained.For higher localization accuracy,the particle swarm optimization (PSO) was introduced to optimize the expectation-maximization (EM)algorithm.Finally,by using the residual weighting algorithm to estimate the distance,the estimation coordinates of target nodes can be determined.The proposed algorithm was proved to be effective through simulation experiments.

    Minimal difference sampling for active learning image classification
    Jian WU,Sheng-li SHENG,Peng-peng ZHAO,Zhi-ming CUI
    2014, 35(1):  107-114.  doi:10.3969/j.issn.1000-436x.2014.01.013
    Asbtract ( 314 )   HTML ( 6)   PDF (784KB) ( 792 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics
    summarize
    Survey of wireless channel measurement and characterization for high-speed railway scenarios
    Liu LIU,Cheng TAO,Hou-jin CHEN,Tao ZHOU,Rong-chen SUN,Jia-hui QIU
    2014, 35(1):  115-127.  doi:10.3969/j.issn.1000-436x.2014.01.014
    Asbtract ( 423 )   HTML ( 10)   PDF (2207KB) ( 2491 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The conducted measurement campaigns,domestic and overseas,were presented.Meanwhile,proposals and standard channel models from the international standardization organization were reviewed.The large-scale and small-scale fading characteristics of High-Speed Railway wireless channels were adequately compared,and it is found that the channel parameters depend on the propagation environment and the distance between the transmitter and receiver.Moreover,due to difficulties encountered in realistic channel measurements,theoretical channel characterization methods were analyzed.Finally,open research issues were presented.

    Academic communication
    Research on reconfigurable information communication basal network architecture
    Ju-long LAN,Dong-nian CHENG,Yu-xiang HU
    2014, 35(1):  128-139.  doi:10.3969/j.issn.1000-436x.2014.01.015
    Asbtract ( 516 )   HTML ( 17)   PDF (2617KB) ( 1583 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the thinking of network reconfiguration,the reconfigurable information communication basal network architecture was proposed,and then the network atomic capacity theory,polymorphic addressing and routing mechanism,network reconfiguration mechanism and the secure manageability and controllability mechanism were put forward respectively.The architecture would provide a resolution for current and future applications with different quality of services,flexible and expansible function,universal inter-connection,heterogeneous convergence,manageability and controllability,which also supports the compatible evolution with current internet and is feasible to be implemented on a large scale.

    Distributed variational sparse Bayesian compressed sensing based on factor graphs
    Cui-tao ZHU,Fan YANG,Han-xin WANG,Zhong-jie LI
    2014, 35(1):  140-147.  doi:10.3969/j.issn.1000-436x.2014.01.016
    Asbtract ( 332 )   HTML ( 2)   PDF (1432KB) ( 323 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed variational sparse Bayesian compressed spectrum sensing algorithm based on factor graph was proposed,which decomposed the global spectrum sensing problem into local problem based on factor and variation.Belief propagation was used for the statistical inference of the spectrum occupancy,to implement the “soft fusion”.The temporal and spatial correlation information providing two-dimensional redundancies was exchanged among cooperative cognitive users to improve the detection performance under low SNR.Meanwhile,the algorithm prunes the divergence of hyper-parameters and the corresponding basis functions for reducing the load of communication.The simulation results show that this method can effectively achieve performance of spectrum sensing under a low sampling rate and the low SNR.

    Fair and efficient network congestion control algorithm based on minority game with local information
    Zu-xi WANG,Zhao-zhang DENG,Li LI
    2014, 35(1):  148-155.  doi:10.3969/j.issn.1000-436x.2014.01.017
    Asbtract ( 243 )   HTML ( 10)   PDF (2861KB) ( 534 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Low link utility,RTT unfairness and unfairness of Multi-Bottleneck network are the existing problems in the present network congestion control algorithms at large.Considering the local information of network,a congestion control model based on minority game (MG) with local information was proposed to solve these problems.Based on the model,a congestion control algorithm was designed.The result of simulation indicates that the proposed algorithm has good performance on link utilization and fairness of RTT flow in multi-bottleneck network.

    Using coverage analysis to extract Botnet command-and-control protocol
    Zhi WANG,Ya-yun CAI,Lu LIU,Chun-fu JIA
    2014, 35(1):  156-166.  doi:10.3969/j.issn.1000-436x.2014.01.018
    Asbtract ( 289 )   HTML ( 3)   PDF (2102KB) ( 416 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There are some inherent patterns in the bot execution trace coverage of basic blocks.Using these patterns,an approach was proposed to infer Botnet command-and-control protocol (C&C protocol).Without intermediate representation of binary code and constraints solving,this approach has a lower time and space overhead.This coverage analysis approach was evaluated on 3 famous Botnet:Zeus,Sdbot and Agobot.The result shows that this approach can accurately and efficiently extract the Botnet control commands.And the completeness of the extracted control commands could be verified by checking whether all available basic blocks in bot are covered by the traces triggered by the control commands.

    Interference alignment based spectrum sharing and user scheduling for cognitive radio MIMO system
    Zhao LI,Jian-dong LI,Qin LIU,Biao SHEN
    2014, 35(1):  167-172.  doi:10.3969/j.issn.1000-436x.2014.01.019
    Asbtract ( 237 )   HTML ( 4)   PDF (1340KB) ( 959 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In communication scenario with multiple cognitive radio (CR) multi-input multi-output (MIMO) users,signal processing algorithm was designed based on interference alignment (IA) such that transmissions of cognitive and authorized signal were carried out in mutual orthogonal sub-spaces.Conflict-free utilization of spare spatial channel(s) authorized by primary system was achieved by cognitive user.Moreover,the difference of spatial transmission performance originating from various channel matrices was exploited to implement appropriate user scheduling.Simulation results show that the proposed method can utilize spare spatial channel resource effectively and obtain multiuser diversity gain.On the premise that authorized service is protected from disturbing,transmission rate of cognitive user is improved.

    Fully homomorphic encryption scheme from RLWE
    Dian-hua TANG,Shi-xiong ZHU,Lin WANG,Hao-miao YANG,Jia FAN
    2014, 35(1):  173-182.  doi:10.3969/j.issn.1000-436x.2014.01.020
    Asbtract ( 570 )   HTML ( 20)   PDF (2373KB) ( 1735 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the somewhat homomorphic scheme of Kristin Lauter et al.a new technique,called Relinearization with key switching was presented.Combining this technique with modulus switching,a (leveled) fully homomorphic encryption scheme without bootstrapping from RLWE were designed.Homomorphic operations of this scheme is simple,and trivial gate operation given in the scheme can make level structure of circuit clearer.Finally,bootstrapping was used as optimization to evaluate capability of the proposed scheme.

    Source localization based on time delay estimation in complex environment
    Da-wei ZHANG,Chang-chun BAO,Bing-yin XIA
    2014, 35(1):  183-190.  doi:10.3969/j.issn.1000-436x.2014.01.021
    Asbtract ( 308 )   HTML ( 6)   PDF (872KB) ( 1005 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the performance of source localization in noisy and reverberant environments,a novel time delay estimation (TDE) method was proposed.This method is called acoustical transfer function ratio based on statistical model (ATFR-SM).In the proposed algorithm,the noise reduction method based on the statistical model was adopted to reduce the effect of noise on acoustical transfer Function (ATF).In the ATF method,the power spectral density (PSD) was smoothed and whitened to reduce the effect of reverberations.voice activity detection (VAD) was used to distinguish the speech period from the noise period,and the TDE was performed in the speech period to improve the estimation accuracy.Moreover,the proposed TDE method and the linear closed-form method for source localization were combined to constitute a source localization system.The results of performance evaluation show that,in both the noisy and reverberant conditions,the lower percentage of abnormal points (PAP) and lower root mean square error (RMSE) can be achieved by the proposed TDE method than those of the reference methods.Meanwhile,the source localization has higher accuracy than the reference methods.

    Adaptive key distillation from channel characteristics
    Qiao DAI,Liang JIN,Kai-zhi HUANG
    2014, 35(1):  191-197.  doi:10.3969/j.issn.1000-436x.2014.01.022
    Asbtract ( 303 )   HTML ( 15)   PDF (739KB) ( 529 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Approaches generating secret keys based on radio channel characteristics can’t guarantee the key length and system efficiency at the same time because of the low entropy rate or high disagreement ratio of keys.An adaptive key distillation scheme based on the quantization of channel state information was designed.An upper bounding function was used as an approximation of the real one to improve the entropy of keys under the constraint of disagreement rate.Based on this,the key agreement scheme resulting in longer keys was selected.Simulation results show that with this scheme,the length of key and efficiency of the system can be guaranteed at the same time.

    Uneven clustering routing protocol based on dynamic partition for wireless sensor network
    Yan-qing SUN,Jian PENG,Tang LIU,Xiao-hai CHEN
    2014, 35(1):  198-206.  doi:10.3969/j.issn.1000-436x.2014.01.023
    Asbtract ( 293 )   HTML ( 10)   PDF (1348KB) ( 651 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the “hot spots” problem caused by uneven load energy,a novel distributed clustering routing protocol was proposed.Its core is an uneven clustering routing protocol based on dynamic partition(UCDP).In UCDP,the entire network’s energy consumption is balanced by dynamic partitioning,making the regions closer to the sink node with smaller nodes,which can preserve some energy for inter-region data forwarding.Considering the distance factor and residual energy factor for uneven clustering in each region,cluster-heads and region-heads work together in UCDP.Via the combination of single-hop and multi-hop,DBUP has established an optimal energy-balanced routing protocol.Simulation results show that UCDP has good stability,and significantly prolongs the network life.

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: