Current Issue

25 April 2013, Volume 34 Issue 4

Previous Issue    Next Issue

Social network model based on the transmission of information

2013, 34(4):  1-9. 

Asbtract ( 1798 )   Knowledge map   

Related Articles | Metrics

The topology modeling of the social network is propitious to understanding the transmission process of information and the topology characteristic of the real friendship network. Considering the directed characteristic of information spread, the dynamic process of information dissemination was simulated, and moreover, the weighted directed topology model in order to well emulate the topology structure of the social network was constructed. Simulation results show the degree and strength distribution as well as the correlation between degree and strength of the network generate by the topology model embody obvious power-law characteristic, and meanwhile, through analyzing the clustering coefficient, coreness and Gini coefficient of the network, the generated network has the characteristics of clustering, layer and heterogeneity which are shown in the real friendship network is verified.

Academic paper

Social network model based on the transmission of information

Yan-heng LIU,Fei-peng LI,Xin SUN,Jian-qi ZHU

2013, 34(4):  1-9.  doi:10.3969/j.issn.1000-436x.2013.04.001

Asbtract ( 452 )   HTML ( 25)   PDF (345KB) ( 989 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The topology modeling of the social network is propitious to understanding the transmission process of information and the topology characteristic of the real friendship network.Considering the directed characteristic of information spread,the dynamic process of information dissemination was simulated,and moreover,the weighted directed topology model in order to well emulate the topology structure of the social network was constructed.Simulation results show the degree and strength distribution as well as the correlation between degree and strength of the network generate by the topology model embody obvious power-law characteristic,and meanwhile,through analyzing the clustering coefficient,coreness and Gini coefficient of the network,the generated network has the characteristics of clustering,layer and heterogeneity which are shown in the real friendship network is verified.

Cross-layer multi-channel MAC protocol combined with QoS search for cognitive wireless multi-hop networks

2013, 34(4):  2-18. 

Asbtract ( 1084 )   Knowledge map   

Related Articles | Metrics

In cognitive wireless multi-hop networks, the spectrum resources are highly variable and diverse. A cross-layer multi-channel MAC protocol combined with QoS search was proposed. The protocol combines the on-demand QoS search with dynamic spectrum allocation via cross-layer method, which only permits the transmission nodes to participate in the spectrum allocation and can guarantee the allocation results meet the QoS requirement. Besides, frequency division duplex transceivers are introduced to continuously listen to the common control channel, and an access algorithm is carefully designed to realize hybrid communication between nodes with different number of transceivers. Extensive simulations show that our protocol can efficiently guarantees the QoS requirement for end-to-end transmission and significantly improves end-to-end throughput and delay.

Secure network coding method merged with timestamp and homomorphic signature

2013, 34(4):  4-35. 

Asbtract ( 1075 )   Knowledge map   

Related Articles | Metrics

A secure network coding method merged with timestamp and homomorphic signature which can solve security issues in wireless multi-hop networks was proposed. The timestamp into RSA-based homomorphic signature scheme was brought and used to produce random coefficients of network coding, thus made it possible to defend pollution attacks and replay attacks simultaneously while maintaining the homomorphic property of the signature. The analysis that mainly focus on was the influence of random coefficients on decoding probability of network coding and security of the proposed scheme. Results indicate that the proposed scheme can defend pollution attacks and replay attacks simultaneously, and the ratio of overhead between RSA-based homomorphic signature scheme and the proposed scheme is approximates 1.

Opportunistic Network coding based on prediction

2013, 34(4):  5-46. 

Asbtract ( 1015 )   Knowledge map   

Related Articles | Metrics

Since pure theory network coding had some drawbacks in practical network, however current opportunistic network coding fully depends on overheard information. Thus, in a radically different way from network coding optimization, a novel opportunistic network coding scheme was proposed which was based on prediction (ONCP). The main idea of ONCP was：firstly, arrival time of next packet in a node was predicted for the self-similarity of network traffic; secondly, encoding time, waiting time for coding, transmission time and other factors were taken into account together to determine whether this packet was coded in this node. A theorem—maximum waiting time for was proved network coding in order to obtain throughput gain. Simulation results show that ONCP improves throughput by 15% compared to pure theory network coding and by 21% compared to traditional store-forward. ONCP can also effectively reduce energy con-sumption while improving throughput.

Distributed trust model based on parameter modeling

2013, 34(4):  6-59. 

Asbtract ( 975 )   Knowledge map   

Related Articles | Metrics

A distributed trust model based on parameter modeling was proposed. Nine functional parameters were extracted after investigating the trust mechanism and current trust models. These parameters included flexibility, subjectivity, fuzziness, time decay property, transitivity, anti-attacks property, rewards & punishment property, sensitivity and scalability. Each parameter was modeled and integrated to form a comprehensive trust model. Analytical results indicate that the proposed trust model satisfies all the nine functional parameters and thus has fair universality. Experimental results show that the proposed trust model is reasonable and effective. Comparisons with previous algorithms indicate that the performance of the proposed trust model has been improved.

Small target detection based on modified local reverse entropy operator

2013, 34(4):  7-69. 

Asbtract ( 1078 )   Knowledge map   

Related Articles | Metrics

A small-target detection approach was proposed, which is based on the modified local reverse entropy operator and the improved region growing technology. The approach adopted the fact that the emergence of small target could lead to the large change of local reverse entropy. The proposed approach made use of the local reverse entropy map to suppress the small-target image background, and then adopted the improved region growing technique to effectively detect small targets. Experimental results show that the proposed approach can detect small targets accurately and quickly.

Novel self-renewal hash chain scheme based on (t, n) threshold and division tree

2013, 34(4):  8-81. 

Asbtract ( 1049 )   Knowledge map   

Related Articles | Metrics

The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains, but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity. The definitions of repetition, division and division-tree was proposed, and then a novel self-renewable hash chain construction scheme was put forward based on division and (t, n)-Mignotte's threshold Chinese remainder theorem secret sharing scheme. From three aspects of key space, twice authentication and provable security, it theoretically proves that the proposed hash scheme could ensure the novel seed value regenerated safely and resisting the middle-man attack effectively. Simulation experiments demonstrate that the novel scheme obtains equal or more satisfactory performances on the costs of communication, computation and storage than typical schemes.

Provable secure mutual authentication protocol for RFID in the standard model

2013, 34(4):  9-87. 

Asbtract ( 1072 )   Knowledge map   

Related Articles | Metrics

The security issue of RFID is becoming more and more serious, in order to protect the RFID’s information security and privacy, a mutual authentication protocol for RFID based on HB protocol was proposed in the standard model. The security proofs for this novel protocol was given by using the reduction method, and the attacker’s hardness was reduced to the indistinguishability between pseudo-random function and real random function. The implementation of proposed protocol only required lightweight pseudo-random generator and vector dot product operation and provided higher security and efficiency. The comparisons of security and performance were also given with other authentication protocols, the results show that the proposed protocol is feasible for RFID tags which are low cost and resource-constrained.

Cryptanalysis of a hybrid-structured onion routing scheme

2013, 34(4):  10-98. 

Asbtract ( 1050 )   Knowledge map   

Related Articles | Metrics

SHI Jin-qiao et al’s hybrid-structured onion routing scheme was analysed and some security flaws were found in their design. The first flaw was derived from the malleability of its cryptographic message format which could be exploited by attackers to redirect an onion message or embed tags into it for tracing its routing path. The second flaw was the vulnerability of relay servers to chosen ciphertext attack. Three different attacks were presented that each broke the sender-receiver unlinkability entirely at a relatively low cost. To evade these attacks, a modified scheme was also proposed which could capture malicious nodes by using upstream investigation.

Academic paper

Cross-layer multi-channel MAC protocol combined with QoS search for cognitive wireless multi-hop networks

Jie SUN,Wei GUO

2013, 34(4):  10-18.  doi:10.3969/j.issn.1000-436x.2013.04.002

Asbtract ( 143 )   HTML ( 2)   PDF (330KB) ( 278 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In cognitive wireless multi-hop networks,the spectrum resources are highly variable and diverse.A cross-layer multi-channel MAC protocol combined with QoS search was proposed.The protocol combines the on-demand QoS search with dynamic spectrum allocation via cross-layer method,which only permits the transmission nodes to participate in the spectrum allocation and can guarantee the allocation results meet the QoS requirement.Besides,frequency division duplex transceivers are introduced to continuously listen to the common control channel,and an access algorithm is carefully designed to realize hybrid communication between nodes with erent number of transceivers.Extensive simulations show that our protocol can efficiently guarantees the QoS requirement for end-to-end transmission and significantly improves end-to-end throughput and delay.

Auction based bandwidth allocation mechanism for P2P content distribution networks

2013, 34(4):  11-105. 

Asbtract ( 1099 )   Knowledge map   

Related Articles | Metrics

Unreasonable allocation of originally scarce bandwidth was a severe problem in the P2P content distribution networks. To solve the problem and suppress the node’s selfishness, an auction-based bandwidth allocation mechanism for P2P networks was proposed. Through the effective bandwidth payment scheme, the selfish nodes had no incentives to lie and provided the real bandwidth requirements. Also the “tragedy of the commons” could be avoided by the nodes’ healthy bandwidth competition. To adapt to the distributed nature of the P2P networks, the algorithm was implemented in parallel at resource providing nodes and request nodes. Simulation results show that the scheme not only suppresses free riding nodes efficiently in the system, but also shortens the average completion time for content distribution and decreases the ratio of data uploaded by the source server.

Construction and analysis of one class of cryptographic functions

2013, 34(4):  12-113. 

Asbtract ( 1029 )   Knowledge map   

Related Articles | Metrics

A novel class of n+t-variable Boolean functions G(x,y) through adding t variables while concatenating t+1 Boolean functions (called basic function) was constructed and the Walsh spectrum and autocorrelation coefficient of G(x,y) were given. The relationship between G(x,y) and basic functions by Krawtchouk polynomial and Krawtchouk matrix was studied. Moreover, their cryptographic properties: correlation immunity, propagation and algebraic immunity were investigated. Specially, the detailed relationship between G(x,y) and basic functions when t=2 was analyzed. In additional, a novel class of multioutput Boolean functions by generalizing the method was constructed and the general Walsh spectrum of the class of multioutput Boolean functions was proposed. Correlation immunity and algebraic immunity of the class of multioutput Boolean functions were analyzed.

Smart fuzzing method based on comparison algorithm of control flow sequences

2013, 34(4):  13-121. 

Asbtract ( 961 )   Knowledge map   

Related Articles | Metrics

Flowing the way introduced in the research of evolutionary fuzzing system (EFS), a smart fuzzing method was proposed based on the node comparison algorithm among the control flow sequences. Through mapping program execution flow sequences onto the control flow sequences, the isomorphism relationship between dada search space and program logic space was established. The analyzed results prove that the method is capable of mining a mass of information from group data effectively, and is able to fully utilize the parallelism of genetic algorithm to guide the fuzzing test.

Hardware Trojans detection based on projection pursuit

2013, 34(4):  14-126. 

Asbtract ( 1025 )   Knowledge map   

Related Articles | Metrics

A novel hardware Trojans detection technique using the side channel signals of chips was proposed. Based on the projection pursuit with absolute information divergence index, this technique could find out the data structure enables reflect high dimension special rules without obvious information loss, so as to attain the goal of feature abstraction and identification on side channel signals of IC chips. The detection experiment against an exemplary AES-128 hardware Trojan circuit showed that the technique could distinguish the difference of side channel signal’s feature between the genuine chip and tested chip, and consequently could detect the existence of the hardware Trojan.

Adaptive extraction method of network application signatures

2013, 34(4):  15-137. 

Asbtract ( 961 )   Knowledge map   

Related Articles | Metrics

An adaptive application signature extraction method (AdapSig) was proposed. AdapSig firstly extracted keyword sequences from payloads of packets, and then negative examples and redundancy filter were used to generate candidate signatures. An adaptive mechanism based on self-identification rate was applied to select the final signature. Experimental results show that application signatures extracted by AdapSig have high accuracy for various protocols.

Blind frequency tracking based on time-domain spreading for MB-OFDM-UWB systems

2013, 34(4):  16-143. 

Asbtract ( 985 )   Knowledge map   

Related Articles | Metrics

A blind carrier frequency offset (CFO) tracking algorithm based on time-domain spreading (TDS) was proposed for multiband orthogonal frequency division multiplexing ultra wide band systems. The scheme uses data symbols and the mapped TDS ones to develop time and frequency-domain estimators and tracking loops respectively. Simulation results indicate that the proposed scheme has a better performance in tracking accuracy than pilots-aided ones. Under the SNR of 10dB, the mean square root errors of the residual CFO reach 2×10?4, and the bit error rate of the system is 10?6 of magnitude.

RFID dynamic positioning method

2013, 34(4):  17-148. 

Asbtract ( 1030 )   Knowledge map   

Related Articles | Metrics

A novel proximity method-RFID dynamic positioning method was presented, using a moving radio frequency identification (RFID) reader to accurately position the target based on reference tag arrays. The major advantage of the method was that through reading tags without any measurement data, e.g., the time of arrival (TOA) or the received signal strength indication (RSSI), it improved the accuracy of positioning target based on reference tags and a moving reader. The algorithm was simple but useful. Based on the performance of the prototype system, it demonstrated that the proposed system could accurately position in one of the smallest reference tag cell (within dozens of centimeters) and could be deployed easily with low cost, thus has potential application in RFID warehouse management.

Delay-sensitive data allocation scheme for CMT over diversity paths

2013, 34(4):  18-157. 

Asbtract ( 1157 )   Knowledge map   

Related Articles | Metrics

The performance of CMT association degrades remarkably when the performances of parts of paths deteriorate. Based on the analysis of different network configurations, a delay sensitive data allocation scheme was proposed to distribute data to different paths over multi-diversity network with reference of their transmission delay, which is a key factor to the whole performance. Meanwhile, the transmission sequence number of each chunk will also was considered. The result of analysis and simulation reveal the performance of our scheme can achieve much better performance than the original round-robin scheme.

Routing metric based on interference measurement for multi-radio multi-channel wireless mesh networks

2013, 34(4):  19-164. 

Asbtract ( 988 )   Knowledge map   

Related Articles | Metrics

An interference sensing based(ISB) routing metric which mainly depend on the estimation of signal power was introduced for the multi-radio multi-channel wireless mesh networks. The existing metric such like WCETT and iAWARE all have their drawbacks were shown. As shown in the equations of iAWARE, it could be proved that a worse background noise corresponds to a better metric value which was imprecise. The iAWARE to make it suited for the environment with background noise was improved, and the isotonic property was regained. that the Bellman-Ford and Dijkstra algorithm could be deployed in ISB. The simulation results prove the novel algorithm takes the advantages of higher efficiency both in throughput and end to end delays, compared with the traditional ones HopCoMnt, ETT, WCETT and iAWARE.

Academic paper

Energy efficient beamforming scheme for wireless sensor networks

Zhi-chao QIN,Zheng ZHOU,Xiao-chuan ZHAO

2013, 34(4):  19-27.  doi:10.3969/j.issn.1000-436x.2013.04.003

Asbtract ( 142 )   HTML ( 2)   PDF (354KB) ( 724 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the limitation of energy and communication distance for nodes in wireless sensor networks and the characteristics of premature death due to ignoring the energy balance for traditional beamforming schemes,an energy efficient beamforming scheme was proposed.First the impact of the number of nodes,the transmission coefficients,the limited power,and the arrival phase on the network energy consumption is analyzed,and the corresponding design principles are given.Then,the nodes which participate the beamforming are selected based on these principles their transmission coefficients are adjusted according to their residual energy and phase.The analysis and simulation results show that the proposed scheme can effectively increase the number of successful transmission,balance the energy consumption among the nodes and prolong the network lifet me.

Improved ant colony algorithm based on natural selection strategy for solving TSP problem

2013, 34(4):  20-170. 

Asbtract ( 1166 )   Knowledge map   

Related Articles | Metrics

To solve basic ant colony algorithm’s drawbacks of low convergence rate, easiness of trapping in local optimal solution, an improved ant colony algorithm based on natural selection was proposed. The improved algorithm employed evolution strategy of survival the fittest in natural selection to enhance pheromones in paths whose random evolution factor was bigger than threshold of evolution drift factor in each process of iteration. It could accelerate convergence rate effectively. Besides the introduction of random evolution factor reduced probability of trapping local optimal solution notably. The proposed algorithm was applied to classic TSP problem to find better solution for TSP. Simulation results depict the improved algorithm has better optimal solution and higher convergence rate.

Efficient improving community structure strategy for enhancing Internet transmission performance

2013, 34(4):  21-179. 

Asbtract ( 909 )   Knowledge map   

Related Articles | Metrics

An efficient weakening community structure strategy (WCS) by adding links to the existing networks was propose, which can enhance Internet transmission performance. Internet topology reconstruction can be realized by WCS strategy, because lightpaths that represent logical links between nodes can achieve the same high performance as physical links by means of optically bypassing intermediate nodes. The performance of the proposed strategy is investigated in pseudo random networks with community structure，scale-free network with community structure and Internet topology respectively, for both local routing strategy and global shortest-path routing strategy. The experimental results show that the traffic capacity of networks and the average shortest path are considerably improved by adding a few links among communities.

Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error

2013, 34(4):  22-186. 

Asbtract ( 956 )   Knowledge map   

Related Articles | Metrics

Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals, the test times of existing sparsity trial and error algorithms were always large. The novel algorithm, blind sparsity adaptive matching pursuit (BSAMP) was proposed, could recover the original signal fast in the case of unknown sparsity. Firstly, the range of sparsity was determined, and each time half of values in current range were eliminated by trial and error test. Secondly, the number of atoms was twice the sparsity, which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems. Last but not least, the least-squares approximation was pruned by weakly matching for next iteration. The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions.

Linear precoding for interference suppression in multi-cell multi-user TDD MIMO downlink

2013, 34(4):  23-193. 

Asbtract ( 1085 )   Knowledge map   

Related Articles | Metrics

To suppress multi-user interference (MUI) and inter-cell interference (ICI) existing in multi-cell multi-user TDD MIMO downlink, an interference suppression algorithm through designing precoder was proposed. Firstly, a precoding matrix was designed for MUI suppression, with the help of the QR decomposition of generalized MMSE channel inversion. And then the second precoding matrix was designed to suppress ICI and residual MUI, using a signal leakage criterion. The proposed algorithm could utilize TDD MIMO channel reciprocity, and thus did not require users’ feedback information. The algorithm had been simulated in a multi-user TDD MIMO system composed of urban micro-cells. Simulation results show that, the proposed algorithm can effectively improve system capacity and user’s average SINR.

Cascaded algorithm for background modeling using pixel-based and block-based methods

2013, 34(4):  24-200. 

Asbtract ( 891 )   Knowledge map   

Related Articles | Metrics

Block-based background modeling couldn’t obtain the exact shape of foreground, while pixel-based approaches couldn’t handle non-stationary backgrounds effectively. To solve the problem, a hierarchical scheme for background modeling was presented. The hierarchical model used block-based method proposed to obtain coarse background and foreground regions firstly, and then the operations of pixel-level foreground refining and model updating based on Gaussian mixture model were performed on special regions of the input image. These two algorithms in different levels were combined by adopting an asymmetric feed-forward strategy. Experimental results show that the hierarchical method proposed can obtain the exact shape of foreground and process non-stationary scenes well, in addition, it is insensitive to illumination change and can provide better results than any single approach in it, meanwhile, the integrated computation time is shorter than the sum of those of running the block and pixel-level methods, and satisfies real-time processing.

Novel SNR estimation algorithm based on relevance vector machine

2013, 34(4):  26-206. 

Asbtract ( 1002 )   Knowledge map   

Related Articles | Metrics

A new SNR estimation algorithm based on relevance vector machine (RVM) was proposed, it can not only be used under the flat fading channel, but also meet the request of larger estimation range and higher estimation accuracy of PSK. The estimation model was created by using RVM, based on the relation between the SNR and the two-order moments and four-order moments, and the reliable weights of the model can be figured out by straining and studying. Simulation results show that this algorithm has lots of advantages, for example, it uses less data and has larger estimation range than general algorithm, in addition , its estimation accuracy becomes higher in the effective estimation rang, and it is applicable to more modulation signals.

Academic paper

Secure network coding method merged with timestamp and homomorphic signature

Heng-li PEI,Tao SHANG,Jian-wei LIU

2013, 34(4):  28-35.  doi:10.3969/j.issn.1000-436x.2013.04.004

Asbtract ( 222 )   HTML ( 0)   PDF (282KB) ( 769 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A secure network coding method merged with timestamp and homomorphic signature which can solve security issues in wireless multi-hop networks was proposed.The timestamp into RSA-based homomorphic signature scheme was brought and used to produce random coefficients of net it possible to defend pollution attacks and replay attacks simultaneously while maintaining the homomorphic property of the signature.The analysis that mainly focus on was the influence of random coefficients on decoding probability of network coding a security of the proposed scheme.Results indicate that the proposed scheme can defend pollution attacks and replay attacks simultaneously,and the ratio of overhead between RSA-based homomorphic signature scheme and the proposed scheme is approximates 1.

Opportunistic network coding based on prediction

Wai-xi LIU,Shun-zheng YU,Ying GAO,Xiao HU

2013, 34(4):  36-46.  doi:10.3969/j.issn.1000-436x.2013.04.005

Asbtract ( 237 )   HTML ( 0)   PDF (411KB) ( 680 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Since pure theory network coding had some drawbacks in practical network,however current opportunistic network coding fully depends on overheard information.Thus,in a radically different way from network coding optimization,a novel opportunistic network coding scheme was proposed which was based on prediction (ONCP).The main idea of ONCP was firstly,arrival time of next packet in a node was predicted for the self-similarity of network traffic;:secondly,encoding time,waiting time for coding,transmission time and other factors were taken into account together to determine whether this packet was coded in this node.A theorem—maximum waiting time for was proved network coding in order to obtain throughput gain.Simulation results show that ONCP improves throughput by 15% compared to pure theory network coding and by 21% compared to traditional store-forward.ONCP can also effectively reduce energy consumption while improving throughput.

Distributed trust model based on parameter modeling

Jing-pei WANG,Bin SUN,Xin-xin NIU,Yi-xian YANG

2013, 34(4):  47-59.  doi:10.3969/j.issn.1000-436x.2013.04.006

Asbtract ( 314 )   HTML ( 6)   PDF (495KB) ( 496 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A distributed trust model based on parameter modeling was posed.Nine functional parameters were extracted after investigating the trust mechanism and current trust models.These parameters included flexibility,subjectivity,fuzziness,time decay property,transitivity,anti-attacks property,rewards ＆amp; punishment property,sensitivity and scalability.Each parameter was modeled and integrated to form a comprehensive trust model.Analytical results indicate that the proposed trust model satisfies all the nine functional parameters and thus has fair universality Experimental results show that the proposed trust model is reasonable and effective.Comparisons with previous algorithms indicate that the performance of the proposed trust model has been improved.

Small target detection based on modified local reverse entropy operator

He DENG,Yan-tao WEI,Ming-wen TONG,Shao-cheng QU

2013, 34(4):  60-69.  doi:10.3969/j.issn.1000-436x.2013.04.007

Asbtract ( 288 )   HTML ( 9)   PDF (434KB) ( 554 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A small-target detection approach was proposed,which is based on the modified local reverse entropy operator and the improved region growing technology.The approa adopted the fact that the emergence of small target could lead to the large change of local reverse entropy.The proposed approach made use of the local reverse entropy map to suppress the small-target image background,and then adopted the improved region growing technique to effectively detect small targets.Experimental results show that the proposed approach can detect small targets accurately and quickly.

Novel self-renewal hash chain scheme based on (t,n) threshold and division tree

Hai-ping HUANG,Ting DAI,Ru-chuan WANG,Xiao-lin QIN,Jiu-tian CHEN

2013, 34(4):  70-81.  doi:10.3969/j.issn.1000-436x.2013.04.008

Asbtract ( 233 )   HTML ( 1)   PDF (426KB) ( 428 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains,but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity.The definitions of repetition,division and division-tree was proposed,and then a novel self-renewable hash chain construction scheme was put forward based on division and (,t n)-Mignotte's threshold Chinese remainder theorem secret sharing scheme.From three aspects of key space,twice authent ion and provable security,it theoretically proves that the proposed hash scheme could ensure the novel seed value regenerated safely and resisting the middle-man attack effectively.Simulation experiments demonstrate that the novel scheme obtains equal or more satisfactory performances on the costs of communication,computation and storage than typical schemes.

Provable secure mutual authentication protocol for RFID in the standard model

Feng XIAO,Ya-jian, ZHOU,Jing-xian ZHOU,Xin-xin NIU

2013, 34(4):  82-87.  doi:10.3969/j.issn.1000-436x.2013.04.009

Asbtract ( 230 )   HTML ( 3)   PDF (228KB) ( 394 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The security issue of RFID is becoming more and more serious,in order to protect the RFID's information security and privacy,a mutual authentication protocol for RFID based on HB protocol was proposed in the standard model.The security proofs for this novel protocol was given by using the reduction method,and attacker's hardness was reduced to the indistinguishability between pseudo-random function and real random function.The implementation of proposed protocol only required lightweight pseudo-random generator and vector dot product operation and provided higher security and efficiency.The comparisons of security and performance were also given with other authentication protocols,the results show that the proposed protocol is feasible for RFID tags which are low cost and resource-constrained.

Cryptanalysis of a hybrid-structured onion routing scheme

Long-hai LI,Shao-feng FU,Rui-dan SU,Xiang-quan CHE

2013, 34(4):  88-98.  doi:10.3969/j.issn.1000-436x.2013.04.010

Asbtract ( 343 )   HTML ( 7)   PDF (351KB) ( 847 )   Knowledge map   

References | Related Articles | Metrics

SHI Jin-qiao et al's hybrid-structured onion routing scheme was analysed and some security flaws were found in their design.The first flaw was derived from the malleability of its cryptographic message format which could be exploited by attackers to redirect an onion message or embed tags into it for tracing its routing path.The second flaw was the vulnerability of relay servers to chosen ciphertext attack.Three different attacks were presented that each broke the sender-receiver unlinkability entirely at a relatively low co To evade these attacks,a modified scheme was also proposed which could capture malicious nodes by using upstream investigation.

Auction based bandwidth allocation mechanism for P2P content distribution networks

Yun-he ZHANG,Yan-qin ZHU,Qi-jin JI

2013, 34(4):  99-105.  doi:10.3969/j.issn.1000-436x.2013.04.011

Asbtract ( 262 )   HTML ( 2)   PDF (239KB) ( 436 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Unreasonable allocation of originally scarce bandwidth was a severe problem in the P2P content distribution networks.To solve the problem and suppress the node's selfishness,an auction-based bandwidth allocation mechanism for P2P networks was proposed.Through the effective bandwidth payment scheme,the selfish nodes had no incentives to lie and provided the real bandwidth requirements.Also the “tragedy of the commons” could be avoided by the nodes' healthy bandwidth competition.To adapt to the distributed nature of the P2P networks,the algorithm was implemented in parallel at resource providing nodes and request nodes.Simulation results show that the scheme not only suppresses riding nodes efficiently in the system,but also shortens the average completion time for content distribution and decreases the ratio of data uploaded by the source server.

Construction and analysis of one class of cryptographic functions

Zhi-hui OU,Ya-qun ZHAO,Xu LI

2013, 34(4):  106-113.  doi:10.3969/j.issn.1000-436x.2013.04.012

Asbtract ( 242 )   HTML ( 0)   PDF (294KB) ( 448 )   Knowledge map   

References | Related Articles | Metrics

A novel class of n+t -variable Boolean functions G (x,y) through adding t variables while concatenating t+ 1 Boolean functions (called basic function) was constructed and the Walsh spectrum and autocorrelation coefficient of G(x,y)were given.The relationship between G(x,y)and basic functions by Krawtchouk polynomial and Krawtchouk matrix was studied.Moreover,their cryptographic properties:correlation immunity,propagation and algebraic immunity were investigated.Specially,the detailed relationship between G (x,y) and basic functions when t= 2 was analyzed.In additional,a novel class of multioutput Boolean functions by generalizing the method was constructed and the general Walsh spectrum of the class of multioutput Boolean functions was proposed.Correlation immunity and algebraic immunity of the class of multioutput Boolean functions were analyzed.

Technical Report

Smart Fuzzing method based on comparison algorithm of control flow sequences

Ying WANG,Yi-xian YANG,Xin-xin NIU,Li-ze GU

2013, 34(4):  114-121.  doi:10.3969/j.issn.1000-436x.2013.04.013

Asbtract ( 287 )   HTML ( 2)   PDF (309KB) ( 367 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Flowing the way introduced in the research of evolutionary fuzzing system (EFS),a smart fuzzing method was proposed based on the node comparison algorithm among control flow sequences.Through mapping program execution flow sequences onto the control flow sequences,the isomorphism relationship between dada search space and program logic space was established.The analyzed results prove that the method is capa of mining a mass of information from group data effectively,and is able to fully util ze the parallelism of genetic algorithm to guide the fuzzing test.

Hardware Trojans detection based on projection pursuit

Peng ZHANG,Xin-cheng WANG,Qing ZHOU

2013, 34(4):  122-126.  doi:10.3969/j.issn.1000-436x.2013.04.014

Asbtract ( 256 )   HTML ( 3)   PDF (231KB) ( 311 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel hardware Trojans detection technique using the side channel signals of chips was proposed.Based on the projection pursuit with absolute information divergence index,this technique could find out the data structure enables reflect high dimension special rules without obvious i tion loss,so as to attain the goal of feature abstraction and identification on side channel signals of IC chips.The detection experiment against an exemplary AES-128 hardware Trojan circuit showed that the technique could distinguish the difference of side channel signal's feature between the genuine chip and tested chip,and consequently could detect the existence of the hardware Trojan.

Adaptive extraction method of network application signatures

Bian-qin WANG,Shun-zheng YU

2013, 34(4):  127-137.  doi:10.3969/j.issn.1000-436x.2013.04.015

Asbtract ( 275 )   HTML ( 1)   PDF (476KB) ( 313 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An adaptive application signature extraction method (AdapSig) was proposed.AdapSig firstly extracted keyword sequences from payloads of packets,and then negative examples and redundancy filter were used to generate candidate signatures.An adaptive mechanism based on self-identification rate was applied to select the final si ture.Experimental results show that application signatures extracted by AdapSig have high accuracy for various protocols.

Blind frequency tracking based on time-domain spreading for MB-OFDM-UWB systems

Li-jun GE,Hong WU

2013, 34(4):  138-143.  doi:10.3969/j.issn.1000-436x.2013.04.016

Asbtract ( 186 )   HTML ( 0)   PDF (259KB) ( 173 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A blind carrier frequency offset (CFO) tracking algorithm based on time-domain spreading (TDS) was proposed for multiband orthogonal frequency division multiplexing ultra wide band systems.The scheme uses data symbols and the mapped TDS ones to develop time and frequency-domain estimators and tracking loops respectively.Simulation results indicate that the proposed scheme has a better performance in tracking accuracy than pilots-aided ones.Under the SNR of 10dB,the mean square root errors of the residual CFO reach 2 10^-4,and the bit error rate of the system is 10^-6× of magnitude.

RFID dynamic positioning method

Cheng LI,Song-rong QIAN

2013, 34(4):  144-148.  doi:10.3969/j.issn.1000-436x.2013.04.017

Asbtract ( 237 )   HTML ( 7)   PDF (202KB) ( 769 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel proximity method-RFID dynamic positioning method was presented,using a moving radio frequency identification (RFID) reader to accurately position the target based on reference tag arrays.The major advantage of the method was that through reading tags without any measurement data,e.g.,the time of arrival (TOA) or the received signal strength indication (RSSI),it improved the accuracy of positioning target based on reference tags and a moving reader.The algorithm was simple but useful.Based on the performance of the prototype system,it demonstrated that the proposed system could accurately position in one of the smallest reference tag cell (within dozens of centimeters) and could be deployed easily with low cost,thus has potential application in RFID warehouse management.

Delay-sensitive data allocation scheme for CMT over diversity paths

Wen-feng DU,Zhen WU,Li-qian LAI

2013, 34(4):  149-157.  doi:10.3969/j.issn.1000-436x.2013.04.018

Asbtract ( 226 )   HTML ( 4)   PDF (330KB) ( 506 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The performance of CMT association degrades remarkably when the performances of parts of paths deteriorate.Based on the analysis of different network configurations,a delay sensitive data allocation scheme was proposed to distribute data to different paths over multi-diversity network with reference of their transmission delay,which is a key factor to the whole performance.Meanwhile,the transmission sequence number of each chunk will also was considered.The result of analysis and simulation reveal the performance of our scheme can achieve much better performance than the original round-robin scheme.

Academic communication

Routing metric based on interference measurement for multi-radio multi-channel wireless mesh networks

Wen-jiang JI,Jian-feng MA,Jun-wei ZHANG,Zhuo MA

2013, 34(4):  158-164.  doi:10.3969/j.issn.1000-436x.2013.04.019

Asbtract ( 181 )   HTML ( 4)   PDF (258KB) ( 296 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An interference sensing based(ISB)routing metric which mainly depend on the estimation of signal power was introduced for the multi-radio multi-channel wireless mesh networks.The existing metric such like WCETT and iAWARE all have their drawbacks were shown.As shown in the equations of iAWARE,it could be proved that worse background noise corresponds to a better metric value which was imprecise.The iAWARE to make it suited for the environment with background noise was improved,and the isotonic property was regained that the Bellman-Ford and Dijkstra algorithm could be deployed in ISB.The simulation results prove the novel algorithm takes the advantages of higher efficiency both in throughput and end to end delays,compared with the traditional ones HopCount,ETT,WCETT and iAWARE.

Improved ant colony algorithm based on natural selection strategy for solving TSP problem

Hua-feng WU,Xin-qiang CHEN,Qi-huang MAO,Qian-nan ZHANG,Shou-chun ZHANG

2013, 34(4):  165-170.  doi:10.3969/j.issn.1000-436x.2013.04.020

Asbtract ( 346 )   HTML ( 13)   PDF (260KB) ( 1176 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve basic ant colony algorithm's drawbacks of low convergence rate,easiness of trapping in local optimal solution,an improved ant colony algorithm based on natural selection was proposed.The improved algorithm employed evolution strategy of survival the fittest in natural lection to enhance pheromones in paths whose random evolution factor was bigger than threshold of evolution drift factor in each process of iteration.It could accelerate convergence rate effectively.Besides the introduction of random evolution factor reduced probability of trapping local optimal solution notably.The proposed algorithm was applied to classic TSP problem to find better solution for TSP.Simulation results depict the improved algorithm has better optimal solution and higher convergence rate.

Improving community structure strategy for efficiently enhancing Internet transmission performance

Jun CAI,Shun-zheng YU

2013, 34(4):  171-179.  doi:10.3969/j.issn.1000-436x.2013.04.021

Asbtract ( 218 )   HTML ( 0)   PDF (421KB) ( 219 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient weakening community structure strategy (WCS) by adding links to the existing networks was propose,which could enhance Internet transmission performance.Internet topology reconstruction could be realized by WCS strategy,because lightpaths that represent logical links between nodes could achieve the same high performance as physical links by means of optically bypassing intermediate nodes.The performance of the proposed strategy was investigated in pseudo random networks with community structure scale-free network with community structure and Internet,topology respectively,for both local routing strategy and global shortest-path routing strategy.The experimental results show that the traffic capacity of networks and the average shortest path are considerably improved by adding a few links among communities.

Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error

Wen-biao TIAN,Zheng FU,Guo-sheng RUI

2013, 34(4):  180-186.  doi:10.3969/j.issn.1000-436x.2013.04.022

Asbtract ( 199 )   HTML ( 0)   PDF (353KB) ( 418 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the original signal fast in the case of unknown sparsity.Firstly,the range of sparsity was determined,and each time half of values in current range were eliminated by trial and error test.Secondly,the number of atoms was twice the sparsity,which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems.Last but not least,the least-squares approximation was pruned by weakly matching for next iteration.The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions.

Linear precoding for interference suppression in multi-cell multi-user TDD MIMO downlink

Zu-jun LIU,Jie-ling WANG,De-chun SUN,Ke-chu YI

2013, 34(4):  187-193.  doi:10.3969/j.issn.1000-436x.2013.04.023

Asbtract ( 262 )   HTML ( 3)   PDF (336KB) ( 595 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To suppress multi-user interference (MUI) and inter-cell interference (ICI) existing in multi-cell multi-user TDD MIMO downlink,an interference suppression algorithm through designing precoder was proposed.Firstly,a precoding matrix was designed for MUI suppression,with the help of the QR decomposition of generalized MMSE channel inversion.And then the second precoding matrix was designed to suppress ICI and residual MUI,using a signal leakage criterion.The proposed algorithm could utilize TDD MIMO channel reciprocity,and thus did not require users' feedback information.The algorithm had been simulated in a multi-user TDD MIMO system composed of urban micro-cells.Simulation results show that,the proposed algorithm can effectively improve system capacity and user's average SINR.

Cascaded algorithm for background modeling using pixel-based and block-based methods

Wen-hua XIE,Ben-shun YI,Jin-sheng XIAO,Liang-cai GAN

2013, 34(4):  194-200.  doi:10.3969/j.issn.1000-436x.2013.04.024

Asbtract ( 245 )   HTML ( 5)   PDF (305KB) ( 481 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Block-based background modeling couldn't obtain the exact shape of foreground,while pixel-based approaches couldn't handle non-stationary backgrounds effectively.To solve the problem,a hierarchical scheme for background modeling was presented.The hierarchical model used block-based method proposed to obtain coarse background and foreground regions firstly,and then the operations of pixel-level foreground refining and model updating based on Gaussian mixture model were performed on special regions of the input image.These two algorithms in different levels were combined by adopting an asymmetric feed-forward strategy.Experimental results show that the hierarchical method proposed can obtain the exact shape of foreground and process non-stationary scenes well,in addition,it is insensitive to illumination change and can provide better results than any single approach in it,meanwhile,the integrated computation time is shorter than the sum of those of running the block and pixel-level methods,and satisfies real-time processing.

New SNR estimation algorithm based on relevance vector machine

Bo HAN,Jie WU,Hua XU,Hai-ou SHEN,Peng LI

2013, 34(4):  201-206.  doi:10.3969/j.issn.1000-436x.2013.04.025

Asbtract ( 232 )   HTML ( 1)   PDF (245KB) ( 635 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new SNR estimation algorithm based on relevance vector machine (RVM) was proposed,it can not only be used under the flat fading channel,but also meet the request of larger estimation range and higher estimation accuracy of PSK.The estimation model was created by using RVM,based on the relation between the SNR and the two-order moments and four-order moments,and the reliable weights of the model can be figured out by straining and studying.Simulation results show that this algorithm has lots of advantages,for example,it uses less data and has larger estimation range than general algorithm,in addition,its estimation accuracy becomes higher in the effective estimation rang,and it is applicable to more modulation signals.