Please wait a minute...

Current Issue

    15 March 2017, Volume 38 Issue 3
    Papers
    Optimal base station selection based on dynamic programming for reprogramming in mine wireless network
    Jiang-hong HAN,Zhang-ling DUAN,Xing WEI,Yang LU,Jian-jun ZHANG
    2017, 38(3):  7-15.  doi:10.11959/j.issn.1000-436x.2017069
    Asbtract ( 454 )   HTML ( 6)   PDF (2366KB) ( 1193 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The nodes of large-scale wireless network which widely used in safety-critical systems often update new code,the way of wireless reprogramming is efficiency and flexibility.The problem of selecting the optimal base station when nodes uniformly distributed in mine wireless network environment and all other nodes were reprogrammed efficiency.Firstly,the model of base station selecting was established by covering process of reprogramming.Then the problem was transformed into solving the minimum of longest non-cyclic path between node and base station in undirected circulant graph.Finally,the optimal algorithm based on dynamic programming which included optimal substructure and overlapping subproblems was proposed.Numerical analysis and experimental results show that the time consumption of proposed algorithm is more stable than other optimal algorithm when the complexity of network is increased sharply.

    Variable-step blind source separation method with adaptive momentum factor
    Tian-qi ZHANG,Bao-ze MA,Xing-zi QIANG,Sheng-rong QUAN
    2017, 38(3):  16-24.  doi:10.11959/j.issn.1000-436x.2017067
    Asbtract ( 358 )   HTML ( 3)   PDF (1049KB) ( 449 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A variable-step blind source separation algorithm based on the natural gradient with adaptive momentum factor was proposed,which could cope with the determined blind source separation in the environment of stationary and non-stationary.Function estimation mixed matrix was constructed by performance index.The estimated performance index was obtained by the estimated mixed matrix,and the constructor was updated by the estimated performance index.Then,the constructor was plugged with appropriate experienced parameter into the proposed algorithm and step and momentum factor was adaptively adjusted.Finally,the estimation source signals could be obtained.Simulations show that the proposed algorithm is effective to estimate the mixed matrix in the stationary and non-stationary environments,and the proposed algorithm has faster convergence speed and lower steady error as well as separates source signals effectively.

    New method for file deduplication in cloud storage
    Chao YANG,Qian JI,Si-chun XIONG,Mao-zhen LIU,Jian-feng MA,Qi JIANG,Lin BAI
    2017, 38(3):  25-33.  doi:10.11959/j.issn.1000-436x.2017057
    Asbtract ( 901 )   HTML ( 7)   PDF (807KB) ( 878 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Deduplication is widely used in cloud storage service to save bandwidth and storage resources,however,the security of client deduplication still flaws in an external attack to access a user’s private data.Xu-CDE,a deduplication solution of encrypting data for multi-client was first proposed,which could protect the privacy of data from the external attackers and honest but curious server,with favorable theoretical meaning and representativeness.However,in Xu-CDE,the user ownership authentication credentials were lack of instantaneity protection,which could not resist replay attack.As an improvement to the flaw,the protocol MRN-CDE (MLE based and random number modified client-side deduplication of encrypted data in cloud storage) was proposed,adding random number in order to ensure the instantaneity of the authentication credentials,and using the algorithm of MLE-KPto extract key from original file to replace the file itself as an encryption key.As a consequence,the new protocol improved security while significantly reduced the amount of computation.After the safety analysis and the actual tests,results show that based on Xu-CDE,the proposed protocol MRN-CDE has stronger security of ownership,and improves time efficiency.Specially,the new protocol works better on large files in cloud with a certain value.

    Video transmission strategy in multi-rate and multi-node IEEE 802.11 networks
    Liang CHEN,Xiang GU,Jin WANG
    2017, 38(3):  34-44.  doi:10.11959/j.issn.1000-436x.2017059
    Asbtract ( 434 )   HTML ( 5)   PDF (839KB) ( 681 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The video transmission strategy VQCW (video queue contention window) was proposed for video transmission fair problem in multi-rate and multi-node IEEE 802.11 networks.The strategy was based on node queue selective packet drop and contention window dynamic adjustment.It deduced a maximum throughput model according to initial contention window size because of the relation between throughput and initial contention window size.This model can provide theoretical upper limit for improving throughput.The theoretical modeling and NS simulation show that the proposed strategy can maintain both video transmission quality and high network overall throughput.

    Time-varying channel estimation in OFDM systems based on multiple symbols BEM
    Yong DING,Shan OUYANG,Yue-lei XIE,Jun-zheng JIANG,Xiao-mao CHEN
    2017, 38(3):  45-52.  doi:10.11959/j.issn.1000-436x.2017060
    Asbtract ( 474 )   HTML ( 12)   PDF (1142KB) ( 823 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the problem of low frequency spectrum utilization for the time-varying channel estimation in orthogonal frequency division multiplexing(OFDM) systems based on basis expansion model (BEM),a new method based on multiple symbols BEM was proposed.Compared with the conventional method based on single symbol,the proposed method reduced the subcarriers for pilots.And by means of the baseline tilting technique,the new method mitigated the Gibbs phenomenon caused by Fourier series expansion.The theoretical analysis reveals that the channel model error is reduced due to the introduction of the baseline tilting technique when the normalized Doppler frequency is no more than 1 2 1 M 1+ N g N .Finally,the numerical simulation shows that compared with conventional methods,the proposed algorithm achieves significant improvement on the estimation error performance and bit error rate (BER) performance under the conditions of the corresponding time-varying channel.

    Edge-first-based cooperative caching strategy in information centric networking
    Jiang ZHI,Jun LI,Hai-bo WU,Yong-mao REN
    2017, 38(3):  53-64.  doi:10.11959/j.issn.1000-436x.2017064
    Asbtract ( 511 )   HTML ( 9)   PDF (966KB) ( 839 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to optimize the replica placement in information centric networking,an edge-first-based cooperative caching strategy (ECCS) was proposed.According to the strategy,cache decision was made during the interest forwarding stage.The decision result and statistic information would been forwarded to upstream routers step by step.Utilizing the information,upstream nodes could update their cache information table immediately to achieve cooperative caching.The experimental results indicate ECCS can achieve salient performance gain in terms of server load reduction ratio,average hop reduction ratio,average cache hit ratio,compared with current strategies.

    Power analysis attack of dynamic password token based on SM3
    Zhi-bo DU,Zhen WU,Min WANG,Jin-tao RAO
    2017, 38(3):  65-72.  doi:10.11959/j.issn.1000-436x.2017066
    Asbtract ( 469 )   HTML ( 2)   PDF (1510KB) ( 1036 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method of the power analysis attack of dynamic password token based on SM3 was first proposed to choose the permutation function output as the power analysis attack target,and the simultaneous equations about the key were composed of the attack results.According to the given inverse permutation function,the key was derived by solving the simultaneous equations based on the inverse permutation function.Measured results are presented to validate the proposed method was effective.The proposed method solved the problems of permutation function keys for direct selection of target as an energy analysis attack target.And the proposed method can also be applied to the power analysis attack of the other cryptographic algorithms.

    Nondata-aided error vector magnitude based adaptive modulation over rapidly time-varying channels
    Fan YANG,Xiao-ping ZENG,Xin JIAN,Ji-hua ZHOU,Ding-liang RUAN,Yi-wen GAO
    2017, 38(3):  73-82.  doi:10.11959/j.issn.1000-436x.2017065
    Asbtract ( 459 )   HTML ( 4)   PDF (1141KB) ( 789 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel nondata-aided error vector magnitude based adaptive modulation(NDA-EVM-AM) was proposed to solve the problem of lower spectral efficiency over rapidly time-varying wireless channels.Namely,NDA-EVM was considered as a metric to reflect the rapid change of time-varying channels.The unified model to calculate different modulation order of NDA-EVM was analytically derived,with which the relationship between NDA-EVM and bit error rate (BER) for each modulation order was presented.Thereafter,the mechanism to adaptively select the modulation orders of multilevel quadrature amplitude modulation (MQAM) signals was designed to guarantee the predefined BER.Taking the two rapidly time-varying channels proposed for high-speed railway scenarios as examples,numerical results are conducted to verify the effectiveness of the proposed algorithm.It shows that NDA-EVM estimation has the lest root mean square error than data-aided error vector magnitude (DA-EVM) estimation and signal to noise ratio estimation.The proposed algorithm has better accuracy in aspects of channel quality estimation and modulation orders adjustment,Compared with conventional data-aided error vector magnitude based-adaptive modulation (DA-EVM-AM),the accuracy improves by 7.9%,spectral efficiency improves by 0.53 bit·s?1·Hz?1,and compared with signal to noise ratio based-adaptive modulation (SNR-AM),the accuracy improves by 15.7%,spectral efficiency improves by 0.82 bit·s?1·Hz?1.

    Multi-authority attribute-based encryption with efficient revocation
    Kai ZHANG,Jian-feng MA,Hui LI,Jun-wei ZHANG,Tao ZHANG
    2017, 38(3):  83-91.  doi:10.11959/j.issn.1000-436x.2017068
    Asbtract ( 529 )   HTML ( 15)   PDF (1557KB) ( 1031 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multi-authority attribute-based encryption was very suitable for data access control in a cloud storage environment.However,efficient user revocation in multi-authority attribute-based encryption remains a challenging problem that prevents it from practical applications.A multi-authority ciphertext-policy attribute-based encryption scheme with efficient revocation was proposed in prime order bilinear groups,and was further proved statically secure and revocable in the random oracle model.Extensive efficiency analysis results indicate that the proposed scheme significantly reduce the computation cost for the users.In addition,the proposed scheme supports large universe and any monotone access structures,which makes it more flexible for practical applications.

    Blind separation algorithm of PCMA signals with different symbol rates based on DG-PSP
    Yi-ming GUO,Hua PENG,Yong YANG,Xue-juan WEI,Hao WANG
    2017, 38(3):  92-100.  doi:10.11959/j.issn.1000-436x.2017063
    Asbtract ( 543 )   HTML ( 4)   PDF (1331KB) ( 782 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A blind separation algorithm was proposed for PCMA signals with different symbol rates based on double grid per-survivor processing (DG-PSP).The channel states and two input signal components were treated as two dynamic grids,receiving mixed-signal reconstructed by respectively iterative updating the two groups of grid status,thus achieving blind signal separation.The joint iterative decoding separation structure was focused,and a detailed analysis and comparison under different error estimation of parameters was shown.The complexity of the algorithm is similar to the traditional PSP algorithm.Simulation results show that,a gain of about 2 dB in signal-noise ratio can be obtained after the first iteration at a bit error rate of 10?2,and a gain of nearly 3 dB in signal-noise ratio can be obtained after the second iteration.

    Uncertain data analysis algorithm based on fast Gaussian transform
    Rong-hua CHI,Yuan CHENG,Su-xia ZHU,Shao-bin HUANG,De-yun CHEN
    2017, 38(3):  101-111.  doi:10.11959/j.issn.1000-436x.2017061
    Asbtract ( 539 )   HTML ( 13)   PDF (1374KB) ( 749 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The effect of the uncertainties needs to be taken full advantage during uncertain data clustering.An uncertain data clustering algorithm based on fast Gaussian transform was proposed,to solve the problems about the impact on the accuracy of clustering results and the clustering efficiency caused by the uncertainties,during the construction of uncertain data models and the distance measurement,which existed in the current researches.First,the data model according to the characteristic of the uncertainty distribution was constructed,without the premise of assuming the data distribution.And the similarity between uncertain data objects was measured by combining the two important features of uncertain objects,attribute features and the probability density function representing the characteristic of uncertainty distribution.And then the uncertain data clustering algorithm was proposed.Finally,the experiment results on UCI and real datasets indicate the better efficiency and accuracy of proposed algorithm.

    Multi-objective data collecting strategies for wireless sensor network based on the time variable multi-salesman problem and genetic algorithm
    Hao FENG,Lei LUO,Yong WANG,Miao YE
    2017, 38(3):  112-123.  doi:10.11959/j.issn.1000-436x.2017070
    Asbtract ( 493 )   HTML ( 8)   PDF (1185KB) ( 968 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Comparing to the traditional data collecting method with data route,the technology of wireless mobile nodes has gradually became a new technique in the wireless sensor network.As the solution to the visiting order of the static nodes was an intrinsic NP-hard problem,a more general multi-objective data colleting strategies based on multi-mobile nodes was proposed.The proposed data collecting technique was abstracted as a model of time variable multiple traveling salesman problem.Belonging to a discrete optimal problem,the proposed model was solved by with a proposed hybrid genetic algorithm to determine the paths of the multi-mobile nodes.The convergence analysis of the proposed algorithm was given.With the experiment of open dataset,the proposed model based on the time variable multiple traveling salesman problem and the proposed hybrid genetic algorithm certify a certain improvement to the efficiency and real-time ability.

    Research on the chaotic group secret communication of the distributed ,large-scale and multi-signal system
    Guang-ming SUN,Jin-jie HUANG,Qiao LIU
    2017, 38(3):  124-132.  doi:10.11959/j.issn.1000-436x.2017062
    Asbtract ( 310 )   HTML ( 2)   PDF (1354KB) ( 861 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Modern complicated communication system has the characteristics of distributed,large scales,multiple-imput signals and parallel transmission,which result in the increasing urgent problem of communication security.Based on the analysis on the evolution method and the unification-synchronization problem of the chaotic group system,a rotation model of 3D chaotic system was established.With the Newton-Leipnik system as study object,three different types of communication signals to simulate and validate the evolution of chaotic group,and the unification and synchronization of the chaotic group system was utilized.Experimental results show that the method presented in this study is effective and has a good prospect for the application.

    Network moving target defense technique based on optimal forwarding path migration
    Cheng LEI,Duo-he MA,Hong-qi ZHANG,Qi HAN,Ying-jie YANG
    2017, 38(3):  133-143.  doi:10.11959/j.issn.1000-436x.2017056
    Asbtract ( 604 )   HTML ( 16)   PDF (1436KB) ( 1194 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Moving target defense is a revolutionary technology which changes the situation of attack and defense.How to effectively achieve forwarding path mutation is one of the hotspot in this field.Since existing mechanisms are blindness and lack of constraints in the process of mutation,it is hard to maximize mutation defense benefit under the condition of good network quality of services.A novel of network moving target defense technique based on optimal forwarding path migration was proposed.Satisfiability modulo theory was adopted to formally describe the mutation constraints,so as to prevent transient problem.Optimization combination between routing path and mutation period was chosen by using optimal routing path generation method based on security capacity matrix so as to maximum defense benefit.Theoretical and experimental analysis show the defense cost and benefit in resisting passive sniffing attacks.The capability of achieving maximum defense benefit under the condition of ensuring network quality of service is proved.

    Mobile direct-sequence spread-spectrum underwater acoustic communication based on improved differential energy detector
    Peng-yu DU,Long-xiang GUO,Jing-wei YIN,Gang QIAO
    2017, 38(3):  144-153.  doi:10.11959/j.issn.1000-436x.2017058
    Asbtract ( 338 )   HTML ( 8)   PDF (2236KB) ( 788 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A Doppler estimation method based on the structural features of spread spectrum signal was proposed,which could achieve real-time Doppler estimation for received spread spectrum signals by energy detecting the result of matching correlation calculation of adjacent received spreading symbols.In addition,this method made full use of the spread spectrum processing gain and could do Doppler estimation under low SNR condition.Improved differential energy detector was further proposed,which can effectively deal with the rapid carrier phase fluctuation interference caused by Doppler effect and time-varying multi-path interference by detecting the output energy of two correlators.Simulation verified the robustness of improved differential energy detector algorithm and the Doppler estimation method based on spread spectrum signal.At-sea data shows that improved differential energy detector combined with the proposed Doppler estimation method can achieve low bit error rate communication for direct-sequence spread spectrum underwater acoustic communication with large time-varying Doppler interference when SNR is ?10 dB.

    Correspondences
    Differential data update scheme on network-coding-based cloud storage system
    Long-jiang WANG,Yue CHEN,Xin-cheng YAN,Kai-xiang HUANG
    2017, 38(3):  154-164.  doi:10.11959/j.issn.1000-436x.2017045
    Asbtract ( 392 )   HTML ( 1)   PDF (1182KB) ( 1111 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem that the communication overhead of date update was too large on network-coding-based cloud storage system,a new differential data update scheme was proposed.By encoding and compressing the updated part of file,the communication overhead was reduced significantly.A network-coding-based storage prototype system was designed and implemented,and update scheme was deployed in the real network settings.Experimental results show that the proposed scheme has less communication overhead and better scalability than the existing schemes.

    Asynchronous perception algorithm based on energy detection
    Pan YU,Bin LI,Cheng-lin ZHAO
    2017, 38(3):  165-173.  doi:10.11959/j.issn.1000-436x.2017039
    Asbtract ( 337 )   HTML ( 3)   PDF (808KB) ( 926 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the future heterogeneous wireless networks,since primary user (PU) and cognitive secondary user (SU) are not coordinated to be synchronous,it will result in sense timing difference between PU’s transmitter and SU’s receiver.For this asynchronous sense case,a new asynchronous sensing algorithm based on Bayesian estimation theory was proposed.A unified dynamic state space model was first proposed to describe the observable energy relationship with dynamic PU state and unknown timing difference.Then,an iterative estimation scheme was designed using stochastic finite set and the rules of maximum posterior probability.Finally,approximated estimation results were obtained by using a particle filter.The simulation results show that the proposed asynchronous scheme significantly eliminates the uncertainty of the received signal information and thus improves the spectrum sensing performance by obtaining the time difference accurately.

    Scrambler blind recognition method based on soft information
    Ze-liang CHEN,Hua PENG,Ke-xian GONG,Pei-dong YU
    2017, 38(3):  174-182.  doi:10.11959/j.issn.1000-436x.2017043
    Asbtract ( 397 )   HTML ( 5)   PDF (1156KB) ( 1020 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Two scrambler blind recognition methods based on soft information were proposed for received signal in non-cooperative ways.The first method established a cost function of the scrambler coefficients by using the soft information,and adopted the optimization theory of real number field for positive solution.So it didn’t need to traverse the closed set of test polynomial any more.The second method built conformity degree concept with the soft information,and used the size of conformity of each test scrambler polynomial as the discriminant criteria.So it made more full use of the received information compared to the hard sentence recognition algorithm.Simulation results show that the first method can shorten the recognition time of a synchronous scrambler polynomial from 5 min 18 s to 8 s compared with the traversal method put forward by Cluzeau,and the second method has 2 dB SNR gain when to achieve the relatively high accuracy compared with the hard sentence recognition algorithm.

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: