Current Issue

25 July 2013, Volume 34 Issue 7

Previous Issue    Next Issue

Constructions of Golomb Costas arrays and their applications in OFDM systems

2013, 34(7):  1-13. 

Asbtract ( 1076 )   Knowledge map   

Related Articles | Metrics

Theory of structures of Golomb Costas arrays with 1-gap row and 1-gap column was established with the study of the properties and mathematical models of Golomb Costas arrays and their families which are obtained by the cyclic shift method. By conducting a number of researches on the algebraic constructions and the auto- and cross-correlation properties of Golomb Costas arrays with 1-gap row and 1-gap column, certain theorems were confirmed. The design of frequency hopping codes and the distribution of them to the users were illustrated while the design of frequency hopping patterns was explored in OFDM system with Golomb Costas arrays with 1-gap row and 1-gap column. By designing frequency hopping codes with Golomb Costas ayrays with 1-gap row and 1-gap column, an algebraically constructed frequency hop code family can achieve ideal auto-correlation properties. And excellent cross-correlation performance can be obtained when the Doppler shifts are restricted in a wireless communication system.

academic paper

Constructions of Golomb Costas arrays and their applications in OFDM systems

Jian-guo YAO,Yu-feng WANG,Wei HENG

2013, 34(7):  1-13.  doi:10.3969/j.issn.1000-436x.2013.07.001

Asbtract ( 300 )   HTML ( 7)   PDF (678KB) ( 648 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Theory of structures of Golomb Costas arrays with 1-gap row and 1-gap column was established with the study of the properties and mathematical models of Golomb Costas arrays and their families which are obtained by the cyclic shift method. By conducting a number of researches on algebraic constructions and the auto- and cross-correlation properties of Golomb Costas arrays with 1-gap row and 1-gap column, certain theorems were confirmed. The design of frequency hopping codes and the distribution of them to the users were illustrated while the design of frequency hopping patterns was explored in OFDM system with Golomb Costas arrays with 1-gap row and 1-gap column. By designing fre-quency hopping codes with Golomb Costas ayrays with 1-gap row and 1-gap column, an algebraically constructed fre-quency hop code family can achieve ideal auto-correlation properties. And excellent cross-correlation performance can be obtained when the Doppler shifts are restricted in a w less communication system.

Local routing strategy in network simulation based on Zone_Cut

2013, 34(7):  2-23. 

Asbtract ( 692 )   Knowledge map   

Related Articles | Metrics

Local routing strategy based on Zone_Cut was put forward for network simulation. All nodes in topology were divided into three zones, including T Zone, LD Zone and HD Zone according to the property of the node. To reduce the storage space and search time of routing strategy, different storage and search mechanisms were adopted for different zones, which balanced the space and time of routing mechanism. Experimental results on PDNS show that Zone_Cut improves the comprehensive properties of routing strategy, compared with the MTree_Nix. Compared with MTree_Nix, it can reduce the simulation time and simulation space by about 18.08% and 51.23% respectively in low frequency, while in high frequency, it can reduce the simulation time and simulation space by about 55.29% and 74.4% respectively.

Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution

2013, 34(7):  3-33. 

Asbtract ( 933 )   Knowledge map   

Related Articles | Metrics

Due to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover bandwidth-aware peer selection algorithm named LBAPS was designed. LBAPS avoids centralized optimization method that fails to effectively utilize leftover bandwidth when multiple destinations occur. In LBAPS, a node selection strategy based on synthetical evaluation was presented in order to find appropriate nodes with leftover bandwidth currently. In addition, two other strategies, i.e., resource reservation based on threshold and exiting upload upon the length of time slice, were put forward. With these two strategies, nodes with more leftover bandwidth get higher priority to obtain file blocks; besides, different file blocks can be delivered to different nodes as soon as possible. On the basis of LBAPS, a content cloud prototype, P2PStitcher was implemented. Experimental results on PlanetlLab show that the strategies proposed in LBAPS are effective to decrease the average delivery time.

IoV vertical handoff research based on Bayesian decision

2013, 34(7):  4-41. 

Asbtract ( 1211 )   Knowledge map   

Related Articles | Metrics

Vehicles need vertical handoffs in the heterogeneous wireless network environment of IoV, but current vertical switching technologies generally cannot support vertical handoff among WAVE, WiMAX and 3G cellular. In order to overcome this problem, a vertical handoff method with Bayesian decision was proposed. Firstly, according to the signal strength, transmission rate, bit error rate, blocking probability, vehicle speed and movement trend, the handoff probability distribution of Multi-condition was established and the handoff prior probability was calculated. Secondly, Bayesian decision method was used to obtain the handoff posterior probability and to classify decisions, which made vehicles access the best network. Simulation results show that the proposed method can not only achieve the vertical handoff among WAVE, WiMAX and 3G cellular, but also avoid the ping-pong effect and ensure the network update rate.

Linear randomization with lowest information leakage for physical layer secure transmission

2013, 34(7):  5-48. 

Asbtract ( 867 )   Knowledge map   

Related Articles | Metrics

Linear randomization pre-processing framework was presented to design feasible physical layer secure transmission schemes. The framework show that, based on characteristic differentiae of wireless channels, additive and multiplicative randomization modules with suitable design would create channel advantage for legitimate users. In the view point of information theory security, the optimal distributions of the additive randomization weights and the multiplicative randomization weights to induce the lowest information leakage to the eavesdropper were verified. Finally, A random sub-carrier referencing security scheme was proposed as an instantiation analysis for the optimization design of multiplicative randomization weights.

Energy efficient copy distributing status aware routing mechanism in opportunistic network

2013, 34(7):  6-58. 

Asbtract ( 708 )   Knowledge map   

Related Articles | Metrics

In opportunistic network, the relation between the node energy and message spreading degree is tradeoff. As a result, the network performance can be dramatically improved in limited resource scenarios by an effective routing mechanism considering the node energy and copy status. Both the message spreading degree and node residual energy were taken into consideration, and then combined with the encounter probability predicting methods, an energy efficient copy distributing status aware routing mechanism was proposed, which could be used to choose the relay nodes reasonably. Numerical results show that the overhead can be reduced efficiently, and the message delivery ratio and latency can also be optimized.

Motion estimation algorithm using 2 bit-depth pixel and fuzzy quantization

2013, 34(7):  7-70. 

Asbtract ( 776 )   Knowledge map   

Related Articles | Metrics

A motion estimation algorithm was proposed using 2 bit-depth pixels. The reduction of pixel depth was first formalized by two successive steps, namely interval partitioning and interval mapping. The former is a many-to-one mapping which determines motion estimation performance, while the latter is a one-to-one mapping. A non-uniform quantization method was then presented to compute three initial thresholds of the interval partitioning. These initial thresholds were subsequently refined by using a membership function to solve the mismatch of pixel values near them caused by signal noise and so on. Afterwards, a matching criterion was discussed suitable for the motion estimation using 2 bit- depth pixels. A novel motion estimation algorithm was consequently addressed based on 2 bit-depth pixels and fuzzy quantization. To further predict the precision of the proposed algorithm, a bit resolution reduction error-motion vector precision model was built by exploiting the auto-correlation function. Extensive experimental results show that the proposed algorithm can always achieve high motion estimation precision for video sequences with various characteristics, especially for those with detailed scene and complex motion. Compared with traditional 2 bit motion estimation, the proposed algorithm gains 0.27 dB improvement in terms of average peak signal-to-noise ratio of motion compensation.

Adaptive user behavior’s evaluation method based on network status

2013, 34(7):  8-80. 

Asbtract ( 799 )   Knowledge map   

Related Articles | Metrics

With the development of network, user’s complex and dynamic behaviors often lead to unexpected fluctuations of network status, and these fluctuations take great challenge to the stability of network. It is difficult to evaluate user behavior’s affection on network status fluctuations for traditional methods because of their subjectivity and static drawbacks. An evaluation method was proposed, which analyses the correlation between the user’s behavior and network status fluctuations based on actual data of behavior and network status, by means of rough set attribute reduction and attribute importance. This method can construct and dynamically adjust the evaluation indexes and their weight adaptive from the actual data. The evaluation results show this method can help to detect and manage users who affect the stability of network, and provide effective support to control users and their behavior.

Multi-channel broadcast protocol for CRSN based on home channel

2013, 34(7):  9-86. 

Asbtract ( 733 )   Knowledge map   

Related Articles | Metrics

In the light of the limited resources and the dynamic spectrum distribution in the CRSN, a half duplex multi-channel broadcast protocol for CRSN was proposed based on the home channel theory. In the absence of the common channel and clock synchronization, the proposed protocol initialized the network through the transitions of the sending and receiving state of the single transceiver and the exchanges of the channel table. After network initialization, the topology of nodes was formed based on home channel. Nodes broadcast through home channel based on half duplex data transfer mode. According to the simulation results, it is proved that, compared with complete broadcast, the proposed protocol effectively improves the success rate of broadcast and reduces broadcast delay and overhead, which gets better performance in practical application of CRSN.

Efficient chosen-ciphertext secure proxy re-encryption scheme

2013, 34(7):  10-97. 

Asbtract ( 823 )   Knowledge map   

Related Articles | Metrics

In order to construct an efficient and chosen-chiphertext secure unidirectional re-encryption scheme in the standard model, a novel and efficient unidirectional proxy re-encryption scheme was proposed, and its chosen-ciphertext security in the adaptive corruption model was proved in the standard model. Compared with LV scheme, this scheme has the advantages of both higher efficiency and stronger security. Under the same security level, this scheme has lower computational cost than that of WJ scheme.

On the designand performance of nonbinary LDPC codes on burst errorchannels

2013, 34(7):  11-104. 

Asbtract ( 736 )   Knowledge map   

Related Articles | Metrics

Taking structured Q-ary irregular repeat-accumulate (S-QIRA) codes as an example, the burst-error-correcting capability of QLDPC codes was analyzed preliminarily by comparison with the burst-error-correcting capability of binary LDPC codes (BLDPC)and turbo codes on the single burst erasure (SBE) channels and burst-deep-fading additive white Gaussion noise (BF-AWGN) channels respectively. Two criteria of designing QLDPC codes were presented for burst error channels. Moreover, a class of structured extended Q-ary irregular repeat-accumulate (S-eQIRA) codes was proposed, which performs rather well on burst error channels. Numerical results indicate that, the proposed S-eQIRA codes have higher burst-error-correcting capability on both SBE and BF-AWGN channels.

Efficient certificateless sequential multi-signature scheme

2013, 34(7):  12-110. 

Asbtract ( 736 )   Knowledge map   

Related Articles | Metrics

The authentication of recommendation information transmitted through trust train is important for trust model in distributed environment. To solve this problem, the security model for the certificateless sequential multi-signature scheme was studied and then a certificateless sequential multi-signature scheme using elliptic curve cryptography and bilinear pairings was proposed. It is proven in the random oracle that the security of the scheme is based on the fact that the computational Diffie-Hellman problem is hard. Meanwhile, the scheme needs no certificate management center and the length of signature is independent of the number of signers. It needs no bilinear pairing operation in the phase of partial signing, and just needs one each in verification phases of partial signing and integral signing. So it is computationally efficient compared to the existing signature schemes and can be applied conveniently to trust transitivity in large scale distributed environment.

Research on the efficiency of replication-based storage mechanism

2013, 34(7):  13-123. 

Asbtract ( 827 )   Knowledge map   

Related Articles | Metrics

An algorithm-independent description model was established for the mechanism, and both efficiency-related and efficiency-independent parameters were identified. Besides, the impact of system scale on efficiency was investigated, and an important observation was obtained that the product of the two utilization ratios (i.e., the utilization ratio of disk space and that of I/O bandwidth) is approximately inversely proportional to the number of nodes contained in the system. The observation was verified through experimental results, and the reason behind was revealed through theoretical analysis. The study provides guidelines for the application of replication-based storage mechanism in engineering, and lays a theoretical foundation for the trade-off between the two utilization ratios and for the prediction of I/O performance in large-scale storage systems.

Cooperation mechanism of multi-agent system driven by utility

2013, 34(7):  14-133. 

Asbtract ( 681 )   Knowledge map   

Related Articles | Metrics

A cooperative mechanism amlong multiple agents was proposed. In the cooperative mechanism, a utility value was used to generate a preferred order for agents under different cooperative patterns. This utility value was achieved by computing the cooperative utility between one agent and the others under different tasks using a utility function. According to this mechanism, agents can automatically choose the cooperative pattern, which is the best to fit themselves to accomplish their missions. Meanwhile, driven by utility, group task income can achieve the optimum, which enhances the cooperation efficiency of agent groups. A prototype system was designed at last to validate the proposed cooperative mechanism. The effectiveness of this cooperative mechanism has been proved under the prototype system.

academic paper

Local routing strategy in network simulation based on Zone_Cut

Zhao-xin ZHANG,Yue-jin DU,Ke WANG,Xuan-chun1 WANG,Zhi-yu HAO

2013, 34(7):  14-23.  doi:10.3969/j.issn.1000-436x.2013.07.002

Asbtract ( 148 )   HTML ( 0)   PDF (379KB) ( 244 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Local routing strategy based on Zone_Cut was put forward for network simulation.All nodes in topology were divided into three zones, including T Zone, LD Zone and HD Zone according to the property of the node. To the storage space and search time of routing strategy, dif nt storage and search mechanisms were adopted for different zones, which balanced the space and time of routing mechanism. Experimental results on PDNS show that Zone_Cut im-proves the comprehensive properties of routing strategy,compared with the MTree_Nix. Compared with MTree_Nix, it can reduce the simulation time and simulation space by about 18.08% and 51.23% respectively in low frequency,while in high frequency, it can reduce the simulation time and simulation space by about 55.29% and 74.4% respectively.

Research of Hamming weight-based algebraic side-channel attack on LED

2013, 34(7):  15-142. 

Asbtract ( 711 )   Knowledge map   

Related Articles | Metrics

The security of LED against the algebraic side-channel attack (ASCA)was evaluated, which is a lightweight block cipher proposed in CHES 2011. Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were described. Secondly, the power leakages of LED on ATMEGA324P microcontroller were measured by a digital oscilloscope; some leakage points with obvious power patterns were chosen as the targeted points and used to deduce the Hamming weight via computing the Pearson correlation factor; satisfiability-based, Pseudo-Boolean optimization-based, linear programming-based methods were used to representing Hamming weights with algebraic equations. Finally, the CryptoMinisat and the SCIP solver were applied to solve for the key and many attacks are conducted under different scenarios. Experiment results demonstrate that LED is vulnerable to ASCA, full 64 bit master key can be derived via analyzing the HW leakages of the first round in LED.

Research on ciphertext search for the cloud environment

2013, 34(7):  16-153. 

Asbtract ( 988 )   Knowledge map   

Related Articles | Metrics

In order to ensure the data privacy, users have to encrypt the data before outsourcing them to the cloud, However, the encrypted data cannot take full advantage of the rich service function and powerful computation ability of the cloud platform. Ciphertext search technology can combine the protection of user data’s privacy with the efficient usage of cloud platform services. On the basis of analyzing the ciphertext search technologies in cloud computing environment, a ciphertext search system architecture based on cloud computing environment was proposed and the key technologies of ciphertext search were studied. Finally the ciphertext search technologies’ main problems at present and the important research direction in future were pointed out.

Breaking novel and lightweight digital signature scheme

2013, 34(7):  17-158. 

Asbtract ( 752 )   Knowledge map   

Related Articles | Metrics

The signature schemes based on RSA and ECC do not seem suitable for special application area such as wireless sensor network, smart card and wireless RFID since they suffer from low computing efficiency. In order to design a scheme for small computing devices with limited computing capacity, Wang et al. proposed a novel lightweight digital signature scheme based on the hash authentication technology. A polynomial time algorithm, which found an equivalent signing secret key from the public key, was presented for this novel lightweight digital signature scheme. By using the equivalent secret key, adversary can forge signature for arbitrary messages. Hence, their digital signature scheme based on hash authentication is broken.

Image indexing method based on clustering via Info-Kmeans under pair constraints

2013, 34(7):  18-166. 

Asbtract ( 737 )   Knowledge map   

Related Articles | Metrics

Constructing high-quality content-based image indexing is fairly difficult due to the large amount of noise in the data set and the high-dimension and the sparseness of the image data. To meet this challenge, a novel noise-filtering and clustering was proposed using Info-Kmeans based image indexing construction method. Firstly, a noise-filtering method using the cosine interesting patterns was presented. Secondly, a novel Info-Kmeans algorithm was proposed which could avoid the zero-feature dilemma caused by the use of KL-divergence and exploit the prior knowledge in the form of pair constraints. The experimental results on the two image data sets, LFW and Oxford_5K, well demonstrate that: noise filter can improve the clustering performance remarkably and the novel Info-Kmeans algorithm yields better results than the existing clustering tool.

Trust evaluation model based on improved D-S evidence theory

2013, 34(7):  19-173. 

Asbtract ( 904 )   Knowledge map   

Related Articles | Metrics

The existing trust evidence models cannot deal with malicious attacks in the distributed network quickly and effectively, and are lack of a trust normalization method that can measure trust relationship described by a triple set, so a trust model based on the improved D-S evidence theory was proposed. On this basis, basic trust value function based on continuous sequences and trust evaluation method based on evaluation function were also proposed to inhibit malicious nodes in a higher speed, and to enable the prediction results to be closer to the fact. Analysis and simulation show that this model has better effectiveness and robustness to deal with the aggregating trust attack, and trust evaluation method has better reasonableness and accuracy.

Community based multi-copied data delivery scheme for delay tolerant sensor network

2013, 34(7):  20-183. 

Asbtract ( 727 )   Knowledge map   

Related Articles | Metrics

The characteristics of community structure have effect on the data transmission procedure of delay tolerant mobile sensor network. Under the community network model, data delivery probabilities of multi-copied delivery were deduced. A community based multi-copy data delivery (CMDD) scheme was also proposed. By dynamically computing the average inter-meeting time between the communities and using the delivery probability formulations, the scheme can estimate the delivery probability when data are delivered through such community. Simulation results show that the proposed CMDD scheme achieves a relatively high data delivery ratio and a lower message delivery latency and transmission overhead.

Fuzzy adaptive algorithm based on modified current statistical model for vehicle positioning

2013, 34(7):  21-190. 

Asbtract ( 923 )   Knowledge map   

Related Articles | Metrics

The singer model and current statistical model were first analyzed and compared. A modified scheme based on the two kinds of models was proposed. Moreover, a modified current statistical model based-fuzzy adaptive extended Kalman filter (MCS-FAEKF) algorithm was proposed to choose maneuvering model and adjust system noise covariance dynamically. The simulated results show that the algorithm could get more accurate and reliable performance for vehicle positioning compared with the current statistical model based-extended Kalman filter (CS-EKF) and Singer-EKF algorithms.

academic paper

Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution

Yong-feng HUANG,Yong-qiang DONG,Shan-feng ZHANG,Guo-xin WU

2013, 34(7):  24-33.  doi:10.3969/j.issn.1000-436x.2013.07.003

Asbtract ( 245 )   HTML ( 0)   PDF (364KB) ( 632 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover band-width-aware peer selection algorithm named LBAPS was designed. LBAPS avoids centralized optimization method that fails to effectively utilize leftover bandwidth when multiple destinations occur. In LBAPS, a node selection strategy based on synthetical evaluation was presented in order to find appropriate nodes h leftover bandwidth currently. In addition, two other strategies, i.e., resource reservation based on threshold and exiting upload upon the length of time slice, were put forward. With these two strategies, nodes with more leftover bandwidth get higher priority to obtain file blocks; be-sides, different file blocks can be delivered to different nodes as soon as possible. On the basis of LBAPS, a content cloud prototype, P2PStitcher was implemented. Experimental results on PlanetlLab show that the strategies proposed in LBAPS are effective to decrease the average delivery time.

IoV vertical handoff research based on Bayesian decision

Cun-qun FAN,Shang-guang WANG,Qi-bo SUN,Hua ZOU,Fang-chun YANG

2013, 34(7):  34-41.  doi:10.3969/j.issn.1000-436x.2013.07.004

Asbtract ( 253 )   HTML ( 3)   PDF (307KB) ( 332 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Vehicles need vertical handoffs in the heterogeneous wireless network environment of IoV, but current vertical switching technologies generally cannot support vertical handoff among WAVE, WiMAX and 3G cellular. In order to overcome this problem, a vertical handoff method with yesian decision was proposed. Firstly, according to the signal strength, transmission rate, bit error rate, blocking probability, vehicle speed and movement trend, the handoff probability distribution of Multi-condition was established and the handoff prior probability was calculated. Secondly, Bayesian de-cision method was used to obtain the handoff posterior probability and to classify decisions, which made vehicles access the best network. Simulation results show that the proposed method can not only achieve the vertical handoff among WAVE, WiMAX and 3G cellular, but also avoid the ping-pong effect and ensure the network update rate.

Linear randomization with lowest information leakage for physical layer secure transmission

Qiao-long LI,Liang JIN

2013, 34(7):  42-48.  doi:10.3969/j.issn.1000-436x.2013.07.005

Asbtract ( 183 )   HTML ( 1)   PDF (276KB) ( 330 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Linear randomization pre-processing framework was presented to design feasible ysical layer secure trans-mission schemes. The framework show that, based on characteristic differentiae of wireless channels, additive and mul-tiplicative randomization modules with suitable design would create channel advantage for legitimate users. In the view point of information theory security, the optimal distributions of the additive randomization weights and the multiplica-tive randomization weights to induce the lowest information leakage to the eavesdropper were verified. Finally, A random sub-carrier referencing security scheme was proposed as an instantiation analysis for the optimization design of multip-licative randomization weights.

Energy efficient copy distributing status aware routing mechanism in opportunistic network

Da-peng WU,Si-long FAN,GPu-ning ZHAN,Yi LV,Ru-yan WANG

2013, 34(7):  49-58.  doi:10.3969/j.issn.1000-436x.2013.07.006

Asbtract ( 195 )   HTML ( 1)   PDF (316KB) ( 684 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In opportunistic network, the relation between the node energy and message spreading degree is tradeoff. As a result, the network performance can be dramatically improved in limited resource scenarios by an effective routing me-chanism considering the node energy and copy status. Both the message spreading degree and node residual energy were taken into consideration, and then combined with the e probability predicting methods, an energy efficient copy distributing status aware routing mechanism was proposed, which could be used to choose the relay nodes reasonably. Numerical results show that the overhead can be reduced efficiently, and the message delivery ratio and latency can also be optimized.

Motion estimation algorithm using 2 bit-depth pixel and fuzzy quantization

Chuan-ming SONG,Yan-wen GUO,Xiang-hai WANG,Dan LIU

2013, 34(7):  59-70.  doi:10.3969/j.issn.1000-436x.2013.07.007

Asbtract ( 273 )   HTML ( 1)   PDF (501KB) ( 378 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A motion estimation algorithm was proposed using 2 bit-depth pixels. The reduction of pixel depth was first formalized by two successive steps, namely interval partitioning and interva mapping. The former is a many-to-one mapping which determines motion estimation performance, while the latter is a one-to-one mapping. A non-uniform quantization method was then presented to compute three initial thresholds of the interval partitioning. These initial thre-sholds were subsequently refined by using a membership function to solve the mismatch of pixel values near them caused by signal noise and so on. Afterwards, a matching criterion was discussed suitable for the motion estimation using 2 bit-depth pixels. A novel motion estimation algorithm was consequently addressed based on 2 bit-depth pixels and fuzzy quantiza-tion. To further predict the precision of the proposed algorithm, a bit resolution reduction error-motion vector precision model was built by exploiting the auto-correlation function. Extensive experimental results show that the proposed algo-rithm can always achieve high motion estimation precis rious characteristics, especially for those with detailed scene and complex motion. Compared with traditional 2 bit motion estimation, the proposed algorithm gains 0.27 dB improvement in terms of average peak signal-to-noise ratio of motion compensation.

Adaptive user behavior's evaluation method based on network status

You LU,Jun-zhou LUO,Wei LI,Feng YU,Nu XIA

2013, 34(7):  71-80.  doi:10.3969/j.issn.1000-436x.2013.07.008

Asbtract ( 198 )   HTML ( 1)   PDF (341KB) ( 436 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Abstract:With the development of network, user's complex and dynamic behaviors often lead to unexpected fluctuations of network status,and these fluctuations take great challenge to the stability of network. It is difficult to evaluate user be-havior's affection on network status fluctuations for traditional methods because of their subjectivity and static drawbacks. An evaluation method was proposed, which analyses the correlation between the user's behavior and network status fluc-tuations based on actual data of behavior and network status,by means of rough set attribute reduction and attribute im-portance. This method can construct and dynamically adjust the evaluation indexes and their weight adaptive the actual data. The evaluation results show this method can help to detect and manage users who affect the stability of net-work, and provide effective support to control users and their beha ior.

Multi-channel broadcast protocol for CRSN based on home channel

Jian-jie PU,Fan-zi ZENG

2013, 34(7):  81-86.  doi:10.3969/j.issn.1000-436x.2013.07.009

Asbtract ( 233 )   HTML ( 1)   PDF (211KB) ( 669 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In the light of the limited resources and the dynamic pectrum distribution in the CRSN, a half duplex mul-ti-channel broadcast protocol for CRSN was proposed based on the home channel theory. In the absence of the common channel and clock synchronization, the proposed protoc initialized the network through the transitions of the sending and receiving state of the single transceiver and the nges of the channel table. After network initialization, the to-pology of nodes was formed based on home channel. Nodes broadcast through home channel based on half duplex data transfer mode. According to the simulation results, it is proved that, compared with complete broadcast, the proposed protocol effectively improves the success rate of broadcast and reduces broadcast delay and overhead, which gets better performance in practical application of CRSN.

Efficient chosen-ciphertext secure proxy re-encryption scheme

Wei-wei ZHANG,Ru ZHANG,Jian-yi LIU,Xin-xin NIU,Yi-xian YANG

2013, 34(7):  87-97.  doi:10.3969/j.issn.1000-436x.2013.07.010

Asbtract ( 260 )   HTML ( 9)   PDF (392KB) ( 1515 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to construct an efficient and chosen-chiphertext secure unidirectional re-encryption scheme in the standard model,a novel and efficient unidirectional proxy re-encryption scheme was proposed, and its chosen-ciphertext security in the adaptive corruption model was proved in the standard model. Compared with LV scheme, this scheme has the advantages of both higher efficiency and stronger curity. Under the same security level, this scheme has lower computational cost than that of WJ scheme.

On the designand performance of nonbinary LDPC codes on burst errorchannels

Bo ZHANG,Wei LIN,Chun-yuan LIU,Bao-ming BAI

2013, 34(7):  98-104.  doi:10.3969/j.issn.1000-436x.2013.07.011

Asbtract ( 385 )   HTML ( 8)   PDF (267KB) ( 720 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Taking structured Q -ary irregular repeat-accumulate (S-QIRA) codes as an example, the burst-error-correcting capability of QLDPC codes was analyzed preliminarily by comparison with the burst-error-correcting capability of binary LDPC codes (BLDPC)and turbo codes on the single burst e (SBE) channels and burst-deep-fading additive white Gaussion noise (BF-AWGN) channels respectively. Two criteria of designing QLDPC codes were presented for burst er-ror channels. Moreover, a class of structured extended -ary irregular repeat-accumulate (S-eQIRA) codes was proposed,Q which performs rather well on burst error channels. Numerical results indicate that, the proposed S-eQIRA codes have higher burst-error-correcting capability on both SBE and BF-AWGN channels.

Efficient certificateless sequential multi-signature scheme

Yan-lin QIN,Xiao-ping WU

2013, 34(7):  105-110.  doi:10.3969/j.issn.1000-436x.2013.07.012

Asbtract ( 232 )   HTML ( 4)   PDF (195KB) ( 757 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The authentication of recommendation information transmitted through trust train is important for trust model in distributed environment. To solve this problem, the security model for the certificateless sequential multi-signature scheme was studied and then a certificateless sequential multi-signature scheme using elliptic curve cryptography and bi-linear pairings was proposed. It is proven in the random oracle that the security of the scheme is based on the fact that the computational Diffie-Hellman problem is hard. Meanwhile, the scheme needs no certificate management center and the length of signature is independent of the number of signers. It needs no bilinear pairing operation in the phase of partial signing, and just needs one each in verification phases of partial signing and integral signing. So it is computationally ef-ficient compared to the existing signature schemes and can be applied conveniently to trust transitivity in large scale dis-tributed environment.

Technical Report

Research on the efficiency of replication-based storage mechanism

Xiang-yu LUO,Yun WANG,Xiao-mei CHEN,Fei-fei YUAN,Con LI

2013, 34(7):  111-123.  doi:10.3969/j.issn.1000-436x.2013.07.013

Asbtract ( 203 )   HTML ( 0)   PDF (417KB) ( 206 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An algorithm-independent description model was established for the ism, and both efficiency-related and efficiency-independent parameters were identified. Besides,the impact of system scale on efficiency was investigated, and an important observation was obtained that the product of the two utilization ratios (i.e., the utilization ratio of disk space and that of I/O bandwidth) is approximately inversely proportional to the number of nodes contained in the system. The observation was verified through experimental resu reason behind was revealed through theoretical analy-sis. The study provides guidelines for the application of replication-based storage mechanism in engineering, and lays a theoretical foundation for the trade-off between the two utilization ratios and for the prediction of I/O performance in large-scale storage systems.

Cooperation mechanism of multi-agent system driven by utility

Han-bing DENG,Xia ZHANG,Ji-ren LIU

2013, 34(7):  124-133.  doi:10.3969/j.issn.1000-436x.2013.07.014

Asbtract ( 247 )   HTML ( 2)   PDF (418KB) ( 479 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A cooperative mechanism amlong multiple agents was proposed. In the cooperative mechanism, a utility value was used to generate a preferred order for agents under different cooperative patterns. This utility value was achieved by computing the cooperative utility between one agent and the others under different tasks using a utility funct Accord-ing to this mechanism, agents can automatically choose the cooperative pattern, wh is the best to fit themselves to ac-complish their missions. Meanwhile, driven by utility, group task income can achieve the optimum, which enhances the cooperation efficiency of agent groups. A prototype system was designed at last to val te the proposed cooperative me-chanism. The effectiveness of this cooperative mechanism has been proved under the prototype system.

Research of Hamming weight-based algebraic side-channel attack on LED

Ke-ke JI,Tao WANG,Shi-ze GUO,Xin-jie ZHAO,Hui-ying LIU

2013, 34(7):  134-142.  doi:10.3969/j.issn.1000-436x.2013.07.015

Asbtract ( 236 )   HTML ( 1)   PDF (309KB) ( 603 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Abstract:The security of LED against the algebraic side-channel attack (ASCA)was evaluated, which is a lightweight block cipher proposed in CHES 2011.Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were described. Secondly, the power leakages of LED on ATMEGA324P microcontroller were measured by a digital oscilloscope; some leakage points with obvious power patterns were chosen as the targeted points and used to deduce the Hamming weight via computing the Pearson correlation factor; satisfiability-based, Pseu-do-Boolean optimization-based, linear programming-based methods were used to representing Hamming weights with algebraic equations. Finally, the CryptoMinisat and the SCIP solver were applied to solve for the key and many attacks are conducted under different scenarios. Experiment results demonstrate that LED is vulnerable to ASCA, full 64 bit master key can be derived via analyzing the HW leakages of the first round in LED.

Overview

Research on ciphertext search for the cloud environment

Fei XIANG,Chuan-yi LIU,Bin-xing FANG,Chun-lu WANG,HONGRui-ming Z

2013, 34(7):  143-153.  doi:10.3969/j.issn.1000-436x.2013.07.016

Asbtract ( 260 )   HTML ( 12)   PDF (331KB) ( 1475 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to ensure the data privacy, users have to encrypt the data before outsourcing them to the cloud, How-ever, the encrypted data cannot take full advantage of the rich service function and powerful computation ability of the cloud platform. Ciphertext search technology can combine the protection of user data's privacy with the efficient usage of cloud platform services. On the basis of analyzing the ciphertext search technologies in cloud computing environment, a ciphertext search system architecture based on cloud c g environment was proposed and the key technologies of ciphertext search were studied. Finally the ciphertext search technologies' main problems at present and the important re-search direction in future were pointed out.

Academic communication

Breaking novel and lightweight digital _s ignature scheme

Chun-sheng GU

2013, 34(7):  154-158.  doi:10.3969/j.issn.1000-436x.2013.07.017

Asbtract ( 222 )   HTML ( 2)   PDF (149KB) ( 492 )   Knowledge map   

References | Related Articles | Metrics

The signature schemes based on RSA and ECC do not seem suitable for special application area such as wire-less sensor network, smart card and wireless RFID since they suffer from low computing efficiency. In order to design a scheme for small computing devices with limited computing capacity, Wang et al. proposed a novel lightweight digital signature scheme based on the hash authentication technology. A polynomial time algorithm, which found an equivalent signing secret key from the public key, was presented or this novel lightweight digital signature scheme. By using the equivalent secret key, adversary can forge signature for arbitrary messages. Hence, their digital signature scheme based on hash authentication is broken.

Image indexing method based on clustering via Info-Kmeans under pair constraints

Wen-jie LIU,Zhi-ang WU,Jie CAO,Jin-gui PAN

2013, 34(7):  159-166.  doi:10.3969/j.issn.1000-436x.2013.07.018

Asbtract ( 260 )   HTML ( 2)   PDF (399KB) ( 346 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Constructing high-quality content-based image indexing is fairly difficult due to the large amount of noise in the data set and the high-dimension and the sparseness of the image data.To meet this challenge,a novel noise-filtering and clustering was proposed using Info-Kmeans based image indexing construction method. Firstly,a noise-filtering me-thod using the cosine interesting patterns was presented. Secondly,a novel Info-Kmeans algorithm was proposed which could avoid the zero-feature dilemma caused by the use of KL-divergence and exploit the prior knowledge in the form of pair constraints. The experimental results on the two image data sets,LFW and Oxford_5K,well demonstrate that: noise filter can improve the clustering performance remarkably and the novel Info-Kmeans algorithm yields better results than the existing clustering tool.

Trust evaluation model based on improved D-S evidence theory

Lin ZHANG,Jing-wen LIU,Ru-chuan WANG,Hai-yan WANG

2013, 34(7):  167-173.  doi:10.3969/j.issn.1000-436x.2013.07.019

Asbtract ( 336 )   HTML ( 1)   PDF (277KB) ( 1070 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The existing trust evidence models cannot deal with malicious attacks in the distributed net quickly and effectively, and are lack of a trust normalization method that can measure relationship described by a triple set, so a trust model based on the improved D-S evidence theory was proposed. On this basis, basic trust value function based on continuous sequences and trust evaluation method based on evaluation function were also proposed to inhibit malicious nodes in a higher speed, and to enable the prediction results to be closer to the fact. Analysis and simulation show that this model has better effectiveness and robustness to deal th the aggregating trust attack, and trust evaluation method has better reasonableness and accuracy.

Community based multi-copied data delivery scheme for delay tolerant sensor network

Bin FU,Ren-fa LI,Xiong-ren XIAO,Ya-wei HUANG

2013, 34(7):  174-183.  doi:10.3969/j.issn.1000-436x.2013.07.020

Asbtract ( 182 )   HTML ( 0)   PDF (338KB) ( 188 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The characteristics of community structurehave effect on the data transmission procedure of delay tolerant mobile sensor network. Under the community network model,data delivery probabilities of multi-copied delivery were deduced. A community based multi-copy data delivery (CMDD)scheme was also proposed. By dynamically computing the average inter-meeting time between the communities and using the del ery probability formulations,the scheme can estimate the delivery probability when data are delivered through such community. Simulation results show that the pro-posed CMDD scheme achieves a relatively high data delivery ratio and a lower message delivery latency and transmis-sion overhead.

Fuzzy adaptive algorithm based on modified current statistical model for vehicle positioning

Zhen-hong SHAO,Wen-feng3 LI,Yi WU,Qiong YANG,Lian-feng SHEN

2013, 34(7):  184-190.  doi:10.3969/j.issn.1000-436x.2013.07.021

Asbtract ( 260 )   HTML ( 7)   PDF (302KB) ( 423 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The singer model and current statistical model were first analyzed and compared. A modified scheme based on the two kinds of models was proposed. Moreover, a modified current statistical model based-fuzzy adaptive extended Kalman filter (MCS-FAEKF)algorithm was proposed to choose maneuvering model and adjust system noise covariance dynamically. The simulated results show that the algorithm could get more accurate and reliable performance for vehicle positioning compared with the current statistical model based-extended Kalman filter (CS-EKF) and Singer-EKF algo-rithms.