Current Issue

25 May 2016, Volume 37 Issue 5

Previous Issue    Next Issue

Papers

Blind recognition of STBC based on higher-order cumulants

Li-min ZHANG,Qing LING,Wen-jun YAN

2016, 37(5):  1-8.  doi:10.11959/j.issn.1000-436x.2016087

Asbtract ( 459 )   HTML ( 2)   PDF (301KB) ( 934 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problems for blind recognition of space-time block code(STBC)in MIMO communication sys-tems,a method was exploited based on higher-order cumulants of received signals.Firstly,the model of received signals was given and the fourth-order cumulants of the received signals in multiple input single output(MISO)systems was ob-tained.Secondly,using the characteristics of coding matrix,it was proved that the fourth-order cumulants in different de-lay vectors presented non-null value that depended on the STBC sat the transmitter side.Finally,a classifier for the STBC was presented based on the Euclid distance between the experimental values of fourth-order cumulants and the theoretical ones.Simulations show that the method performs well even for low signal to noise ratio.

Novel cyberspace-oriented access control model

Feng-hua LI,Yan-chao WANG,Li-hua YIN,Rong-na XIE,Jin-bo XIONG

2016, 37(5):  9-20.  doi:10.11959/j.issn.1000-436x.2016109

Asbtract ( 628 )   HTML ( 21)   PDF (426KB) ( 1366 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel cyberspace-oriented access control model was proposed,termed as CoAC,which avoided the threats by comprehensively considering vital factors,such as access requesting entity,general tense,access point,device,networks,resource,internet-based interactive graph and chain of resource transmission.By appropriately adjusting these factors,CoAC emulated most of typical access control models and fulfilled the requirements of new information service patterns and dissemination modes.The administrative model of CoAC was also presented and the functions and methods for administrating CoAC were described by utilizing Z-notation.CoAC is flexible and scalable,it can be further refined and expanded to figure out new opportunities and challenges in the upcoming access control techniques.

Joint estimation of frequency and DOA with spatio-temporal under sampling

Xiang-dong HUANG,Hong-yu XIAN,Zi-yang YAN,Sen-xue JING

2016, 37(5):  21-28.  doi:10.11959/j.issn.1000-436x.2016088

Asbtract ( 497 )   HTML ( 8)   PDF (308KB) ( 904 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to estimate the frequency and DOA of an incident signal with sub-Nyquist spatio-temporal sampling,A novel joint estimation algorithm based on spectrum correction and Chinese remainder theorem(CRT)was proposed.Firstly,the incident signal was parallelly sampled at multiple sensors non-uniformly located in a sparse linear array.Then,AM spectrum corrector was employed to extract the rema of frequency and phase-difference from a small quantity of snapshots.Finally,implementing the close-form CRT on these remainders directly yields the estimates of frequency and DOA.In the proposed scheme,the spectrum corrector was shared by both the frequency estimator and the DOA es-timator,which contributed to a high utilization of the snapshots.Furthermore,compared to the existing CRT based esti-mators,the proposed estimator needs not to incorporate multiple times of temporal undersampling on a single sensor,which saves considerable time consumption and thus obtain high ability of tracking time-variant objects.Simulations verify the feasibility and the high-accuracy of the proposed joint estimator and further study shows that high reconstruc-tion probability can be realized even in low SNR cases,which present the vast potential for future development.

Researches on efficient transmission protocol for multi-cell system based on interference toleration

Bao-feng JI,Chun-guo LI,Kang SONG,Yi WANG,Liang SONG

2016, 37(5):  29-37.  doi:10.11959/j.issn.1000-436x.2016089

Asbtract ( 404 )   HTML ( 5)   PDF (380KB) ( 446 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A two-time-slot transmission protocol was designed according to the cell-edge users' interference problem.The precoder closed expressions under the proposed transmission protocol were derived based on the well-known precoder scheme of the signal-to-leakage-plus-noise ratio(SLNR).Furthermore,an adaptive receiver was based on the non-linear minimum mean square error criterion.Simulation results demonstrated that the proposed transmission protocol has significant sum-rate gains compared with traditional system.

Power analysis attack of HMAC based on SM3

Zhi-bo DU,Zhen WU,Min WANG,Jin-tao RAO

2016, 37(5):  38-43.  doi:0.11959/j.issn.1000-436x.2016090

Asbtract ( 297 )   HTML ( 4)   PDF (227KB) ( 1152 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The current power analysis attack of HMAC based on SM3 applies only to the object,on which there is the Hamming weight and Hamming distance information leakage at the same time.there is only a single information leakage mode on the attack object,then the attack methods don't work.To solve the limitations of the current attack methods,a novel method of the power analysis attack of HMAC based on SM3 was proposed.The different attack object and their related va-riables were selected in each power analysis attack.The attacks were implemented according to the Hamming distance mod-el or Hamming weight model of the intermediate variables.After several power analysis attacked on the first four rounds of SM3,the equations that consists of the results proposed of all the power analysis attacks were obtained.The ultimate attack object is derived by getting the solution of the equations.The experimental results show that the oposed attack method was effective.The method can be used universally because its being available for both the situation of co-exist of hamming weight with Hamming distance,and that of either the Hamming weight or choosing the Hamming distance model existence.

Ciphertext policy attribute-based encryption scheme supporting direct revocation

Xi-xi YAN,Hui MENG

2016, 37(5):  44-50.  doi:10.11959/j.issn.1000-436x.2016091

Asbtract ( 499 )   HTML ( 14)   PDF (233KB) ( 956 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to support fine-grained attribute revocation in direct revocation mode an attribute-based encryption scheme with efficient revocation was proposed.The model of ABE supporting attribute revocation was given,and a con-crete scheme was constructed which was proven its security under the standard model.Compared to the existing related schemes,the size of ciphertext and private/secret key was reduced.In additional,the new scheme achieved fine-grained and immediate attribute revocation which is more suitable for the practical applications.

Defense policies selection method based on attack-defense signaling game model

Heng-wei ZHANG,Ding-kun YU,Ji-hong HAN,Jin-dong WANG,Tao LI

2016, 37(5):  51-61.  doi:11959/j.issn.1000-436x.2016092

Asbtract ( 463 )   HTML ( 22)   PDF (350KB) ( 1326 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Currently defense policies selection based on game theory mostly applied either the complete information game model or the static game model.In order to be more in line with the reality of network attack and defense,at-tack-defense behavior was studied by dynamic rivalry and incomplete information.The attack-defense signaling game mode was built,the method to quantify policies was improved and an algorithm to obtain the perfect Bayesian equili-brium was proposed.On the basis of analyzing equilibrium,the algorithm for selecting the optimal defense policy was proposed.The simulation experiment demonstrates that the model and algorithms are feasible and effective.By the expe-rimental data,general rules on signaling attack-defense game are summarized,which can guide defenders of different types to make decisions.

Probability-based heuristic content placement method for ICN caching

Hai-bo WU,Jun LI,Jiang ZHI

2016, 37(5):  62-72.  doi:10.11959/j.issn.1000-436x.2016093

Asbtract ( 444 )   HTML ( 3)   PDF (418KB) ( 913 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back,on-path cache nodes decide whether to cache the content with certain probability.The probability is associated with the content popu-larity and placement benefit,i.e.,proportional to content popularity and content placement benefit.The experimental re-sults indicate PCP can achieve salient performance gain in terms of cache service ratio,cache hit ratio,access latency ra-tio,compared with current strategies.Meanwhile,PCP's overhead is affordable.

Scalable overlay multicast algorithm with high stability

Ye SHEN,Jing FENG,Zhan-feng WANG

2016, 37(5):  73-80.  doi:10.11959/j.issn.1000-436x.2016094

Asbtract ( 375 )   HTML ( 0)   PDF (318KB) ( 860 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new scalable overlay multicast algorithm with high stability(SOM-HS)was proposed.In SOM-HS algo-rithm,the node stability and the link weight factor were defined to ensure that the high stability nodes were located in the backbone network of multicast tree.In the hierarchica clustering configuration process,SOM-HS algorithm limits the degree of the nodes to ensure load balancing.The experimental results show that,the maximum delay with SOM-HS al-gorithm is minimum compared to the other existing algorithms in different multicast scales.

Conversion model of annual statistics to worst-month statistics of troposcatter

Lei LI,Zhen-wei ZHAO,Zhen-sen WU,Le-ke LIN,Yuan LEI,Rui ZHANG

2016, 37(5):  81-87.  doi:10.11959/j.issn.1000-436x.2016095

Asbtract ( 342 )   HTML ( 2)   PDF (369KB) ( 715 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The present worst-month prediction model,however,cannot reflect the me ical characteristics of tro-poscatter propagation accurately.Hence,based on the worst-month prediction models introduced in the recommendation ITU-R P.617-3 and ITU-R P.841-4 respectively,a conversion model of annual statistics to worst-month statistics of tro-poscatter was presented.The corresponding relation between the conversion of annual statistics to worst-month statistics of troposcatter and the refractivity N_sat the earth's surface was derived with the rational n erical calculation and opti-mization method.This model not only solves the disadvantages of the ITU models mentioned above,but also has a better practicability and applicability.Then,using the new model and the trans-horizon propagation loss data banks released by the international telecommunication union(ITU),the worst-month transmission loss for the non-exceedance time percen-tages(50%,90%,99%)of interest are calculated.The prediction results are compared with the recommendation ITU-R P.841 and the trans-horizon propagation loss data banks.The conclusions are helpful for the development and the applica-tion of the troposcatter propagation.

Multiattribute ranking based on analytic hierarchy model

Wei WANG,Tie-jun ZHAO,Guo-dong XIN,Bing XU

2016, 37(5):  88-94.  doi:10.11959/j.issn.1000-436x.2016096

Asbtract ( 403 )   HTML ( 8)   PDF (210KB) ( 530 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An approach based on analytic hierarchy model for solving product multiattribute ranking was proposed.The approach decomposed a decision problem into hierarchy of more easily comprehended sub-problems,such as goal level,criteria level,and alternative level.Then priorities among the elements of the hierarchy were established towards its higher hierarchy.Synthesize these priorities to yield a set of overall iorities for the alternative hierarchy by using weighted sums.The experiment results show the effectiveness of analytic hierarchy model.

Application oriented cross-layer multi-channel MAC protocol for VANET

Cai-xia SONG,Guo-zhen TAN,Nan DING,Jun-ling BU,Fu-xin ZHANG,Ming-jian LIU

2016, 37(5):  95-105.  doi:10.11959/j.issn.1000-436x.2016097

Asbtract ( 380 )   HTML ( 6)   PDF (438KB) ( 922 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An application oriented cross-layer multi-channel(AOCM)MAC protocol was proposed for VANET.The AOCM protocol could derive the optimal control channel(CCH)interval to ensure the timely and reliable transmission of safety messages on the CCH,based on real-time statistics and prediction for different types of sages coming from upper application layer.In the service channels(SCH),the proposed protocol relies on a reservation mechanism for con-tention-free transmission,so as to improve the throughput of SCH.The proposed protocol was suitable for both saturation and unsaturation conditions,and has low computational complexity and high scalability.Extensive simulation results demonstrate the superiority of the AOCM protocol compared with other existing protocols.

Routing approach based on local topology control in cognitive radio networks

Shu-qi LIU,Yi-ming WANG,Cui-mei CUI

2016, 37(5):  106-114.  doi:10.11959/j.issn.1000-436x.2016098

Asbtract ( 363 )   HTML ( 2)   PDF (353KB) ( 540 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An approach of topology control and routing was proposed according to the characteristics of cogni ive radio networks,which considered multi factors optimization with fusion of primary users and secondary users.And the ap-proach took the spectrum utilization of primary users the interference from secondary users to primary users into ac-count.Then a joint link cost was defined combining the predicted cognitive link stability with the link power consump-tion.Furthermore,the local cognitive topology control routing(LCTCR)algorithm with minimizing the link cost was presented,which was used to optimize the network topology.Meanwhile,the network path was selected according to the optimized network topology.Theoretical analysis and simulation experiments show that the link power consumption and the link stability are also important parameters and need to be jointly optimized when selecting the network path.Only by doing so can it guarantee that the selected path is optimal.

High order intuitionistic fuzzy time series forecasting model

Ya-nan WANG,Ying-jie LEI,Yang LEI,Xiao-shi FAN

2016, 37(5):  115-124.  doi:10.11959/j.issn.1000-436x.2016099

Asbtract ( 389 )   HTML ( 11)   PDF (373KB) ( 668 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A high order intuitionistic fuzzy time series forecasting model was built.In the new model,fuzzy clustering algorithm was used to get unequal intervals,and a more objective technique for ascertaining membership and non-membership functions of intuitionistic fuzzy set was proposed.On these bases,forecasting rules based on mul-ti-dimension intuitionistic fuzzy modus ponens inference were established.At last,contrast experiments on the enroll-ments of the university of Alabama and the daily average temperature of Beijing were carried out,which show that the novel model has a clear advantage of improving the forecasting accuracy.

Differentially private data release based on clustering anonymization

Xiao-qian LIU,Qian-mu LI

2016, 37(5):  125-129.  doi:10.11959/j.issn.1000-436x.2016100

Asbtract ( 510 )   HTML ( 11)   PDF (184KB) ( 1439 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the theory of anonymization,the DBSCAN method was applied to divide all the data records into different groups to cover individuals.To provide priv enhancement,the Laplace noise was added to the anonymized partitioned data to perturb the real value of data record so that the requirements of differential privacy model were satis-fied.With the clustering operation,the sensitivity of the query function has been partitioned to improve data utility.The proof of privacy has been given and experimental results have been provided to evaluate the utility of the released data.

Gain-aware caching scheme for information-centric networking

Long CHEN,Hong-bo TANG,Xing-guo LUO,Yi BAI,Zhen ZHANG

2016, 37(5):  130-142.  doi:10.11959/j.issn.1000-436x.2016101

Asbtract ( 397 )   HTML ( 1)   PDF (510KB) ( 671 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The in-network caching system of information-centric networking had to deal with the popularity of huge number of content chunks and make efficient usage of storage resources.A content popularity based caching gain opti-mization model aimed to get maximum reduction of content retrieve cost was established,and a gain-aware caching scheme was proposed.By utilizing filtering effect of cache to request flow is scheme achieves caching cooperation and diversity potentially while maximizing caching gain of every single node.Bloom filter based sliding window strategy captures the content chunks with high caching gain according to request arrival interval and retrieval cost from the source.Analysis shows that the method can drastically reduce memory consumption caused by popularity monitoring.The simu-lation results illuminate that this scheme is well aware of content popularity based caching gain,and gets better band-width saving and cache hit ratio when content popularity is changing dynamically.

Automation technology,computer technology

Identifying the confidence level of activity recognition via HMM

Chang-hai WANG,Jian-zhong ZHANG,Jing-dong XU,Yu-wei XU

2016, 37(5):  143-151.  doi:10.11959/j.issn.1000-436x.2016102

Asbtract ( 473 )   HTML ( 12)   PDF (363KB) ( 678 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A context-based method to identify the confidence level of activ recognition was proposed,referred to as S-HMM(sliding window hidden Markov model),which reduced the confusion rate and facilitated the transfer learning.With S-HMM,the activity recognition sequence was modeled as HMM(hidden Markov model)and the corresponding probability was adopted as the confidence level.This ,S-HMM removed the dependency of the confidence level on the sample distribution in the feature space.S-HMM is extensively evaluated based on real-life activity data,demonstrat-ing a reduced confusion rate of 37% when compared to the state-of-the-art methods.

Papers

Multiple targets localization via compressive sensing from mere connectivity

Lei LIU,Jian-jun ZHANG,Yang LU,Xing WEI,Jiang-hong HAN

2016, 37(5):  152-164.  doi:10.11959/j.issn.1000-436x.2016103

Asbtract ( 378 )   HTML ( 5)   PDF (662KB) ( 890 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multiple targets localization method was proposed from mere connectivity,and the multiple targets posi-tioning problem was converted to sparse vector resolving by compressive sensing theory,which was applied to the indoor localization of intensive references distribution.The connectivity to the references was collected as the only measurement data,and targets locations were figured out by minimum l₁-norm algorithm.When measurement data was compressed tol 1 bit,the fixed point iteration algorithm combined with semi-definite relax was proposed to figure out targets locations.As for the simulation results,compared with MDS-MAP,DV-Hop and RSS-CS algorithms,the average location error is less than 1 grid by the mere connectivity of N -bit and 1-bit quantization CS localization,of which the occupied bit quan-tity are reduced to less than 4 times and 16 times of RSS localization observation value respectively.

Comprehensive Review

Survey of modeling methods in cyber-physical system

Ren-fa LI,Fan YANG,Guo-qi XIE,Jing HUANG,Meng-qin DUAN

2016, 37(5):  165-175.  doi:10.11959/j.issn.1000-436x.2016106

Asbtract ( 777 )   HTML ( 30)   PDF (379KB) ( 1685 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Cyber-physical system(CPS)not only contains the discrete calculation process and network communication,but also involves in the handling of continuous physical events.Based on discrete system and continuous system,some existing modeling theories and development tools were introduced,and their applications in CPS were summarized,and a brief introduction on how to solve the problem was given.Finally,on the basis of the difficulty to be solved in CPS,four practical ways for researchers were put forward to solve the CPS modeling problem.

Correspondences

Research on a hexagonal lattice optimal clustering routing algorithm based on hybrid CS for WSN

Can CUI,Yi SUN,Jun LU,Jian-hong HAO

2016, 37(5):  176-183.  doi:10.11959/j.issn.1000-436x.2016104

Asbtract ( 359 )   HTML ( 2)   PDF (386KB) ( 796 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A hexagon lattice clustering model for WSN was proposed based on hybrid CS.The relationship between data transmission times and compression ratio and clus er size was analyzed quantitatively to get optimal clustering number.Then,a hexagon lattice optimal clustering routing algorithm for WSN based on ybrid CS was proposed,to balance network communication overhead and reduce data transmission times.Simulation experiment proved that the optimal clustering model and algorithm proposed are better than traditional ones in reducing data transmis-sion times in WSN.

Electronic cash system based on certificateless group signature

Yan LIANG,Xiao ZHANG,Zhi-ming ZHENG

2016, 37(5):  184-190.  doi:10.11959/j.issn.1000-436x.2016107

Asbtract ( 487 )   HTML ( 11)   PDF (241KB) ( 847 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient elliptic certificateless group signature ith forward security and member revocation based on ACJT group signature was proposed.Compared to ACJT which has complex computation,many parameters and long signature length,proposed scheme has less parameters and only involve a small amount of computation.The length of proposed signature is short and the efficiency is high.A fair off-line multi-bank e-cash system based on this group signa-ture scheme was also proposed.The new e-cash system has not only the high security and efficiency,but the unforgeabil-ity.It also can avoid double-spending and tampering money.The scheme has a clear advantage compared with others.