Current Issue

25 September 2012, Volume 33 Issue 9

Previous Issue    Next Issue

Academic paper

Evolving multicast tree based artificial fish swarm algorithm

Xuan MA,Qing LIU

2012, 33(9):  1-7.  doi:1000-436X(2012)09-0001-07

Asbtract ( 0 )   HTML ( 0)   PDF (142KB) ( 334 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An artificial fish swarm algorithm with two regions model was proposed.The algorithm used a multicast tree formed by the predecessor orientation method to represent an artificial fish,and divided the search space into feasible re-gion and infeasible region.The artificial fishes in the feasible region and the infeasible region were given different mov-ing objectives,respectively.The behavior operator was designed to adaptively implement four behaviors of artificial fish.Experimental results show that the proposed algorithm can effectively make use of the infeasible individuals and per-forms better in searching least-cost multicast tree with delay constraint.

Study on self-similar call admission control algorithm in WiM AX

Yong-dong HU,Guo-xin WU,Ning QIAN,San-feng ZHANG

2012, 33(9):  8-14.  doi:1000-436X(2012)09-0008-07

Asbtract ( 0 )   HTML ( 0)   PDF (119KB) ( 357 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As to the self-similarity of WiMAX network traffic,M/Pareto model was proposed to model network traf-fic.Through the statistical nature between the M/Pareto model and FBM traffic model,the parameters of the M/Pareto were mapped to the ones of FBM traffic model.The effective bandwidth formula was derived for M/Pareto model para-meters.Whereby,a self-similar call admission control algorithm(SS-CAC)was designed.It avoided getting the parame-ter values of FBM traffic flow model with the measurem method and adapted to the self-similarity of WiMAX traffic.Since the calculation of the effective bandwidth was accurate and convenient,simulation results show that SS-CAC greatly reduces the call blocking rate and improves the bandwidth utilization.

Three-dimensional polarization amplitude modulator and demodulator

Han-bin SONG,Jun-bo ZHANG,Xiao-guang CHEN,Jian-qiu ZHANG

2012, 33(9):  15-22.  doi:1000-436X(2012)09-0015-08

Asbtract ( 0 )   HTML ( 0)   PDF (205KB) ( 605 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the mathematical description of a space electromagnetic field,a novel approach to the three-dimen-sional joint modulation of the signal amplitude,polarization angle and polarization phase angle of an electromagnetic signal in wireless communication was presented.The model of the three-dimensional modulation signal was first given by the equations of the relationship among the parameters of a space electromagnetic field.Then,the transmission im-plementation of the three-dimensional joint modulation signal was discussed by a vector antenna.At the receiving end,a signal amplitude detection and DOA polarization parameter estimation method was given to demodulate the received three-dimensional joint modulation signal.The bit error rate and performance of the proposed three-dimensional joint modulator and demodulator were analyzed.Both the analysis and the simulation results show that a high information transmission and a low bit error rates can simultaneously be obtained by the proposed method.

Analysis and improvement of route switch in IEEE 802.11s

Bo YOU,Yue-peng YAN

2012, 33(9):  23-30.  doi:1000-436X(2012)09-0023-08

Asbtract ( 0 )   HTML ( 0)   PDF (164KB) ( 894 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Analyzed the route switch of hybrid wireless mesh protocol(HWMP)in IEEE 802.11s and made an improve-ment to reduce the packet lost rate when routes switching was analyzed.Based on the received signal strength indica-tor(RSSI)a scheme with judgment threshold in mesh peer link management protocol was proposed,which controlled the status of peer link to change the timing of route switch.In this way,the packet lost was avoided.The experimental results show that the improvement reduces the packet lost rate by 2%~5% compared with traditional IEEE 802.11s in uncon-trolled wireless environment when nodes moving in low speed.

Danger theory inspired intrusion detection model for wireless sensor networks

Rong-rong FU,Kang-feng ZHENG,Tian-liang LU,Yi-xian YANG

2012, 33(9):  31-37.  doi:1000-436X(2012)09-0031-07

Asbtract ( 83 )   HTML ( 3)   PDF (137KB) ( 486 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

According to the challenges of intrusion detection technique for wireless sensor networks,a danger theory in-spired intrusion detection model was proposed by taking advantage of the working principle of artificial immune system.Due to the distributed and cooperative mechanism,the proposed model shows more advantages in detection performance and energy consumption than methods adopt promiscuous to get global knowledge.The simulation results show that compared to traditional Watchdog algorithm with single threshold and self-nonself(SNS)model,the model inspired by danger theory can provide highest correct detection rate and lowest false detection rate.Moreover,the model can also decrease the energy consumption of the system.

Research on load-balanced construction algorithm of logical carrying network

Hao-xue WANG,Ming JIANG,Ji FU

2012, 33(9):  38-43.  doi:1000-436X(2012)09-0038-06

Asbtract ( 50 )   HTML ( 0)   PDF (133KB) ( 370 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the extensibility of network service,constructing algorithm of logical carrying network was pro-posed by mapping the demands of network service into substrate network.To solve the problem of construction efficiency,on-demand carrying strategy was introduced to provide different resources to meet different service requirements.Based on available resource and current link load,an improved multi-commodity flow model was proposed to compute the re-source allocation.Simulation results indicate this al ithm can improve network service capability from construction success rate and average construction profit.

Target counting algorithm via local signal recovery in sensor networks

Wen-tao JIANG,Li-min SUN,Jun-wei LV,Hong-song ZHU

2012, 33(9):  44-52.  doi:1000-436X(2012)09-0044-09

Asbtract ( 68 )   HTML ( 1)   PDF (181KB) ( 388 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the deficiencies of existing targets counting algorithms in sensor networks,a local signal recovery based target counting algorithm(LSR)was proposed.LSR firstly searched for the possible local area where targets may exist,and then established a local signal recover model according to signal attenuation characteristic and nodes' distribu-tion.Finally,LSR sought the best target distribution estimation in each possible local area through the established model and obtained the target counting result by summarizing the estimations.Simulation results demonstrate that LSR pos-sesses good merits in counting precision,noise tolerance and energy consumption.

Structure-free and dynamic-adaptive data fusion algorithm for wireless sensor networks

Jun YUE,Wei-ming ZHANG,Wei-dong XIAO,Da-quan TANG,Jiu-yang TANG

2012, 33(9):  53-65.  doi:1000-436X(2012)09-0053-13

Asbtract ( 47 )   HTML ( 0)   PDF (186KB) ( 268 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Researches on the problem that the existing data fusion algorithms couldn't satisfy the new application re-quirements,ie,frequent dynamic change of network and hi demand with reliability of data communication,a struc-ture-free and dynamic-adaptive data fusion algorithm was presented which divided the network into several grids,sensors perform data communication according to grids and adopt many-to-many data communication manner,there was no need for sensors to establish and maintain a structure.The results of simulation experiments show that this algorithm is able to adapt the dynamic change of network and offer high reliable data communication while performs the task of data fusion.

Research on the cloud services provider-oriented services selection method

Yun-yong ZHANG,Su-fen LI,Jun WU,Bing-yi FANG

2012, 33(9):  66-76.  doi:1000-436X(2012)09-0066-11

Asbtract ( 60 )   HTML ( 0)   PDF (161KB) ( 193 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to select services more accurately,firstly,a detailed process for services selection was proposed from the perspective of cloud services providers.Secondly,a services selection mathematical programming model was pro-posed for the selection of cloud services by considering two kinds of factors:QoS attributes and services scheduling re-lated parameters,and the model was solved by the GA-based algorithm.Finally,a case study is conducted to demonstrate the feasibility and effectiveness of the proposed approach.

Research on energy-saving method based on reconfigurable network architecture

Sheng-quan LIAO,Chun-ming WU,Bin WANG,ming JIANG

2012, 33(9):  77-84.  doi:1000-436X(2012)09-0077-08

Asbtract ( 70 )   HTML ( 3)   PDF (338KB) ( 252 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the aim to address the problem that current energy-saving algorithms in the IP network were low practical,an energy-saving method in the reconfigurable network architecture base on its natural features was proposed that the central server unified manages the routing configuration of all the routers.The method firstly using the modified OSPF protocol algorithm to determine a candidate link set in which a l the links were probably closed or sleep,then the mul-ti-commodity model was utilized to remap the traffic volume of these links to other physical paths.Thus,some links can be idle since their data flows had been redirected.It was reasonable to power off idle physical links for the purpose of saving energy.Finally,the simulated experiments had verified the effects of saving energy and the differences between the proposed algorithm and the high recognized energy-saving method –GreenTE were given.

Efficient attack detection and data aggregation algorithm

Hong-bing CHENG,Chun-ming RONG,Xiao HUANG,Skjalg EGGEN,Qing-kai ZENG

2012, 33(9):  85-94.  doi:1000-436X(2012)09-0085-10

Asbtract ( 87 )   HTML ( 1)   PDF (189KB) ( 463 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient algorithm of attack detection and data aggregation for wireless multimedia sensor networks based on the previous work was proposed.The proposed algorithm concludes the action trait of sensor nodes from their attribute vectors without any prior knowledge,at the same time;it was scalable and could be applied in large scale net-works.The simulation results show that the proposed algorithm can detect the attacks action more accurate than other technologies,and can make data aggregation efficiently.At the same time,the proposed algorithm can make the wireless multimedia sensor networks secure and reduce communication flow so that it will save a lot of resources in wireless mul-timedia sensor networks.

Stable enclosure based hybrid routing schema in heterogeneous wireless networks

Zhi LI,Yi JIANG,Qian-mu LI,Feng-yu LIU

2012, 33(9):  95-104.  doi:1000-436X(2012)09-0095-10

Asbtract ( 48 )   HTML ( 0)   PDF (175KB) ( 377 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The model of heterogeneous wireless networks was analyzed and a hybrid routing schema based on MANET stable enclosure was proposed.This schema could transform the routing protocol between MANET and DTN based on the local topology in real time.In the stable enclosure,AODV was used to improve packet relaying efficiency.When packet relayed to the disconnected area,the routing protocol transcended to Prophet to avoid routing failed.It fully used the advantage of MANET and DTN routing protocol.The feasibility of the proposed algorithm is demonstrated,and it is more efficient than the other DTN routing protocols used in the heterogeneous wireless networks.

Research on input-queued slicing domain scheduling based on Crossbar in the reconfigurable network

Bo ZHANG,Bin-qiang WANG,Shan-shan WANG,Hong-quan WEI,Hui LI

2012, 33(9):  105-115.  doi:1000-436X(2012)09-0105-11

Asbtract ( 51 )   HTML ( 0)   PDF (270KB) ( 340 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problem which was switching fabric could not meeting scale application of abundant differ-ent business in traditional technology system.The slicing domain scheduling viewpoint based on reconfigurable network technology system was proposed.It used selecting and closing part Crossbar switching points slicing model.It analyzed and deduced smoothed deficit round-robin(SDRR)scheduling algorithm in carrying group and longest queue first(LQF)sche-duling algorithm in scheduling domain.Then it contrasted complexity and time delay in switching performance evaluation system(SPES).The results show that the complexity of slicing domain LQF is less than traditional LQF.The more number of domains is,the less complexity of slicing domain LQF is.The time delay of slicing domain scheduling with three slices is less than others without slicing domain,and is close to time delay of fair output-queued scheduling algorithm.

Hole recovery algorithm based on mobile inner nodes in wireless sensor networks

Kai YANG,Quan LIU,Shu-kui ZHANG,Jin LI,Dong-liang WENG

2012, 33(9):  116-124.  doi:1000-436X(2012)09-0116-09

Asbtract ( 77 )   HTML ( 0)   PDF (190KB) ( 354 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problem of coverage holes in target areas,a principle for hole recovery was proposed.Based on the principle,a novel algorithm named SOI was proposed for hole recovery using mobile nodes,which does not require location information,figures out the optimal inner nodes in the edge of coverage holes,and then moves them to new po-sitions.Through this mechanism,the area of coverage holes could be reduced.Analysis and simulation results show that,SOI has a better performance in dense deployed wireless sensor networks compared with existing VHR algorithm.

Polynomial estimation method for PN sequence based on reliability accumulation

Song CHEN,Kai-zhi HUANG,Hua ZHAO

2012, 33(9):  125-131.  doi:1000-436X(2012)09-0125-07

Asbtract ( 69 )   HTML ( 1)   PDF (138KB) ( 781 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The issues of insufficient efficiency and poor error-tolerance of current high-order polynomial estimation me-thods under error conditions were studied.By combining the iterative berlekamp-massey(BM)algorithm in GF(2)and the improved Chase algorithm,a novel algorithm based on reliability accumulation was proposed.The sequence soft infor-mation was mapped to sequence reliability as the input information of BM algorithm,and the corresponding output relia-bility of estimated polynomial was accumulated as the rule of correct polynomial.In order to improve the estimation pre-cision,the candidate reliability-accumulated polynomial set were reduced by the characteristics of primitive polynomial in GF(2).The simulation results show that the proposed method is irrelevant with the tapped number of ator poly-nomial,and has a good estimation performance to estimate 17-order polynomials when the sequence BER is 18%.

Performance analysis of packet cooperative relaying system and the effect of packet length on performance

Shao-yang LIU,Yong XI,Ying LI,Ji-bo WEI,LISTERBurr A

2012, 33(9):  132-139.  doi:1000-436X(2012)09-0132-08

Asbtract ( 50 )   HTML ( 0)   PDF (260KB) ( 233 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The packet error rate(PER)of the packet cooperative relay system for both(amplify-and-forward)and DF(decode-and-forward)schemes in the high signal-to-noise ratio(SNR)region was analyzed,and the effect of packet length on PER performance was studied.It is shown that both AF and DF achieve the same diversity gain in terms of PER,but with different coding gains depending on packet length.Different from the prior research,if considering prac-tical packet lengths,the DF scheme always achieves better performance than the AF scheme,with shorter packet length,the advantage of DF over AF is more obvious.For large enough packet length,AF performance approaches that of DF.It is also found that the optimal relay will always be located in the middle of the two nodes for AF regardless of packet length,while for DF,when packet length becomes large,the optimal relay moves from close to the source towards the midpoint.

Research on differential properties of Keccak-like nonlinear transform

Qian-nan LI,Yun-qiang LI,Shu-jing JIANG,Yao LU

2012, 33(9):  140-146.  doi:1000-436X(2012)09-0140-07

Asbtract ( 48 )   HTML ( 4)   PDF (105KB) ( 512 )   Knowledge map   

References | Related Articles | Metrics

By analyzing the nonlinear transformation in Keccak,n-gram Keccak-like nonlinear transform model was proposed firstly,and the differential properties of this kind of transformation was studied.They are proved that to the n-gram Keccak-like nonlinear transform,the differential transition probability about cycle shift transform is unchanged,and nonzero differential transition probabilities are equal when the input difference was confirmed.The range of the dif-ferential transition probability was calculated when it wasn't 0 and 1.By analyzing the Boolean expressions of the output difference,the differential construction for largest nontrivial and smallest nonzero differential transition probability were obtained.At the end,one correlation between the differential probabilities of adjacent variable in n-gram Keccak-like nonlinear transform was given.

Technical Report

FTIR microscopic image analysis based on 2DPCA

Xiu-kun YANG,Ming-liang ZHONG,Xiao-jun JING,Jie ZHANG

2012, 33(9):  147-151.  doi:1000-436X(2012)09-0147-05

Asbtract ( 50 )   HTML ( 0)   PDF (143KB) ( 271 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the efficiency of spectral unmixing,a novel spectral unmixing method based on 2DPCA in the spectral direction was developed.With the proposed method,spectra can be unmixed directly using the original image matrices.Simulation experiments performed on FTIR microscopic images of a rabbit artery and a multilayer paint chip verify the feasibility and effectiveness of the proposed algorithm.Experimental results demonstrate that when the FTIR microscopic image contains more spectra than spectral channels,the proposed algorithm has higher computation effi-ciency than PCA algorithm for spectral unmixing.Further more,the advantage of using 2DPCA becomes more obvious with an increase in the ratio of the number of spectra to the number of spectral channels.

Multi-language oriented automatic realization method for cryptographic protocols

Xing-hua LI,Shuai-tuan LI,Deng LI,Jian-feng MA

2012, 33(9):  152-159.  doi:1000-436X(2012)09-0152-08

Asbtract ( 60 )   HTML ( 0)   PDF (122KB) ( 431 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multi-objective-language-oriented automatic code generation scheme for security protocols was put forward.First,based on XML,a description method for security protocols was designed.Second,a graphic user interface(GUI)was developed,through which the XML description documents could be automatically generated by configuring the se-curity protocol.Finally,a security protocol interpreter was designed,through which the corresponding objective code was generated with the XML description document as input.nalysis indicates that compared with the existing schemes the scheme has obvious advantages.

Dynamic resource allocation scheme for multiuser OFDM–UWB systems based on user's rate

Chao CHENG,Zhi-hong QIAN,Chun-lan LI,Xue WANG

2012, 33(9):  160-167.  doi:1000-436X(2012)09-0160-08

Asbtract ( 75 )   HTML ( 0)   PDF (196KB) ( 321 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

According to original dynamic resource allocation algorithms,a new dynamic resource allocation algorithm for multiuser OFDM-UWB system based on users'rates was proposed to minimize the total transmitting power whil sa-tisfy requests for QoS and data rate of all users.Qual ty of the system was improved running the subcarrier allocation and bit allocation algorithms based on fairness of users.In subcarrier allocation process,rate impact factor was used to com-pare influence of different subcarriers to a user.In allocation process,bits were allocated to each user's subcarriers first,then bits on each subcarriers were adjusted according to rate request of each user.In or to reduce the complexity system of the furthermore,a subcarrier and bit allocation scheme is employed through subcarrier grouping.Simulation results indicate that the algorithm can lower power consume,BER and operation complexity.

New class of frequency-hopping sequences set with optimal average Hamming correlation property

Pin-hui KE,Hai-hui ZHANG,Sheng-yuan ZHANG

2012, 33(9):  168-175.  doi:1000-436X(2012)09-0168-08

Asbtract ( 69 )   HTML ( 0)   PDF (150KB) ( 409 )   Knowledge map   

References | Related Articles | Metrics

The average Hamming correlation is an important performance parameter of frequency-hopping sequences.A generalization of Whiteman cyclotomy was proposed and then some properties of the new defined cyclotomy classes were presented.Based on the generalization of Whiteman cyclotomy,new classes of frequency-hopping sequences set were constructed.The proposed frequency-hopping sequences set was shown to be optimal with respect to the average Hamming correlation bound.

Academic communication

Mobile sink-based data collection scheme for wireless sensor networks

Jian GUO,Li-juan SUN,Wen-jun XU,Ru-chuan WANG,Fu XIAO

2012, 33(9):  176-184.  doi:1000-436X(2012)09-0176-09

Asbtract ( 79 )   HTML ( 2)   PDF (250KB) ( 541 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The issue of data collection in wireless sensor networks was studied.A mobile sink-based data collection scheme called DCSR was proposed.DCSR consisted of two phases.Firstly,a number of collection sites were selected according to the sensor distribution.And then a quantum genetic algorithm was performed to calculate the shortest loop across the sites.The sink node would travel along this loop periodically and collect data at each site.Theoretical analysis and simulation results show that DCSR has better performance and collects more data.

Effects on lifetime of opportunistic network based on Epidemic routing under flooding attacks

Jian-zhi SUN,Ying-xin ZHANG,Dan CHEN,Zhong-ming HAN

2012, 33(9):  185-190.  doi:1000-436X(2012)09-0185-06

Asbtract ( 71 )   HTML ( 1)   PDF (96KB) ( 335 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In some scenarios of opportunistic network,energy could not be replenished.It was prone to flooding attacks in opportunistic network.The energy consumption of nodes and the effect on the network lifetime caused by flooding at-tacks under the mechanism of the Epidemic routing was analyzed.The analysis showed that the increase of malicious nodes had significant effects on network lifetime,and the number of packets from malicious nodes can only had effects in particular scenarios,and had minimal effects.ONE to simulate flooding attacks was used,the simulation results are same as the theoretical analysis.