Current Issue

25 August 2014, Volume 35 Issue 8

Previous Issue    Next Issue

Authentication method in SWIM based on improved Diameter/EAP-MD5

2014, 35(8):  1-7. 

Asbtract ( 786 )   Knowledge map   

Related Articles | Metrics

System wide information management (SWIM) provides the civil aviation information exchange and data sharing function by using service-oriented architecture (SOA). Based on the analysis of SWIM architecture and the sub-protocol EAP-MD5 of Diameter, the security vulnerable of authenticating process in standard Diameter/EAP-MD5 is explored, the EAP-MD5 authentication protocol is improved, and the SWIM authentication service based on Diameter is studied, then the SWIM authentication method based on improved Diameter/EAP-MD5 protocol is proposed. Experiments on the security of SWIM authentication service based on Diameter are performed in SWIM simulation environment, results show that the improved Diameter/EAP-MD5 authentication method can enhance the security of SWIM authentication and guarantee SWIM security service.

Academic paper

Authentication method in SWIM based on improved Diameter/EAP-MD5

Zhi-jun WU,Ting ZHAO,Jin LEI

2014, 35(8):  1-7.  doi:10.3969/j.issn.1000-436x.2014.08.001

Asbtract ( 348 )   HTML ( 3)   PDF (991KB) ( 698 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

System wide information management (SWIM) provides the civil aviation information exchange and data sharing function by using service-oriented architecture (SOA). Based on the analysis of SWIM architecture and the sub-protocol EAP-MD5 of Diameter, the security vulnerable of authenticating process in standard Diameter/EAP-MD5 is explored, the EAP-MD5 authentication protocol is improved, and the SWIM authentication service based on Diameter is studied, then the SWIM authentication method based on improved Diameter/EAP-MD5 protocol is proposed. Experi-ments on the security of SWIM authentication service based on Diameter are performed in SWIM simulation environ-ment, results show that the improved Diameter/EAP-MD5 authentication method can enhance the security of SWIM au-thentication and guarantee SWIM security service.

High efficient shape coding based on the representation of contour and chain code

2014, 35(8):  2-14. 

Asbtract ( 620 )   Knowledge map   

Related Articles | Metrics

A high efficient lossless shape coding scheme was proposed based on the representation of contour and chain code. The object contours are firstly extracted and thinned to be single-pixel width. Then the object contours are transformed into chain-code-based representation and divided into different sub-segments based on link directions to make each sub-segment consist of up to two types of links. Thirdly, straightness detection is performed and long straight-line segments within contours are separated. Finally, different schemes are proposed to encode the straight-line sub-segments and ordinary curve sub-segments by employing the spatial correlations among contours aiming to acquire high coding performance. Experiments are conducted and the results show that the proposed scheme outperforms the existing techniques and can improve the compression efficiency by 36.5% on average compared with the state-of-the-art method.

Predicting users’ profiles in social network based on semi-supervised learning

2014, 35(8):  3-22. 

Asbtract ( 723 )   Knowledge map   

Related Articles | Metrics

How to derive the users’ hidden profiles using social relationships is studied. Considering the network structure of social network and characteristics of users’ data, the graph based semi-supervised learning algorithm is chose to predict users’ profiles. To improve the prediction accuracy, the attribute affinity is proposed to evaluate whether the value of an attribute is easy to be predicated, and different weight computing formulas are designed to calculate the relationship between users. The experimental data is collected from “renren network” and two attributes, hobbies and schools, are predicted in the experiments. The experimental results show that the strategies for computing weights among users are effective.

Privacy-perserving scheme for social networks

2014, 35(8):  4-32. 

Asbtract ( 824 )   Knowledge map   

Related Articles | Metrics

The security and privacy issues in SNS were studied and a privacy-preserving scheme PPSNS was proposed. PPSNS utilizes attribute-based encryption, allowing the SNS user to set up an enforcement of fine-grained access control upon the data he owns, thus the potential threats from unauthorized parties or even the SNS provider itself could be avoided. A token system in PPSNS is included to address the challenging issue of efficient attribute revocation. In addition, the users in PPSNS don’t have to manage as much information as they do in other encryption-based solutions, achieving a much lower cost in the client side. Analyses show that PPSNS is secure, and gives a better performance in computing and storage costs compared to most related works.

Adaptive compressed spectrum sensing based on optimized measurement matrix

2014, 35(8):  5-39. 

Asbtract ( 549 )   Knowledge map   

Related Articles | Metrics

The estimation error of reconstruction by adaptive compressed sensing was derived, and the column vector autocorrelation of the observation matrix was reduced, and the impact of optimization process on compressed sensing reconstruction algorithm was analyzed. Combining the observation matrix optimization and adaptive process, the spectrum sensing algorithm of optimized adaptive compression based on observation matrix was proposed. The simulation results show that the mean square error (MSE) of proposed algorithm is lower than traditional algorithm, and the probability of detection of proposed algorithm is higher on the same number of observations, and the required number of observations is fewer when achieving the same receiver operating performance (ROC).

Semi-supervised learning by constructing query-document heterogeneous information network

2014, 35(8):  6-47. 

Asbtract ( 540 )   Knowledge map   

Related Articles | Metrics

Various graph-based algorithms for semi-supervised learning have been proposed in recent literatures. However, although classification on homogeneous networks has been studied for decades, classification on heterogeneous networks has not been explored until recently. The semi-supervised classification problem on query-document heterogeneous information network which incorporate the bipartite graph with the content information from both sides is considered. In order to strengthen the network structure, class information of sample nodes is introduced. A semi-supervised learning algorithm based on two frameworks including the novel graph-based regularization framework and the iterative framework is investigated. In the regularization framework, a new cost function to consider the direct relationship between two entity sets and the content information from both sides which leads to a significant improvement over the baseline methods is developed. Experimental results demonstrate that proposed method achieves the best performance with consistent and promising improvements.

Non-orthogonal multiple-access system SC-FDMA-IDMA with iterative block equalization

2014, 35(8):  7-55. 

Asbtract ( 731 )   Knowledge map   

Related Articles | Metrics

As a new non-orthogonal multiple-access scheme, SC-FDMA-IDMA combines two technologies of SC-FDMA and IDMA together. This combination makes SC-FDMA-IDMA have the probability to inherit different advantages of these two technologies such as large system capacity, low peak-to-average power ratio (PAPR) and simple multiuser detection. However, because SC-FDMA for the transmission of different users’ signal is a special form of single carrier modulation, the system performance may degrade quickly when the frequency selectivity of channel is serious. So the iterative block decision feedback equalization (IB-DFE) algorithm applied to the SC-FDMA-IDMA system is derived in order to enhance the ability of anti-frequency selective fading. Simulation results show that comparing with the single-user SC-FDMA system with high-order modulation, the multiuser SC-FDMA-IDMA system with low-order modulation has great performance improvement after adopting the IB-DFE algorithm on condition that these two systems have the same trans-mission efficiency.

Optimized algorithm for value iteration based on topological sequence backups

2014, 35(8):  8-62. 

Asbtract ( 584 )   Knowledge map   

Related Articles | Metrics

In order to improve the convergence performance, an optimized value iteration based on topological sequence backups, VI-TS, is proposed. The key idea of VI-TS is to circumvent the problem of unnecessary backups by dividing an MDP into strongly-connected components and solving these components in topological sequences after detecting the structure of MDP. The experiment results show that VI-TS has a better convergence performance and robustness for state space growth when applied to classical planning experiment scenarios.

Academic paper

High efficient shape coding based on the representation of contour and chain code

Zhong-jie ZHU,Yu-e WANG,Gang-yi JIANG

2014, 35(8):  8-14.  doi:10.3969/j.issn.1000-436x.2014.08.002

Asbtract ( 180 )   HTML ( 6)   PDF (702KB) ( 795 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A high efficient lossless shape coding scheme was proposed based on the representation of contour and chain code. The object contours are firstly extracted and thinned to be single-pixel width. Then the object contours are trans-formed into chain-code-based representation and divided into different sub-segments based on link directions to make each sub-segment consist of up to two types of links. Thirdly, straightness detection is performed and long straight-line segments within contours are separated. Finally, different schemes are proposed to encode the straight-line sub-segments and ordinary curve sub-segments by employing the spatial correlations among contours aiming to acquire high coding performance. Experiments are conducted and the results show that the proposed scheme outperforms the existing tech-niques and can improve the compression efficiency by 36.5% on average compared with the state-of-the-art method.

Research on optimal parallel routing and wide diameter of unidirectional double-loop networks

2014, 35(8):  9-70. 

Asbtract ( 527 )   Knowledge map   

Related Articles | Metrics

A new method to research optimal parallel routing of unidirectional double-loop networks (DLN) is presented based on Cartesian coordinates. Firstly, the ditributed model of copy nodes is obtained under the research on the distributed rules of the copy nodes of nodes on both X axis and Y axis in the minium distance diagram(MDD). Using this ditributed model of copy nodes, the optimal parallel routing method is provided, as well as calculating method of wide diameter of DLN. Secondly, the parallel distance diagram(PDD) of DLN which is expanded by MDD is designed and simulated. Based on the PDD, a method to find two shortest parallel pathes quickly without any repeating node was proposed. At last, the simulation of the distribution of wide diameter of DLN is given. The result of simulation indicates that the characteristic of wide diameter distribution is reposeful undulation. Compared with traditional routing method, optimal parallel routing method improved the transition efficiency of DLN obviously based on the simulation results.

Fused access control scheme for sensitive data sharing

2014, 35(8):  10-77. 

Asbtract ( 679 )   Knowledge map   

Related Articles | Metrics

In order to improve security of sensitive data sharing and distributing, fused access control scheme based on the mechanism of attribute-based encryption (ABE) and usage control (UCON) was proposed. The scheme could ensure data confidentiality in the storage, distribution process and control sensitive data sharing scope with dynamic access policies. Additionally, the scheme can prevent legal users operating sensitive data illegally and prohibit privilege abuse for domain user.The results of security analysis and efficiency analysis show that fused access control scheme alleviates the administering burdens on data management server and realizes secure storage and distribution for sensitive data.

Malware detection technology analysis and applied research of android platform

2014, 35(8):  11-85. 

Asbtract ( 811 )   Knowledge map   

Related Articles | Metrics

For the Android platform security problem, a mobile client and server collaborative malware detection proposal was proposed, where mobile client application was mainly based on permission detection technology and implemented lightweight testing. The server-side detection system is mainly responsible for testing suspicious samples submitted by the mobile terminals, meanwhile implements the functions of software behavior analysis, signature library updates, and mobile client synchronization, etc. The server-side detection techniques include permission-based detection technology, bytecode-based static detection technology and root-based dynamic detection technology. The result of the experiment shows that the three detection techniques can achieve better detection results.

DTW-based multi-wavelet data compression algorithm for wireless sensor networks

2014, 35(8):  12-94. 

Asbtract ( 648 )   Knowledge map   

Related Articles | Metrics

A data compression algorithm for wireless sensor networks based on DTW and multi-wavelet transform is proposed. Firstly, the correlation and warping path of asynchronous data point pairs is introduced, and then an iterative algorithm for solving DTW warping path with maximal similarity is designed. Secondly, a best match point algorithm is presented, which employs prediction to estimate the relationship of synchronous data vectors and then find out the best match points. A sensory data matrix with maximal correlation is thus obtained. Afterwards, a multi-wavelet transform is introduced, which is capable of utilizing the spatial correlation of sensory data matrix and solving the row-column asymmetry problem. Experiment results show that proposed method has higher energy concentration ratio, better reconstruction accuracy and lower running time compared to the traditional distributed wavelet compression algorithm.

Research of platform identity attestation based on trusted chip

2014, 35(8):  13-106. 

Asbtract ( 584 )   Knowledge map   

Related Articles | Metrics

By studying the platform identity attestation base on trusted third parties, a scheme where a trusted computing platform is identified by a certificate and a token is proposed. In this scheme, only the token is used when the platform proves its identity. Compared to other schemes, this scheme not only has much lower calculation and communication, but also convinces the verifier of the trustworthiness of the client’s platform state during the platform identity attestation. A detailed security proof of the proposed scheme is presented by using the protocol composition logic, and the proof shows that the scheme satisfies correctness and anonymity of platform identity verification. The experiment result in a developed prototype system shows that the proposed scheme provides good performances in computation and communication, and is especially suitable for the wireless network.

Survivability evaluation of network information system based on the cloud model and analytic hierarchy process

2014, 35(8):  14-115. 

Asbtract ( 514 )   Knowledge map   

Related Articles | Metrics

Considering the problem of quantitative evaluation for qualitative survivability data and indexes of network information systems, the proposed method gives a multi-level survivability evaluation framework based on cloud model theory and AHP method. The algorithm builts a multi-level evaluation indexes system and compute the weight of each index using AHP method. Moreover, a quantitative method for qualitative data and a fuzzy evaluation method are designed via multidimensional cloud model. Finally, the experimental results show that the proposed method achieves a satisfactory result in quantitative evaluation of complex qualitative indexes, and has certain advantages in terms of accuracy and fuzzy computing.

LBS-oriented location privacy protection model and scheme

2014, 35(8):  15-124. 

Asbtract ( 566 )   Knowledge map   

Related Articles | Metrics

A location privacy protection model was proposed based on the central server structure, designed a location privacy protection scheme based on pseudo-random permutation for the model. Proposed scheme builds on k-anonymous and secret information retrieval technology design concept and methods, achieves a blind query and perfect anonymous. This scheme has been proven to have untraceability and unlinkability, and the efficiency is analyzed as well.

Academic paper

Privacy-perserving scheme for social networks

Zhi-quan LV,Cheng HONG,Min1 ZHANG,Deng-guo FENG,Kai-qu CHEN

2014, 35(8):  15-22.  doi:10.3969/j.issn.1000-436x.2014.08.004

Asbtract ( 403 )   HTML ( 18)   PDF (1621KB) ( 1067 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The security and privacy issues in SNS were studied and a privacy-preserving scheme PPSNS was proposed. PPSNS utilizes attribute-based encryption, allowing the SNS user to set up an enforcement of fine-grained access control upon the data he owns, thus the potential threats from unauthorized parties or even the SNS provider itself could be avoided. A token system in PPSNS is included to address the challenging issue of efficient attribute revocation. In addi-tion, the users in PPSNS don't have to manage as much information as they do in other encryption-based solutions, achieving a much lower cost in the client side. Analyses show that PPSNS is secure, and gives a better performance in computing and storage costs compared to most related works.

Research on malicious code variants detection based on texture fingerprint

2014, 35(8):  16-136. 

Asbtract ( 874 )   Knowledge map   

Related Articles | Metrics

A texture-fingerprint-based approach is proposed to extract or detect the feature from malware content. The texture fingerprint of a malware is the set of texture fingerprints for each uncompressed gray-scale image block. The malicious code is mapped to uncompressed gray-scale image by integrating image analysis techniques and variants of malicious code detection technology. The uncompressed gray-scale image is partitioned into blocks by the texture segmentation algorithm. The texture fingerprints for each uncompressed gray-scale image block is extracted by gray-scale co-occurrence matrix algorithm. Afterwards, the index structure for fingerprint texture is built on the statistical analysis of general texture fingerprints of malicious code samples. In the detection phase, according to the generation policy for malicious code texture fingerprint, the prototype system for texture fingerprint extraction and detection is constructed by employing the integrated weight method to multi-segmented texture fingerprint similarity matching to detect variants and unknown malicious codes. Experimental results show that the malware variants detection system based on the proposed approach has good performance not only in speed and accuracy but also in identifying malware variants.

Multi-core helper thread prefetching for irregular data intensive applications

2014, 35(8):  17-146. 

Asbtract ( 586 )   Knowledge map   

Related Articles | Metrics

Big data analysis applications often use sparse graph traversal algorithm which characterized by irregular data intensive memory access. For improving performance of memory access in sparse graph traversal algorithm, helper thread prefetching could convert discontinuous locality into continuous-instant spatial-temporal locality effectively by using the shared last level cache of chip multi-processor platforms. Betweenness centrality algorithm was used as a case study, the multi-parameter prefetching model of helper thread and optimized instances were presented and evaluated on commercial CMP platforms Q6600 and I7, the average speedup of betweenness centrality algorithm at different input scale is 1.20 and 1.11 respectively. The experiment results show that helper thread prefetching can improve the performance of irregular applications effectively.

Method to improve the performance of network time delay of EPA system

2014, 35(8):  18-153. 

Asbtract ( 513 )   Knowledge map   

Related Articles | Metrics

In order to improve the performance of network-induced time delay of EPA (Ethernet for plant automation) networked control systems, the interacting mechanism between the control and the communication in EPA system was studied and EPA-CS (EPA cooperative scheduling) method was presented. Through setting their mutually cooperative time slices for function blocks that executed the control tasks and data transmission that executed the communication tasks, and through determining the executing time and frequencies of control tasks in their time slices, the method could accomplish the cooperation between control tasks and communication tasks in EPA system. When the round scanning cycles of devices are very little or there are many function blocks that need network communication in system, the method can effectively reduce the network load to improve the performance of network-induced time delay of EPA system.

Semi-Markov decision process based congestion control algorithm for video transmission

2014, 35(8):  19-161. 

Asbtract ( 609 )   Knowledge map   

Related Articles | Metrics

Due to the problem that the congestion control algorithm of transmission control protocol (TCP) cannot meet the requirements of quality of experience for Internet video transmission, a semi-Markov decision process based congestion control algorithm for video transmission was proposed. First, in order to improve the accuracy of video quality assessment, an online operation no-reference video quality assessment was presented. Then, the congestion control problem was formulated as a semi-Markov decision process according to the feedback of video quality assessment, and the optimal parameters of congestion control were obtained by solving the semi-Markov decision process. Simulation results reveal that proposed algorithm achieves better subjective and objective video quality, and obtains well TCP-friendliness ratio, compared with the conventional congestion control algorithms.

Low-power TCAM for regular expression matching

2014, 35(8):  20-168. 

Asbtract ( 649 )   Knowledge map   

Related Articles | Metrics

A character-indexed regular expression matching algorithm was presented to address the limitations of TCAM power consumption. This algorithm used the idea of separating the alphabet table from the states in deterministic finite automaton (DFA) for building a character index, in order to reduce the number of activated TCAM blocks, which in turn translated low TCAM power. Experimental results showed that proposed algorithm reduces the TCAM power by 92.7% on average as well as the TCAM space usage by 32.0% on average, and improves the matching throughput by 57.9% on average compared to previous solutions based on DFA.

Effective retransmission in network coding for TCP

2014, 35(8):  21-178. 

Asbtract ( 737 )   Knowledge map   

Related Articles | Metrics

Theoretical analysis for evaluating the decoding delay and redundancy of the different retransmission schemes show that the feedback based retransmission scheme has a lower decoding delay than the scheme with a fixed retransmission rate, whereas these schemes which retransmit packets containing all packets in the coding window are deeply influenced by the loss rate. Therefore a novel network coding retransmission scheme which uses the implicit information of seen scheme to acquire the number of packets the receiver needs for decoding packets is proposed, the encoding rules of retransmission to let a part of packets decodable in advance are changed. Proposed scheme can work well on handling not only random losses but bursty losses in reducing decoding delay. More important, it isn’t influenced by the loss rate, and thus can effectively mask losses. Simulation results show that the new scheme significantly outperforms the previous coding approach in reducing decoding delay and increasing throughput at the same time. It is more possible to be implemented in practical systems.

Equivalent characterization of resilient rotation symmetric functions with q number of variables over GF(p)

2014, 35(8):  22-183. 

Asbtract ( 579 )   Knowledge map   

Related Articles | Metrics

Baesd on the property of the l-value support tables of the resilient rotation symmetric functions (RSF) with q number of variables, an equivalent characterization on the resilient RSF with q number of variables is derived. It is proved that construction of the resilient RSF with q number of variables are equivalent to solve an equation system. At last, the count of resilient RSF with q number of variables are represented by using all the solutions of the equation system.

Survey of research on future network architectures

2014, 35(8):  23-197. 

Asbtract ( 1584 )   Knowledge map   

Related Articles | Metrics

Nowadays, the Internet is facing unprecedented challenges, including scalability, security, management, mobility, content distribution capability, and energy saving, etc., which are difficult to solve through incremental development. In such context, it is a hot field of global focus to develop an innovative future network architecture. Firstly, The global progress in this field is introduced. Then the main current research results are described. Finally, the development trends and core problems in this field are discussed. It is expected to be helpful for the domestic research in the related fields.

Research of cross-tier cooperative transmission technology in heterogeneous network

2014, 35(8):  24-205. 

Asbtract ( 811 )   Knowledge map   

Related Articles | Metrics

A cross-tier cooperative transmission strategy with cooperative precoding is used to reduce the intercell interference in heterogeneous network, especially the interference in cell range expansion areas. The proposed cooperative strategy supports the cooperative transmission of Macro BS and low power BS at resource block level based on LTE-Advanced downlink transmission system. Simulation results indicate that the cooperative strategy based on hierarchical cooperative framework provides more satisfactory system throughput gains compared with non-cooperative scheme and the existing eICIC technology under cell range expansion.

HPEngine: high performance XACML policy evaluation engine based on statistical analysis HPEngine: high performance XACML policy evaluation engine based on statistical analysis

2014, 35(8):  25-215. 

Asbtract ( 619 )   Knowledge map   

Related Articles | Metrics

To improve the efficiency of the XACML(eXtensible access control markup language) policy evaluation engine under distributed environment, a novel XACML policy evaluation engine, HPEngine was proposed. The HPEngine dynamically refined policies based on statistical analysis of the policy optimization mechanism first and transformed text form of policy into numerical afterward. Moreover, the engine adopted the multi-level caching mechanism based on the statistical analysis to store frequently called request-results, attributes and policy information. Emulation results show that multi-level optimization mechanisms based on the statistical analysis applied in HPEngine significantly reduce the size of policies, decrease the communication cost between the engine and other components, lessen the amount of matching operation and improve the speed of matching. Comparative analysis demonstrates that HPEngine is obviously better in performance than other similar systems.

Provably secure and efficient proxy signature scheme

2014, 35(8):  26-222. 

Asbtract ( 555 )   Knowledge map   

Related Articles | Metrics

The size of proxy signature secret key in proxy signature scheme based on lattice basis delegation in fixed dimension or bonsai tree is greater than that of original signature secret key. Aiming at the situation above, a new efficient proxy signature scheme is proposed. The random oracles are combined in the scheme and a smaller vector norm blind message is used to control the dimension of proxy signature secret key. The security of proposed scheme is based on the hardness of shortest vector problem and small integer solution problem, and the scheme satisfies the security requirements of a proxy signature scheme. Compared with other schemes over lattice, the size of proxy signature secret key and proxy signature is reduced, and the size of proxy signature secret key is equivalent to that of the original signature secret key in magnitude.

Academic paper

Adaptive compressed spectrum sensing based on optimized measurement matrix

Wei-gang WANG,Zhen YANG,Bin GU,Hai-feng HU

2014, 35(8):  33-39.  doi:10.3969/j.issn.1000-436x.2014.08.005

Asbtract ( 313 )   HTML ( 4)   PDF (800KB) ( 511 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The estimation error of reconstruction by adaptive compressed sensing was derived, and the column vector autocorrelation of the observation matrix was reduced, and the impact of optimization process on compressed sensing re-construction algorithm was analyzed. Combining the observation matrix optimization and adaptive process, the spectrum sensing algorithm of optimized adaptive compression based on observation matrix was proposed. The simulation results show that the mean square error (MSE) of proposed algorithm is lower than traditional algorithm, and the probability of detection of proposed algorithm is higher on the same number of observations, and the required number of observations is fewer when achieving the same receiver operating performance (ROC).

Semi-supervised learning by constructing query-document heterogeneous information network

Yu-feng LIU,Ren-fa LI

2014, 35(8):  40-47.  doi:10.3969/j.issn.1000-436x.2014.08.006

Asbtract ( 169 )   HTML ( 0)   PDF (1162KB) ( 421 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Various graph-based algorithms for semi-supervised learning have been proposed in recent literatures. How-ever, although classification on homogeneous networks has been studied for decades, classification on heterogeneous networks has not been explored until recently. The semi-supervised classification problem on query-document heteroge-neous information network which incorporate the bipartite graph with the content information from both sides is consid-ered. In order to strengthen the network structure, class information of sample nodes is introduced. A semi-supervised learning algorithm based on two frameworks including the novel graph-based regularization framework and the iterative framework is investigated. In the regularization framework, a new cost function to consider the direct relationship be-tween two entity sets and the content information from both sides which leads to a significant improvement over the baseline methods is developed. Experimental results demonstrate that proposed method achieves the best performance with consistent and promising improvements.

Non-orthogonal multiple-access system SC-FDMA-IDMA with iterative block equalization

De-liang LIU,Qiang HUANG,Da-zhuan XU

2014, 35(8):  48-55.  doi:10.3969/j.issn.1000-436x.2014.08.007

Asbtract ( 303 )   HTML ( 0)   PDF (1126KB) ( 420 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As a new non-orthogonal multiple-access scheme, SC-FDMA-IDMA combines two technologies of SC-FDMA and IDMA together. This combination makes SC-FDMA-IDMA have the probability to inherit different advantages of these two technologies such as large system capacity, low peak-to-average power ratio (PAPR) and simple multiuser de-tection. However, because SC-FDMA for the transmission of different users' signal is a special form of single carrier modulation, the system performance may degrade quickly when the frequency selectivity of channel is serious. So the it-erative block decision feedback equalization (IB-DFE) algorithm applied to the SC-FDMA-IDMA system is derived in order to enhance the ability of anti-frequency selective fading. Simulation results show that comparing with the sin-gle-user SC-FDMA system with high-order modulation, the multiuser SC-FDMA-IDMA system with low-order modula-tion has great performance improvement after adopting the IB-DFE algorithm on condition that these two systems have the same transmission efficiency.

Optimized algorithm for value iteration based on topological sequence backups

Wei HUANG,Quan LIU,Hong-kun SUN,Qi-ming FU,HOUXiao-ke Z

2014, 35(8):  56-62.  doi:10.3969/j.issn.1000-436x.2014.08.008

Asbtract ( 226 )   HTML ( 1)   PDF (1993KB) ( 560 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the convergence performance, an optimized value iteration based on topological sequence backups, VI-TS, is proposed. The key idea of VI-TS is to circumvent the problem of unnecessary backups by dividing an MDP into strongly-connected components and solving these components in topological sequences after detecting the structure of MDP. The experiment results show that VI-TS has a better convergence performance and robustness for state space growth when applied to classical planning experiment scenarios.

Research on optimal parallel routing and wide diameter of unidirectional double-loop networks

Hui LIU,Zhen ZHANG,Mu-yun FANG,GXiao ZHEN,Ye-bin CHEN

2014, 35(8):  63-70.  doi:10.3969/j.issn.1000-436x.2014.08.009

Asbtract ( 201 )   HTML ( 2)   PDF (1745KB) ( 446 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new method to research optimal parallel routing of unidirectional double-loop networks (DLN) is presented based on Cartesian coordinates. Firstly, the ditributed model of copy nodes is obtained under the research on the distrib-uted rules of the copy nodes of nodes on both X axis and Y axis in the minium distance diagram(MDD). Using this ditrib-uted model of copy nodes, the optimal parallel routing method is provided, as well as calculating method of wide diame-ter of DLN. Secondly, the parallel distance diagram(PDD) of DLN which is expanded by MDD is designed and simulated. Based on the PDD, a method to find two shortest parallel pathes quickly without any repeating node was proposed. At last, the simulation of the distribution of wide diameter of DLN is given. The result of simulation indicates that the character-istic of wide diameter distribution is reposeful undulation. Compared with traditional routing method, optimal parallel routing method improved the transition efficiency of DLN obviously based on the simulation results.

Fused access control scheme for sensitive data sharing

Xi-xi YAN,Tao GENG

2014, 35(8):  71-77.  doi:10.3969/j.issn.1000-436x.2014.08.010

Asbtract ( 256 )   HTML ( 5)   PDF (1058KB) ( 571 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve security of sensitive data sharing and distributing, fused access control scheme based on the mechanism of attribute-based encryption (ABE) and usage control (UCON) was proposed. The scheme could ensure data confidentiality in the storage, distribution process and control sensitive data sharing scope with dynamic access poli-cies. Additionally, the scheme can prevent legal users operating sensitive data illegally and prohibit privilege abuse for domain user.The results of security analysis and efficiency analysis show that fused access control scheme alleviates the administering burdens on data management server and realizes secure storage and distribution for sensitive data.

Malware detection technology analysis and applied research of android platform

Wei-ping WEN,Rui MEI,Ge NING,Liang-liang WANG

2014, 35(8):  78-85.  doi:10.3969/j.issn.1000-436x.2014.08.011

Asbtract ( 624 )   HTML ( 29)   PDF (898KB) ( 2727 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For the Android platform security problem, a mobile client and server collaborative malware detection pro-posal was proposed, where mobile client application was mainly based on permission detection technology and imple-mented lightweight testing. The server-side detection system is mainly responsible for testing suspicious samples submit-ted by the mobile terminals, meanwhile implements the functions of software behavior analysis, signature library updates, and mobile client synchronization, etc. The server-side detection techniques include permission-based detection technol-ogy, bytecode-based static detection technology and root-based dynamic detection technology. The result of the experi-ment shows that the three detection techniques can achieve better detection results.

DTW-based multi-wavelet data compression algorithm for wireless sensor networks

Si-wang ZHOU,Lan LI

2014, 35(8):  86-94.  doi:10.3969/j.issn.1000-436x.2014.08.012

Asbtract ( 255 )   HTML ( 1)   PDF (1127KB) ( 366 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A data compression algorithm for wireless sensor networks based on DTW and multi-wavelet transform is pro-posed. Firstly, the correlation and warping path of asynchronous data point pairs is introduced, and then an iterative algo-rithm for solving DTW warping path with maximal similarity is designed. Secondly, a best match point algorithm is pre-sented, which employs prediction to estimate the relationship of synchronous data vectors and then find out the best match points. A sensory data matrix with maximal correlation is thus obtained. Afterwards, a multi-wavelet transform is introduced, which is capable of utilizing the spatial correlation of sensory data matrix and solving the row-column asym-metry problem. Experiment results show that proposed method has higher energy concentration ratio, better reconstruc-tion accuracy and lower running time compared to the traditional distributed wavelet compression algorithm.

Research of platform identity attestation based on trusted chip

Qian-ying ZHANG,Deng-guo FENG,Shi-jun ZHAO

2014, 35(8):  94-106.  doi:10.3969/j.issn.1000-436x.2014.08.013

Asbtract ( 351 )   HTML ( 10)   PDF (1645KB) ( 906 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

By studying the platform identity attestation base on trusted third parties, a scheme where a trusted computing platform is identified by a certificate and a token is proposed. In this scheme, only the token is used when the platform proves its identity. Compared to other schemes, this scheme not only has much lower calculation and communication, but also convinces the verifier of the trustworthiness of the client's platform state during the platform identity attestation. A detailed security proof of the proposed scheme is presented by using the protocol composition logic, and the proof shows that the scheme satisfies correctness and anonymity of platform identity verification. The experiment result in a devel-oped prototype system shows that the proposed scheme provides good performances in computation and communication, and is especially suitable for the wireless network.

Survivability evaluation of network information system based on the cloud model and analytic hierarchy process

Yan-hua LIU,Guo-long CHEN,Rui-fen WU

2014, 35(8):  107-115.  doi:10.3969/j.issn.1000-436x.2014.08.014

Asbtract ( 195 )   HTML ( 1)   PDF (776KB) ( 685 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Considering the problem of quantitative evaluation for qualitative survivability data and indexes of network information systems, the proposed method gives a multi-level survivability evaluation framework based on cloud model theory and AHP method. The algorithm builts a multi-level evaluation indexes system and compute the weight of each index using AHP method. Moreover, a quantitative method for qualitative data and a fuzzy evaluation method are de-signed via multidimensional cloud model. Finally, the experimental results show that the proposed method achieves a satisfactory result in quantitative evaluation of complex qualitative indexes, and has certain advantages in terms of accu-racy and fuzzy computing.

LBS-oriented location privacy protection model and scheme

Song-tao YANG,Chun-guang MA,Chang-li ZHOU

2014, 35(8):  116-124.  doi:10.3969/j.issn.1000-436x.2014.08.015

Asbtract ( 288 )   HTML ( 1)   PDF (888KB) ( 770 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A location privacy protection model was proposed based on the central server structure, designed a location privacy protection scheme based on pseudo-random permutation for the model. Proposed scheme builds on k-anonymous and secret information retrieval technology design concept and methods, achieves a blind query and perfect anonymous. This scheme has been proven to have untraceability and unlinkability, and the efficiency is analyzed as well.

Research on malicious code variants detection based on texture fingerprint

Xiao-guang HAN,UWu Q,AOXuan-xia Y,UOChang-you G,Fang ZHOU

2014, 35(8):  125-136.  doi:10.3969/j.issn.1000-436x.2014.08.016

Asbtract ( 668 )   HTML ( 25)   PDF (1112KB) ( 3068 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A texture-fingerprint-based approach is proposed to extract or detect the feature from malware content. The texture fingerprint of a malware is the set of texture fingerprints for each uncompressed gray-scale image block. The ma-licious code is mapped to uncompressed gray-scale image by integrating image analysis techniques and variants of mali-cious code detection technology. The uncompressed gray-scale image is partitioned into blocks by the texture segmen-tation algorithm. The texture fingerprints for each uncompressed gray-scale image block is extracted by gray-scale co-occurrence matrix algorithm. Afterwards, the index structure for fingerprint texture is built on the statistical analy-sis of general texture fingerprints of malicious code samples. In the detection phase, according to the generation policy for malicious code texture fingerprint, the prototype system for texture fingerprint extraction and detection is con-structed by employing the integrated weight method to multi-segmented texture fingerprint similarity matching to de-tect variants and unknown malicious codes. Experimental results show that the malware variants detection system based on the proposed approach has good performance not only in speed and accuracy but also in identifying malware variants.

Multi-core helper thread prefetching for irregular data intensive applications

Jian-xun ZHANG,Zhi-min GU,Xiao-han HU,Min CAI

2014, 35(8):  137-146.  doi:10.3969/j.issn.1000-436x.2014.08.017

Asbtract ( 234 )   HTML ( 1)   PDF (2970KB) ( 757 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Big data analysis applications often use sparse graph traversal algorithm which characterized by irregular data intensive memory access. For improving performance of memory access in sparse graph traversal algorithm, helper thread prefetching could convert discontinuous locality into continuous-instant spatial-temporal locality effectively by using the shared last level cache of chip multi-processor platforms. Betweenness centrality algorithm was used as a case study, the multi-parameter prefetching model of helper thread and optimized instances were presented and evaluated on commercial CMP platforms Q6600 and I7, the average speedup of betweenness centrality algorithm at different input scale is 1.20 and 1.11 respectively. The experiment results show that helper thread prefetching can improve the perform-ance of irregular applications effectively.

Method to improve the performance of network time delay of EPA system

Ning LIU,Chong-quan ZHONG,Yao-yao LIN

2014, 35(8):  147-153.  doi:10.3969/j.issn.1000-436x.2014.08.018

Asbtract ( 242 )   HTML ( 0)   PDF (1341KB) ( 428 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the performance of network-induced time delay of EPA (Ethernet for plant automation) networked control systems, the interacting mechanism between the control and the communication in EPA system was studied and EPA-CS (EPA cooperative scheduling) method was presented. Through setting their mutually cooperative time slices for function blocks that executed the control tasks and data transmission that executed the communication tasks, and through determining the executing time and frequencies of control tasks in their time slices, the method could accomplish the cooperation between control tasks and communication tasks in EPA system. When the round scanning cy-cles of devices are very little or there are many function blocks that need network communication in system, the method can effectively reduce the network load to improve the performance of network-induced time delay of EPA system.

Semi-Markov decision process based congestion control algorithm for video transmission

Bo TIAN,Yi-min YANG,Shu-ting CAI

2014, 35(8):  154-161.  doi:10.3969/j.issn.1000-436x.2014.08.019

Asbtract ( 282 )   HTML ( 5)   PDF (1345KB) ( 700 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the problem that the congestion control algorithm of transmission control protocol (TCP) cannot meet the requirements of quality of experience for Internet video transmission, a semi-Markov decision process based conges-tion control algorithm for video transmission was proposed. First, in order to improve the accuracy of video quality as-sessment, an online operation no-reference video quality assessment was presented. Then, the congestion control problem was formulated as a semi-Markov decision process according to the feedback of video quality assessment, and the opti-mal parameters of congestion control were obtained by solving the semi-Markov decision process. Simulation results re-veal that proposed algorithm achieves better subjective and objective video quality, and obtains well TCP-friendliness ra-tio, compared with the conventional congestion control algorithms.

Low-power TCAM for regular expression matching

Lin-xuan DING,Kun HUANG,Da-fang ZHANG

2014, 35(8):  162-168.  doi:10.3969/j.issn.1000-436x.2014.08.020

Asbtract ( 282 )   HTML ( 5)   PDF (1657KB) ( 564 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A character-indexed regular expression matching algorithm was presented to address the limitations of TCAM power consumption. This algorithm used the idea of separating the alphabet table from the states in deterministic finite automaton (DFA) for building a character index, in order to reduce the number of activated TCAM blocks, which in turn translated low TCAM power. Experimental results showed that proposed algorithm reduces the TCAM power by 92.7% on average as well as the TCAM space usage by 32.0% on average, and improves the matching throughput by 57.9% on average compared to previous solutions based on DFA.

Effective retransmission in network coding for TCP

Jing CHEN,Xue-peng SONG,Fang LIU

2014, 35(8):  169-178.  doi:10.3969/j.issn.1000-436x.2014.08.021

Asbtract ( 280 )   HTML ( 3)   PDF (839KB) ( 239 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Theoretical analysis for evaluating the decoding delay and redundancy of the different retransmission schemes show that the feedback based retransmission scheme has a lower decoding delay than the scheme with a fixed retransmis-sion rate, whereas these schemes which retransmit packets containing all packets in the coding window are deeply influ-enced by the loss rate. Therefore a novel network coding retransmission scheme which uses the implicit information of seen scheme to acquire the number of packets the receiver needs for decoding packets is proposed, the encoding rules of retransmission to let a part of packets decodable in advance are changed. Proposed scheme can work well on handling not only random losses but bursty losses in reducing decoding delay. More important, it isn't influenced by the loss rate, and thus can effectively mask losses. Simulation results show that the new scheme significantly outperforms the previous coding approach in reducing decoding delay and increasing throughput at the same time. It is more possible to be imple-mented in practical systems.

Equivalent characterization of resilient rotation symmetric functions with q number of variables over GF(p)

Jiao DU,Shan-qi PANG,Qiao-yan WEN,GJie ZHAN

2014, 35(8):  179-183.  doi:10.3969/j.issn.1000-436x.2014.08.022

Asbtract ( 198 )   HTML ( 0)   PDF (925KB) ( 292 )   Knowledge map   

References | Related Articles | Metrics

Baesd on the property of the l-value support tables of the resilient rotation symmetric functions (RSF) with q number of variables, an equivalent characterization on the resilient RSF with q number of variables is derived. It is proved that construction of the resilient RSF with q number of variables are equivalent to solve an equation system. At last, the count of resilient RSF with q number of variables are represented by using all the solutions of the equation system. Key words: rotation symmetric functions; l-value support table; orthogonal arrays; resilient functions

Comprehensive Review

Survey of research on future network architectures

Tao HUANG,Jiang LIU,Ru HUO,Liang WEI,Yun-jie LIU

2014, 35(8):  184-197.  doi:10.3969/j.issn.1000-436x.2014.08.023

Asbtract ( 991 )   HTML ( 90)   PDF (1897KB) ( 4248 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Nowadays, the Internet is facing unprecedented challenges, including scalability, security, management, mobil-ity, content distribution capability, and energy saving, etc., which are difficult to solve through incremental development. In such context, it is a hot field of global focus to develop an innovative future network architecture. Firstly, The global progress in this field is introduced. Then the main current research results are described. Finally, the development trends and core problems in this field are discussed. It is expected to be helpful for the domestic research in the related fields.

Correspondences

Research of cross-tier cooperative transmission technology in heterogeneous network

GChen ZHAN,Xin SU,Wen-qing WANG,Jie ZENG,Yu-jun KUANG

2014, 35(8):  198-205.  doi:10.3969/j.issn.1000-436x.2014.08.024

Asbtract ( 354 )   HTML ( 8)   PDF (1939KB) ( 666 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A cross-tier cooperative transmission strategy with cooperative precoding is used to reduce the intercell inter-ference in heterogeneous network, especially the interference in cell range expansion areas. The proposed cooperative strategy supports the cooperative transmission of Macro BS and low power BS at resource block level based on LTE-Advanced downlink transmission system. Simulation results indicate that the cooperative strategy based on hierar-chical cooperative framework provides more satisfactory system throughput gains compared with non-cooperative scheme and the existing eICIC technology under cell range expansion.

HPEngine: high performance XACML policy evaluation engine based on statistical analysis

De-hua NIU,Jian-feng MA,Zhuo MA,Chen-nan LI,Lei WANG

2014, 35(8):  206-215.  doi:10.3969/j.issn.1000-436x.2014.08.025

Asbtract ( 266 )   HTML ( 2)   PDF (1651KB) ( 577 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the efficiency of the XACML(eXtensible access control markup language) policy evaluation en-gine under distributed environment, a novel XACML policy evaluation engine, HPEngine was proposed. The HPEngine dynamically refined policies based on statistical analysis of the policy optimization mechanism first and transformed text form of policy into numerical afterward. Moreover, the engine adopted the multi-level caching mechanism based on the statistical analysis to store frequently called request-results, attributes and policy information. Emulation results show that multi-level optimization mechanisms based on the statistical analysis applied in HPEngine significantly reduce the size of policies, decrease the communication cost between the engine and other components, lessen the amount of matching op-eration and improve the speed of matching. Comparative analysis demonstrates that HPEngine is obviously better in per-formance than other similar systems.

Provably secure and efficient proxy signature scheme

Jie ZENG,Wei NIE

2014, 35(8):  216-222.  doi:10.3969/j.issn.1000-436x.2014.08.026

Asbtract ( 163 )   HTML ( 5)   PDF (1366KB) ( 451 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The size of proxy signature secret key in proxy signature scheme based on lattice basis delegation in fixed di-mension or bonsai tree is greater than that of original signature secret key. Aiming at the situation above, a new efficient proxy signature scheme is proposed. The random oracles are combined in the scheme and a smaller vector norm blind message is used to control the dimension of proxy signature secret key. The security of proposed scheme is based on the hardness of shortest vector problem and small integer solution problem, and the scheme satisfies the security require-ments of a proxy signature scheme. Compared with other schemes over lattice, the size of proxy signature secret key and proxy signature is reduced, and the size of proxy signature secret key is equivalent to that of the original signature secret key in magnitude.