Current Issue

25 September 2016, Volume 37 Issue 9

Previous Issue    Next Issue

Papers

Detection algorithm for cache pollution attacks based on node state model in content centric networking

Hong-bo TANG,Lin-hao ZHENG,Guo-dong GE,Quan YUAN

2016, 37(9):  1-9.  doi:10.11959/j.issn.1000-436x.2016172

Asbtract ( 554 )   HTML ( 7)   PDF (825KB) ( 808 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at cache pollution attacks in content centric networking,the attacks were quantitatively described by three parameters,namely number of pollution contents,distribution of attack requests and attack intensity,then the cache state model of node under attack was built.Benefited from the analysis of key parameters of cache node,the attack detection principle based on node state model was put forward,correspondingly,two attack detection algorithms were instantiated with the observation parameters of cache replacement ratio and request arrival rate.The simulation results show that proposed algorithm can obtain good detection performance under each decentralized attack and centralized attack.

Hardware data race detection algorithm based on sliding windows

Su-xia ZHU,De-yun CHEN,Zhen-zhou JI,Guang-lu SUN

2016, 37(9):  10-19.  doi:10.11959/j.issn.1000-436x.2016173

Asbtract ( 361 )   HTML ( 3)   PDF (550KB) ( 803 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Data race is a major factor which causes multi-core programs to produce concurrent bugs.To address the high hardware cost in happens-before detection proposals,a light-weight hardware data race detection approach based on sliding window technology was proposed.It used sliding windows to save recent memory instructions in thread execution and dynamically detected data races with small race distance which more easily lead to concurrent bugs.Considering the race distance,parallel thread segments were subdivided into concurrent race regions with lock and concurrent race regions without lock.A pair of alternate rewritable sliding windows was used to store the memory instructions in concurrent race region without lock,and a sliding window with variable size was used to store the memory instructions in concurrent race region with lock.When there was a conflict between a remote sharing access and memory accesses in sliding windows,a data race was detected.In the hardware implementation,the addresses of the data in sliding windows were automatically encoded into three hardware signatures with small size.Data races can be detected quickly without modifying the L1 cache and cache coherence protocol messages.This approach supplies efficient guidance to help users to diagnose concurrency bugs occurred in the development and production run of multi-core programs,achieving smaller hardware and bandwidth overhead.

Multi-sensor data fusion method for water quality evaluation based on interval evidence theory

Jian ZHOU,Chen-hao MA,Lin-feng LIU,Li-juan SUN,Fu XIAO

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

Asbtract ( 380 )   HTML ( 12)   PDF (1371KB) ( 929 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For the inevitable uncertainty and random uncertainty in the process of measuring water quality data with the sensor network,a multi-sensor data fusion method for water quality evaluation based on interval evidence theory was proposed.Considering the precision error of sensor and the abnormalities of measured data,every water quality data measured by sensor was represented by interval number.By calculating the distance between the water quality data and the features of each water quality class,the interval evidence of water quality class was acquired.According to the interval evidence combining rule,a comprehensive interval evidence was obtained by combining the interval evidence of each sensor.Finally,the water quality class was determined based on the comprehensive interval evidence by the decision rule.Experiments show that the proposed method can evaluate water quality class more accurately from the uncertain water quality data.

Lightweight multi-coupon system for multi-merchant environments with DAA

Xin LIU,Qiu-liang XU,Bo ZHANG

2016, 37(9):  30-45.  doi:10.11959/j.issn.1000-436x.2016175

Asbtract ( 291 )   HTML ( 1)   PDF (3628KB) ( 761 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multi-coupon system for multi-merchant environments was proposed by extending the DAA (direct anonymous attestation) scheme of Brickell etc.The new system bound the key elements in multi-coupon with the tamper-resistant TPM（trusted platform module）chip,so that it could prevent users from sharing behavior more effectively.By using the server-aided signature verification of Chow etc,the self-blindable credential technique of Yang etc,and range proof of Peng etc,the new system does not require customers to perform expensive pairing operations in the issue protocol and the redeem protocol.Compared with previous similar systems,the new system simultaneously satisfies several ideal properties and it is compatible with the mobile payment framework on the ARM TrustZone platform.Moreover,it has obvious advantages in aspects of communication and computation costs.

Location publishing technology based on differential privacy-preserving for big data services

Lin ZHANG,Yan LIU,Ru-chuan WANG

2016, 37(9):  46-54.  doi:10.11959/j.issn.1000-436x.2016176

Asbtract ( 593 )   HTML ( 16)   PDF (976KB) ( 2170 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at dealing with prospect knowledge and complex combinatorial attack,a new location big data publishing mechanism under differential privacy technology was given.And innovative usability evaluation feedback mechanism was designed.It gave corresponding solution details for the sensitive attributes and the identity recognition to analyze the quality of service,aimed at privacy protecting for location based big data under situations like combination of location information and non-location information and attacker’s arbitrary background knowledge.Simulation results based on different spatial indexing technology proved that the new publishing model has a higher accuracy under specified privacy conditions for the location query service.

SDN based e-mail repudiation source restraining method

Zhi-geng HAN,Xia FENG,Geng CHEN

2016, 37(9):  55-67.  doi:10.11959/j.issn.1000-436x.2016178

Asbtract ( 341 )   HTML ( 1)   PDF (1178KB) ( 682 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the limitation of controllability of the existing Internet architecture,the existing secure e-mail technology such as certified e-mail can only post detection but cannot source restraining on e-mail repudiation.Based on the idea of control and data separation of software-defined networking technology,by means of bypass attaching customized repudiation restrain unit to the traditional e-mail model.An e-mail repudiation source restraining method was proposed without destroying the existing e-mail structure.After presenting e-mail evidence binding protocol,repudiation behavior detection algorithm,certified reputation evaluation model,and repudiation restraining strategy formation algorithm embedded in repudiation restrain unit,the effectiveness were tested of the proposed method in 4 cross scenarios.The experimental results show that,under the premise of compatibility with the current e-mail system,the method can source restrain e-mail repudiation effectively.

Parallelism of multi-scale quantum harmonic oscillator algorithm

Yan HUANG,Peng WANG,Kun CHENG,Feng LIU

2016, 37(9):  68-74.  doi:10.11959/j.issn.1000-436x.2016179

Asbtract ( 419 )   HTML ( 0)   PDF (816KB) ( 712 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

MQHOA was a novel intelligent algorithm constructed by quantum harmonic oscillator's wave function.Sampling was the basic operation and main computational burden of MQHOA.The independence of sampling operation constructs MAHOA’s parallelism.Parallel granularity was obtained by experiments of group parameter and sampling parameter,and MQHOA-P was proposed.Experiments were done in a cluster of ten nodes on six standard test functions.By changing node number,function dimension and sampling parameter,experiments of MQHOA-P’s speed-up ratio were done.The experimental results show the good performance of MQHOA-P’s speed-up ratio and expansibility.MQHOA-P can be deployed and run on multiple nodes in a large-scale cluster.

Analysis of physical layer secret key capacity in the uniform scattering environment

Xu WANG,Liang JIN,Lu LIU,Ming-liang LI,Kai-zhi HUANG

2016, 37(9):  75-81.  doi:10.11959/j.issn.1000-436x.2016177

Asbtract ( 336 )   HTML ( 1)   PDF (1074KB) ( 693 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Physical layer secret key capacity was affected by time difference of channel sounding,mobility of terminals,and additive noise.Effects on the physical layer secret key capacity were quantitatively analyzed in the uniform scattering environment.Based on the time domain statistical characteristics of narrow band wireless channel parameters with noise,a closed-form solution to physical layer secret key capacity in the time domain was derived.Afterwards,simulations in the uniform and non-uniform scattering environment were carried out to demonstrate its validity and applicability,respectively.

Detecting Spam albums in online social network

Shao-qing LYU,Yu-qing ZHANG,Dong-hang LIU,Guang-hua ZHANG

2016, 37(9):  75-91.  doi:10.11959/j.issn.1000-436x.2016180

Asbtract ( 254 )   HTML ( 1)   PDF (981KB) ( 1229 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A supervised learning solution to detect Spam albums instead of spammers in Photo Spam was proposed.Specifically,the characteristics of Photo Spam and the differences between Photo Spam and traditional Spam were analyzed.Then 12 features which were extracted easily and calculated efficiently were constructed based on the analysis.Next a classification model was built with a dataset of 2 356 labeled albums to identify Spam albums.The model provided excellent performance with true positive rates of Spam albums and normal albums,reaching 100% and 98.2% respectively.Finally,the detection model were applied to 315 115 unlabeled albums and detected 89 163 spam albums with a true positive rate of 97.2%.

Online Boosting tracking algorithm combined with occlusion sensing

Ya-wen WANG,Hong-chang CHEN,Shao-mei LI,Chao GAO

2016, 37(9):  92-101.  doi:10.11959/j.issn.1000-436x.2016181

Asbtract ( 273 )   HTML ( 2)   PDF (4757KB) ( 751 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Online Boosting tracking algorithm combined with occlusion sensing was presented.In this method,occlusion sensor was introduced to check the tracking results,and classifier updating strategy was adjusted depending on the occlusion checking results.By this way,the feature pool of the classifier can be kept pure,which will improve the tracking robustness under occlusion.Experimental results show that compared with traditional Boosting tracking algorithm,improved algorithm can solve the problem of occlusion very well.

Utility-based barter trade incentive scheme in opportunistic network

Jian-sheng YAO,Chun-guang MA,Qi YUAN

2016, 37(9):  102-110.  doi:10.11959/j.issn.1000-436x.2016182

Asbtract ( 342 )   HTML ( 4)   PDF (920KB) ( 653 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In opportunistic networks,existing simple barter trade (SBT) incentive scheme degraded the network performance due to the blindly caching strategy.So a utility-based barter trade (UBT) incentive mechanism was proposed.In the UBT scheme,nodes cache messages by predicting their future encounters and the probability that the encounters forward these messages to their destinations,which improved the caching efficiency and the network performance.Simulated results show that,compared with SBT,UBT can obtain higher delivery ratio and lower delay by less network cost and effectively motivate nodes’ cooperation as well.

Research of proactive complex event processing method

Shao-feng GENG,Yong-heng WANG,Ren-fa LI,Jia ZHANG

2016, 37(9):  111-120.  doi:10.11959/j.issn.1000-436x.2016183

Asbtract ( 379 )   HTML ( 15)   PDF (795KB) ( 812 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the preliminary analysis results of the indeterminate event stream that generated by the sensors and control purpose equipment of CPS,the adaptive dynamic Bayesian network and parallel Markov decision process model were used to support the proactive complex event processing.In order to resolve the vast state space issue of Markov decision process for large CPS,states partition and reward decomposition methods were proposed to parallel the decision making process.The experimental result based on the simulation of traffic network shows that proposed method can process event stream effectively and has favorable scalability.

Performance analysis of broadband self-interference cancellation at RF domain in co-frequency co-time full duplex systems

Jun WANG,Hong-zhi ZHAO,Wan-zhi MA,You-xi TANG,Chao-jin QING

2016, 37(9):  121-130.  doi:10.11959/j.issn.1000-436x.2016184

Asbtract ( 579 )   HTML ( 24)   PDF (1150KB) ( 1363 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the lack of performance analysis of the RF domain broadband self-interference cancellation algorithms in the co-time and co-frequency full duplex system,the multi-tap RF domain self-interference cancellation structure were considered,and the optimal solutions of its parameters to minimize the residual interference signal power were discussed,then its achievable interference cancellation capability was analyzed.By analysis and simulation,the performance of the multi-tap structure was associated with the interference bandwidth,the carrier frequency,and the differences between the multi-tap delays and multipath delays of the self-interference channel.The greater the signal bandwidth is,or the larger the differences between the multi-tap delays and multipath delays are,the worse the interference cancellation performance is.Besides,the interference cancellation performance is periodic oscillation with the increase of carrier frequency.

Compressive sensing based data gathering algorithm over unreliable links in WSN

Ce ZHANG,Xia ZHANG,Ou LI,Guan-lin MEI,Zhe HAN,Da-long ZHANG,Guang-yi LIU

2016, 37(9):  131-141.  doi:10.11959/j.issn.1000-436x.2016185

Asbtract ( 302 )   HTML ( 1)   PDF (1162KB) ( 561 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problem that the ubiquitous unreliable links in the WSN influence the performance of the compressive sensing (CS) based data gathering,first the relationship between the reconstruction SNR of CS-based data gathering algorithm and the bit-error-ratio (BER) were simulated quantitatively.Then classify two cases were classified,namely light-payload and heavy-payload,relying on the analysis of wireless link packet loss characteristics.The random packet loss model was conceived to describe the packet loss under light-payload scenario.Further the neighbor topology spatial correlation prediction-based CS data gathering (CS-NTSC) algorithm was proposed,which utilized the nodes spatial correlation to reduce the impact of error.Additionally,the node pseudo-failure model was conceived to describe the packet loss occurred in network congestion,and then the sparse schedule-aided CS data gathering (CS-SSDG) algorithm were conceived,for the purpose of changing the sparsity of measurement matrix and avoiding measurements amongst the nodes affected by unreliable links,thus weakening the impact of error/loss on data reconstruction.Simulation analysis indicates that the proposed algorithms are not only capable of improving the accuracy of the data reconstruction without extra energy,but also effectively reducing the impact affected by the unreliable links imposed on CS-based data gathering.

Comprehensive Reviews

Survey on data preserving for the search of internet of things

Jia-hui WANG,Chuan-yi LIU,Bin-xing FANG

2016, 37(9):  142-153.  doi:10.11959/j.issn.1000-436x.2016186

Asbtract ( 607 )   HTML ( 15)   PDF (780KB) ( 1684 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the rapid development of the internet of things(IoT) technology and big data technology,the search engine for internet of things become a hot research topic.However,because of the openness of the search of IoT,the privacy in traditional internet search area become more prominent and face more challenges.Firstly,the research background and challenges of privacy preservation for search of IoT were described.Secondly,the framework of data privacy preservation for search of IoT were presented and several main research domain in this framework were described.Thirdly,several privacy preservation technology appropriated for search of IoT were described in detail,including the background,recent research work,main research directions.Finally,the current problems and important research field for future were presented.

Review and perspective on encrypted traffic identification research

Wu-bin PAN,Guang CHENG,Xiao-jun GUO,Shun-xiang HUANG

2016, 37(9):  154-167.  doi:10.11959/j.issn.1000-436x.2016187

Asbtract ( 1795 )   HTML ( 224)   PDF (996KB) ( 8173 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Considering the importance of encrypted traffic identification technology and existing research work,first,the type of encrypted traffic identification according to the demand of traffic analysis were introduced,such as protocols,applications and services.Second,the encrypted traffic identification technology was summarized,and identification technology was compared from multiple views.Third,the deficiencies and the affecting factors of the existing encrypted traffic identification technologies were induced,such as tunneling,traffic camouflage technology,new protocols of HTTP/2.0 and QUIC.Finally,prospect trends and directions of future research on encrypted traffic identification were discussed.

Correspondences

Analysis of stability condition for LDPC codes and optimizing degree sequences over mixed channel

Kang-ning SUN,Lin-hua MA,Le RU,Wen-tong FAN,Xing HU,Shao-cheng HUANG

2016, 37(9):  168-174.  doi:10.11959/j.issn.1000-436x.2016188

Asbtract ( 383 )   HTML ( 0)   PDF (791KB) ( 616 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Under the circumstance that white Gaussian noise and random erasures exist all at once,the stability condition for LDPC codes over mixed channel was proposed.And it was proved that a good degree sequence of LDPC codes was not optimized over mixed channel.It can also be proved by simulation.The random particle swarm optimization (RPSO) and simulated annealing (SA) algorithm were combined to find some capacity-approaching degree sequences over mixed channel with different erasure probabilities.The threshold of signal-to-noise ratio improves 1.615 9 dB than that of the classical degree sequences calculated by Gaussian approximation over mixed channel.These degree sequences are optimal for optical recording and frequency-hopping communication with narrow-band interference.

DiffPRFs:random forest under differential privacy

Hai-rong MU,Li-ping DING,Yu-ning SONG,Guo-qing LU

2016, 37(9):  175-182.  doi:10.11959/j.issn.1000-436x.2016169

Asbtract ( 591 )   HTML ( 15)   PDF (909KB) ( 1318 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A differential privacy algorithm DiffPRFs based on random forests was proposed.Exponential mechanism was used to select split point and split attribute in each decision tree building process,and noise was added according to Laplace mechanism.Differential privacy protection requirement was satisfied through overall process.Compared to existed algorithms,the proposed method does not require pre-discretization of continuous attributes which significantly reduces the performance cost of preprocessing in large multi-dimensional dataset.Classification is achieved conveniently and efficiently while maintains the high accuracy.Experimental results demonstrate the effectiveness and superiority of the algorithm compared to other classification algorithms.

Sensor fault detection algorithm based on credibility and neighbor-cooperation

Yan-fei LIN,Su-jie SHAO,Cheng ZHONG,Shao-yong GUO,Xue-song QIU

2016, 37(9):  183-190.  doi:10.11959/j.issn.1000-436x.2016170

Asbtract ( 337 )   HTML ( 5)   PDF (853KB) ( 1103 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To effectively detect whether a node was failure,one of the effective sensor fault detection methods was to compare historical data of suspicious node with its neighbors.The key points of this method were identification of suspicious nodes,as well as decision problem of sending timing for fault diagnosis messages.To this end,a sensor fault detection algorithm was presented based on credibility and neighbor-cooperation.Firstly,a credibility model to determine whether nodes are suspicious was established.Then suspicious nodes send fault diagnosis requests to neighbor nodes based on neighbor-cooperation.The sending timing was determined by equal probability time window.Finally,it could finish classification of fault condition and state judgment based on diagnosis responds of neighbor nodes.Simulation experiments show that this algorithm can achieve higher fault detection rate with less fault diagnosis times and low data congestion probability.