Current Issue

25 November 2012, Volume 33 Issue Z2

Previous Issue    Next Issue

Papers

Alloy-based verification of Web service composition

Jiu-xin CAO,Jiang-lin WU,Guo-jin WANG,Bo LIU,Peng-wei YANG,Dan DONG

2012, 33(Z2):  1-8.  doi:10.3969/j.issn.1000-436x.2012.z2.001

Asbtract ( 226 )   HTML ( 0)   PDF (738KB) ( 609 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Service composition was the core problem of service computing,the validity and reliability of service composition had become the premise of service execution.A method was presented which utilizes the finite state machine (FSM)to model the business process’s state transitions,and described the required properties with Alloy language.Then,Alloy model was used to formalize the service FSM and the required properties of the system.Finally,Alloy Analyzer was used to verify the model that whether the required properties were satisfied.It is shown that the method of Alloy-based verification of the service composition is of good feasibility.

Differentiated service and ant colony optimization based routing protocol for wireless multimedia sensor networks

Yan-jing SUN,Wei FANG,Wei-dong LIU,Chong MENG

2012, 33(Z2):  9-14.  doi:10.3969/j.issn.1000-436x.2012.z2.002

Asbtract ( 163 )   HTML ( 1)   PDF (719KB) ( 442 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

There are many kinds of data in wireless multimedia sensor networks,which have different quality of service requirements.A novel routing protocol(DSACO)based on ant colony optimization was proposed.In the protocol,the time and energy spent on searching paths were reduced by limiting ants searching region after dividing the network into many layers.The protocol chose different paths for different kinds of data to meet the QoS requirements from the data.The simulation results show that the protocol provides better QoS for multimedia data and outperforms the other routing protocol in terms of data transmission average delay,packet loss rate and energy consumption.

Improvement on simulating TCP connection establishment in NS2

Yu JIANG,Jian REN,Li-ming ZHOU

2012, 33(Z2):  15-19.  doi:10.3969/j.issn.1000-436x.2012.z2.003

Asbtract ( 166 )   HTML ( 2)   PDF (675KB) ( 348 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In the procedure of three-way handshake of transmission control protocol connection establishment,it involves the management of half-connection and connection tables.However,in the famous networks simulator NS2,there is only a formal description instead of a concrete and complete implementation for the procedure of TCP connection establishment.An improvement was beed made on the point.Table structures for half-connections and connections are added,and the way of managing half-connection table in Linux kernel is also imported into NS2.Simulation results show that it is clear to monitor the change in half-connection table in the TCP connection establishment procedure,and thus the requirement of simulating the connection establishment procedure in studies such as protection from TCP SYN flooding attack can be met.

Mutual authentication scheme based on the TPM cloud computing platform

Zhen-peng LIU,Feng-long WU,Kai-yu SHANG,Wen-lei CHAI,Xiao WANG

2012, 33(Z2):  20-24.  doi:10.3969/j.issn.1000-436x.2012.z2.004

Asbtract ( 249 )   HTML ( 8)   PDF (614KB) ( 866 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A mutual authentication scheme based on the TPM cloud computing platform was proposed to solve the problem of mutual authentication between user and cloud computing server.Trusted computing technology and traditional smart card password method were used in cloud computing service platform.The scheme completed the authentication of both sides in cloud computing,generated the session key according consulting,at the same time,verified the credibility of cloud service platform.Experiment analysis shows that our scheme can resist various kinds of possible attacks,so it is therefore more secure than other schemes.And the computing time meet the requirements of cloud computing environment.

Dynamics of substrate resource selection in network virtualization environment——an evolutionary game approach

Yu YANG,Shan-zhi CHEN,Xin LI

2012, 33(Z2):  25-34.  doi:10.3969/j.issn.1000-436x.2012.z2.005

Asbtract ( 233 )   HTML ( 0)   PDF (761KB) ( 323 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The substrate network path selection problem of virtual network was modeled as an evolutionary game.In the process of evolutionary game,virtual networks adjusted the strategies through the iterated game.The replicator dynamics were leveraged equation to analyze the dynamic variation of strategies selection and demonstrates that this dynamics equation is the admissible dynamic to the evolutionary game.The potential game theory was used to analyze the evolutionary process and demonstrates the evolutionary result will converge to the evolutionary equilibrium.At the evolutionary equilibrium,all the virtual networks could get the best selection strategies.Finally,an evolutionary algorithm based on replicator dynamics was proposed.The experiments simulate the process of virtual network selecting the substrate paths in different initial state and reach the evolutionary equilibrium.Simulation results are coincided with the theoretical analysis results.

Research on architecture and algorithm for code resolution system in the internet of things

Hai-ning YU,Hong-li ZHANG,Bin-xing FANG,Xiang-zhan YU

2012, 33(Z2):  35-44.  doi:10.3969/j.issn.1000-436x.2012.z2.006

Asbtract ( 173 )   HTML ( 2)   PDF (871KB) ( 276 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on a list of requirements for code resolution,a code resolution system architecture that is a distributed system of independent,collaborating code resolution services was presented.Meanwhile,an improved SkipNet based code resolution service named SkipNet-OCRS was proposed.It not only inherits DHT’s traditional advantages,but also supports administrative control and autonomy.Simulation experiments verify the excellent performance of SkipNet-OCRS.

Study on semantic Web security

De-yan CHEN,Hong ZHAO,Xia ZHANG,Li-jun ZHAO,An PING

2012, 33(Z2):  45-59.  doi:10.3969/j.issn.1000-436x.2012.z2.007

Asbtract ( 272 )   HTML ( 2)   PDF (711KB) ( 696 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Semantic Web technologies themselves as well as the web of data constituted by semantic Web applications on the Internet might introduce new security,privacy and trust issues as well as requirements.So,security issues faced by the Semantic Web and its security status were analyzed in detail.On this basis,the semantic Web security reference framework was proposed.Finally,urgent needs about key technologies,policy specifications and safety standards of semantic Web were pointed out based on the semantic Web security reference framework.

Delay-optimal spectrum decision method for cognitive network

Wu-jian SUN,Na LI,Yang LIU,Le SUN,Tao CHEN,Hao LI,Ou LI

2012, 33(Z2):  60-70.  doi:10.3969/j.issn.1000-436x.2012.z2.008

Asbtract ( 270 )   HTML ( 3)   PDF (930KB) ( 406 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Spectrum decision was investigated within the confine of spectrum management framework for cognitive radio networks.Sensing errors in PHY layer,outage probability on wireless channel and multiple interruptions of primary user were taken into consideration.Probability-based and sensing-based spectrum decision methods were proposed,which were capable of balancing traffic evenly among licensed.For the probability-based method,short-time first discipline was employed to further shorten average residual time,closed-formed expression were presented based on dynamical programing.For the sensing based method,new channel could be chosen for uncompleted transmission,which alleviated the time spent in waiting primary user.Optimal residual time was obtained by choosing the minimal value of the two methods.Furthermore,spectrum heterogeneity was taken into consideration and theoretical analysis was of general sense.Simulation results validate the approach is efficient.

Cognitive Wi-Fi 2.0 networks:future intelligent WLAN

Chun-gang YANG,Chao XU,Min SHENG,Jian-dong LI,Hong-yan LI

2012, 33(Z2):  71-80.  doi:10.3969/j.issn.1000-436x.2012.z2.009

Asbtract ( 320 )   HTML ( 6)   PDF (840KB) ( 720 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

One typical deployment scenario was described and several key techniques including channel bonding were introduced.More importantly,a two-tire dynamic spectrum access model was formulated from both the economic and technologic perspectives.In addition,a variety of dynamic resources sharing schemes were summarized.Furthermore,classic game theoretic models were discussed and consequently strategic design of dynamic spectrum access and intelligent network selection were introduced.Finally,a spectrum sharing scheme was proposed and the future of cognitive Wi-Fi 2.0 networks was looked to.

Evaluating MapReduce for seismic data processing using a practical application

Chang-hai ZHAO,Hai-hua YAN,Xiao-peng LIU,Deng XIONG,Xiao-hua SHI

2012, 33(Z2):  81-89.  doi:10.3969/j.issn.1000-436x.2012.z2.010

Asbtract ( 250 )   HTML ( 0)   PDF (858KB) ( 441 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Huge amounts of seismic data undergo complex iterative processing in the oil industry to get knowledge of the earth’s subsurface structure to detect where oil can be found and recovered.To evaluate the suitability of MapReduce for seismic processing algorithms,the algorithm design and implementation of Fresnel tomography on Hadoop MapReduce was described.Experiments demonstrate that MapReduce is approximately 3 times slower than MPI,and tuning the performance of MapReduce is really hard.To expand its applicability to high performance computing for oil industry,MapReduce should be improved in the flexibility and provide the opportunity to exploit fine-grained thread-level parallelism.Finally,research ideas to achieve these objectives were presented.

Energy dissipation balanced and reliable clustering algorithm for wireless sensor networks

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

2012, 33(Z2):  90-96.  doi:10.3969/j.issn.1000-436x.2012.z2.011

Asbtract ( 225 )   HTML ( 2)   PDF (731KB) ( 318 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel clustering algorithm for wireless sensor networks was proposed to resolve the hot spot problem and the single failure problem.The algorithm divided the network into unequal grids,and the nodes in the same grid form a cluster.The number of cluster heads in each grid was determined according to the failure probability of nodes,and the data collection of nodes in a grid was implemented by multiple cluster heads of the grid cooperatively.By adjusting the number of nodes that could participate in cluster head rotation of each grid,the algorithm was able to balance the energy dissipation of nodes on a long view.The algorithm reduced the reliance of cluster members to single cluster head by forming cluster with multiple cluster heads.Furthermore,the algorithm adopted some measures to diminish energy consumption.Simulation results show that the algorithm has higher balanced extent of energy dissipation and reliability of data collection,and prolongs the lifetime of network.

Novel non-cooperative power control game algorithm for cognitive radio

Jun-hui ZHAO,Tao YANG,Xue-xue ZHANG

2012, 33(Z2):  97-103.  doi:10.3969/j.issn.1000-436x.2012.z2.012

Asbtract ( 187 )   HTML ( 0)   PDF (812KB) ( 599 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel non-cooperative power control algorithm based on new pricing function and the characteristics of cognitive radio technology was proposed with the interference temperature constrain,in order to improve signal to interference plus noise ratio of CR.The problem of power control was changed into the problem of multi-restraints non-linear optimization with interference limits based on channel conditions,maximal network and power limits.The existence and unique of nash equilibrium(NE)in utility function by the principle of game theory and optimization were proved and a distributed algorithm for this game was proposed.Simulation results show that the proposed algorithm can improve users QoS(quality of serves),system performance effectively and improve radio resource efficiency.

Communication performance analysis of secondary users in cognitive radio networks under primary user emulation attacks

Shan-shan WANG,Xing-guo LUO,Peng LI

2012, 33(Z2):  104-110.  doi:10.3969/j.issn.1000-436x.2012.z2.013

Asbtract ( 267 )   HTML ( 2)   PDF (794KB) ( 585 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Cognitive radio network(CRN)is an effective technology and a hot research direction which could solve the problem of deficient resource and revolutionize utilization.And its safety technology attracted more and more researches.Primary user emulation(PUE)is a typically easily and largely affecting attack.PUE attacked come from both malicious misbehavior secondary users(MMU)and selfish misbehavior secondary users(SMU).The former was studied much more deeply than the later one.Distinguishing MMU and SMU,a four dimensional continuous time markov chain model to analyze the communication performance of normal secondary users under PUE attacks,and typically affected by SMUs was proposed.Furthermore,several PUE detection technologies were compared.The emulation results indicate that the SMU detection mechanism is essential for the PUE attack detection technology,which can improve the detection effects largely.

Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule

Xiao-ge ZHANG,Shi-bing ZHANG,Gong-an QIU

2012, 33(Z2):  111-117.  doi:10.3969/j.issn.1000-436x.2012.z2.014

Asbtract ( 238 )   HTML ( 7)   PDF (748KB) ( 351 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The algorithm divided the total relays into two subsections.The front subsection included N number of relays,and the later one included K?N number of relays.Firstly,the front N relays sensed the spectrum.If no more than m_L number of relays had detected the existing of the primary user,the global detection was that the spectrum holes existed.If more than m_H number of relays had detected the existing of the primary user,the global detection was that no spectrum holes existed.Otherwise,the later K?N number of relays continued to sense the spectrum.The global detection was that the spectrum holes existed only when there were totally over n number of relays having detected the existing of the primary user in the two sensing stages.The object function was built for minimizing the time-slot consumption by adjusting the parameters m_L,m_H and N with the limit of detection probability and false probability.Simulation results show that the proposed incremental cooperative spectrum sensing algorithm has much lower time-slot consumption than the traditional one by properly setting the parameters with high sensing performance kept.

Statistical covariance blind detection algorithm based on cholesky factorization in cognitive radio network

Ying-xue LI,Shu-qun SHEN,Lang-tao HU,Qiu-cai WANG

2012, 33(Z2):  118-124.  doi:10.3969/j.issn.1000-436x.2012.z2.015

Asbtract ( 248 )   HTML ( 1)   PDF (743KB) ( 550 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As the blind covariance detection algorithm has the shortcoming that the performance parameters are obtained using non-asymptotic method,a new blind detection algorithm was presented using cholesky factorization.Utilizing random matrix theory,the performance parameters was derived using non-asymptotic method.The proposed method overcomes the noise uncertainty problem and performs well without information about the channel,primary user and noise.Numerical simulation results demonstrate that the performance parameters expressions are correct and the new detector outperforms the other blind covariance detectors.

Study on electronic evidence acquisition and analysis method over Windows logs

Xiao-mei DONG,Xu-dong LIU,Xiao-hua LI,Ya-jie FEI

2012, 33(Z2):  125-134.  doi:10.3969/j.issn.1000-436x.2012.z2.016

Asbtract ( 218 )   HTML ( 4)   PDF (753KB) ( 759 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to collect logs in real time,two methods to acquire Windows logs in real time were proposed respectively according to the two types of log file formats.Based on acquiring logs,an approach for correlating log files with atomic attack functions was proposed.After the correlation,atomic attack functions can be analyzed instead of log files,which can greatly decrease the time of analysis.A time based log correlation and event reconstruction method was proposed to reconstruct the computer criminal scenarios.Experimental results show that log evidences can be acquired and the crime process can be reconstructed effectively.

Bounding box based distributed search localization algorithm for WSN

Ying-biao YAO,Rong ZENG,Zhi-qiang YI

2012, 33(Z2):  135-140.  doi:10.3969/j.issn.1000-436x.2012.z2.017

Asbtract ( 237 )   HTML ( 5)   PDF (706KB) ( 559 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A bounding box based distributed full search localization algorithm for WSN(wireless sensor networks)was proposed.Firstly,the coordinates and distances of neighbor nodes were obtained by ranging.Secondly,the possible node position area was determined based on bounding box method.Finally,the area was meshed and the full search method was employed to search the best estimation point,whose coordinates are the node’s localization coordinates.In real WSN,the algorithm need run several rounds to obtain node’s localization coordinates by stepwise refinement.Simulation results show that the proposed algorithm achieves the comparable performance with other up-to-date complex localization algorithms.

Simulation of broadcasting method based on busy tone

Sheng-hong XU,Qing-tian HAN,Wen-jing CAO

2012, 33(Z2):  141-145.  doi:10.3969/j.issn.1000-436x.2012.z2.018

Asbtract ( 206 )   HTML ( 0)   PDF (732KB) ( 254 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In ad hoc network with high dynamic topology,broadcasting method based on handshake mechanism was not efficient.Therefore,a broadcasting method based on busy tone was proposed.This method was modeled and implemented with the network simulation platform OPNET,and the performance of the broadcasting method was analyzed based on experimental results.Experimental results show that,the broadcasting method based on busy tone is applicable to the network with high dynamic topology.

Applications of information navigation method in wireless sensor networks

Wei WEI,Liang ZHANG,De-ke GUO,Pei-yi SHEN

2012, 33(Z2):  146-152.  doi:10.3969/j.issn.1000-436x.2012.z2.019

Asbtract ( 201 )   HTML ( 2)   PDF (933KB) ( 342 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For adapting to a novel architecture of WSNs,which supports information query and navigation systems through construction of the virtual potential field.Under the premise of diffusion equation and poisson-based formula,a novel method was proposed which can accomplish the navigation more conveniently and more efficiently.In order to guarantee the accuracy of navigation,the relative knowledge of information transmission and the partial differential process(diffusion equation)in electric potential field was utilized,meanwhile gradient descent method was also applied in the process of application.A complete mathematical derivation was used.Tiny-OS simulations show the method can efficiently overcome the original WSNs weakness that network configuration abilities of information navigation are not good enough.Simultaneously,during the process of explore the navigation computation,structures of diffusion equation are more flexible and adaptability.

Energy saving in uplink cognitive cellular network

Xiao MA,Min SHENG,Yan ZHANG,Yu-zhou LI

2012, 33(Z2):  153-159.  doi:10.3969/j.issn.1000-436x.2012.z2.020

Asbtract ( 235 )   HTML ( 0)   PDF (772KB) ( 281 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problem that high data rate transmission will cause extremely energy consumption of users,a maximum energy efficiency(EE)strategy,based on the cognitive cellular network model,was proposed by utilizing the cognitive resources and concurrent transmission.According to the characteristics that the multimode user equipment can connect with heterogeneous networks simultaneously,the proposed strategy,establishes the EE model and obtains the algorithm for selecting the cognitive resources and distributing the data rate by analyzing the relationship among the channel state information of available networks,energy consumption and data rate.Simulation results show that the proposed strategy can increase the EE of MUE efficiently

Analysis on the impact of router alias resolution

Jian REN,Yu JIANG,Ge GAO

2012, 33(Z2):  160-166.  doi:10.3969/j.issn.1000-436x.2012.z2.021

Asbtract ( 343 )   HTML ( 12)   PDF (853KB) ( 470 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Router alias resolution is one of hard problems and important steps for router level Internet topology measurement based on traceroute mechanism,and the topology characteristic of the generated router level topology graph has close relationship with the completeness of alias resolution.The graph with its degrees following power-law distribution was taken as the base-graph,and the shortest paths from one source to others were computed for simulating topology measurement.Experiment results show that it is very probable to see different topology characteristics between the derived graph and the base-graph due to incomplete alias resolution.Most importantly,for large-scale router level topology measurement,the completeness of alias resolution must be improved with the increasing number of probe sources,and in this way the derived topology graph could be approximate to the real topology graph.

Node selection algorithm based on channel coefficient for cognitive network

Jin-huai GUO,Ke-feng FAN,Su-bing ZHANG

2012, 33(Z2):  167-171.  doi:10.3969/j.issn.1000-436x.2012.z2.022

Asbtract ( 220 )   HTML ( 1)   PDF (589KB) ( 725 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve communication performance of cognitive network,according to the principle of opportunity cooperative communication,node selection algorithm based on channel coefficient for cognitive network was proposed and studied.Results show that the proposed algorithm can enhance spectrum utilize efficiency and improve network throughput effectively.

Study on an effective integrated model of Ka-band mobile satellite channel

Juan WEI,Da LIU,Gang-qi TIAN

2012, 33(Z2):  172-175.  doi:10.3969/j.issn.1000-436x.2012.z2.023

Asbtract ( 304 )   HTML ( 9)   PDF (786KB) ( 479 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to describe the Ka-band mobile satellite communications channel fading features more realitically,a mobile satellite integrated channel model was proposed.The characteristics of the mobile satellite propogation channel were analysed in detail.Weather conditions,as well as multi-path fading and shadowing were taken into account as main influencing factors.On this basis,airspace channel model was built obeying the Gaussian distribution as well ground surface,which obey Rice,Rayleigh and Lognormal joint distribution.Then the integrated channel model was presented considering weather effects on condition that the two parts are independent each other in the influence of the channel characteristics.The mathematical analysis model and simulation model of the new integrated channel model were established respectively.Finally,the BER(bit error rate)performance was analyzed for different weather conditions and shadows.Compared with the theoretical BER,the integrated channel model in satellite mobile communication systems is correct and reasonable.

Software services protection security protocol based on software watermarking in cloud environment

Jin-chao XU,Guo-sun ZENG,Wei WANG

2012, 33(Z2):  176-181.  doi:10.3969/j.issn.1000-436x.2012.z2.024

Asbtract ( 191 )   HTML ( 0)   PDF (734KB) ( 259 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aimed to resist the infringement of software services in cloud environment,a software services protection security protocol based on software watermarking in cloud environment was presented.On the consideration of actual needs in cloud computing,the protocol introduced the software watermarking as a service cloud which was responsible for software watermark embedding and extraction.The protocol not only met the basic requirements of software copyright protection,but also gived the detailed strategy to solve the infringement,and hardened the ability of the software watermarking to resist various attacks.The analysis shows that the proposed protocol has higher security.

Cognitive network spectrum access for emergency communications

Zheng GUAN,Wen-hua QIAN,Mei-le YU

2012, 33(Z2):  182-188.  doi:10.3969/j.issn.1000-436x.2012.z2.025

Asbtract ( 203 )   HTML ( 3)   PDF (756KB) ( 221 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A wireless cognitive network opportunistic spectrum accessing scheme which provided delay guarantee for emergency communications was proposed.Primary user (PU) and secondary users (SU) shared the spectrum resources according to the discrete time two-level exhausted and limited (k=1) polling mechanism.Then,piggyback acknowledgement was used to realize the parallel scheduling between data transportation and users access,and then reducing the time consumption cause by the user switching.Finally,the mathematics functions was set up and achieved the closed form expressions for the mean waiting time theoretical analysis and simulation experiment.It is proved that the proposed scheme is both interference restraining and high throughput with the delay guaranteed.

Modeling and analysis of multi-party non-repudiation protocols with extended-CSP approach

Zhi-geng HAN,Geng CHEN,Jun-zhou LUO

2012, 33(Z2):  189-195.  doi:10.3969/j.issn.1000-436x.2012.z2.026

Asbtract ( 192 )   HTML ( 0)   PDF (715KB) ( 198 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Follow with the methodology of reverse engineering,an exploratory modeling and analysis of security of the typical Kremer-Markowitch multi-party non-repudiation protocol were carried out with a novel method named extended-CSP approach which had been proposed for two-party non-repudiation protocol in preliminary work.With the analysis,the inherent fact that this protocol statisfies not timeliness but non-repudiality and fairness was found successfully.The result of the analysis indicates that,as applying to two-party non-repudiation protocols,the extended-CSP approach can also be a new method for security verification of multi-repudiation protocols.

Analyzing the weights and its variation of the three delays in EPA network

Xiu-zhu JIANG,De-jiu DENG,Dong-qin FENG

2012, 33(Z2):  196-200.  doi:10.3969/j.issn.1000-436x.2012.z2.027

Asbtract ( 202 )   HTML ( 1)   PDF (717KB) ( 523 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Three delay factors of EPA micro segment:queuing delay,node information processing delay and transmission and propagation delay was analied,and the weight influence of the three major factors of delay on the real-time performance was discussed,through the analysis of the number of nodes in the N and scheduling algorithm factor α on the effects of delay variation,reached two conclusions:1) N=8 is the inflection point of phenomenon of "two eight"between queue delay and node information processing delay;2)when α□0.32,queuing delay will be reduced to be the secondary factors for the influence of the delay.The conclusions provide EPA network reference directions for measures to improve the real-time performance.

Survey of data possession provability proving on cloud storage

Wei FU,Qing YE,Ze-mao CHEN,Xiao-ping WU

2012, 33(Z2):  201-206.  doi:10.3969/j.issn.1000-436x.2012.z2.028

Asbtract ( 334 )   HTML ( 6)   PDF (687KB) ( 1523 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Data possession provability allows cloud users to verify whether their data are still integrally preserved in Cloud Storage system,and whether they can obtain the data at anytime,anywhere.It is a challenging research problem of cloud storage security.A data possession proving model and its estimating criteria system were established.Three famous proving schemes were analyzed in detail.Six proving methods were compared from different aspects.Finally,some valuable future research issues and suggestions were pointed out as conclusion.

Survey on the deployment and design for regular topology structures in wireless sensor networks

Wen-xiang LI,Ya-jie MA,Jun XU,Jian-feng YANG

2012, 33(Z2):  207-216.  doi:10.3969/j.issn.1000-436x.2012.z2.029

Asbtract ( 271 )   HTML ( 5)   PDF (987KB) ( 450 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In wireless sensor networks,such regular topology structures as Square,Hexagon and Triangle could fully cover the area to be monitored,provide accurate positioning for special events,and achieve better network performance.In order to provide valuable guidelines for WSN design and optimization,related works on regular topology structures was surveyed.By the analysis on the index of Area per Node,the deployment method and efficiency of regular topology structures under such cases as full coverage,k-coverage and l-connectivity was explored.the performance,variation and application scenarios in such aspects as network connectivity,energy consumption,transmission performance,routing scheme and MAC protocol was summarized.The optimal application conditions for each structure together with several directions for further research were proposed.

Detection of selfish nodes based on credit mechanism in opportunistic networks

Zuo-yong TANG,Yi-jia YUAN,Yong-qiang DONG,Guo-xin WU

2012, 33(Z2):  217-221.  doi:10.3969/j.issn.1000-436x.2012.z2.030

Asbtract ( 191 )   HTML ( 1)   PDF (671KB) ( 559 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The existence of selfish nodes seriously affects the routing performance of opportunistic networks(OppNet).To protect the OppNet against the nodes’ selfish behavior,a credit-based selfish nodes detection mechanism was proposed to make it possible to keep away from such nodes during the process of message forwarding.The mechanism leverages 2-ACK messages to observe the nodes’behavior.Then the credit value was calculated based on the observation information and accordingly acts as the metric to distinguish the selfish nodes.Simulation results show that,when coupled with various routing algorithms,the mechanism could detect selfish nodes out accurately,and improve network performance effectively in terms of delivery rate and traffic load.

Technique of analyzing device drivers of embedded linux system using UML

Liang MA,Li LI,Su-bin SHEN

2012, 33(Z2):  222-227.  doi:10.3969/j.issn.1000-436x.2012.z2.031

Asbtract ( 225 )   HTML ( 6)   PDF (582KB) ( 673 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A method to model and analyze the device drivers in embedded Linux system using UML was proposed.By using UML modeling method,the dependencies among the device driver components and the focus of the device driver development are clarified.On this basis,the SDWiFi device driver model was studied,the SDIO communication interface between the host and Wi-Fi chips was designed and the SDWiFi device driver was transplanted.At last,the SDWiFi wireless LAN equipment was configured and tested using wireless tools.The test results show that the SDWiFi wireless LAN equipment works properly.The efficiency of the device driver development is improved by modeling and analyzing the device drivers using UML.

Novel cyclostationary multiple antenna spectrum sensing approach based on asymptotic optimal χ₂ test

Qing-lei KONG,Yu-long GAO

2012, 33(Z2):  228-232.  doi:10.3969/j.issn.1000-436x.2012.z2.032

Asbtract ( 284 )   HTML ( 0)   PDF (789KB) ( 404 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the performance of cyclostationary spectrum sensing,reduce the influence of deep fading,a new approach of combining the multiple received signals by multiple antennas was proposed,which means that exploited an improved MRC combination of cyclic autocorrelation and cyclic spectrum,and got the test statistic calculated by implementing asymptotic optimal χ² test.This approach could detect the existence of the transmitting signal without amplitude prior information.BPSK modulation signal was applied as an example to testify the accuracy of the approach.The results indicate that multiple antennas spectrum sensing has more advantage that single antenna,reduces the influence of deep fading.

Survey on multipath TCP congestion control

Pei LIU,Yong-mao REN,Jun LI

2012, 33(Z2):  233-238.  doi:10.3969/j.issn.1000-436x.2012.z2.033

Asbtract ( 541 )   HTML ( 22)   PDF (783KB) ( 2303 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

First，several congestion control algorithms of multipath TCP recently had been introduced and discussed.Next,some simulation experiments in NS2 was did,the performance of MPTCP congestion control algorithm in TCP fairness of the bottleneck link,resource pooling and flapness was analyzed.At last,some problems existed and possible research directions in the future was pointed out.

Design of infrastructure-free Wi-Fi indoor localization

Xiao-jian WANG,Zheng XUE,Yu-peng ZENG,Di WU

2012, 33(Z2):  239-243.  doi:10.3969/j.issn.1000-436x.2012.z2.034

Asbtract ( 274 )   HTML ( 1)   PDF (588KB) ( 498 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A RSS-based infrastructure-free localization algorithm was proposed,which is only based on Wi-Fi signals and does not require any additional infrastructure.It reduces the database construction cost by a special dynamic method.By picking the hot spot,it can effectively alleviate the interference from other wireless signals in the nearby region.It also enhances the RSS–based matching algorithm and hence improves the localization accuracy.The algorithm is easy to operate and doesn’t need any complex participation from end users.The algorithm is suitable for those who can provide positioning service in some special locations.Through the deployment of dedicated hot spots,it will reduce the environment interference and improve the quality of location-based service.

Device integration technology based on Web services

Lu JIN,Su-bin SHEN

2012, 33(Z2):  244-249.  doi:10.3969/j.issn.1000-436x.2012.z2.035

Asbtract ( 210 )   HTML ( 2)   PDF (595KB) ( 781 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Through studied on integration technologies based on the web services,DPWS (devices profile for Web service) was applied to solve the integration issues of different kinds of devices.Relying on the requirements of integrating networked cameras,the difficulties in the integration process of embedded devices were summarized.Application interfaces based on web services was implemented by using DPWS and the features like dynamic discovery,eventing were integrated.The test results show that the system has high performance,scalability,robustness and universality.

Sparse channel estimation for OFDM system weighted l_p norm

Jian-bin FU,Hua PENG,Zheng DONG

2012, 33(Z2):  250-255.  doi:10.3969/j.issn.1000-436x.2012.z2.036

Asbtract ( 187 )   HTML ( 3)   PDF (687KB) ( 478 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The new lp norm was introduced to substitute the l₀ and l₁ norm,as they met some problems when used to estimate sparse channel in LMS algorithm.By analyzing the l_p norm,the optimal value of p was obtained,it was 1/2.Then a most sparse solution could be gotten for channel estimation.And it both saved the cost for training sequence and solved the lack of data size by using data reusing method.Simulation results show that the l_p-LMS performs better than the existing methods,combining with data reusing when the training sequence is certain short.

Research on a cooperative spectrum sensing algorithm based on energy-constraint

Jian SU,Guo-qin NING,Feng QING

2012, 33(Z2):  256-261.  doi:10.3969/j.issn.1000-436x.2012.z2.037

Asbtract ( 251 )   HTML ( 0)   PDF (784KB) ( 363 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the aim of the realization of green energy-efficient cognitive communications,the energy consumption was mainly analyzed in the process of cooperative sensing and transmission,and an energy-efficient centralized cooperative spectrum sensing scheme was proposed.The spectrum sensing model of maximizing the detection lifetime of cognitive radio system was established and specified in detail.Furthermore,a searching method was presented to obtain the optimal detection lifetime and corresponding parameters.Simulation results reveal that the proposed scheme is able to extend detection lifetime and improve the probability of performing cooperative sensing for CR users with low SNR.

Imaging method based on compressed sensing for the cognitive sparse aperture of ISAR

Feng-lian SUN,Qun ZHANG,Ying LUO,Fu-fei GU,Guo-zheng WANG

2012, 33(Z2):  262-269.  doi:10.3969/j.issn.1000-436x.2012.z2.038

Asbtract ( 295 )   HTML ( 2)   PDF (853KB) ( 462 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Focused on the problem that different ISAR targets required different measurement dimension and different imaging time when they were imaging with compressed sensing(CS)theory,a cognitive high-resolution imaging method based on CS was proposed.According to the cognition of the sparsity of the radar target,a stochastic measurement matrix was established based on the imaging time and the target’s cross-range sparsity.An evaluate criterion of imaging quality was also present.Based on this,the cognitive high-resolution imaging was realized with the limited radar resource.Simulation results indicate that the proposed method can gain the high quality ISAR imaging with much less transmitted pulses and shorter imaging time compare to traditional imaging radar.

HIPSCS:secure IP communication system based on HIP

Min ZHOU,Ming CHEN,Chang-you XING,Pei-cheng JIANG

2012, 33(Z2):  270-275.  doi:10.3969/j.issn.1000-436x.2012.z2.039

Asbtract ( 270 )   HTML ( 0)   PDF (664KB) ( 268 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To make the host identity protocol(HIP)into practical use,a secure communication system basd on HIP named HIPSCS was designed and implemented.HIPSCS achieved the real-name identification of communications hosts by binding the HI with user's certificates,thus made the source of packets trustworthy from network.IPsec was used to encrypt communication data,so that the goal of secure IP communication was accomplished.The HIPSCS prototype was implemented in the laboratory environment,and experimental results show that HIPSCS has good usability and can support mobile communication well.

Performance analysis of complex field network coding based on moment generating function

Gang-zi CHEN,Jing YANG

2012, 33(Z2):  276-279.  doi:10.3969/j.issn.1000-436x.2012.z2.040

Asbtract ( 279 )   HTML ( 0)   PDF (650KB) ( 513 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The moment generating function was introduced to analysis closed-form expression for the outage probability that the relays employ complex field network coding,and the effect on symbol error probability with various modulation mode was evaluated.Computer simulation results demonstrate that the difference between closed expression and the approximate representation of outage probability greatly relies on the level of signal to noise ratio.

QoS rerouting mechanism for SON

Long-fei WANG,Xing-wei WANG,Min HUANG

2012, 33(Z2):  280-289.  doi:10.3969/j.issn.1000-436x.2012.z2.041

Asbtract ( 188 )   HTML ( 0)   PDF (830KB) ( 368 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Along with the development of computer network,SON(self-organizing network)has attracted wide attention with its flexibility,adaptability,robustness.On the basis of OSPFv3,the interactive message of QoS state was defined to establish the information table of neighbors,store the link QoS information,judge the triggering of rerouting,and then the biological behaviors,such as hibernation and awakening,were introduced to the routing nodes.A hybrid rerouting mechanism was adopted to make the corresponding treatment under various network failure situations,so that the application QoS support could be provided when the network state was changing.Simulation results show that the proposed mechanism has better performance.

Improved density-dased clustering algorithm based on information entropy and ant colony optimization abstract

Yong-hua ZHANG,Fei-ming DU,Dai-wen WU

2012, 33(Z2):  290-293.  doi:10.3969/j.issn.1000-436x.2012.z2.042

Asbtract ( 264 )   HTML ( 3)   PDF (608KB) ( 667 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An integration of clustering algorithm was proposed for the shortage of the DBSCAN algorithm in inhomogeneous distribution and large-scale data processing.The algorithm extracted representative data from the original data set using information entropy and ant colony clustering technology,and did DBSCAN clustering based on the representative data subset.The experiment show that this algorithm is effective to reduce the I/O-consuming and memory requirements,and resolve the cluster problem of large-scale data sets containing categories property.

Tunnel transition mechanism support all types of NAT users

Nian-feng LU,Zhen-xing WANG,Hui-sheng LIU

2012, 33(Z2):  295-300.  doi:10.3969/j.issn.1000-436x.2012.z2.043

Asbtract ( 159 )   HTML ( 0)   PDF (793KB) ( 539 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Through the analied of current tunneling mechanism,a more efficient and applicable tunneling mechanism called TrNAT based on TSP to face different scenarios was proposed.Optimization of the communications between NAT users was achieved with ideology of MIPv6.Then,Shim6 was utilized to realize route redundancy and also improved the route aggregation of 6 to 4 tunnel.Finally,TrNAT tunneling mechanism was implemented on Linux kernel and validated by experiments.