Please wait a minute...

Current Issue

    25 January 2020, Volume 41 Issue 1
    Papers
    Dynamic service migration strategy based on MDP model with multiple parameter in vehicular edge network
    Hui GUO,Lanlan RUI,Zhipeng GAO
    2020, 41(1):  1-14.  doi:10.11959/j.issn.1000-436x.2020012
    Asbtract ( 564 )   HTML ( 93)   PDF (1557KB) ( 797 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To handle with the service interruption caused by vehicles’ mobility and limited service coverage of edge servers,a dynamic service migration algorithm based on multi-parameters Markov decision process (MDP) model was put forward for vehicular edge network,which was called as dynamic service migration algorithm based on multiple parameter (DSMMP).Combining delay,bandwidth,server capacity with vehicle motion information,DSMMP constructed a multi-parameters MDP revenue function to remedy the deficiency of distance-based schemes.By using vehicle motion and delay constraints,a candidate server set with several candidate servers was defined,and migration decision through long-term Bellman revenue values was made.In order to improve the dynamic adaptability of the proposed algorithm,the weight values were calculated and updated by leveraging historical information.Simulation results show that our strategy has a good performance in terms of delay,packet loss ratio and service migration times.

    Blind recognition of primitive BCH code based on average cosine conformity
    Zhaojun WU,Limin ZHANG,Zhaogen ZHONG,Yufeng LONG
    2020, 41(1):  15-24.  doi:10.11959/j.issn.1000-436x.2020022
    Asbtract ( 249 )   HTML ( 21)   PDF (922KB) ( 498 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2m) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.

    Compressed sensing reconstruction algorithm based on adaptive acceleration forward-backward pursuit
    Zuozhou PAN,Zong MENG,Jing LI,Ying SHI
    2020, 41(1):  25-32.  doi:10.11959/j.issn.1000-436x.2020006
    Asbtract ( 349 )   HTML ( 28)   PDF (1011KB) ( 342 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the long running time problem of the traditional forward-backward pursuit (FBP) algorithm,an adaptive acceleration forward-backward pursuit (AAFBP) algorithm was proposed.The reconstruction process of AAFBP algorithm can be divided into two stages.In the forward stage,the AAFBP algorithm used the adaptive threshold to select the right amount of atoms to join the support set.In the backward stage,based on the projection coefficient of the atoms,the deletion threshold was introduced to remove the atoms adaptively and the excessive backtracking phenomenon in adaptive process was overcome simultaneously.The proposed method can ensure the number of the selected atoms more random,and more right atoms were retained in each iteration.The simulation results of one-dimensional sparse signal and two-dimensional image show that the AAFBP algorithm has more advantages in both the accuracy of reconstruction and the running time.

    Attack detection method based on spatiotemporal event correlation in intranet environment
    Wei SUN,Peng ZHANG,Yongquan HE,Lichao XING
    2020, 41(1):  33-41.  doi:10.11959/j.issn.1000-436x.2020001
    Asbtract ( 357 )   HTML ( 38)   PDF (817KB) ( 719 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the fact that a single event as an attack detection feature leads to a higher false positive rate,an intranet attack detection method using Bayesian network model for cross-space event correlation and Kalman filter linear model for cross-temporal event correlation was proposed.Based on the method,a process query system was implemented,which can scan and correlate distributed network events according to the user's high-level process description.Experimental analysis show that the proposed method can significantly reduce the false positive rate of intranet attack detection without increasing the computational overhead.

    Optimal strategy selection approach of moving target defense based on Markov time game
    Jinglei TAN,Hengwei ZHANG,Hongqi ZHANG,Hui JIN,Cheng LEI
    2020, 41(1):  42-52.  doi:10.11959/j.issn.1000-436x.2020003
    Asbtract ( 409 )   HTML ( 32)   PDF (1307KB) ( 522 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the problem that the existed game model was challenging to model the dynamic continuous characteristics of network attack and defense confrontation effectively,a method based on Markov time game was proposed to select the optimal strategy for moving target defense.Based on the analysis of the attack and defense confrontation process of moving targets,the set of moving target attack and defense strategies was constructed.The dynamics of the single-stage moving target defense process was described by time game.The randomness of multi-stage moving target defense state transformation was described by Markov decision process.At the same time,by abstracting the use of resource vulnerability by attack-defense participants as the alternation of the control of the attack surface,the versatility of the game model was effectively guaranteed.On this basis,the existence of equilibrium was analyzed and proved,and the optimal strategy selection algorithm was designed.Finally,the practicality of the constructed model and the effectiveness of the algorithm are verified by an application example.

    Code-based generalized signcryption scheme with multi-receiver
    Yiliang HAN,Zhong WANG
    2020, 41(1):  53-65.  doi:10.11959/j.issn.1000-436x.2020002
    Asbtract ( 236 )   HTML ( 21)   PDF (1041KB) ( 450 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem of secure transmission of messages with multiple receivers,a code-based generalized signcryption scheme with multi-receiver was designed.Firstly,a multi-encrypted McEliece scheme that can meet the security of IND-CCA2 was designed.Combined with the CFS signature scheme,the multi-receiver signcryption and generalized signcryption scheme based on code were designed.The security analysis shows that the multi-receiver generalized signcryption scheme can meet the security of IND-CCA2 in terms of confidentiality and can meet EUF-CMA security in terms of unforgeability.Compared with other similar multi-receiver signcryption schemes,the proposed scheme does not include exponential,bilinear pairing operations,etc.,and has high computational efficiency and the advantage of anti-quantum computing.Compared with the method of signing-then-encrypting method,the proposed scheme has the smaller private key and higher efficiency.

    Image restoration algorithm based on compensated transmission and adaptive haze concentration coefficient
    Yan YANG,Zhiwei WANG
    2020, 41(1):  66-75.  doi:10.11959/j.issn.1000-436x.2020009
    Asbtract ( 336 )   HTML ( 21)   PDF (6374KB) ( 464 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the drawbacks of traditional dark channel prior,which was prone to distortion and Halo effects in the bright areas,a haze image restoration algorithm based on compensated transmission and adaptive haze concentration coefficient was proposed.First of all,a Gaussian function was used to fit the attenuation relationship between the haze and haze-free image,and the compensation transmission was set to correct the initial transmission.Then the characteristics of haze was analyzed,the concept of brightness entropy was introduced and the bright channel operation was performed to acquire entropy value with pixel by pixel.Combined with the Gaussian pyramid to extract texture features,the haze distribution map was obtained.An adaptive transformation was established to seek the haze concentration coefficient and get the accurate transmission.Finally,the recovery results were restored by improved atmospheric light value and atmospheric scattering model.Experimental results show that the recovered image has better color and detail,the degree of dehazing is thorough,the brightness is appropriate,and the effect is clear and natural.

    Collaborative filtering recommendation algorithm based on rough set rule extraction
    Yonggong REN,Yunpeng ZHANG,Zhipeng ZHANG
    2020, 41(1):  76-83.  doi:10.11959/j.issn.1000-436x.2020028
    Asbtract ( 281 )   HTML ( 20)   PDF (939KB) ( 770 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problem that in a practical recommendation system (RS),because of the datasets are often very sparse,the traditional collaborative filtering (CF) approach cannot provide recommendations with higher quality,a novel CF based on rough set rule extraction was proposed.Firstly,the attributes of user/item and the user-item rating matrix were used to construct a decision table.Then,the core value of each rule in the table was extracted through using the decision table reduction algorithm.Finally,according to the nuclear value decision rule of the core value table,the reductions of all decision rules were utilized to predict the rating scores of un-rated items.Experimental results suggest that the proposed approach can alleviate the data sparsity problem of CF,and provide recommendations with higher accuracy.

    Robust power and subcarrier allocation algorithm for cognitive network based on interference efficiency maximization
    Yongjun XU,Yang YANG,Qilie LIU,Qianbin CHEN,Jinzhao LIN
    2020, 41(1):  84-93.  doi:10.11959/j.issn.1000-436x.2020007
    Asbtract ( 218 )   HTML ( 14)   PDF (1195KB) ( 521 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the cognitive OFDMA uplink communication system,a robust power and subcarrier allocation algorithm based on maximum interference efficiency was proposed.Firstly,considering primary user interference constraint,secondary user transmit power constraint,subcarrier allocation constraint and secondary user minimum rate constraint,a robust resource optimization model based on outage probability was established.Then,by using Bernstein approximation and Dinkelbach’s method,the original non-convex problem based on outage probability was transformed into an equivalent convex optimization one,and the analytical solution was obtained by Lagrangian dual function method.Meanwhile,the computational complexity and robust sensitivity of the algorithm were analyzed.The simulation results show that the proposed algorithm has better interference efficiency and robustness.

    Impossible differential distinguisher analysis of GRANULE and MANTRA algorithm
    Xiaonian WU,Yingxin LI,Yongzhuang WEI,Yaping SUN
    2020, 41(1):  94-101.  doi:10.11959/j.issn.1000-436x.2020025
    Asbtract ( 347 )   HTML ( 26)   PDF (873KB) ( 703 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The lightweight block cipher algorithms called GRANULE and MANTRA have a simple structure,fast encryption speed,and they can be easy implemented in software and hardware.Two algorithms are especially suitable for resource-constrained environments.To analyze the security of two algorithms,an automatic search method of impossible differential distinguishers was proposed.Based on the structural characteristics of the GRANALE and MANTRA,the S-box differential characteristics were obtained by analyzing the S-box differential distribution table,and then the idea of intermediate encounter was used to traverse from the difference path obtained from the encryption/decryption direction seperately to select the optimal differential path with probability 0.The analysis results show that there are 144 different 7-round impossible differential distinguishers in the GRANULE,and 52 different 9-round impossible differential distinguishers in the MANTRA.Compared with the existing results,the rounds of the proposed distinguisher is currently the highest.

    Mobile malware traffic detection approach based on value-derivative GRU
    Hanxun ZHOU,Chen CHEN,Runze FENG,Junkun XIONG,Hong PAN,Wei GUO
    2020, 41(1):  102-113.  doi:10.11959/j.issn.1000-436x.2020005
    Asbtract ( 363 )   HTML ( 29)   PDF (1172KB) ( 569 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the dramatic increase in the number and variety of mobile malware had created enormous challenge for information security of mobile network users,a value-derivative GRU-based mobile malware traffic detection approach was proposed in order to solve the problem that it was difficult for a RNN-based mobile malware traffic detection approach to capture the dynamic changes and critical information of abnormal network traffic.The low-order and high-order dynamic change information of the malicious network traffic could be described by the value-derivative GRU approach at the same time by introducing the concept of “accumulated state change”.In addition,a pooling layer could ensure that the algorithm can capture key information of malicious traffic.Finally,simulation were performed to verify the effect of accumulated state changes,hidden layers,and pooling layers on the performance of the value-derivative GRU algorithm.Experiments show that the mobile malware traffic detection approach based on value-derivative GRU has high detection accuracy.

    V2X offloading and resource allocation under SDN and MEC architecture
    Haibo ZHANG,Zixin WANG,Xiaofan HE
    2020, 41(1):  114-124.  doi:10.11959/j.issn.1000-436x.2020023
    Asbtract ( 651 )   HTML ( 71)   PDF (852KB) ( 1205 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the serious problem of delay and energy consumption increase and service quality degradation caused by complex network status and huge amounts of computing data in the scenario of vehicle-to-everything (V2X),a vehicular network architecture combining mobile edge computing (MEC) and software defined network (SDN) was constructed.MEC sinks cloud serviced to the edge of the wireless network to compensate for the delay fluctuation caused by remote cloud computing.The SDN controller could sense network information from a global perspective,flexibly schedule resources,and control offload traffic.To further reduce the system overhead,a joint task offloading and resource allocation scheme was proposed.By modeling the MEC-based V2X offloading and resource allocation,the optimal offloading decision,communication and computing resource allocation scheme were derived.Considering the NP-hard attribute of the problem,Agglomerative Clustering was used to select the initial offloading node,and Q-learning was used for resource allocation.The offloading decision was modeled as an exact potential game,and the existence of Nash equilibrium was proved by the potential function structure.The simulation results show that,as compared to other mechanisms,the proposed mechanism can effectively reduce the system overhead.

    DGANS:robustness image steganography model based on double GAN
    Leqing ZHU,Yu GUO,Lingqiang MO,Daxing ZHANG
    2020, 41(1):  125-133.  doi:10.11959/j.issn.1000-436x.2020019
    Asbtract ( 516 )   HTML ( 82)   PDF (6851KB) ( 236 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Deep convolutional neural networks can be effectively applied to large-capacity image steganography,but the research on their robustness is rarely reported.The DGANS (double-GAN-based steganography) applies the deep learning framework in image steganography,which is optimized to resist small geometric distortions so as to improve the model’s robustness.DGANS is made up of two consecutive generative adversarial networks that can hide a grayscale image into another color or grayscale image of the same size and can restore it later.The generated stego-images are augmented and used to further train and strengthen the reveal network so as to make it adaptive to small geometric distortion of input images.Experimental results suggest that DGANS can not only realize high-capacity image steganography,but also can resist geometric attacks within certain range,which demonstrates better robustness than similar models.

    Comprehensive Review
    Survey of blockchain:principle,progress and application
    Shiqin ZENG, Ru HUO, Tao HUANG, Jiang LIU, Shuo WANG, Wei FENG
    2020, 41(1):  134-151.  doi:10.11959/j.issn.1000-436x.2020027
    Asbtract ( 2479 )   HTML ( 404)   PDF(1174KB) ( 13764 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Blockchain is a kind of distributed ledger technology that upgrades to a complete storage system by adding logic control functions such as intelligent contracts.With the changes of its classification,service mode and application requirements,the core technology forms of Blockchain show diversified development.In order to understand the Blockchain ecosystem thoroughly,a hierarchical technology architecture of Blockchain was proposed.Furthermore,each layer of blockchain was analyzed from the perspectives of basic principle,related technologies and research progress in-depth.Moreover,the technology selections and characteristics of typical Blockchain projects were summarized systematically.Finally,some application directions of blockchain frontiers,technology challenges and research prospects including Smart Cities and Industrial Internet were given.

    Distinguished and Excellent Young Scholars
    Research progress and prospect of software-defined multi-dimensional optical network
    Lei GUO,Xu ZHANG,Weigang HOU,Yejun LIU,Qihan ZHANG,Zizheng CAO
    2020, 41(1):  152-161.  doi:10.11959/j.issn.1000-436x.2020010
    Asbtract ( 450 )   HTML ( 27)   PDF (1341KB) ( 714 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To meet diverse business needs,both architecture on demand (AoD) nodes and multi-core fibers (MCF) based software-defined multi-dimensional optical networks will enable customizable network services.Aiming at the problem of management and control for multi-dimensional network resources,the architecture of software-defined multi-dimensional optical networks was introduced firstly.Then,the enabling technologies to support the implementation of software-defined multi-dimensional optical networks were presented.Finally,the development direction of software-defined intelligent multi-dimensional optical networks was proposed and analyzed.

    Application research of optical communication network based on artificial intelligence technique
    Gangxiang SHEN
    2020, 41(1):  162-168.  doi:10.11959/j.issn.1000-436x.2020004
    Asbtract ( 761 )   HTML ( 138)   PDF (783KB) ( 594 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The applications of artificial intelligence (AI) technique in optical communication networks were explored.Some representative AI applications and potential risks due to the failure of the AI technique were discussed.To address these risks,methods including systematic AI modeling through unitizing and miniaturizing sub-systems and cooperation with traditional network modeling and planning methods were proposed,which were expected to help improve the effectiveness and practicality of the application of the AI technique.Finally,to recover a system from the failure of its employed AI technique or attacks,some protection strategies were proposed.

    Correspondences
    Identification of DNS covert channel based on improved convolutional neural network
    Meng ZHANG,Haoliang SUN,Peng YANG
    2020, 41(1):  169-179.  doi:10.11959/j.issn.1000-436x.2020017
    Asbtract ( 487 )   HTML ( 51)   PDF (898KB) ( 1168 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to effectively identify the multiple types of DNS covert channels,the implementation of different sorts of DNS covert channel software was studied,and a detection based on the improved convolutional neural network was proposed.The experimental results,grounded upon the campus network traffic,show that the detection can identify twenty-two kinds of data interaction modes of DNS covert channels and is able to identify the unknown DNS covert channel traffic.The proposed method outperforms the existing methods.

    Research on nanosecond time synchronization technology for 5G base station based on GNSS neighborhood similarity
    Wenxue LIU,Shijun CHEN,Jian GE,Hong YUAN,Cuiling GONG
    2020, 41(1):  180-190.  doi:10.11959/j.issn.1000-436x.2020024
    Asbtract ( 504 )   HTML ( 52)   PDF (1575KB) ( 743 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For precision positioning requirements in the LTE-A/5G service developed by the 3GPP,the nanosecond precision time synchronization technology based on global navigation satellite system (GNSS) for 5G base station was studied which broke through the current GNSS receiver’s hundred nanosecond timing accuracy.By analyzing the characteristics of neighborhood similarity of GNSS errors and combining the characteristics of time synchronization requirements of 5G base stations,a nanosecond precision time synchronization theory and related receiver algorithms for 5G base stations was proposed which based on the principle of neighborhood similarity of GNSS signals.The specific characteristics of the time synchronization technology under regional and wide-area conditions were studied.The simulation and experimental results show that compared with the current time synchronization accuracy within hundred nanosecond rang of base stations,the proposed method can achieve precision time synchronization within 3 ns between the regional base stations,and support 5G base station meter-level precision location based service(LBS) and other advanced incremental services.

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: