Current Issue

25 January 2009, Volume 30 Issue 1

Previous Issue    Next Issue

Papers

On the parameter selection of randomness test

Li-min FAN,Deng-guo FENG,Hua CHEN

2009, 30(1):  1-6.  doi:1000-436X(2009)01-0001-06

Asbtract ( 0 )   HTML ( 0)   PDF (528KB) ( 22 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The conditions that two different parameters in a same randomness test should satisfy if they are independ-ent with each other was studied based on statistical theory. And a hypothesis method was proposed to test whether two parameters were independent or not. A series of experiments were designed to study the relations among the parame-ters gather of poker test,which was selected as a research instance by means of this method, and the experiment results were analyzed in details. The method is general and it can be used to deal with other randomness test, such as entropy test and binary derivation test. The work is helpful to select reasonable and scientific parameters in practical random-ness test.

New related-key rectangle attack on 42-round SHACAL-2

Yong-zhuang WEI,Yu-pu HU

2009, 30(1):  7-11.  doi:1000-436X(2009)01-0007-05

Asbtract ( 0 )   HTML ( 0)   PDF (1218KB) ( 150 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the distinguisher and a technique of key-byte guessing. It is shown that related-key rectan-gle attacks with only 2 related keys on 40-round and 42-round reduced SHACAL-2 all require data complexity of about 2²³⁵chosen plaintexts and time complexity of about 2^432.6encryptions on 40-round reduced SHACAL-2, and 2^472.6en-cryptions on 42-round reduced SHACAL-2, respectively. The presented results are better than previous published crypt-analytic results on reduced SHACAL-2 in terms of both the data complexity and the time complexity.

Research of energy-efficient hybrid communication algorithm in wireless sensor networks

Shu-gang LIU,Hong-li LIU,Jie ZHAN,Yao-nan WANG

2009, 30(1):  12-17.  doi:1000-436X(2009)01-0012-06

Asbtract ( 0 )   HTML ( 0)   PDF (1327KB) ( 13 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An energy-efficient hybrid communication algorithm (EEHCA) based on the classic low energy adaptive clus-tering algorithm (LEACH) was proposed. The cluster heads were selected in terms of residual energy of nodes and dis-tance between cluster heads by base station. And sensor nodes communicate with cluster heads alternately with single hop mode and multi-hop mode. The probability of single hop mode was p and The probability of multi-hop mode was 1?p. The hybrid communication mode obtained a more uniform distribution of cluster heads and balanced load of sensor nodes. The results of simulation show that the algorithm effectively balances the energy consumption of nodes. And the algo-rithm has been proposed is clearly better than LEACH in prolonging the lifetime of WSN.

Novel low-delay video transmission scheme based on SR-SW-HARQ

Xiao-fang QIN,Da-cheng YANG,Xin ZHANG

2009, 30(1):  18-24.  doi:1000-436X(2009)01-0018-07

Asbtract ( 0 )   HTML ( 1)   PDF (1898KB) ( 17 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To implement low delay video transmission, a novel scheme based on hybrid automatic repeat request (HARQ) technique was proposed. For three different priority-data based on H.264data partition mode, a combined protocol of se-lective repeat automatic repeat request (ARQ) and stop-and-wait ARQ was adopted at the link layer and an adaptive HARQ retransmission scheme was adopted at the physical layer. Comparing with the traditional scheme based on single slice mode, the simulation results show that less transmission delay and better throughput performance are achieved with improved video reconstructed quality.

Algorithm for multichannel blind deconvolution based on subspace decomposition

Wei-hong FU,Xiao-niu YANG,Nai-an LIU,Xing-wen ZENG

2009, 30(1):  25-30.  doi:1000-436X(2009)01-0025-06

Asbtract ( 0 )   HTML ( 0)   PDF (1215KB) ( 515 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aim at the blind separation of convolution mixture signals, a novel algorithm for multi-channel blind decon-volution was presented. Firstly, this algorithm transforms the convolution mixture into the instantaneous linear mixture by subspace decomposition. The second step is to separate the estimated linearized signals and to obtain the source sig-nals by using the blind source separation algorithm for instantaneous linear mixture. This algorithm needs not to solve the problem of the scale and permutation ambiguity existing in the instantaneous linear blind separation relative to the fre-quency domain method for blind deconvolution. Moreover, the algorithm doesn't need signal is independent identically distributed(i.i.d), only needs the sources are statiscally independent each other. Therefore the algorithm can process the mixing signal in intermediate frequency. Simulation results show that this algorithm can blind deconvolute not only the signals with the different carrier frequencies and different symbol rates, but also that with same carrier frequencies and same symbol rates.

Modeling and analysis of network survivability based on fuzzy inference

Mi-xia LIU,Yu-qing ZHANG,Yi HONG

2009, 30(1):  31-37.  doi:1000-436X(2009)01-0031-07

Asbtract ( 0 )   HTML ( 0)   PDF (1426KB) ( 84 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The object-oriented Petri net was used for formal description and modeling of network system. Then attack failure model was established and the transformation of system state in the presence of attack was described by the method of fuzzy inference. Finally, the value parameters were presented based on the quantification of the level of attack severity and service. The modeling and analyzing method of inferring distributed system's survivability in the early stage of sophisticated attack can measure system survivability in every stage of attack effectively and provide reliable basis for continuous service and emergency response.

Analysis of provably secure on-demand source routing in MANET

Li-qiang MAO,Jian-feng MA,Xing-hua LI

2009, 30(1):  38-44.  doi:1000-436X(2009)01-0038-07

Asbtract ( 0 )   HTML ( 0)   PDF (615KB) ( 18 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A formal model tailored to the security analysis of on-demand source routing protocols in MANET was ana-lyzed, and the improper manipulations such as mergence of the adjacent adversarial nodes in the model and the flaw in the proof for endairA were indicated. A new hidden channel attack to endairA was presented, which shows that endairA is not provably secure even in their model.

Forward-secure threshold signature scheme based on polynomial secret sharing

Dian-jun LU,GBing-ru ZHAN,Hai-xing ZHAO

2009, 30(1):  45-49.  doi:1000-436X(2009)01-0045-05

Asbtract ( 0 )   HTML ( 0)   PDF (816KB) ( 370 )   Knowledge map   

References | Related Articles | Metrics

Based on polynomial secret sharing, a new forward-secure threshold digital signature scheme was proposed. The scheme included a lot of property as follows: it was impossible to forge signature relating players to the past even if more than the threshold numbers of players are compromised, keep the public key fixed and update the secret keys at regular intervals, the scheme can tolerate mobile halting adversaries. Moreover, for assuming factoring is hard, it is for-ward-secure in random oracle model.Foundation Item: The National Natural Science Foundation of China (60863006)

Distributed security management scheme based on dynamic policies for mobile IPv6

Tian-han GAO,Nan GUO,Zhi-liang ZHU

2009, 30(1):  50-57.  doi:1000-436X(2009)01-0050-08

Asbtract ( 0 )   HTML ( 0)   PDF (1446KB) ( 242 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A distributed security management scheme based on dynamic policies for Mobile IPv6 is presented to solve the security compatible problem between MIPv6 node (MN) and the access network (AN). The distributed defensive struc-ture is integrated with MIPv6 to build a policy-based distributed security architecture. Security policies can be dynami-cally transferred within or between different security domains during MN's movement, thus to make the architecture has appreciable and self-adapting capability against the topology change of AN. Both the security of AN and the availability of MN are enhanced.

Efficient identification protocol provably secure in standard model

Yan-ping LI,Yu-min WANG

2009, 30(1):  58-62.  doi:1000-436X(2009)01-0058-04

Asbtract ( 0 )   HTML ( 0)   PDF (859KB) ( 20 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the hardness assumption of the collusion attack algorithm with k traitors (K-CAA) in a gap Dif-fie-Hellman (GDH) group, a new and efficient identification protocol is proposed. The new identification protocol is proven secure against impersonation under concurrent reset attack setting in standard model. Due to its simplicity and naturalness, low-memory, low-computation costs, and better security, the proposed scheme is well suitable for using in computationally limited devices for identification such as smart cards.

Superposition based direct downlink channel state information feedback method

Dao-feng XU,UANGYong-ming H,ANGLv-xi Y

2009, 30(1):  63-69.  doi:1000-436X(2009)01-0062-08

Asbtract ( 0 )   HTML ( 0)   PDF (2136KB) ( 61 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A low cost, real-time feedback method for downlink channel state information (DL-CSI) was proposed. DL-CSI was superimposed with uplink user sequences (UL-US) before transmission and thus exclusive occupation of system resources could be avoided. With guaranteed UL-US SER performance and DL-CSI estimation accuracy, higher spectral efficiency could be achieved by sacrificing some UL-US's symbol error rate (SER) performance. Due to spread-ing processing, DL-CSI could be accurately recovered even with little allocated energy. Simulations demonstrated the practicability of the proposed method.

Distributed probabilistic coverage-preserving configuration protocol for wireless sensor network

Ying TIAN,Shu-fang ZHANG,Ying WANG

2009, 30(1):  70-75.  doi:1000-436X(2009)01-0070-06

Asbtract ( 0 )   HTML ( 0)   PDF (1377KB) ( 24 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Coverage configuration is an effective method to alleviate the energy-limitation problem of sensor nodes in wireless sensor networks. Most of current researches were based on physical coverage model which is inconsistent with the realistic characteristic of signal propagation. Therefore, a distributed probabilistic coverage-preserving configuration protocol (DPCCP) was proposed. This protocol is based on probabilistic detection model and used Voronoi diagram to judge the probabilistic coverage degree on sensor nodes. In the simulation, LEACHE was presented by embedding DPCCP into LEACH seamlessly without any modification of the original workflow to validate the efficiency of the algo-rithem. Simulation results show that DPCCP can effectively reduce the number of active sensor nodes and prolong the network lifetime on the condition of coverage-preserving.

Technical Reports

Low-complexity synchronizer used in OFDM-UWB system

Xue-jing WANG,Liang LIU,Fan YE,Jun-yan REN

2009, 30(1):  76-81.  doi:1000-436X(2009)01-0076-06

Asbtract ( 0 )   HTML ( 1)   PDF (793KB) ( 12 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient synchronizer for OFDM-based UWB system was proposed, which consists of the filter-free sym-bol synchronizer, frequency synchronizer with improved Moose algorithm and sign-based auto-correlator. According to the results of synthesis using SMIC, 0.13μm CMOS process, the proposed design can achieve the throughput requirement with only 24% gate count and 25% power consumption of the conventional four-parallelism approach.

Image de-noising model integrating anisotropic diffusion with USFFT Curvelet transform

Jia-hong YANG,Ming-zhi HE,Li-zhong SHE,Jian-cheng ZHONG

2009, 30(1):  82-87.  doi:1000-436X(2009)01-0082-06

Asbtract ( 0 )   HTML ( 0)   PDF (765KB) ( 110 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An image de-noising model by integrating anisotropic diffusion with USFFT Curvelet transform was proposed, which combined the strongpoint of Curvelet transform with anisotropic diffusion (P-M diffusion). By choosing appropri-ate gradient threshold K through p-norms and carrying out the P-M diffusion process depend on the different scale ma-trixes of Curvelet coefficient of the image from Curvelet transform iterations, as a result, the improved model made it possible to carry out the new P-M diffusion de-noising process based on multi-scale analysis of the image. The experi-ment results have demonstrated that the model can avert the stair-casing effect in the traditional P-M diffusion effectively and keep the textures and details of images better.Foundation Item: The Natural Science Foundation of Hunan Province (08JJ3131)

Scalable video coding based on db2 lifting wavelet

Zhi-jie ZHAO,Mao-liu LIN,Zhi-min CAO,Zeng-yu LIU

2009, 30(1):  88-94.  doi:1000-436X(2009)01-0088-07

Asbtract ( 0 )   HTML ( 0)   PDF (759KB) ( 244 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A scalable video coding schemes based db2 lifting wavelet was described. A new method that using the db2 lifting wavelet to implement the MCTF was proposed. Based on the classification of the pixel, different formulation to compute high-pass frame and low-pass frame was given. The experimental results indicate that, in the scalable video coding system based on db2 wavelet, the video quality of fully reconstructed sequences and reconstructed sequences after being extracted are improved distinctly compared with the scalable video coding system based on Haar wavelet.

Generalized form of OFDM and its applications in frequency-dispersive channel

Qi-sheng CAO,De-qun LIANG

2009, 30(1):  95-101.  doi:1000-436X(2009)01-0095-07

Asbtract ( 0 )   HTML ( 0)   PDF (1533KB) ( 11 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A generalized form of OFDM was presented, termed G-OFDM. In such a system, the real and imaginary parts of complex symbols were modulated separately using different pulse shaping. The issue of pulse shaping design as well as constellations design for the G-OFDM was discussed. Numerical simulations show that G-OFDM outperforms tradi-tional OFDM in frequency-dispersive channel, and this advantage does not sacrifice its performance in AWGN immunity or time-dispersion robustness.Key words:OFDM; pulse shaping; frequency dispersion; orthogonality restrictionFoundation Item: The National Natural Science Foundation of China (60272017)

Novel antenna selection algorithm for STBC and VBLAST hybrid coding systems

Ren LI,Yong-quan JIANG,Xiao-yan LI,GEn-zhan ZHAN

2009, 30(1):  102-107.  doi:1000-436X(2009)01-0102-06

Asbtract ( 0 )   HTML ( 0)   PDF (1553KB) ( 458 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Multiple-input multiple-output (MIMO) systems improve the bit error rate (BER) performance, meanwhile,in order to reduce the impact to system capacity, a novel antenna selection algorithm for space-time block coding (STBC) and vertical Bell laboratories layered space time (VBLAST) hybrid coding systems was proposed. Employing the Alamouti STBC code for some VBLAST layers, the STBC and VBLAST hybrid coding MIMO system has the advan-tages of both STBC and VBLSAT. On the criterion of maximal antenna-subset capacity, the proposed antenna selection algorithm selects those antennas with less contribution to the system capacity to send multilayer STBC signals, so that the system capacity loss by STBC coding can be reduced. Both theoretical analysis and simulation results indicate that the proposed antenna selection algorithm increases the capacity of the STBC and VBLAST hybrid system effectively, and improves the BER remarkably comparing with a VBLAST encoding MIMO system.

Novel effective parameter for MPSK/MFSK classification

GXiao-yong ZHAN,Lai-yuan LUO,Wu-zhong LUO

2009, 30(1):  108-112.  doi:1000-436X(2009)01-0108-05

Asbtract ( 0 )   HTML ( 0)   PDF (816KB) ( 9 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel parameter, named centrality of instantaneous frequency, was proposed for the classification of M-ary phase-shift keying (MPSK) and M-ary frequency-shift keying (MFSK) signals. The distributions of instantaneous fre-quency (IF) of MPSK and MFSK signals were introduced, both without and with additive white Gaussian noise by ana-lyzing the characteristic of the distribution, a conclusion was arrived at and the new parameter was put forward naturally. Then, all factors which would affect the value of the parameter were carefully investigated. Monte carlo experiments were carried out to test the performance of the parameter. The computer simulation results show the overall effectiveness of the parameter in dividing MPSK and MFSK signals. The accuracy is not below than 96% when the SNR is above 4dB.

Concise Papers

Probabilistic scheduling algorithm for providing proportional delay differentiation in content-based online charging system

Hai HU,Jian-xin LIAO,Xiao-min ZHU,Le-jian ZHANG,Ge YANG

2009, 30(1):  113-120.  doi:1000-436X(2009)01-0113-08

Asbtract ( 0 )   HTML ( 0)   PDF (925KB) ( 214 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel request scheduling algorithm was proposed for the OCS (online charging system) server. The basic idea is that one of the requests from all classes of service queues is scheduled with some priority probability which is based on the system queue-length, the request arrival rate, and the pre-assigned delay differentiation parameter. The ex-perimental results show that, in considering request service delays, this proposed algorithm always outperforms some other traditional PDD (proportional delay differentiation) scheduling ones and the performance advantages are relatively greater when request service delays increase and vary greatly from each other. Furthermore, it can efficiently meet 6 QoS (quality of service) requirements proposed in content-based billing.

Congestion control algorithm based on jitter detection in metro Ethernet networks

Jun-ru HAO,Shao-hua YU

2009, 30(1):  127-131.  doi:1000-436X(2009)01-0121-07

Asbtract ( 0 )   HTML ( 0)   PDF (1739KB) ( 9 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel congestion control algorithm (JDCC) for multimedia traffics was proposed. JDCC improves the QoS of multimedia stream in metro Ethernet network by detecting and discarding packets that accumulated enough jitter so as to maintain a high bandwidth for packets that stay within the multimedia stream's jitter tolerance. Simulation results have shown that the proposed scheme can effectively lower the average received packet jitter than that using traditional con-gestion control algorithm RED and DropTail. Moreover, the proposed scheme can improve the useful goodput of the re-ceived packets when compared to RED and DropTail.Foundation Item: The National High Technology Research and Development Program of China (863 Program)(2005AA121410)

Study of on-demand COPE-aware routing protocol in wireless mesh networks

Kai FAN,Ling-xiong LI,Dong-yang LONG

2009, 30(1):  128-134.  doi:1000-436X(2009)01-0128-07

Asbtract ( 0 )   HTML ( 0)   PDF (1388KB) ( 118 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new wireless routing protocol called OCR was presented, enhancing throughput of unicast traffic in wireless mesh networks (WMN). In the routing discovery, OCR could actively detect the possible coding opportunities and make a tradeoff among these factors: utilizing the coding opportunities, finding the shortest path and neatly avoiding the con-gestion. The simulation results show that the network throughput can be greatly improved by OCR, compared to the tra-ditional routing protocol, when using COPE.Foundation Item: The National Natural Science Foundation of China (60573039)

Network scheduling algorithm based on Stackelberg Game with incentive strategy

Jiao-long WEI,Jin HU,Wen-juan DAI,Jia-hong ZOU

2009, 30(1):  135-140.  doi:1000-436X(2009)01-0135-06

Asbtract ( 0 )   HTML ( 0)   PDF (1364KB) ( 194 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

First, a Stackelberg Game network model was built. In this model, the existence of Nash equilibrium was ana-lyzed and the team optimal solution of the network was available. Then a network scheduling algorithm based on Stackelberg Game with incentive strategy which can adjust the network from general state to optimal state by dynamic Game and gradual induction was introduced into the network resource management. The team-optimal solution ensures the stability of network in the optimal state. Finally, the simulation results demonstrate the effectiveness of the algorithm.