Please wait a minute...

Current Issue

    25 September 2017, Volume 38 Issue 9
    Papers
    Adaptive JPEG steganography based on distortion cost updating
    Guang-ming TANG,Yi SUN,Xiao-yu XU,Yu WANG
    2017, 38(9):  1-8.  doi:10.11959/j.issn.1000-436x.2017177
    Asbtract ( 609 )   HTML ( 7)   PDF (800KB) ( 1230 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Previous adaptive JPEG steganography algorithms mostly calculate image distortion before secret information embedding,so they can’t dynamically adjust distortion costs.Considering the mutual impacts during embedding,an adaptive JPEG steganography algorithm based on distortion cost updating was proposed.Firstly,three factors that affect embedding fluctuations were analyzed,including quantization step,the absolute value of the quantized DCT coefficient to be modified and perturbation error.Then the embedding update strategy (EUS) was proposed,which enabled to dynamically update the distortion costs.After that,an adaptive JPEG steganography algorithm was implemented combining the strategy.The experimental result illustrates that the algorithm can significantly improve the secure performance of JPEG steganography algorithm.

    Hadoop cloud platform user dynamic access control model
    Hong-yu YANG,Ling-xian MENG
    2017, 38(9):  9-17.  doi:10.11959/j.issn.1000-436x.2017142
    Asbtract ( 643 )   HTML ( 2)   PDF (1133KB) ( 694 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem that Hadoop cloud platform could not dynamically control user access request,a Hadoop cloud dynamic access control model based on user behavior assessment (DACUBA) was proposed.The model first collected the user instruction sequence in real time and the user behavior contour was obtained by parallel command sequence learning (PCSL).Then the global K model was established by using the forward profile,the subsequent sequence was classified and the classification results were evaluated.The evaluation results were combined with the improved Hadoop access control mechanism to make the cloud platform users’ access rights change dynamically with their own behaviors.Experimental results demonstrate that the model algorithm is effective and the dynamic access control mechanism is feasible.

    Research on Q-learning based rate control approach for HTTP adaptive streaming
    Li-rong XIONG,Jing-zhi LEI,Xin JIN
    2017, 38(9):  18-24.  doi:10.11959/j.issn.1000-436x.2017178
    Asbtract ( 504 )   HTML ( 7)   PDF (799KB) ( 853 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    HTTP adaptive streaming (HAS) has become the standard for adaptive video streaming service.In changing network environments,current hardcoded-based rate adaptation algorithm was less flexible,and it is insufficient to consider the quality of experience (QoE).To optimize the QoE of users,a rate control approach based on Q-learning strategy was proposed.the client environments of HTTP adaptive video streaming was modeled and the state transition rule was defined.Three parameters related to QoE were quantified and a novel reward function was constructed.The experiments were employed by the Q-learning rate control approach in two typical HAS algorithms.The experiments show the rate control approach can enhance the stability of rate switching in HAS clients.

    Construction of zero correlation zone Gaussian integer sequence set
    Yu-bo LI,Jia-an SUN,Nan JING
    2017, 38(9):  25-30.  doi:10.11959/j.issn.1000-436x.2017179
    Asbtract ( 359 )   HTML ( 3)   PDF (663KB) ( 672 )   Knowledge map   
    References | Related Articles | Metrics

    The construction of zero correlation zone (ZCZ) Gaussian integer sequence set was researched.Based on binary orthogonal matrices,ZCZ ternary sequence sets were constructed by adding zeros at first.Then the ternary ZCZ squences were transformed into Gaussian integer sequences by using a perfect Gaussian integer sequence without changing the ideal autocorrelation functions and crosscorrelation functions in the zero correlation zone.The proposed ZCZ Gaussian integer sequence sets are optimal or almost optimal with respect to the Tang-Fan-Matsufuji bound.

    Remote attestation scheme for cloud platform based on double-layer unbalanced hash tree
    Xing RONG,Chang-xiang SHEN,Rong JIANG,Yong ZHAO
    2017, 38(9):  31-38.  doi:10.11959/j.issn.1000-436x.2017180
    Asbtract ( 362 )   HTML ( 3)   PDF (898KB) ( 682 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to validate the service of cloud,an improved remote attestation scheme based on unbalanced hash tree of cloud platform was proposed.Double-layer unbalanced hash tree was built by introducing layer,original single tree was expanded to main tree and sub tree,which corresponded to virtual machine in cloud platform and the running components in virtual machine.Attestation needs no more than measurement component and authentication path.The analysis shows that this scheme can increase the attestation efficiency of cloud platform,and is good at protecting privacy and expandability,which is suitable for validating cloud platform service.

    On the linear complexity of a new generalized cyclotomic sequence with length mover GF(h)
    Long-fei LIU,Kai YANG,Xiao-yuan YANG
    2017, 38(9):  39-45.  doi:10.11959/j.issn.1000-436x.2017181
    Asbtract ( 290 )   HTML ( 5)   PDF (694KB) ( 567 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the Ding-generalized cyclotomy,a new class of generalized cyclotomic sequences with length pm over the finite field of power of odd prime order was constructed,and the sequence was balanced.The linear complexity of the sequences was determined using the relationship between h and p and the theory of polynomial over finite field.It is shown that the sequence has good linear complexity,and it can resist attacks from the application of the Berlekamp-Massey algorithm.

    DFT-SV-OFDM based adaptive multi-rate DFT scrambling vector code division multiple access
    Gao ZHOU,Ping-zhi FAN,Li HAO
    2017, 38(9):  46-54.  doi:10.11959/j.issn.1000-436x.2017182
    Asbtract ( 333 )   HTML ( 3)   PDF (816KB) ( 714 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multipath interference would degrade the performance of multi-rate systems based on OFDM and CDMA,which spectrum efficiency was also lower relatively.To improve the performance and spectrum efficiency,a novel adaptive multi-rate DFT scrambling vector multi-carrier CDMA (AMR-DFT-VMC-CDMA) was proposed based on the theory of matrix permutation and r-cyclical matrix decomposition characteristics.Meanwhile,by theoretical analysis,the parameters of the system could be adaptively adjusted to ensure frame length long enough to break the restriction between channel bit error rate and data frame length on a certain channel utilization condition.The simulation results show that compared with the traditional multi-rate,multi-subcarrier and spreading system,the new system could achieve multi-rate and multi-user information transmission flexibly with better performance and better spectrum efficiency in fading channels.Moreover,it can satisfy the requirement of frame length under certain channel utilization by adjusting the parameters.

    Study on optimization strategy for hybrid underlay/overlay spectrum sharing based on queuing model
    Jian-ping LIU,Shun-fu JIN,Bao-shuai WANG
    2017, 38(9):  55-64.  doi:10.11959/j.issn.1000-436x.2017162
    Asbtract ( 480 )   HTML ( 2)   PDF (683KB) ( 1277 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the licensed spectrum utilization in cognitive radio networks,and provide higher experience quality to system users,the optimizing strategies of the hybrid underlay/overlay spectrum sharing mode was studied.For secondary users,a queuing model with service time following two phase order exponential distribution was constructed,and a method to obtain the steady state distribution was presented for the system model.Based on reward-cost structure,individual optimization strategy with observable case and the Nash equilibrium strategy with unobservable case were discussed.With purpose of optimal social benefit and maximal spectrum incomes,the pricing policies for secondary users to use licensed spectrum were formulated.Using the system experiment,the relations among the different optimal strategies were investigated,and the rationality of the price mechanism was verified.By contrasting the optimal social benefits gained by hybrid underlay/overlay spectrum sharing mode,overlay spectrum sharing mode and underlay spectrum sharing mode,it is further shown that the social optimization strategy of hybrid overlay/underlay sharing mode is more effective and stable to fully use the spectrum resource.

    Security-enhanced live migration based on SGX for virtual machine
    Yuan SHI,Huan-guo ZHANG,Bo ZHAO,Zhao YU
    2017, 38(9):  65-75.  doi:10.11959/j.issn.1000-436x.2017183
    Asbtract ( 672 )   HTML ( 14)   PDF (917KB) ( 1918 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The virtual machine may face the problem of information leakage in live migration.Therefore,a dynamic memory protection technique SGX was introduced and a security enhancement live migration method based on KVM environment was proposed.Firstly,on both sides of migration,a hardware-isolated secure execution environment centered SGX was built.It guaranteed the security of operations like encryption and integrity measurement and also ensured the security of private data.An encrypted channel to transfer migration data based on the remote attestation between the secure execution environments of both migration sides was constructed.And the mutual authentication of both sides’ platform integrity was realized.Finally,the security enhancement effect and did the experiment was analyzed.The results shows that the introduction of SGX won’t cause much negative effect to the migration performance.

    CP-ABE based users collaborative privacy protection scheme for continuous query
    Lei ZHANG,Chun-guang MA,Song-tao YANG,Zeng-peng LI
    2017, 38(9):  76-85.  doi:10.11959/j.issn.1000-436x.2017184
    Asbtract ( 404 )   HTML ( 3)   PDF (716KB) ( 866 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In location-based services (LBS),as the untrusted LBS server can be seen as an adversary,and it can utilize the attribute as background knowledge to correlate the real location of the user in the set of uncertain locations.Then the adversary can gain the location privacy when the user enjoys the snapshot and continuous query through the correlation inference attack.In order to cope with this attack,the main scheme in privacy protection is to generalize the attribute and achieve attribute anonymity.However,algorithms of this type usually assumes a trusted third party (TTP) which provides the service of similarity attribute finding and comparing,and it is unpractical in the real environment,as the TTP may become the point of attack or the bottleneck of service and it cannot be considered as the trusted one all the time.Thus,to cope with the correlation inference attack as well as the semi-trusted third party,ciphertext policy attribute based encryption (CP-ABE) and users collaboration based attribute anonymous scheme was proposed.In this scheme,the user coupled achieve location and attribute anonymity.Furthermore,this scheme could also provide security for attacks from the semi-trusted third party as well as semi-trusted collaborative users.At last,security analysis and the experiment results further verify the effectiveness of privacy protection and the efficiency of algorithm execution.

    Faster-than-Nyquist transmission based on multi-layer superposition
    Shuang-yang LI,Lei PING,Bao-ming BAI,Xiao MA
    2017, 38(9):  86-94.  doi:10.11959/j.issn.1000-436x.2017185
    Asbtract ( 485 )   HTML ( 11)   PDF (806KB) ( 1138 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Faster-than-Nyquist (FTN) signaling technique has received much attention recently as an effective way of enhancing the spectral efficiency.In order to reduce the detection complexity for FTN signals,a multi-layer superposition transmission approach was present.In addition,how to calculate upper bounds on the highest information transmission rate was shown and how to choose suitable component codes was suggested.Numerical results show that the system with different code rates and power on each layer outperforms the system with only power variance on each layer,meanwhile results also imply that given the roll-off factor of the pulse shaping function is not zero,the proposed system is superior to the orthogonal system with a higher modulation format.

    RW-MC:self-adaptive random walk based matrix completion algorithm
    Xin-heng WANG,Qian-yun WANG,Jia-jie WANG,Guo-feng ZHAO,Wen-qiang JIN
    2017, 38(9):  95-105.  doi:10.11959/j.issn.1000-436x.2017186
    Asbtract ( 420 )   HTML ( 8)   PDF (1185KB) ( 1043 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Concerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN),with the features of VAPs’ measurement data (VMD),a self-adaptive matrix completion algorithm based on random walk was proposed,named RW-MC.Firstly,the discrete ratio and covering ratio of VMD account for a sample determination model was used to claim initial samples.Secondly,random walk model was implemented for generating sampling data points in the next iteration.Finally,a self-adaptive sampling redress model concerning the differences between the current error rates and normalize error rates of neighboring completion matrices.The experiments show that the approach can collect the real-time sensory data,meanwhile,maintain a relatively low error rate for a small sampling rate.

    Conditional diagnosability of exchanged crossed cube under the MM model
    Chen GUO,Ming LEMG,Shuo PENG,Bo WANG
    2017, 38(9):  106-124.  doi:10.11959/j.issn.1000-436x.2017187
    Asbtract ( 346 )   HTML ( 2)   PDF (1312KB) ( 664 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Exchanged crossed cube (ECQ) was the latest achievement in the study of novel interconnection network topology.ECQ retained the advantages of hypercube such as recursive structure,high partitionability and strong connectivity,with better properties than other variations of hypercube in terms of the smaller diameter,fewer links,and lower cost factor,which indicated more balanced consideration among performance and cost.As the study object,after topological analyzing,some important topological properties and connectivity theorems of ECQ were introduced,then the conditional diagnosability of ECQ(s,t)was determined under the MM model,which was 3s 2? for t≥s≥2.The research results will provide the key parameters for the reliability evaluation of ECQ in the future.So it has important theoretical significance and application value.

    Anonymizing region construction scheme based on query range in location-based service privacy protection
    Zhuo-xiong PEI,Xing-hua LI,Hai LIU,Kai-yue LEI,Jian-feng MA,Hui LI
    2017, 38(9):  125-132.  doi:10.11959/j.issn.1000-436x.2017131
    Asbtract ( 356 )   HTML ( 3)   PDF (917KB) ( 500 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Since k-anonymity method can reduce the users’ computation cost and provides the precise query results,it has been widely used to protect the user’s privacy in location-based service.However,the existing schemes did not consider the size of the querying region for location based service provider (LSP) during the construction of the anonymizing region,which led that the quality of service was low.To solve this problem,the user’s querying range was introduced to present a novel anonymizing region construction scheme.In the proposal,the anonymity server first generated the original anonymizing sub-regions according to the user’s privacy requirements,and then merged these sub-regions to construct the anonymity region submitted to LSP based on the size of corresponding querying regions.The security and experiment analysis show that the presented scheme not only protects the user’s privacy effectively,but also decreases LSP’s querying regions,thereby improving the quality of service.

    Progressive filling partitioning and mapping algorithm for Spark based on allocation fitness degree
    Chen BIAN,Jiong1 YU,Wei-rong XIU,Bin LIAO,Chang-tian YING,Yu-rong QIAN
    2017, 38(9):  133-147.  doi:10.11959/j.issn.1000-436x.2017188
    Asbtract ( 349 )   HTML ( 1)   PDF (1201KB) ( 786 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The job execution mechanism of Spark was analyzed,task efficiency model and Shuffle model were established,then allocation fitness degree (AFD) was defined and the optimization goal was put forward.On the basis of the model definition,the progressive filling partitioning and mapping algorithm (PFPM) was proposed.PFPM established the data distribution scheme adapting Reducers’ computing ability to decrease synchronous latency during Shuffle process and increase cluster the computing efficiency.The experiments demonstrate that PFPM could improve the rationality of workload distribution in Shuffle and optimize the execution efficiency of Spark.

    Differential spatial modulation scheme based on orthogonal space-time block coded
    Zhi-cheng WANG,Zhi-gang CHEN,Lei WANG
    2017, 38(9):  148-158.  doi:10.11959/j.issn.1000-436x.2017189
    Asbtract ( 395 )   HTML ( 6)   PDF (721KB) ( 647 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Focusing on the problem that differential spatial modulation (DSM) couldn’t obtain transmit diversity and has high decoding complexity,a new differential spatial modulation scheme based on the orthogonal space-time block code was proposed and the proposed scheme is called OSTBC-DSM.There were two matrices in this scheme:the spatial modulation matrix and the symbol matrix.The former was aimed to activate different transmit antennas by setting the position of nonzero elements,and the latter structured symbolic matrix by using orthogonal space-time block codes (OSTBC) as the basic code block.The proposed scheme could obtain full transmit diversity and higher spectral efficiency compared with the conventional DSM schemes.Moreover,the OSTBC-DSM supported linear maximum likelihood (ML) decoding.The simulation results show that under different spectral efficiencies,the proposed OSTBC-DSM scheme has better bit error rate (BER) performance than other schemes.

    Constraint analysis for extended dynamic fault tree
    Qi-xuan WU,Jian-feng MA,Cong SUN,Shuai ZHANG,Shuang ZHANG,Tao ZHENG
    2017, 38(9):  159-166.  doi:10.11959/j.issn.1000-436x.2017156
    Asbtract ( 403 )   HTML ( 3)   PDF (961KB) ( 927 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    As a new extension of dynamic fault trees,time delay gate was proposed.This new mechanism can be used to model the time delay on the fault propagation from the lower level subsystems to the higher level system.The dynamic Bayesian networks was extend to solve the dynamic fault trees containing time delay gates.An algorithm based on SMT to support the optimized failure distribution under the nondeterministic range constraint of basic events was also proposed.The effectiveness is shown by comparison with existing tools on analyzing and solving real systems,and the effects of range constraints and gate parameter on the failure distribution of systems is illustrated.

    Correspondences
    Mechanism of eliminating UDP redundancy control packets in OpenFlow network
    Hui HU,Ming CHEN,Bo LIU,Bo XU,Chang-you XING,Chao HU
    2017, 38(9):  167-175.  doi:10.11959/j.issn.1000-436x.2017190
    Asbtract ( 335 )   HTML ( 5)   PDF (933KB) ( 576 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Large numbers of redundant control packets produced by connectionless UDP flows may engender serious influence over the performance of the SDN controllers and networks.The endangerment of the redundant control packets for the performance of SDN controllers by testing and modeling was firstly analyzed,and then a basic solution to solve the problem was formed.Therefore,a preinstalling flow-tables & filtering redundant packets (PFFR) mechanism was proposed.By preinstalling flow tables,PFFR limited the initial rate of control packets in UDP flows,and through installing flow tables according to paths and utilizing the redundant packets filtering algorithm,PFFR eliminated redundant packets rapidly.A prototype system based on PFFR was implemented and tested.The experimental results prove that the PFFR mechanism can effectively improve the performance of the controller.

    Power allocation algorithm for cognitive radio energy harvesting networks based on energy cooperation
    Zhen-wei XIE,Qi ZHU
    2017, 38(9):  176-184.  doi:10.11959/j.issn.1000-436x.2017191
    Asbtract ( 378 )   HTML ( 7)   PDF (742KB) ( 996 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An algorithm to optimize the power allocation by maximizing the system throughput in cognitive radio energy harvesting networks was proposed.The algorithm formulated the throughput optimization model subject to the causality constraints of the harvested energy within the two secondary users and the interference constraint of the primary user.In addition,by applying the variable-substitution method and problem equivalence transformation,the joint optimization problem of power and cooperative energy was decoupled into two problems:a power allocation problem and a cooperative energy one.The former problem could be solved by iterating the two decoupled problems.As shown in the simulation results,the energy cooperation can significantly improve the system throughput when the harvested energy difference between two nodes is rather large.

    Successive relaying secure transmission scheme based on inter-relay interference cancellation
    Yi ZOU,Kai-zhi HUANG,Xiao-lei KANG
    2017, 38(9):  185-192.  doi:10.11959/j.issn.1000-436x.2017132
    Asbtract ( 325 )   HTML ( 4)   PDF (1200KB) ( 661 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A secure scheme based on inter-relay interference cancellation was proposed to solve untrusted relay eavesdropping problem in successive relaying systems.First inter-relay interference between trusted relay and untrusted relay was exploited as artificial noise to degrade untrusted relay’s eavesdropping condition,then interference iterative cancellation was adapted to improve signal quality at legitimate user by making use of correlation between signals in time domain.Based on this,a quick power allocation algorithm aiming to minimize untrusted relay’s sum rate was proposed.Analysis and simulation results show that the proposed scheme suppress untrusted relay’s eavesdropping without loss of communication efficiency,a promotion of at least 2 bit·s-1·Hz-1in secrecy rate can be observed.

    Resource allocation scheme in two-way multi-relay OFDM system
    Xuan-wei LIANG,Qi ZHU,Guang-jun LIANG
    2017, 38(9):  193-200.  doi:10.11959/j.issn.1000-436x.2017050
    Asbtract ( 355 )   HTML ( 6)   PDF (1037KB) ( 447 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A joint optimization scheme for power allocation and subcarrier pairing under high SNR in two-way multi-relay OFDM system was proposed.Unlike those schemes in which relays use subcarriers separately,all the relays were allowed to forward signal on each subcarrier pair for providing much space diversity.With the constraint of total system power,the proposed scheme firstly allocated each relay power with Cauchy inequality with the assuming that the total relay power was fixed.Then the dichotomy was used to calculate the power allocation between the source node and the relay node by maximizing the equivalent channel gain for different subcarrier pairs.Lastly,the power of different subcarrier pairs was allocated by convex programming,and the subcarriers were paired by Hungarian algorithm to obtain the maximum system capacity.There was no optimal power allocation method with low complexity because of the complexity of the power allocation algorithm in two-way multi-relay networks.This algorithm greatly reduces the complexity of power allocation and simulation results show that the proposed scheme outperforms the relay selection scheme and the relays use subcarriers separately scheme.

    New EM parameter estimation algorithm for a type of micro-motion SFM signal
    Yong-yan JIANG,Shi-yuan ZHANG
    2017, 38(9):  201-206.  doi:10.11959/j.issn.1000-436x.2017192
    Asbtract ( 283 )   HTML ( 2)   PDF (1955KB) ( 772 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem that the existing method has high computational complexity and high SNR,a novel method of multi-component SFM signals parameter estimation based on EM algorithm was proposed as to spinning tar-get's narrow band micro-motion echoes.The echo model of spinning target and its micro-doppler measurements based on time-frequency analysis were given.The iterative parameter estimation steps based on Gaussian mixture model and EM algorithm to measurements were established.The simulation results demonstrate that when SNR is greater than -3 dB and the SFM components are equal or greater than 2,the method can estimate the target’s micro-motion parameters e.g.projection size accurately in narrow band 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: