Please wait a minute...

Current Issue

    20 May 2015, Volume 36 Issue 5
    Academic paper
    Location privacy-preserving method in LBS based on Voronoi division
    AChun-guang M,HOUChang-li Z,ANGSong-tao Y,HAOYun-long Z
    2015, 36(5):  1-12.  doi:10.11959/j.issn.1000-436x.2015109
    Asbtract ( 365 )   HTML ( 5)   PDF (2315KB) ( 948 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of low efficiency when the anonymous server faces a large number of users,a cooperative anonymous method is proposed for static and dynamic users respectively.Based on the Voronoi division of the global area,a central server organizes the users in its region to achieve cooperative anonymity,the server needn't construct anonymous region alone for each user,and the burden of the server is reduced.In view of providing actual location when users query from a LBS server,a decrease nearest neighbor query algorithm is proposed.A user's actual location is replaced with a stationary anchor location and gets the points of interest candidate set from the LBS server gradually.By running the algorithm,pre-cise results can be got and avoiding exposure to a user's location privacy.The algorithm can also help to reduce the possi-bility of location inference when the anchor chooses closely to the user.Experiments show that our method can guarantee the user's location privacy,and provide a good working efficiency.

    Social-based routing in pocket switched networks
    AOJiu-xin C,HENGao-jun C,ANGJing Y,HUZi-qing Z,IUBo L
    2015, 36(5):  13-22.  doi:10.11959/j.issn.1000-436x.2015105
    Asbtract ( 368 )   HTML ( 4)   PDF (1449KB) ( 828 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In pocket switched network,how to make effective balance between the message delivery ratio and transmis-sion delay is a problem to be solved.A community-based PSN routing algorithm,named BridgingCom,is proposed.It uses local community detection method with aging mechanism and introduces the bridging centrality as the basis of for-warding decisions.The algorithm combines the analysis of node centrality with the structure of social mobile network,makes full use of the community relationship and activeness of nodes in PSN.Simulation results show that BridgingCom routing algorithm has better performance in the message delivery ratio and message average delay compared to a number of previously proposed algorithms.

    Blind estimation of pseudo-random codes in non-periodic long code direct-sequence spread-spectrum signals
    HAOZhi-jin Z,UXiao-wei G,HENLei S,HANYi Z
    2015, 36(5):  23-30.  doi:10.11959/j.issn.1000-436x.2015121
    Asbtract ( 399 )   HTML ( 6)   PDF (1241KB) ( 731 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existence of common peaks in triple correlation functions of different m-sequences is proven based on the detail study of the characteristics of triple correlation functions of m-sequences,the features of common peaks and the direct relationship between common peak coordinates and the primitive polynomials of m-sequences are deduced.An es-timation algorithm of pseudo-random (PN) codes in non-periodic long code direct-sequence spread-spectrum (NPLC-DSSS) signals is proposed based on the above theories.Simulations under additive white Gaussian noise show that the probability of spreading code and scrambling code being both correctly estimated can reach 99% when the signal with a quarter of the cycle length of the long PN code is used only and the signal-to-noise ratio is greater than 4dB.

    Distributed key sharing based scheme for security clustering in unattended wireless sensor network
    HONGHong Z,HANGQing-yang Z,IANLi-chao T,ANGLiang-min W
    2015, 36(5):  31-39.  doi:10.11959/j.issn.1000-436x.2015153
    Asbtract ( 508 )   HTML ( 2)   PDF (2190KB) ( 646 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For unattended wireless sensor network (UWSN),considering the collecting and efficiency and security prob-lems,a secure clustering scheme for UWSN was proposed,which implements a clustering algorithm with the secure au-thentication of mobile nodes.The clustering algorithm uses triangle's characteristic to improve connectivity,balances collect efficiency and power consumption.The distributed key sharing scheme is used to improve the security of the clustering algorithm,in which mobile node's public key is able to be searched with high efficiency in the distributed static nodes,and the signature of mobile nodes will be checked by using the searched public key.Simulation results show that the clustering algorithm is tend to triangular meshes when node density is increasing,and more than 95% attacks are tol-erated when compromised nodes are less than 20%.

    Improved ant colony optimization algorithm for solving constraint satisfaction problem
    HANGYong-gang Z,HANGSi-bo Z,UEQiu-shi X
    2015, 36(5):  40-46.  doi:10.11959/j.issn.1000-436x.2015123
    Asbtract ( 422 )   HTML ( 11)   PDF (570KB) ( 1309 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The traditional backtracking algorithm was less efficient on solving large-scale constraint satisfaction problem,and more difficult to be solved within a reasonable time.In order to overcome this problem,many incompleteness algo-rithms based on heuristic search have been proposed.Two improvements based on ant colony optimization meta-heuristic constraint solving algorithm were presented:First,arc consistency checks was done to preprocess before exploring the search space,Second,a new parameter setting scheme was proposed for ant colony optimization to improve the effi-ciency of the search.Finally,the improved algorithm is applied to solve random problems and combinatorial optimization problems.The results of the experiment have showed its superiority.

    Joint estimation of target time delay and Doppler frequency in passive radar system
    ANGPeng W,IUTian-shuang Q,IJing-chun L,ANHai-feng T
    2015, 36(5):  47-55.  doi:10.11959/j.issn.1000-436x.2015124
    Asbtract ( 383 )   HTML ( 10)   PDF (839KB) ( 942 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method of joint estimation of time delay and Doppler shift in passive radar system based on short-time fractional Fourier transform (STFRFT) was proposed.Firstly,the mathematical expression of the STFRFT time-frequency resolution was studied for the quantitative comparison.Secondly,based on the projection envelops of STFRFT,a new method to estimate the time delay and Doppler shift was put forward.Finally,the factors related with the estimation precision such as signal-to-noise ratio (SNR),parameters of Gaussian window were analyzed.The simulation results demonstrate that compared with the CAF based method,proposed method can get precise time delay and Doppler shift estimations with higher probability.

    FI-SURF algorithm for image copy-flip-move forgery detection
    IYan L,IUNian L,HANGBin Z,UANKai-guo Y,ANGYi-xian Y
    2015, 36(5):  54-65.  doi:10.11959/j.issn.1000-436x.2015163
    Asbtract ( 464 )   HTML ( 8)   PDF (1782KB) ( 1016 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    FI-SURF (flip invariant SURF) algorithm was proposed,for the consideration of the copy-move forgery detec-tion of digital images.The arrangement of the SURF (speeded-up robust features) descriptor after image flip was studied.After extract the SURF interest points,rearrange the descriptors,the interest points can still be matched even under the condition of copy-flip-move.The experiment results show that FI-SURF not only reserved the advantage of SURF,but also can detect the copy-flip-move forgery,and can locate the duplicated region.

    Internet worm propagation model based on Markov chain
    HOUHan-xun Z,UOWei G,IUJian L,IADa-yu J
    2015, 36(5):  66-71.  doi:10.11959/j.issn.1000-436x.2015111
    Asbtract ( 448 )   HTML ( 6)   PDF (1075KB) ( 1270 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A stochastic model of Internet worms is presented.Firstly,the propagation of worms is modeled based on Markov chain.The limit distribution and invariant distribution of the model is discussed.Then,necessary and sufficient conditions of the worm propagation in the initial stage and sufficient conditions of the worm propagation in the late stage are discussed.Finally,the scale of the worm propagation is discussed.The simulation validates the model.And the effect of propagation,time and vulnerable host parameter on the spread of worms is discussed.Furthermore,it is compared to the G-W model,and the advantage of it is illustrated.

    Research on PSO-based intuitionistic fuzzy kernel clustering algorithm
    UXiao-dong Y,EIYing-jie L,UEShao-hua Y,ANGRui W
    2015, 36(5):  74-80.  doi:10.11959/j.issn.1000-436x.2015099
    Asbtract ( 444 )   HTML ( 7)   PDF (1712KB) ( 1093 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The intuitionistic fuzzy kernel c-means clustering algorithm has several problems such as sensitivity to the ini-tial value,low convergence speed,etc.To overcome these shortages,the particle swarm optimization (PSO) algorithm with powerful ability of global search and quick convergence rate is applied to intuitionistic fuzzy clustering.Firstly,PSO is used to optimize the initial clustering centers.Then,the approach of intuitionistic fuzzy kernel clustering based on PSO,namely PS-IFKCM,is proposed.This algorithm can enhance both the clustering ability and the convergence speed.Fi-nally,experiments based on four measured datasets are carried out to illustrate the performance of the proposed method.Compared with results from FCM and IFKCM,PS-IFKCM is of great efficiency for classification.

    Symbol timing recovery algorithm based on ordered statistic of maximum mean power timing for WBAN
    HIYu C,HENLan C,VChao L
    2015, 36(5):  81-88.  doi:10.11959/j.issn.1000-436x.2015085
    Asbtract ( 401 )   HTML ( 4)   PDF (817KB) ( 765 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The symbol timing algorithm based on maximum mean power timing is independent of carrier phase offset,and has the property of capturing timing information fast,which meets the demand of wireless body area networks (WBAN).According to IEEE 802.15.6 standard,the ordered statistic of maximum mean power timing was used to reduce the computational complexity in the symbol timing process.The theoretical analysis and simulation results shows that the proposed algorithm can achieve symbol timing within 32 symbols and reduce the computational complexity by ninety percent at most compared to the original maximum mean power algorithm.The fast synchronization and car-rier-independence property of the proposed algorithm can also make room for carrier-offset recovery and frame synchro-nization.

    Reliability test for frequency estimation of sinusoid based on LMP detection
    UGuo-bing H,ULi-zhong X,AOAn-ping B,UShan-shan W,AOYan G
    2015, 36(5):  89-97.  doi:10.11959/j.issn.1000-436x.2015097
    Asbtract ( 321 )   HTML ( 2)   PDF (1476KB) ( 609 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A reliability test method based on locally most powerful (LMP) detection was proposed to evaluate the fre-quency estimation of sinusoid.The hypothesis test was created at first,and then a reference signal was generated depend-ing on the specific frequency estimation of the sinusoid.By analysis of the parameters differences from the probability distribution characteristics of the modulus of the cumulative sum series under the different two hypotheses,the reliability test for frequency estimate of sinusoid signal was performed by the proposed LMP-based statistic and threshold.The LMP statistic and its approximated theoretical detection performance were derived .Simulation results show that the pro-posed method can be used to verify the reliability for blind frequency estimation of sinusoid at low signal-to-noise ratio.

    Evidence combination based on the degree of credibility and falsity
    ONGYa-fei S,ANGXiao-dan W,EILei L,UEAi-jun X
    2015, 36(5):  98-103.  doi:10.11959/j.issn.1000-436x.2015104
    Asbtract ( 369 )   HTML ( 6)   PDF (694KB) ( 845 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    D-S evidence theory has been widely used in various fields of information fusion due to its efficiency in deal-ing with uncertain information.Unfortunately,combination of conflicting evidences by classical Dempster's rule may produce counter-intuitive results.To alleviate this problem,a new weighted average combination rule is proposed.Defi-nitions of correlation coefficient was first presented,followed by the introduction of falsity.Then the credibility of evi-dence is proposed.A new weighted coefficient is determined by credibility and falsity.To achieve convergence,the nor-malized weighted coefficient was suggested into the Dempster's combination rule to average the basic probability as-signment.Comparable numerical examples demonstrate that the proposed approach can combine conflicting evidences more effectively.Moreover,the proposed methodology can provide a faster identification of the observed object.

    Analysis and improvement of an identity-based signature scheme from lattices
    ANGChun-li Y,ANJian-hua Y,HENGShi-hui Z,ANGLi-cheng W,ANGYu Y
    2015, 36(5):  104-111.  doi:10.11959/j.issn.1000-436x.2015136
    Asbtract ( 281 )   HTML ( 1)   PDF (1999KB) ( 702 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Liu et al proposed an identity-based signature from lattices in 2013,and proved that it can achieve strong un-forgeability in the standard model.Through analysis,the security proof of this scheme has some defect,and then show that the scheme cannot prove the strong unforgeability under selective identity and adaptive chosen-message attacks.Then,using Boyen signing technique (PKC 2010) inpoves the signing algorithm,and proves the strong unforgeability under selective identity and adaptive chosen-message attacks (SU-sID-CMA) in the standard model.In addition,it com-pares the efficiency and security of the scheme and the other identity-based signatures from lattices.

    Fine C/A code acquisition algorithm for weak GPS signal based on averaging correlation and differential coherent accumulation
    IXin-shan L,UOWei G
    2015, 36(5):  112-119.  doi:10.11959/j.issn.1000-436x.2015092
    Asbtract ( 374 )   HTML ( 4)   PDF (798KB) ( 961 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of global positioning system (GPS) C/A code acquisition under weak signal conditions,a code acquisition algorithm based on averaging correlation and differential coherent accumulation was proposed.First,the strength ratio of the largest peak to the second largest peak was adopted as the decision variable; optimum decision thresholds can be obtained through the simulation probability of false alarm of all kinds of acquisition algorithms.Second,by setting the decision threshold,the probabilities of detection of different Doppler frequency deviation and signal to noise ratio (SNR) were obtained.Finally,acquisition sensitivities of the code acquisition algorithm based on the differen-tial coherent accumulation were compared with those of the code acquisition algorithm based on coherent and noncoher-ent accumulation and the code acquisition algorithm based on noncoherent accumulation.Simulation results show that acquisition sensitivities of the code acquisition algorithm based on the differential coherent accumulation are improved by about 2.0 dB than those of the other two acquisition algorithms under the same receiving data length condition.

    Dynamic cache size transfer scheme based on replacement rate in content centric networking
    EGuo-dong G,UOYun-fei G,ANJu-long L,IUCai-xia L
    2015, 36(5):  120-129.  doi:10.11959/j.issn.1000-436x.2015115
    Asbtract ( 368 )   HTML ( 2)   PDF (1570KB) ( 741 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    How to allocate an appropriate cache size to each router and efficiently utilize the finite storage resources poses challenges to the caching performance in CCN (content centric networking).On the basis of homogeneous cache allocation,a dynamic cache size transfer scheme based on replacement rate is proposed.In the scheme,the rationality of the cache size transfer is demonstrated firstly.And then,according to the level of actual demand for the storage resources,the cache transfer procedure is implemented dynamically on the nodes which have different caching states.The idle cache resources are temporarily transferred to the overload node to reduce cache miss rate and enhance the caching gain.The simulation results show that,with a small amount of additional cost,the proposed scheme can efficiently decrease the re-quest hops,increase the cache hit ratio,and improve the overall utilization of storage resources.

    CS-based data collection method for airborne clustering WSN
    HOUWei Z,INGBo J,UANGYi-feng H,IAOXiao-xuan J,UJia-xing H,IANGWei L
    2015, 36(5):  130-139.  doi:10.11959/j.issn.1000-436x.2015197
    Asbtract ( 330 )   HTML ( 2)   PDF (1365KB) ( 749 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A data acquisition scheme which was suitable for airborne clustering WSN was proposed.On the one hand,this scheme adopts the random compressive sampling could reduce the amount of sampling data of the cluster nodes ef-fectively,and greatly reducing the hardware requirements of the cluster nodes; on the other hand,put forward a MP re-construction method based on composite chaotic-genetic algorithm expressly,which combined the excellent local searching characteristics of chaos theory with the powerful global search ability of genetic algorithm,could improve the signal reconstruction performance of the cluster head or Sink effectively.The experimental results show that,by dimin-ishing the sampling frequency to 1/8 of the original sampling frequency,this random compressive sensing scheme can dramatically reduce the sampling quantity,and the reconstruction precision can reach 10-7magnitude.This random com-pressive sensing scheme provides a useful idea for practical WSN.

    High-order statistics based blind channel estimation for PSK modulation in flat and slow fading channels
    IXiao-tian L,EIJing L,LIUWei ,,IYan-bin L,HANGRun-sheng Z
    2015, 36(5):  140-147.  doi:10.11959/j.issn.1000-436x.2015110
    Asbtract ( 412 )   HTML ( 9)   PDF (1296KB) ( 807 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A blind channel estimator based on high-order statistics (HOS) of PSK constellations was proposed.For flat and slow fading channels,firstly,the high-order statistics of PSK constellations with different alphabet size M was ana-lyzed.The Mth power symbols of MPSK constellations are same,whereas the Mthpower symbols are symmetrically dis-tributed on the complex plane when 1≤M′<M.Secondly,the estimation algorithms of alphabet size M,initial phase and fading coefficient were introduced based on the characteristics above.Finally,simulation results show that when SNR>12 dB,the proposed algorithm has the same estimation performance as the optimal Lloyd-Max algorithm,while the complexity is only 1/50 of Lloyd-Max algorithm.Moreover,the proposed algorithm's mean-square error curve converges remarkably to the least squares (LS) bound on the condition of less received symbols.

    Analysis and construction for threshold signature scheme based on game theory
    ANGJie W,AIYong-quan C,IANYou-liang T
    2015, 36(5):  148-155.  doi:10.11959/j.issn.1000-436x.2015189
    Asbtract ( 330 )   HTML ( 4)   PDF (979KB) ( 940 )   Knowledge map   
    References | Related Articles | Metrics

    The concept of “rational player” is introduced to make threshold signature system more general.In this new primitive,all players are regarded as rational individuals in the sense that they always try to maximize their profits as the goal at any phases.Each player's strategy and utility in key generation and signature synthesis phases are analyzed based on game theory.It is proved that rational players have no motivation to participate in signature in traditional threshold signature scheme,which might cause it impossible to complete threshold signature.Finally,the mechanism of rational key distribution and rational signature synthesis is proposed.Analysis shows the new method is more applicable than the previous schemes in the real-world applications.

    Academic communication
    Functional composition in software-defined network based on atomic capacity
    UANTong D,ANJu-long L,HENGGuo-zhen C,UYu-xiang H
    2015, 36(5):  156-166.  doi:10.11959/j.issn.1000-436x.2015178
    Asbtract ( 485 )   HTML ( 4)   PDF (2259KB) ( 991 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Software-defined network (SDN) enables frequent network functional innovation and evolution,making the control function modularity one of the most hot research fields on SDN.Aiming at network-wide functional composition based on unified module definition and function division,firstly,atomic capacity (AC) is introduced as atomic elements of module function division and an AC-based resource description method is proposed; secondly,functional composition module based on two-level mapping is put forward and a heuristic algorithm to calculate the composition is proposed; fi-nally,an AC-orchestrating layer as extended structure of SDN application layer is devised and then a NetFPGA-10G pro-totype implementation is given.Experimental results show that the method can combine functional instances more effec-tively with better resource utilization.

    Efficient algorithm for computing Walsh spectrum and differential probability
    IUYan L,UBin H,ULi-ping X
    2015, 36(5):  167-173.  doi:10.11959/j.issn.1000-436x.2015112
    Asbtract ( 333 )   HTML ( 0)   PDF (1851KB) ( 565 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the characteristic of T-functions,along with the definition of narrow T-functions,the linear prop-erty and differential property were studied.Markov chain and transition matrices were constructed to propose fast algo-rithm for computing Walsh spectrum and differential probability,of which the time complexity is O(n).In addition,the algorithm is applied in the T-functions in TSC-family and finally the result expression is given.

    Improved DFA algorithm based on multi-dimensional finite automata
    ONGYang-yang G,IUQin-rang L,ANGZhen-xi Y,HAOXiang-yu S,INGChi-qiang X,IAOHui-juan J,ENGZhi-bin P
    2015, 36(5):  174-186.  doi:10.11959/j.issn.1000-436x.2015101
    Asbtract ( 459 )   HTML ( 6)   PDF (1384KB) ( 1170 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Compiling multiple regular expression signatures into a combined DFA can blowup in state and storage space.Explanations from the prospective of information theory and multi-dimensional mathematical model were proposed fo-cusing on the most serious state explosion.Redundancy states were divided into zero-dimensional ones and one-dimensional ones.The former were compressed by dimension,and the later were dynamically built.The space com-plexity of the model came to the theoretical lower bound by the above methods.Then the multi-dimensional finite auto-mata (MFA) was proposed with the model.Experiments show that,the construction time taken by MFA is slightly less than XFA and is 2~3 orders of magnitude lower than DFA,STT redundancy compression algorithms and Hybrid-FA; the memory space of MFA is slightly higher than XFA,but is 1~2 orders of magnitude lower than DFA,STT redundancy compression algorithms,mDFA and Hybrid-FA; in the aspect of matching time,MFA ranks after DFA and Hybrid-FA,but ranks before XFA,and it achieves 1~2 orders of magnitude lower than that of STT redundancy compression algo-rithms and mDFA.

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: