Current Issue

25 August 2015, Volume 36 Issue 8

Previous Issue    Next Issue

Academic paper

Deduplication algorithm based on condensed nearest neighbor rule for deduplication metadata

Wen-bin YAO,Peng-di YE,Xiao-yong LI,Jing-kun CHANG

2015, 36(8):  1-7.  doi:10.11959/j.issn.1000-436x.2015226

Asbtract ( 625 )   HTML ( 5)   PDF (805KB) ( 1088 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Building effective deduplication index in the memory could reduce disk access times and enhance chunk fingerprint lookup speed,which was a big challenge for deduplication algorithms in massive data environments.As deduplication data set had many samples with high similarity,a deduplication algorithm based on condensed nearest neighbor rule,which was called Dedup²,was proposed.Dedup²uses clustering algorithm to divide the original deduplication metadata into several categories.According to these categories,it employs condensed nearest neighbor rule to remove the highest similar data in the deduplication metadata.After that it can get the subset of deduplication metadata.Based on this subset,new data objects will be deduplicated based on the principle of data similarity.The results of experiments show that Dedup²can reduce the size of deduplication data set more than 50% effectively while maintain similar deduplication ratio.

Design of low-voltage electronically tunable current-mode multiphase sinusoidal oscillator based on single CDCTA

Chun-hua WANG,Hai-rong LIN,Yi LI,Jie JIN,Zan-ming XIA

2015, 36(8):  8-12.  doi:10.11959/j.issn.1000-436x.2015133

Asbtract ( 423 )   HTML ( 8)   PDF (684KB) ( 708 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel current-mode multiphase sinusoidal oscillator circuit was proposed.The realized circuit using single current differencing cascaded transconductance amplifier(CDCTA)and only grounded passive elements could yield n(n being odd or even)current-output signals equally spaced in phase.It enjoyed the characteristics of simple circuit structure,low-voltage,high-output impedance,high-frequency and independently electronic adjustable of oscillation condition and oscillation frequency.CADENCE simulation and experimental results have been included to verify the theoretical analysis.

Dynamical credibility aware data forwarding mechanism for intermittently connected wireless networks

Da-peng WU,Hong-pei ZHANG,Ru-yan WANG,Qiao-shou LIU

2015, 36(8):  13-22.  doi:10.11959/j.issn.1000-436x.2015159

Asbtract ( 336 )   HTML ( 4)   PDF (694KB) ( 658 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel dynamic credibility aware packet forwarding mechanism for intermittently connected wireless networks is proposed.According to the network state information obtained locally by a moving node,the malicious degrees and collaboration degrees of nodes can be obtained in a distributed manner.Meanwhile,based on the node connectivity,the credibility of a node is estimated,furthermore,the relay node can be selected reasonably.Results show that the proposed mechanism can effectively enhance the reliability of data transmission while reducing the network load rate significantly.Thus,the utilization of network resources is improved.

Verifiably private outsourcing scheme for multivariate polynomial evaluation

Yan-li REN,Da-wu GU,Jian-xing CAI,Chun-shui HUANG

2015, 36(8):  23-30.  doi:10.11959/j.issn.1000-436x.2015172

Asbtract ( 606 )   HTML ( 16)   PDF (2282KB) ( 1288 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the development of cloud computing and big data,it had important practical significance for how to outsource private data and verify the computing result efficiently.A verifiably outsourcing scheme for multivariate polynomial evaluation based on multilinear maps and homomorphic encryption was proposed where the user could verify the computing result exactly.The proposed scheme is provably secure without random oracles and the multivariate polynomial itself and the input of the function are private for the server.Moreover,the cost of the user is much smaller than that of the server,and it is much smaller than that of computing the multivariate polynomial directly.

Narrowing the semantic gap in virtual machine introspection

Chao-yuan CUI,Yun WU,Ping LI,Xiao-ming ZHANG

2015, 36(8):  31-37.  doi:10.11959/j.issn.1000-436x.2015103

Asbtract ( 770 )   HTML ( 8)   PDF (1004KB) ( 1571 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Virtual machine introspection(VMI)has been widely used in areas such as intrusion detection and malware analysis.However,due to the existence of semantic gap,the generality and the efficiency of VMI were partly influenced while getting internal information of a virtual machine.By analyzing the deficiencies of existing technology of semantic gap restoration,a method called ModSG was proposed to bridge the semantic gap.ModSG was a modularity system,it divided semantic restoration into two parts.One was online phase that interact directly with user to construct semantic views,the other was offline phase that only interact with operating system to parse high-level semantic knowledge.Both were implemented via independent module,and the latter provided the former with necessary kernel information during semantic view construction.Experiments on different virtual machine states and different kernel versions show that the ModSG is accurate and efficient in narrowing semantic gap.The modular design and deployment also make ModSG easily to be extended to other operating systems and virtualization platforms.

Nettree for maximum disjoint paths with length constraint in DAG

Yan LI,You-xi WU,Chun-ping HUANG,Zhi-ying ZHANG,Zhen-xiang ZENG

2015, 36(8):  38-49.  doi:10.11959/j.issn.1000-436x.2015145

Asbtract ( 618 )   HTML ( 4)   PDF (977KB) ( 1007 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The problem of the maximum disjoint paths in directed acyclic graphs(DAG)was researched which is to find the maximum disjoint paths with length k between two given vertices.A greedy algorithm named greedy path(GP)was proposed to solve the problem.GP transformed a DAG into a nettree with depth k+1 at first.Then the number of root-leaf paths for each node of the nettree was calculated to achieve the number of total paths for each vertex of the DAG.In order to obtain an optimized disjoint path,GP selected the node in the(k+1)th level of the nettree as the current node,and searched for the optimized parent in the usable parents whose number of total paths was minimal.This process was iterated,until there was no disjoint path.The space and time complexities of GP are O(wkn(p+q))and O(kn(p+q)+n²).To evaluate the performance of GP,an algorithm which can create artificial DAG with known maximum disjoint paths was also proposed.Experimental results show that GP can get better performance than other competitive algorithms.

BiRch:a bidirectional search algorithm for k-step reachability queries

Jun-feng ZHOU,Wei CHEN,Chun-ping FEI,Zi-yang CHEN

2015, 36(8):  50-60.  doi:10.11959/j.issn.1000-436x.2015230

Asbtract ( 518 )   HTML ( 7)   PDF (1079KB) ( 1120 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new bidirectional processing algorithm,namely BiRch was proposed.When checking whether a vertex u can reach v within k steps,BiRch firstly compared the out-degree of u and the in-degree of v,and processed the one with smaller degree,such that to avoid large indexes and the inefficiency due to large degree.Two pruning strategies were proposed based on bidirectional breadth-first levels and bidirectional topological levels,such that to reduce the number of visited vertexes.Experimental results on 19 real datasets verify the efficiency of the proposed method in terms of different metrics,including indexing time,index size,query processing time,the number of visited vertexes,and scalability.

Security of the cryptosystems based on ergodic matrices

Hua-wei HUANG,Chang-wen PENG,Yun-yun QU,Chun-hua LI

2015, 36(8):  61-67.  doi:10.11959/j.issn.1000-436x.2015128

Asbtract ( 409 )   HTML ( 7)   PDF (1503KB) ( 592 )   Knowledge map   

References | Related Articles | Metrics

The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein polynomial time and the ciphertext of the PZZ1 cryptosystem can be decrypted by the forged secret key.In some case the SEME problem can be reduced to discrete logarithm problem in polynomial time.If the key parameters are chosen improperly,then PZZ2 cryptosystem is based on discrete logarithm problem instead of NP hard problem.

Three-dimensional localization under severely obstructed NLOS environment

Zhu XIAO,Jie CHEN,Dong WANG,Xiao-hong LI,Ren-fa LI

2015, 36(8):  68-75.  doi:10.11959/j.issn.1000-436x.2015114

Asbtract ( 680 )   HTML ( 18)   PDF (1682KB) ( 1065 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In the severely obstructed NLOS(non-line-of-sight)environment,obstacles between the UN(unknown node)and RS(reference station)made the DP(direct path)undetectable.It greatly restricted the application of wireless localization method.A three-dimensional localization scheme,which utilized the distance and orientation information of single-bounce signal,was proposed to evade the DP blocking effect in three-dimensional NLOS environment.Within the proposed localization scheme,three-dimensional spatial location relationship among the RS,UN and scatterers was proven.Anoptimization algorithm based on least mean square was proposed and the mathematical solution to the position relationship was derived.Furthermore,the performance of algorithm is studied by using RMSE(root mean-square error)analysis.Through Monte-Carlo simulations,how distance and orientation deviation of three-dimensional localization frame affect performance of algorithms is examined.It is also demonstrated that the analytical results closely match the simulations,which verifies the effectiveness of the proposed three-dimensional NLOS localization algorithm.

Inter-carrier interference cancellation using spatial characteristics for high-mobility OFDM communication systems

Wei WANG,Qin-ye YIN,Peng-cheng MU

2015, 36(8):  76-82.  doi:10.11959/j.issn.1000-436x.2015202

Asbtract ( 425 )   HTML ( 10)   PDF (1315KB) ( 770 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

High-mobility orthogonal frequency division multiplexing(OFDM)systems suffered severe inter-carrier interference(ICI)from Doppler spreading.On the basis of the characteristics of wireless propagation in practical scenarios,a method which employed the WINNER Ⅱ channel model to represent the practical wireless channel and an antenna array as the receiver to eliminate ICI in space-domain was proposed.The direction of arrival estimation algorithm and the beamforming network were used to separate the received signals in space-domain.Multi-beam diversity gain was obtained finally by means of combining the signals which have been compensated for Doppler frequency shifts(DFS)respectively.Simulation results demonstrate that the proposed method not only effectively reduces ICI and the error floors,but also obtains a 5～7 dB signal-to-interference gain over systems without use of the proposed method.

Provable secure ownership transfer protocol for RFID tag

Bian-qing YUAN,Ji-qiang LIU

2015, 36(8):  83-90.  doi:10.11959/j.issn.1000-436x.2015228

Asbtract ( 451 )   HTML ( 8)   PDF (590KB) ( 657 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the ownership transfer of an object,the ownership of the RFID tag attached to it also needs to be transferred.Security and privacy are the key issues while researchers studying the process of RFID tag ownership transfer.In the UC(universally composable)framework,an ideal functionality of RFID tag ownership transfer is formally defined.Then,a novel lightweight ownership transfer protocol for RFID tag is proposed.Subsequently,it is proved that proposed protocol realizes the previously defined ideal functionality and satisfies the required security properties such as mutual authentication,tag anonymity,resistance to de-synchronization attacks,forward privacy protection and backward privacy protection.Compared with the existing ownership transfer protocols for RFID tags,the computational complexity and the storage requirements of proposed protocol are all lower.Meanwhile,the number of interaction among the entities is small.Therefore,the proposed protocol can efficiently implement ownership transfer for low-cost tags.

Design and implementation of secure Windows platform based on TCM

Wei FENG,Yu QIN,Deng-guo FENG,Bo YANG,Ying-jun ZHANG

2015, 36(8):  91-103.  doi:10.11959/j.issn.1000-436x.2015139

Asbtract ( 701 )   HTML ( 17)   PDF (3895KB) ( 2552 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A secure Windows platform solution based on TCM was proposed to solve the integrity measurement and attestation problem of the Windows system.Two security modes were realized by extending the Windows kernel:in the measurement mode,all executable contents that were loaded onto the Windows system were measured,and the TCM provided the protection and outward attestation for these measurements; and in the control mode,the measurements were further compared with a whitelist customized by an administrator,and all the programs that were not included in the whitelist would be prohibited from running.Experiment analysis shows that proposed solution can enhance the security of Windows platform and resist some software attacks; and at the same time,the average performance overhead is about 20～30ms,which will not influence the normal running of Windows.

Topic:5G

Network selection algorithm in heterogeneous wireless networks to minimize the maximum residual service time

Bai DU,Hong-yan LI,Yan LONG

2015, 36(8):  104-109.  doi:10.11959/j.issn.1000-436x.2015231

Asbtract ( 468 )   HTML ( 5)   PDF (885KB) ( 780 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the problem of how to select the most suitable access network for users at any time anywhere in heterogeneous wireless networks(HWN),a distributed algorithm to minimize the difference of residual service time between different access networks was proposed.The algorithm use the Lyapunov optimization to model the network and guarantee the stability of the network.Simulation results show that the proposed algorithm can decrease the rejection ratio and achieve a shorter queue length in access networks.

Academic paper

Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks

Ai-wen WANG,Tao WEN,Yong ZHANG,Feng-mei ZHU,Di WU

2015, 36(8):  110-117.  doi:10.11959/j.issn.1000-436x.2015116

Asbtract ( 355 )   HTML ( 3)   PDF (1560KB) ( 653 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An attacking scheme was proposed against the permutation-based multi-polynomial scheme proposed by Guo,et al for pair-wise key establishment in wireless sensor networks.Attacks on polynomials were carried out by constructing a black-box to integrally solve the set of polynomials rather than a single polynomial.The results show that this scheme can break the symmetric polynomials and make the permutation of polynomials lose its function.The proven theorems and instance analysis indicate that the scheme proposed by Guo,et al can’t frustrate the large-scale node capture attack and can’t break the tolerance threshold of polynomials.Therefore,the scheme is insecure.

Low-complexity optimal MPSK detection for spatial modulation

Hong-zhi MEN,Ming-lu JIN

2015, 36(8):  118-124.  doi:10.11959/j.issn.1000-436x.2015120

Asbtract ( 453 )   HTML ( 10)   PDF (1117KB) ( 808 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The low-complexity optimal SM detection algorithm for MQAM signal detection had been proposed,but no similar method was found for MPSK signal.The problem of low-complexity detection for MPSK signal was considered in SM systems.Utilizing 2-D vector quantization of ML demodulation and the property of MPSK constellation,a low-complexity optimal detection which is independent to modulation order was developed.Since the approach avoids the exhaustive searching on signal constellation space,the computational complexity can be significantly reduced.The proposed detection algorithm can provide the identical performance with ML-optimum detector and has lower computational complexity.Therefore,it has both theoretical and practical significance.The proposed algorithm is of great significance in the large antenna and green communication technology.

Algorithm for k-anonymity based on projection area density partition

Chao WANG,Jing YANG,Jian-pei ZHANG,Gang LV

2015, 36(8):  125-134.  doi:10.11959/j.issn.1000-436x.2015204

Asbtract ( 454 )   HTML ( 9)   PDF (890KB) ( 753 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In data publishing privacy preserving,while classifying temporary anonymous groups,the existing algorithms didn’t consider the distance between adjacent data points,and could easily produce a lot of unnecessary information loss,thus affecting the availability of released anonymous data sets.To solve the above problem,the concept of rectangular projection area,the projection area density and partition coefficient characterization were presented,aim to increase the recording points’s projection area density to divide temporary anonymous group reasonably,and to make the information loss of divided anonymous groups as small as possible.And presents the algorithm for k-anonymity based on projection area density partition,by optimizing the rounded partition function and properties dimension selection strategy,to reduce unnecessary information loss and to further improve the availability of released data sets,without reducing the number of anonymous groups.The rationality and validity of the algorithm are verified by theoretical analysis and multiple experiments.

Cluster ensemble selection based on validity index in evidence space

Kai BI,Xiao-dan WANG,Ya-qiong XING

2015, 36(8):  135-145.  doi:10.11959/j.issn.1000-436x.2015146

Asbtract ( 331 )   HTML ( 2)   PDF (1670KB) ( 649 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

At first,the concept of evidence space was proposed to overcome the weakness of distance space for describing the complex structure of data sets.And then,the Davies-Bouldin index was extended based on the evidence space proposed.Meanwhile the label-correlation matrix was used to measure the difference of clusters members.At last,the cluster members with better effectiveness and bigger differences were selected for cluster ensemble.The experimental results show that the proposed method is able to improve the effectiveness of cluster ensemble.

Low-complexity despreading scheme with repetition code for wireless body area networks

Yu CHI,Lan CHEN,Chao LV

2015, 36(8):  146-152.  doi:10.11959/j.issn.1000-436x.2015207

Asbtract ( 508 )   HTML ( 3)   PDF (722KB) ( 773 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the reliability of data transmission and reduce the complexity of the narrow band receiver for wireless body area networks(WBAN),spreading with repetition code is used in IEEE 802.15.6 standard.A despreading structure in which the metrics of reliability were calculated selectively according to the dynamic threshold was designed.Combined with hard decision,hard threshold-combine and hard threshold-delete despreading methods by simplifying maximal ratio combining and generalized minimum distance principle respectively were proposed,which had low complexity and near-optimal performance.The theoretical analysis and simulation results show that compared to despreading based on maximum likelihood method,the spreading gain of the proposed methods is close to the theoretical value and the computational complexity can be reduced by 86% at most under high SNR circumstances.

Upper bound of degrees of freedom in cognitive MIMO interference network with user cooperation

Shi-lei ZHU,Na-e ZHENG,Sheng WANG,Han-ying HU

2015, 36(8):  153-160.  doi:10.11959/j.issn.1000-436x.2015206

Asbtract ( 384 )   HTML ( 2)   PDF (1636KB) ( 693 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In(K+1)-user cognitive MIMO interference network,conventional algorithms distinguish the interference of primary users and secondary users by aligning them to the different interference space,separately.Therefore,it leads to the loss of spatial degrees of freedom(DoF).From the perspective of multiplexing the interference space,a new upper bound of DoF and its necessary condition was deduced.Furthermore,to verify the rationality and validity of the new upper bound,a cooperative joint interference alignment algorithm,in which a joint interference alignment indicator was designed and proposed based on norm theory and Rayleigh-Ritz theorem.The effectiveness of the algorithm was analyzed.Theoretical analysis and simulation results show that the new upper bound of DoF breaks upper bound given in the existing papers,and it can be achieved by the proposed algorithm.

Vessel segmentation of retinal image based on pixel specificity and self-adaptive classification strategy

Ping JIANG,Quan-sheng DOU

2015, 36(8):  161-170.  doi:10.11959/j.issn.1000-436x.2015229

Asbtract ( 390 )   HTML ( 5)   PDF (2249KB) ( 621 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new vessel segmentation method called specificity and self-adaptive vessel detection(SSVD)was proposed based on pixel specificity and self-adaptive classification strategy,in the beginning pixel specificity was defined,by setting a higher pixel specificity threshold,the main vessel skeleton was extracted; then self-adaptive classification process was implemented,and each of the remaining undetermined pixels acted as an Agent,within a multi-scale threshold range,Agent revised its own status according to the status of its neighbor,so as to complete the classification of the pixels; finally the noise was removed by multi-window noise filtering method.By testing SSVD on DRIVE database,the experiment shows that it is more accurate and efficient than state-of-the-art methods.

Academic communication

IEEE 802.15.4 differentiated service strategy based on reinforcement-learning

Liang QIAN,Zhi-hong QIAN,Tian-ping LI,Wei QUAN

2015, 36(8):  171-181.  doi:10.11959/j.issn.1000-436x.2015149

Asbtract ( 410 )   HTML ( 5)   PDF (2809KB) ( 790 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To provide better support in differentiated service for IEEE 802.15.4,a novel differentiated service mechanism was proposed based on BCS(back off counter scheme)and reinforcement learning.In terms of end-device,BCS backoff strategy was added to original priority-based differentiated strategy to solve the service differentiation problem under higher traffic condition.Whil “ e for the coordinator,a reinforcement learning based duty-cycle adjustment algorithm was proposed toself-learning”an optimal duty-cycle according to different application requirements and environmental changes.Simulation shows that the proposed algorithm can meet the performance requirements of high-priority service under different environments and adjust the duty-cycle when traffic is changed,which showed a strong environmental adaptability.

Meet-in-the-middle attack on 11-round 3D cipher

Jiong-jiong REN,Shao-zhen CHEN

2015, 36(8):  182-191.  doi:10.11959/j.issn.1000-436x.2015131

Asbtract ( 504 )   HTML ( 7)   PDF (1552KB) ( 766 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new 6-round meet-in-the-middle distinguisher was constructed by introducing multiset,making use of properties of the S-box was proposed and the truncated differential characteristic.Based on the distinguisher,a meet-in-the-middle attack on 11-round 3D cipher and the time complexity of recovering the key was about 2³²⁹.Furthermore,the data complexity was reduced using the time/memory tradeoff technique.Besides,by utilizing the new distinguisher,the time complexity of 10-round attack on 3D cipher is reduced to 2²⁰¹.

Requirements-oriented spectrum sharing for OFDMA cognitive radio networks

Chi ZHANG,Bi-qing ZENG,Jin-song YANG,Xiao-hong XIE

2015, 36(8):  192-206.  doi:10.11959/j.issn.1000-436x.2015227

Asbtract ( 448 )   HTML ( 11)   PDF (1809KB) ( 749 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Considering the satisfaction of the secondary network communication requirements,a two-stage model was proposed to address the spectrum leasing and allocation problem in OFDMA cognitive radio networks(CRN).At the first stage of the model,the secondary base station(SBS)collected channel capacity requirements of the secondary network,and rent the spectrum resource from multiple primary base stations(PBS).The trade behaviors between the PBS and the SBS were modeled with a Bertrand game,and adopted the Nash equilibrium as the pricing scheme.At the second stage,with the Nash bargaining solution(NBS),the subcarriers and power allocation problem were defined as a nonlinear programming problem,and obtained the solution by Lagrange multiplier method.Comparing with the other spectrum allocation schemes,simulation results show the proposed spectrum sharing scheme can satisfy each secondary user’s communication requirements more fairly and efficiently.