Current Issue

25 April 2011, Volume 32 Issue 4

Previous Issue    Next Issue

Papers

Resilient method for recovering coverage holes of wireless sensor networks by using mobile nodes

Liang-min WANG,Fei LI,Ying QIN

2011, 32(4):  1-8.  doi:1000-436X(2011)04-0001-08

Asbtract ( 0 )   HTML ( 1)   PDF (479KB) ( 337 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Coverage holes directly reduce network performance and become a key problem of static wireless sensor net-works.A hole-patching method was presented to get the resilient coverage,in which mobile nodes were guided by the boundary nodes of the coverage hole and patched uncovered area in the hole triangle by triangle.Based on geometry theories and mathematic deduction,the moving destination of the mobile nodes was proved to be optimal,and the cover-age of the patched holes was higher than 90%.Simulation results show the coverage,stability and redundancy of the proposed method,and then the availability was compared with some related methods reported recently.

Characterizing the topology dynamics in mobile ad hoc networks:modeling and analyzing techniques using the queuing theory

Guang-cheng QIN,Pan-long YANG,Chang TIAN,Qiang CHEN,Hao YIN

2011, 32(4):  9-16.  doi:1000-436X(2011)04-0009-08

Asbtract ( 0 )   HTML ( 0)   PDF (518KB) ( 14 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new modeling parameter named link broken rate (LBR) was proposed so as to characterize the topology dy-namics.On the basis of the definition of the network dynamic characteristics parameter LBR,the expectations of the time interval between the links broken was use to measure the LBR,and a cyclic queuing model was created to analyze the characteristic of dynamic link and an analytic expression was derived.Employing the commercial simulation platform Qualnet,simulations were carried out and the model was reasonable evaluated.And the further simulation results show that,the network dynamic performance are highly related to the LBR,and the dynamic link model can integrate the mo-bility velocity,node density,and transmission range efficiently,which essentially characterize the network,and could provide theoretical results for analysis and simulation works on network dynamics.

On the algebraic immunity for 1st-resilience Boolean functions with five variables

Jiao DU,Qiao-yan WEN,Jie ZHANG,Shou-chao SONG

2011, 32(4):  17-24.  doi:1000-436X(2011)04-0017-08

Asbtract ( 0 )   HTML ( 0)   PDF (431KB) ( 93 )   Knowledge map   

References | Related Articles | Metrics

An upper bound of the resilience of Boolean functions with optimal algebraic immunity was proposed,proved that the algebraic immunity of a special family of 1st-resilience Boolean functions with five variables were not optimal,and demonstrated some possible structures of the 1st-resilience Boolean functions with optimal algebraic immunity.In addition,the relationships among the number of the variables,the algebraic immunity,and the resilient order were stidied.At last,a 1st-resilience Boolean function with five variables with optimal algebraic immunity are given.

Geometrically synchronous watermarking algorithm based on the corner feature

Quan LIU,Le ZHANG,Yong-gang ZHANG,Bessiere Christian,Qi-ming FU,Xiao-yan WANG

2011, 32(4):  25-31.  doi:1000-436X(2011)04-0025-07

Asbtract ( 0 )   HTML ( 0)   PDF (467KB) ( 304 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Simple geometric attacks could destroy watermark or its position,causing the failure of most watermarking algorithm.A geometrically synchronous watermarking algorithm robust based on the corner feature was proposed.In this paper,the feature point was detected on the normalization of the image to resist geometric attack; the combination of Harris and MIC corner detected algorithm was utilized to extract steady corner based on analyzing the advantages and disadvantages of the two algorithm; the watermarking information was statistic embed in the shape of rings instead of changing the simply one pixel.Sufficient experiments demonstrate the robustness of this approach,especially in resisting geometry attack such as RST (rotation,scaling and translation).

Notes on channel capacity per unit cost

Da-gang TIAN

2011, 32(4):  32-38.  doi:1000-436X(2011)04-0032-07

Asbtract ( 0 )   HTML ( 2)   PDF (310KB) ( 32 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For the computation of the capacity per unit cost,an extension of the basic theorem connect the capacity per unit cost with the capacity-cost function was made,and the single peak of the generalized capacity-cost function per unit cost was proved.Then,an algorithm to locate the optimal point of the generalized capacity-cost function per unit cost based on the single peak of the function was proposed.Meanwhile,it was proved that the computation of the capac-ity-cost function,which is a constrained channel capacity issue,can be expressed as a convex optimization,to which the objective function is self- concordant.The algorithm and its computational complexity were given.

Radio resource sharing for wireless networks with traffic type and fairness consideration

Lei-fang HUI,Jian-dong LI,Li-yuan XIAO,Han-qing DING

2011, 32(4):  39-46.  doi:1000-436X(2011)04-0039-08

Asbtract ( 0 )   HTML ( 1)   PDF (498KB) ( 86 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Two radio resource sharing algorithms for wireless networks,C_TDRS and S_TDGRS,were proposed based on graph coloring.They aimed to satisfy users' demands from the perspective of sub-channel and stream respectively,with traffic type and fairness into consideration.Simulation results show that,the sharing results are closer to the optimal solution than the existing one in terms of system throughput and proportional fairness.Besides,S_TDGRS has a good tradeoff for the two criterions.

Predicting self-similar networking traffic based on EMD and ARMA

Bo GAO,Qin-yu ZHANG,Yong-sheng LIANG,Ning-ning LIU,Cheng-bo HUANG,Nai-tong ZHANG

2011, 32(4):  47-56.  doi:1000-436X(2011)04-0047-10

Asbtract ( 0 )   HTML ( 0)   PDF (760KB) ( 764 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel method based on empirical mode decomposition (EMD) and ARMA was proposed to model and fore-cast self-similar networking traffic.The results demonstrate that EMD had the function of getting rid of the long range dependence(LRD) in traffic data.Therefore,the self-similar traffic processed by EMD could be modeled and predicted well by using ARMA which was a short range dependent(SRD) model.Moreover,the complexity of the proposed method was reduced sharply and the prediction precision was higher than radial basis function neural network.

Dynamic traffic balancing scheme for LB-BvN to guarantee in-order packet delivering

Hong-chao HU,Yun-fei GUO,lin PANG,You-jun BU

2011, 32(4):  57-65.  doi:1000-436X(2011)04-0057-09

Asbtract ( 0 )   HTML ( 0)   PDF (573KB) ( 10 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to its outstanding extensibility performance,the LB-BvN switch had attracted much attention recently in the switching technology academia.However,the problem that it might disturb the sequences of packets made it not so applicable in practice.To overcome this,the principles for guaranteeing packets in order switching were first discussed.Then,based on these principles,it focused on research on the transmission characteristics in network traffic and came up with DFA and DFS algorithms.DFA assigned the switching paths to each flow based on their transport layer parameters to make sure that each packet in the flow were in order.DFS was more sophisticated than DFA in that it first divided flows into flowlets.In this way,the flowlets in the flows were in order.Both DFA and DFS could achieve in order packets switching with limited flow states maintained in the line-cards.Simulation results show that both DFA and DFS can achieve good performance.

Botnets' similarity analysis based on communication features and D-S evidence theory

Tian-ning ZANG,Xiao-chun YUN,Yong-zheng ZHANG,Chao-guang MEN,Xiang CUI

2011, 32(4):  66-76.  doi:1000-436X(2011)04-0066-11

Asbtract ( 0 )   HTML ( 0)   PDF (545KB) ( 211 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A potential hidden relationship may exist among different zombie groups.A method to analyze the relationship among botnets was proposed based on the communication activities.The method extracted several communication fea-tures of botnet,including the number of flows per hour,the number of packets per flow,the number of flows per IP and the packet payloads.It defined similarity statistical functions of the communication features,and built the analysis model of botnets relationship based on the advanced dempster-shafer (D-S) evidence theory to synthetically evaluate the simi-larities between different zombie groups.The experiments were conducted using several botnet traces.The results show that the method is valid and efficient,even in the case of encrypted botnet communication messages.Moreover,the ideal processing results is achieved by applying our method to analyze the data captured from the security monitoring platform of computer network,as well as compare with similar work.

Sequential blind signal separation algorithm based on bacterial colony chemotaxis

Lei CHEN,Li-yi ZHANG,Yan-ju GUO,Jun-qing ZHAO,Qiang LI

2011, 32(4):  77-85.  doi:1000-436X(2011)04-0077-09

Asbtract ( 0 )   HTML ( 0)   PDF (632KB) ( 7 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A bacterial colony optimization algorithm based on bacterial chemotaxis was proposed.Detection determina-tion strategy and random perturbation strategy was led in the process of bacterial colony evolution for solving the diffi-culty of locating on global optimal position because of the random move state of the bacteria in later period of evolution process.The bacterial colony optimization algorithm proposed has excellent performance in convergence speed and solu-tion quality by comparing with other algorithm using test function.Furthermore,the bacterial colony optimization algo-rithm proposed was used for solving blind signal separation problem and the sequential blind separation for source signal was realized.Simulation results show that the blind separation algorithm based on bacterial colony optimization algo-rithm has excellent separation effectiveness.Source signal can be separated efficiently according to the order of their ab-solute value descending of normalized fourth-order cumulant.

Software reliability prediction with an improved Elman network model

Xu-chao CHENG,Xin-yu CHEN,Ping GUO

2011, 32(4):  86-93.  doi:1000-436X(2011)04-0086-08

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

Figures and Tables | References | Related Articles | Metrics

In order to improve accuracy and dependability of using neural network for software reliability prediction,a multi-objective optimization-based improved Elman recurrent network method (Mop-IElman) was proposed.First,on the basis of the Elman network,a self-delay feedback of the output layer as another context layer was designed.Second,the network architecture and the initial outputs of these two context layers were taken as variables of network configuration setting,and NSGA-II was employed to simultaneously optimize prediction performance and robustness,then the Pareto solution was obtained.After that,by maximizing the sum of prediction performance and robustness,the final network configuration setting was determined.Finally,the proposed method was compared with the feed-forward neural network,the Elman network,both the single-objective and the multi-objective optimization Elman networks with respect to two real software failure data.It demonstrated that the proposed Mop-IElman achieves higher prediction accuracy and de-pendability.

Technical Report

Multi-user broadcast authentication scheme in wireless sensor networks with defending against DoS attacks

Jiang-hong GUO,AJian-feng M

2011, 32(4):  94-102.  doi:1000-436X(2011)04-0094-09

Asbtract ( 0 )   HTML ( 0)   PDF (404KB) ( 12 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multi-user broadcast authentication scheme was proposed in wireless sensor networks with defending against DoS attacks(DDA-MBAS) based on vBNN-IBS signature,the bogus messages could be filtered using hash op-eration and user information.Compared with existing multi-user broadcast authentication schemes,except defending against node compromise attack and active attack,the bogus messages can be filtered with low energy consumption and the threat of DoS attack and collusion attack launched by compromised user can be limited effectively.

Link quality estimation model for wireless sensor networks under non-perceived packet loss

Jian SHU,Lin-lan LIU,You-lei FAN,Jun LI

2011, 32(4):  103-111.  doi:1000-436X-32-4-00103

Asbtract ( 0 )   HTML ( 0)   PDF (523KB) ( 358 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For the existing link quality estimation with no consideration of the incomplete packet impact on link quality in wireless sensor networks,the packet loss was divided into two categories-perceived packet loss and non-perceived packet loss.A link quality estimation model under non-perceived packet loss has been proposed on the basis of the analy-sis of the causes for the non-perceived packet loss and the measurement of the non-perceived packet loss.When the model is being built,Kalman filter is introduced to denoise the acquired CCI (chip correlation indicator).The cubic model and the least squares method are employed in the fitting relationship between CCI and non-perceived packet loss ratio.The experiment results show that the link quality estimation model is reasonable,and non-perceived packet loss ra-tio coming from this model is very close to the measured value.

Result merging method based on combined kernels for distributed information retrieval

Xiu-hong WANG,Shi-guang JU

2011, 32(4):  112-118.  doi:1000-436X(2011)04-0112-07

Asbtract ( 0 )   HTML ( 0)   PDF (379KB) ( 16 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To enhance the performance of result merging for distributed information retrieval (DIR),a novel merging method was put forward,which was based on relevance between retrieved results and query.Improved latent semantic kernel (LSK) was combined with analysis of variance (ANOVA) kernel to calculate the relevance.Experimental results showed that the result merging precision of the combination of LSK and ANOVA kernel (CLA) is 16.79%,30.73%,20.37%,24.17%,14.25%,13.50% and 7.53% higher than that of Round-robin,ComMNZ,Bayesian,Borda,SDM,MEM and regression SVM respectively.CLA kernel method has better performance for result merging and is a practical method for result merging in DIR.

Blind identification and digital calibration method of broadband receiver front-end nonlinearity

Jun PENG,Hong MA,Jiang,HUXiao JIN,Xiao HU,Liang PENG,Hui ZHANG,Wu-Jun GUO

2011, 32(4):  119-124.  doi:1000-436X(2011)04-0119-07

Asbtract ( 0 )   HTML ( 0)   PDF (388KB) ( 69 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel real-time digital nonlinearity post-calibration method was developed based on the Volterra series.With the purpose of fitting the inverse transfer function of the nonlinear distortion characteristics of the receiver,parameters of the model were measured and self-adaptively updated without knowledge of the inputs using the blind identification cri-terion that was aimed at the minimizing of the total energy of the frequencies other than strong signals in the calibrated outputs.Experimental results on multi-tone excitation and 16-QAM modulation input show that with the proposed method,spurs-free-dynamic-range(SFDR) of the high efficiency nonlinear receiver front-end would achieve almost 26dB improvement,and the ability of the system in weak signals detection can be also significantly enhanced.

Study on multi-channel reservation based MAC protocol for sensor networks

De-sheng ZHANG,Jin-bao LI,Long-jiang GUO

2011, 32(4):  126-137.  doi:1000-436X(2011)04-0126-12

Asbtract ( 0 )   HTML ( 0)   PDF (767KB) ( 114 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at triple hidden terminal problems in wireless sensor networks,an adaptive duty cycle based multi-channel MAC protocol was proposed,called MCR.MCR efficiently handled triple hidden terminal problems with multiple channel reservation.By minimizing the lower bound of average times of channel switching in MCR,the optimal duty cycle in theoretical analysis was obtained.To investigate values of multiple channel reservation and dynamic duty cycling in MCR,extensive simulation and real testbed experiments were conducted.The results show that compared with other protocols,when the number of channels is larger or loads are heavy,M-cube improves throughput and energy effi-ciency significantly.

Research on alert correlation method based on alert confidence in multi-IDS environment

Hai-bin MEI,Jian GONG

2011, 32(4):  138-146.  doi:1000-436X(2011)04-0138-09

Asbtract ( 0 )   HTML ( 0)   PDF (541KB) ( 127 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To overcome the shortcoming of current alert correlation methods which didn't consider the confidence of IDS,an alert correlation method based on alerts confidence using the evidence theory was presented.Each alert was regarded as a piece of evidence of a network attack.Then multiple pieces of evidence were combined by the Dempster's combina-tion rule,and used to infer whether the attack corresponding to the alerts took place.As a result,the ambiguity and con-fliction in alerts were eliminated,achieving the goal of improving alerts quality.Experimental results on the DARPA 2000 IDS test dataset show that the proposed method can efficiently decrease the false alert rate and reduce more than 60% of the alerts.

Short essay

Analysis of operational channel selection of dynamic spectrum sharing wireless communication system based on RF front-end

Chang-jiang YOU,Xiao-wei ZHU,Jing LIU,Xiao-dong ZHANG

2011, 32(4):  147-152.  doi:1000-436X(2011)04-0147-06

Asbtract ( 0 )   HTML ( 0)   PDF (382KB) ( 8 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Because of the existence of primary user signals and the inevitable nonlinearity of some RF devices,the inter-ference signals such as three-order intermodulation signal would be produced in the front-end of RF receiver.To reduce the impact of interference signals,the interference which was caused by primary user signals to dynamic spectrum shar-ing wireless communication system was analyzed on the front-end of RF receiver side.Then,the restriction on opera-tional channel selection of dynamic spectrum sharing wireless communication system was derived.By following the re-striction,the negative effects caused by interference signals could be reduced and the quality of communication in dy-namic spectrum sharing system was guaranteed.Finally,availability of the restriction on operational channel selection is verified experimentally in UHF dynamic spectrum sharing wireless communication system.

Network traffic prediction based on wavelet transformation and FARIIMA

Xiao-tian CHEN,Jing-xian LIU

2011, 32(4):  153-157.  doi:1000-436X(2011)04-0153-05

Asbtract ( 0 )   HTML ( 0)   PDF (382KB) ( 326 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An advanced network traffic prediction method based on wavelet transformation and FARIMA model was put forward.In the method,the original data was decomposed and reconstructed with Mallat algorithm,then FARIMA model was applied on each branch to predict and integrate the traffic.Simulation is carried out to verify the accuracy of pro-posed algorithm with real network traffic.Compared with the traditional method,the proposed method reduces the pre-diction error.

Hish speed deep packet inspection method with low power dissipation

Guo-sheng ZHU,Shao-hua YU

2011, 32(4):  158-165.  doi:1000-436X(2011)04-0158-08

Asbtract ( 0 )   HTML ( 0)   PDF (368KB) ( 169 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Hish speed deep packet inspection using TCAM faces the problem of high power dissipation.A 2-phase DPI method BF-TCAM was proposed.The first phase used parallel Bloom filters to exclude the normal packets not including attack signatures.The second phase used TCAM to inspect suspicious packets including real attack packets and false positive packets of the first phase.The Bloom filters' false negative probability is zero and false positive probability is very low.Since most of the network data traffic does not include attack signatures,the method can get high speed deep packet inspection with low power dissipation.

Markov-based availability analysis of clusters for distributed rendering system

Zhi-guo HONG,Yong-bin WANG,Min-yong SHI

2011, 32(4):  166-174.  doi:1000-436X(2011)04-0166-09

Asbtract ( 0 )   HTML ( 0)   PDF (12243KB) ( 7 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The availability of system comprising multiple cluster nodes in the case of CMF was studied.Firstly,contra-posing to the system with two cluster nodes,two CTMC models for the step-by-step recovery mechanism and uniform resetting one were proposed respectively.Furthermore,the conclusion on the priority and inferiority comparison for re-lated plans of different mechanisms was derived thereby.Moreover,its correctness was simulated and validated by sto-chastic reward nets tool.Additionally,the availability of system with n(n>2) cluster nodes was discussed.