Please wait a minute...

Current Issue

    30 September 2010, Volume 31 Issue 9A
    Infrastructure of WSN
    Probabilistic disc model based optimal node deployment scheme to target coverage in wireless sensor networks
    Xin HE,Xiao-lin GUI
    2010, 31(9A):  1-8.  doi:1000-436X(2010)9A-0001-08
    Asbtract ( 0 )   HTML ( 4)   PDF (788KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In wireless sensor networks,since the existing methods of dividing sensors based on the random deployment of nodes can not guarantee the optimal deployment to target coverage,a probabilistic disc model based optimal deterministic deployment scheme of sensor nodes was proposed.Firstly,probabilistic disc model was used to capture the stochastic nature of sensing.And,node sensing radius meeting to user needs was computed.Secondly,the candidate positions where nodes were placed to coverage target set were computed by using the concept of the most multi-overlapping domains of target point.Finally,known the candidate positions,by using simulated annealing genetic algorithm,the optimal positions and the least number of nodes to coverage target set were gained.Simulation results show that the nodes optimal deployment method is obtained based on user needs.The optimal allocation of resources is realized in wireless sensor networks.

    Cross-layer strategy for cooperative diversity in wireless sensor networks
    Yong-rui CHEN,Yang YANG,Wei-dong YI
    2010, 31(9A):  9-15.  doi:1000-436X(2010)9A-0009-07
    Asbtract ( 0 )   HTML ( 2)   PDF (712KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The problem of how to minimize the energy consumption in multi-hop wireless sensor network under the constraint of end-to-end reliability QoS requirement was investigated.Based on the investigation,jointly considering the routing,relay selection and power allocation algorithm,a novel distributed cross-layer strategy for cooperative communication based on opportunistic relaying was presented.The results show that under the same QoS requirement,the proposed cross-layer strategy performs better in energy efficiency.The impact of several parameters on the energy efficiency of the cooperative communication in wireless sensor networks was investigated,thus could be used to provide guidelines to decide when and how to apply cooperation for a given setup.

    Virtual potential field and covering factor based coverage-enhancing algorithm for three-dimensional wireless sensor networks
    Jun-jie HUANG,Li-juan SUN,Ru-chuan WANG,Hai-ping HUANG
    2010, 31(9A):  16-21.  doi:1000-436X(2010)9A-0016-06
    Asbtract ( 0 )   HTML ( 2)   PDF (713KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Virtual potential field was introduced for three-dimensional WSNs.In view of the particularity of 3D coverage problem,a method that using covering factor to reduce useless node movement to eliminate the instability of algorithm was progosed to improve the algorithm performance.Experiments show the effectiveness of the introduction of covering factor and the PCCEA algorithm by comparing the PCCEA algorithm to another algorithm based on virtual force algorithm.

    E2DTS:an energy efficiency distributed time synchronization algorithm for underwater acoustic sensor network
    Zheng-bao LI,Zhong-wen GUO,Hai-peng QU,Feng HONG,Lu HONG
    2010, 31(9A):  22-29.  doi:1000-436X(2010)9A-0022-08
    Asbtract ( 0 )   HTML ( 1)   PDF (756KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The impact on propagation delay of nodes mobility in underwater acoustic sensor network (UASN) was investigated.Then the relationship between nodes mobility propagation delay was built.At last an energy efficiency distributed time synchronization algorithm for the UASN,called“E2DTS”,was presented.Both clock skew and offset were estimated in this scheme with the linear regression by solving the adjacent packet reception/transmission time difference.The error on the time synchronization accuracy was reduced by decreasing the data exchange.Through analysis and simulation,it is shown that E2DTS achieves low energy cost and high level time synchronization precision (at least 30% promotions)compared with existing algorithms.

    Hybrid intelligent algorithm-based coverage optimization for directional sensor networks
    Jing LI,Li-juan SUN,Ru-chuan WANG,Hai-ping HUANG,Gao-juan FAN
    2010, 31(9A):  30-36.  doi:1000-436X(2010)9A-0030-07
    Asbtract ( 0 )   HTML ( 2)   PDF (834KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aimed at disadvantages on most existing coverage optimization algorithms for directional sensor networks,such as the finite number of orientations,the poor degree of optimization etc.,a hybrid intelligence-based coverage optimization (HIACO) algorithm was presented,which defined a set of orientations as a particle and made use of the particle swarm to optimize coverage,combined with simulated annealing that could satisfy the global optimization.Simulation results and performance analysis illustrate that HIACO,by continuously rotating orientations to improve coverage effectively,is super to current algorithms,such as distributed greedy algorithm and centralized coverage-enhancing algorithm based on computational geometry.

    Suffient conditions and an algorithm for preserving m-coverage and k-connectivity in three dimensional heterogenous sensor networks
    Zhao-liang ZHANG,Dong LI,Ting-pei HUANG,Li CUI
    2010, 31(9A):  37-46.  doi:1000-436X(2010)9A-0037-10
    Asbtract ( 0 )   HTML ( 3)   PDF (847KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Recently,researchers start turning to the problem of ensuring coverage and connectivity in three dimensional sensor networks.However,existing works only focus on deterministic deployment pattern in homogenous sensor networks,which neglect the significant problem of sleep scheduling and power control in randomly distributed three dimensional sensor networks.To address this problem,five design rules were proved to guarantee m-coverage,to guarantee k-connectivity,and to control transmission power respectively in three dimensional heterogenous sensor networks.Then,based on these rules,an integrated topology control algorithm was proposed,which schedules the active/sleep status and controled the transmission power of sensor nodes while preserving m-coverage and k-connectivity of the network.Simulation results show that the proposed algorithm effectively prolongs the network lifetime under the condition of ensuring m-coverage and k-connectivity of three dimensional heterogeous sensor networks.

    Parameter optimization method to extend deployment area of radio interferometric positioning system
    Ya-song ZHU,Peng LIU,Shan HUANG
    2010, 31(9A):  47-52.  doi:1000-436X(2010)9A-0047-06
    Asbtract ( 78 )   HTML ( 2)   PDF (912KB) ( 164 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The impact of parameter setting on the performance of radio interferometric ranging(RIR)was quantitatively analyzed,including phase error distribution,carrier frequency separation and its number.Then a parameter optimization method was proposed to further extend the deployment area of radio interferometric positioning system (RIPS),which could further extend the ranging ambiguity period of RIR as well as keep a high ranging accuracy.Outfield experiment shows that the ranging error of RIR is restricted to several meters while the deployment distance can be extended to over one kilometer,which makes RIR capable of implementing precise localization in sparsely deployed wireless sensor network.

    Communications Protocol of WSN
    Research of old-new information combined routing method in delay tolerant network
    Ya-hui WU,Su DENG,Hong-bin HUANG
    2010, 31(9A):  53-58.  doi:1000-436X(2010)9A-0053-06
    Asbtract ( 68 )   HTML ( 2)   PDF (630KB) ( 132 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new routing method ONICRM(old-new information combined routing method) was proposed for DTN which used the old and new information of the node to estimate its delivery probability.According to the local topology of the node at some instance,the number of the copies were reduced.At last,a queue management method was adopted according to the message’s age,time of left and the number of copies.Simulation shows that ONICRM achieves a higher message delivery ratio and lower delivery delay with lower transmission overhead.

    Incremental algorithm for finding disjoint paths in sensor networks
    Ke-jia ZHANG,Hong GAO
    2010, 31(9A):  59-67.  doi:1000-436X(2010)9A-0059-09
    Asbtract ( 44 )   HTML ( 2)   PDF (762KB) ( 77 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Increasing robustness,throughput and load balance are important goals when designing and deploying a wireless sensor network.One way to achieve those goals is by being able to route messages through multiple disjoint paths between two nodes.Given a fixed sink node s,an user-specified node t and an user-defined positive integer k,an incremental algorithm was proposed to find k disjoint paths connecting s and t.The algorithm is guaranteed to produce min{k,k*}disjoint paths connecting s and t,where k*is the maximum number of existing disjoint paths in the network.It only needs to collect part of topology information in an incremental manner,which makes it more communication efficient comparing with existing centralized algorithms.

    Simulation research of VANET routing protocols in real urban simulation scenarios
    De-gui XIAO,Li-xiang PENG
    2010, 31(9A):  68-72.  doi:1000-436X(2010)9A-0068-05
    Asbtract ( 63 )   HTML ( 4)   PDF (703KB) ( 118 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to use NS-2 simulating routing algorithms of vehicular ad hoc networks(VANET),MOVE was used to build real urban simulation scenarios and simulator scripts were exported into NS-2,whose node mobility model was extended.GPSR was implemented and compared with AODV and DSDV under three typical urban area scenarios simulated by MOVE.Packet delivery rate,average end-to-end delay and the first-packet-received time under different packet sizes and vehicle numbers were used as the performance metrics to evaluate those three routing algorithms.Experimental results indicate that GPSR is more suitable for VANET in urban area.

    PreS:an efficient routing algorithm for opportunistic networks based on mobility prediction
    Jian-wei NIU,Jin-kai GUO,Yan LIU,Chao TONG
    2010, 31(9A):  73-80.  doi:1000-436X(2010)9A-0073-08
    Asbtract ( 42 )   HTML ( 2)   PDF (784KB) ( 114 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existing routing algorithms for opportunistic networks rarely consider the social characteristics of the nodes,and therefore the mobility models in these algorithms cannot accurately describe users’ real traces.PreS was proposed,an efficient routing algorithm for opportunistic networking,which employed an adapted Markov chain to model the node mobility process,and to describe the node mobility features by considering the nodes’ social characteristics.A comparison with the state-of-the-art algorithms reveals that PreS can provide better performance on both the delivery ration and delivery latency,and approaches the performance of Epidemic with less resource consumption.

    Study on distributed channel allocation and routing forwarding strategy in Dual-Radio sensor networks
    Bin FAN,Jin-bao LI,Long-jiang GUO,Xu LIU,Qian-qian REN
    2010, 31(9A):  81-89.  doi:1000-436X(2010)9A-0081-09
    Asbtract ( 36 )   HTML ( 1)   PDF (861KB) ( 71 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the limited orthogonal channels in wireless sensor networks (WSN),a distributed channel allocation algorithm (DCA) for Dual-Radio WSN was presented.Based on DCA,a routing forwarding strategy (RFS) was proposed as well.DCA avoids conflictions within a path and reduces conflictions among different paths with a small number of channels.Furthermore theoretically prove that when K≥Δ+1,the upper bound of the network throughput is|M|+1,where K is the number of orthogonal channels in WSN,Δ is the largest degree of the network topology graph,and|M|is the number of non-leaf nodes in the network routing tree.Nodes switch channels timely in RFS,and then further dropping the conflict between the paths,effectively transmit data in parallel.Simulation results indicate that DCA and RFS can reduce the latency of data forwarding and the average energy consumption of nodes,as well as increase the throughput significantly.

    Broadcast algorithm based on network coding in wireless sensor networks
    Ling XIAO,Ren-fa LI,Juan LUO
    2010, 31(9A):  90-96.  doi:1000-436X(2010)9A-0090-07
    Asbtract ( 29 )   HTML ( 1)   PDF (735KB) ( 38 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Broadcast from sink,such as code updates,was frequent and expensive in the wireless sensor network applications.E-code was presented,which was a reliable and efficient one-to-all broadcast protocol based on intra-flow network coding.The key idea is change the way of choosing coefficients of the linear combination to save the storage space of node and reduce the complexity of computing and develop a packet forwarding scheme for wireless sensor networks to improve the efficiency of the algorithm.E-Code performs better in terms of the average overhead of transmissions to achieves more power saving.

    Applications of WSN
    Repeated game based secret sharing scheme in IOT
    Da-wei LI,Geng YANG
    2010, 31(9A):  97-103.  doi:1000-436X(2010)9A-0097-07
    Asbtract ( 52 )   HTML ( 4)   PDF (689KB) ( 83 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The Internet of things(IOT)is a heteromerous network integrated by different types of network,which offers more challenge to design key management schemes.In secret sharing scheme,IOT nodes’performances in the protocol may be determined by their expect payoffs.Under this scenario,IOT nodes will simply not broadcast their shares so that traditional secret sharing schemes could not complete in a bounded running time.Focus on this problem,a new IOT secret sharing scheme based on IBE public key system and repeated game theory was proposed.In this scheme,shares are distributed by dealer encoded by a bilinear pairing in finite field.IOT nodes exchange their shares in a finite repeated game.The mechanism of the scheme makes all the nodes have incentive to broadcast his or her share of the secret.The security analysis and complexity analysis are addressed.

    Distributed energy efficient scheduling in wireless sensor network for agriculture
    Xiao QI,Chun-jiang ZHAO,Yue-xuan WANG,Yong-cai WANG,Jin-biao CHEN
    2010, 31(9A):  104-111.  doi:1000-436X(2010)9A-0104-08
    Asbtract ( 39 )   HTML ( 1)   PDF (770KB) ( 40 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Energy management is one of the most important problems in wireless sensor network(WSN),especially in WSN of agriculture which need to work stably in large-scale farmland for long term.It is therefore very important to design an energy efficient scheduling algorithm which can make sure that the sensor network could sample data and work for long term.A distributed energy efficient stair scheduling algorithm based on reverse time synchronization and stair working and sleeping was proposed to solve this problem.This algorithm guaranteed energy-efficient motion and reliable multi-hop communication in sensor network.The algorithm was implemented in TinyOS and its performance was demonstrted in a real system based on 60 IRIS nodes.This algorithm requires strict time synchronization,so a solution for time synchronization during nodes was also proposed.

    Hidden monitor based distributed intrusion detection mechanism for WSN
    Xiao-jing LIAO,Lei YU,Jian-zhong LI
    2010, 31(9A):  112-120.  doi:1000-436X(2010)9A-0112-09
    Asbtract ( 51 )   HTML ( 1)   PDF (794KB) ( 49 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed intrusion detection mechanism was proposed.The monitors were implicitly selected to enhance the security of the intrusion detection mechanism itself to a certain extend.Through the random selection of the monitor nodes and collaborative neighborhood detection,the intrusion detection mechanism achieved the energy-efficiency and reliability in the attack detection.Analysis shows that mechanism can effectively defend against node capture attacks while ensuring the efficiency of detection.

    iOPEN:a congestion-aware indoor optimal emergency navigation algorithm in WSN
    Yong-le CHEN,Li-min SUN,Xin-yun ZHOU,Jie SHEN
    2010, 31(9A):  121-128.  doi:1000-436X(2010)9A-0121-08
    Asbtract ( 35 )   HTML ( 1)   PDF (793KB) ( 172 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A congestion-aware indoor optimal emergency navigation algorithm (iOPEN) was proposed,which first quantified the congestion degree by pedestrian average velocities,and accurately computed the evacuating time,then transformed the navigation problem into the shortest path maintaining problem in dynamic networks.Thereby,our algorithm can describe the evacuation of people as a kind of network flow,and kept all the people escaping in the shortest time by dynamic maintaining the shortest path in the network.Besides,the simulation results also show that our algorithm not only keeps all the people escaping in the shortest time,but also keeps the number of escaping people at any time is most.

    Distributed mobile node localization with QR factorization
    Shao-shuai LIU,Hai-yong LUO,Shi-hong ZOU,Bo ZHANG
    2010, 31(9A):  129-134.  doi:1000-436X(2010)9A-0129-06
    Asbtract ( 51 )   HTML ( 1)   PDF (649KB) ( 69 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most localization algorithms in the literature focused on static wireless sensor networks without taking mobility of sensor nodes into account.Aiming at the drawbacks,an efficient approach for localization in mobile sensor networks using QR factorization was proposed.This algorithm first used QR factorization to solve the linear equations for every beacon,and then mobile blind sensors updated the results received from the nearest beacon without computing QR factorization again to estimate the locations,which reduced the mobile blind sensors’cost of computation in a large extent.Also the estimation lower bound(the Cramér-Rao lower bound)was analyzed for the location error characters in wireless sensor networks.The experimental results show this algorithm can efficiently reduce the cost of computation and perform well in locating the mobile blind sensors.

    Energy-efficient algorithm for mobile target prediction and tracking in wireless sensor networks
    Xu LIU,Jin-bao LI,Long-jiang GUO,Bin FAN,Jing-hua ZHU
    2010, 31(9A):  135-143.  doi:1000-436X(2010)9A-0135-09
    Asbtract ( 51 )   HTML ( 1)   PDF (762KB) ( 128 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of target tracking in wireless sensor networks,an energy efficient algorithm for mobile targets prediction and tracking was proposed.Sleep scheduling mechanism was used to reduce the cost,as well as to guarantee the real-time tracking.The algorithm predicts the trajectory of the target with the Markov chain theory,and the sleeping nodes in the predicted area would be waked up to monitor the targets.In order to predict the target accurately,a location algorithm based on distance vector was triggered to estimate its position.The sensors sleep initiatively to save energy when they did not have the sensing task.Simulation and testbed experimental results indicate that the algorithms can accurately describe the target trajectory,and efficiently reduce the energy consumption.

    Approach to design traffic model based on social networks
    Shi-bao LI,Li HONG
    2010, 31(9A):  144-149.  doi:1000-436X(2010)9A-0144-06
    Asbtract ( 30 )   HTML ( 2)   PDF (619KB) ( 175 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the traffic irregularity in real networks and by taking advantage of the social network theory,a new approach was presented to design traffic model.It made use of the preferential and growing mechanism to establish a node service network and defined friend-nodes for each node.Meanwhile,it distributed the service among node pairs proportionately according to edge weights.The simulation results show that the new traffic model reflects the scale-free property and the small-world effect of real networks,and experiments with BR-AODV routing algorithm prove its important practical significance and broad application prospect.

    Network Security
    Emergency response model for enhanced survivability of information system
    Guo-sheng ZHAO,Jian WANG,Hai-long LIU
    2010, 31(9A):  150-154.  doi:1000-436X(2010)9A-0150-05
    Asbtract ( 39 )   HTML ( 1)   PDF (630KB) ( 58 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A survivable emergency response model based on three progressive control modes monitor-analysis-response was proposed which described the adaptive adjustment mechanism oriented to the improvement of system survivability.Based on that frame,an emergency scheduling model was proposed,which could autonomically coordinate and control emergent policies according to the survivable situation changes of critical services.Then a survivability-oriented services degraded strategy was presented.As a result,critical services could be finished farthest within its deadline expected by users.Moreover,the whole configuration process was transparent for users.The simulation results show that the proposed method can provide the guarantee of survivability for critical services and effectively improve the survivability of overall system.

    Model and realization of comprehensive monitor towards the self-healing system
    Xi-kun DONG,Hui-qiang WANG,Hong-wu LV,Guang-sheng FENG,Xu LU
    2010, 31(9A):  155-163.  doi:1000-436X(2010)9A-0155-09
    Asbtract ( 41 )   HTML ( 1)   PDF (1078KB) ( 56 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the analysis of massive existing monitor model and methods,a comprehensive monitor model towards the self-healing system was proposed.Based on building the mode of general application and organically combining the monitor methods towards different attributes of the files,the monitor model can improve the performance of self-healing by reducing the grain size of the monitor and recovery.At last,the monitor model was applied to a typical web application to validate its efficiency and performance.The experiment result shows that,the proposed monitor model has better monitor performance and lower missing rate than single aspect monitor,and.it can decrease the performance cost of the subsequent recovery.

    Method for building hardware emulating platform in trusted mobile terminal
    Kai TANG,Xin XU
    2010, 31(9A):  164-168.  doi:1000-436X(2010)9A-0164-05
    Asbtract ( 45 )   HTML ( 3)   PDF (568KB) ( 142 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the lack of hardware support in trusted mobile terminal research based on MTM (mobile trusted module),the popularity and application of MTM were restricted heavily.Based on QEMU and MTM emulator,a method to implement MTM device in QEMU was proposed,which could be used to build hardware emulating platform in trust mobile terminal and perform related researches.The method had been verified in emulating embedded platform based on S3C24x0 SOC and provided support for the research in MTM secure boot.

    Research on network running model of the imitating ecosystem
    Tong-rang FAN,Yong-bin ZHAO,Yan SUN,Ming LI
    2010, 31(9A):  169-175.  doi:1000-436X(2010)9A-0169-07
    Asbtract ( 39 )   HTML ( 1)   PDF (802KB) ( 59 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient ecological running model was proposed from the ecology perspective,it had built a new network system to adapt to complex environments.Summarizing the physical relation of network structure,the definitions of monomer was given,connection and living-body proved that isomorphic mapping relation exists between network and living-bodies,basing on the quantitative analysis of network ecological property.In the new system,the creation was described,part update and metabolism of micro-ecological cycle on monomer and as well as physical connection,data connection and security strategy on living-body.

    Generation of Trojan communication signatures based on support
    Xiao-yan SUN,Yun-dong XING,Sheng-li LIU,Yue-fei ZHU
    2010, 31(9A):  176-182.  doi:1000-436X(2010)9A-0176-07
    Asbtract ( 54 )   HTML ( 3)   PDF (834KB) ( 83 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Either current generation methods of network attack signature are not suitable for Trojan communication signature generation,or generation time overhead is too large.To address these problems,the definitions of group support and distinction signature and the criteria for determining noise were put forward.The algorithm of Trojan network communication signature generation based on support was given,and the theoretical higher limit of the number of two-sequence alignment was analyzed.Experimental results show that the algorithm based on support can reduce the number of two-sequence alignment,and the generated signatures have good accuracy.

    IRC botnets’size measure based on duplicated removal of dynamic IP and NAT identifing
    Run-heng LI,Liang GAN,Yan JIA
    2010, 31(9A):  183-189.  doi:1000-436X(2010)9A-0183-07
    Asbtract ( 51 )   HTML ( 3)   PDF (724KB) ( 88 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For botnet’s dynamic and the impact of dynamic IP and NAT IP,the measure of botnet’s size was difficult.Removed duplicated and dynamic IP and identified NAT based on communication feature to estimate the size of botnet.Experiments were carried out for validation purposes.

    Design of a hardware-based high-speed multi-pattern matching structure for network security applications
    Peng HUANG,Yuan-bo GUO,Wei LIU
    2010, 31(9A):  190-196.  doi:1000-436X(2010)9A-0190-07
    Asbtract ( 56 )   HTML ( 3)   PDF (819KB) ( 93 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the high-speed multi-pattern matching demand in content detection based network security applications,a hardware-based multi-pattern matching structure was designed.Winnowing algorithm which has self-synchronization feature was used to segment pattern strings and variable-stride AC automata was constructed to solve the inherent character shifting problem of traditional multi-stride AC algorithm.A state cache was inserted into the variable-stride automata to dynamically generate one-step cross-transitions and reduce the number of static rules in memory.Keywords consisting of state and character block were pre-filtered by bloom filter to reduce the access to state transition table and improve matching speed.A matching table was built to check head and tail blocks of long patterns and TCAM was used to match short patterns effectively.Experimental results show that,by adding a state cache and a pre-filter,the memory requirement of Variable-Stride AC algorithm is reduced by 30%,a single matching engine can achieve the detection rate of 5.6Gbit/s.

    Protocol of Information Security
    Improved meet-in-the-middle attacks on 7-round AES-192 and 8-round AES-256
    Xiao-li DONG,Yu-pu HU,Jie CHEN,Shun-bo LI,Yang YANG
    2010, 31(9A):  197-201.  doi:1000-436X(2010)9A-0197-05
    Asbtract ( 47 )   HTML ( 1)   PDF (594KB) ( 336 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new variant of 5-round distinguisher of meet-in-the-middle attack on AES was constructed by exploiting the properties of the round transform of AES.Based on the variant of distinguisher,meet-in-the-middle attacks on 7-round AES-192 and 8-round AES-256 were presented by using the time-memory tradeoff approach.It is shown that the new results are better than the cryptanalytic results presented at FSE2008 on reduced AES in terms of the time complexity and the memory complexity.

    RFID tag ownership transfer secure protocol
    Zhi-de CHEN,You-qin CHEN,Li XU
    2010, 31(9A):  202-208.  doi:1000-436X(2010)9A-0202-07
    Asbtract ( 36 )   HTML ( 1)   PDF (571KB) ( 97 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at security,privacy and authentication problems during RFID tag ownership transfer,a“one exchange and two update”ownership transfer protocol was proposed.Two“update”could protect both of the previous and new owners’privacy while“one exchange”was for undeniable ownership transfer and tag verified in one ownership transfer.In the sales of goods with embedded RFID tag,the protocol could ensure the security and privacy for both of two participators and realize after-sales service for the undeniable ownership transfer,which was very valuable for the pervasive application of RFID in reality.

    Security flaws and improvement of an ID-based wireless authentication scheme with anonymity
    Qi JIANG,Guang-song LI,Jian-feng MA
    2010, 31(9A):  209-216.  doi:1000-436X(2010)9A-0209-08
    Asbtract ( 41 )   HTML ( 1)   PDF (725KB) ( 72 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An ID-based wireless authentication scheme was analyzed.It was demonstrated that the scheme suffered from mobile node spoofing attack and rogue network attack and the key updating failed to possess backward secrecy.Then,an improved authentication scheme was proposed,which remedied the security flaws.Security analysis shows that the improved scheme is provably secure in the CK model.Meanwhile,performance comparison indicates that the improved scheme maintains the merit of low computation cost.

    New approach to security analysis of ad hoc routing protocols based on strand space model
    Jing-jing GUI,Yu-sen ZHANG
    2010, 31(9A):  217-222.  doi:1000-436X(2010)9A-0217-06
    Asbtract ( 47 )   HTML ( 2)   PDF (672KB) ( 85 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new method of security analysis of ad hoc routing protocol based on SSM (strand space model) was proposed.Firstly,in specific setting of network,the incorrect routes based on graphic theory was calculated on.Then in the extended SSM the probability of incorrect routes being found by ad hoc routing protocol was proofed.As a example,The improved model was used to analyze a route protocol,EndairA,and result shows that EndairA can generate incorrect routes,but which can’t be discover in other analysis model.

    Efficient collusion-resisting data aggregation protocol
    You-wen ZHU,Liu-sheng HUANG,Wei YANG,Miao-miao TIAN
    2010, 31(9A):  223-227.  doi:1000-436X(2010)9A-0223-05
    Asbtract ( 48 )   HTML ( 5)   PDF (672KB) ( 93 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A measurement model was defined to analysis each privacy-preserving data aggregation protocol’s ability to resist potential collusion.Then,a new efficient collusion-resisting privacy-preserving data aggregation protocol was proposed.Theoretical analysis and experiment result confirmed the protocol’s ability to resist potential collusion and the communication overhead of our scheme is much less than existing protocol’s.

    Efficient two-server password authenticated key exchange scheme
    De-xin YANG,Bo YANG,Xi-ming LI
    2010, 31(9A):  228-232.  doi:1000-436X(2010)9A-0228-05
    Asbtract ( 42 )   HTML ( 1)   PDF (602KB) ( 49 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new efficiently two-server password authenticated key exchange scheme was proposed,It proved that an adversary cannot obtain the password of a user even though one of two servers was corrupted.Comparing with the previous schemes,This scheme has higher security,lower computational complexity and lower communication rounds.It is particularly suitable for implementation of computational resource-restrained environment.

    Quick feature selection method and its application on network intrusion detection
    Tie-ming CHEN,Ji-xia MA,Yi-guang XUAN,Jia-mei CAI
    2010, 31(9A):  233-238.  doi:1000-436X(2010)9A-0233-06
    Asbtract ( 56 )   HTML ( 2)   PDF (565KB) ( 67 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    s:A novel and quick feature selection method,based on data inconsistency was proposed.Due to the different data inconsistency under different pattern generated from different feature subset,the optimal features with no relevant or redundant attribute could be easily found.At last,the intrusion detection benchmark dataset from KDD99 was analyzed into detail to show the superiority of proposed feature selection method,compared with the traditional relevance-based method CFS.

    Performance verification of the digital watermarking for vector map based on SPA
    Jian-guo SUN,Guo-yin ZHANG,Jun-peng WU,Ai-hong YAO
    2010, 31(9A):  239-244.  doi:1000-436X(2010)9A-0239-06
    Asbtract ( 50 )   HTML ( 1)   PDF (672KB) ( 90 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To realize the accuracy appraisement and verification to the comprehensive performance of digital watermarking for vector maps,a novel performance verification model for digital watermarking of vector maps based on set pair analysis was introduced.Several important appraisement factors and the process were proposed for the verification of the watermarking algorithm.Experiments and analysis show that the proposed verification technology provides better practicability and expandability,and helps to enhance the performance of the digital watermarking algorithm.

    Algorithms of Information Security
    Audio steganography algorithm using PCM quantization coding in the DWT domain
    Qiu-yu ZHANG,Yi-bo HUANG,Lan-jun ZHENG
    2010, 31(9A):  245-250.  doi:1000-436X(2010)9A-0245-06
    Asbtract ( 43 )   HTML ( 1)   PDF (705KB) ( 138 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the concealment and robustness of the audio steganography,using the pulse code modulation (PCM) quantization coding to embed secret message,an audio steganography algorithm was proposed.The PCM quantization coding was introducted to quantify the every segment’s mean value of wavelet coefficient to a binary sequence.This method could greatly reduce the quantization error.Using matrix coding to embed secret bits could improve embedding efficiency and embedding capacity.The experimental results show that the algorithm not only has excellent concealment,but also has good robustness against noise addition,lowpass filtering,resampling,MP3 compression and synchronization attack.

    Analysis and detection of text steganographic tool—Stegparty
    Hai-bo MIAO,Liu-sheng HUANG,Zhi-li CHEN,Wei YANG
    2010, 31(9A):  251-258.  doi:1000-436X(2010)9A-0251-08
    Asbtract ( 48 )   HTML ( 1)   PDF (861KB) ( 57 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Using the idea of probability statistics,a study on Stegparty encode-text was done.After analyzing the characteristics of encode-text,a detecting algorithm based on characteristic lexicons was proposed.The idea possesses favorable commonality and flexibility.It also fits other text steganography based on substitution such as synonyms substitution and punctuation substitution.A detection experiment on Stegparty was carried out.Experimental result shows that the detecting algorithm can achieve an accuracy of 90% even when the embedding ratio is very low(about 0.08%).

    Fuzzy comprehensive evaluation for image blind steganalysis algorithms
    Yong-kuan ZHAO,Xiao-xia CAI,Hong CHEN
    2010, 31(9A):  259-263.  doi:1000-436X(2010)9A-0259-05
    Asbtract ( 35 )   HTML ( 1)   PDF (590KB) ( 75 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A fuzzy comprehensive evaluation for image blind steganalysis algorithms was proposed.Based on analyzing the existing indicators system of blind steganalysis algorithms,The scenario adopts AHP subjective and objective weighting method to determine primary and secondary indicators weight,then evaluates blind steganalysis algorithms by using fuzzy measures.The result of the evaluation is a guide,which can select blind steganalysis algorithms for the different practical applications.

    Correlation degree and correlation coefficient of multi-output m-valued logical functions
    IXU L,Ya-qun ZHAO
    2010, 31(9A):  264-268.  doi:1000-436X(2010)9A-0264-05
    Asbtract ( 29 )   HTML ( 1)   PDF (570KB) ( 43 )   Knowledge map   
    References | Related Articles | Metrics

    The definition of the correlation degree was presented,the relations of the correlation degree with balance functions and independence were investigated,and the Chrestenson spectral representation of the correlation degree between a multi-output m-valued logical function and a multi-output m-valued affine function was given.On the bases of that,the concept of the correlation coefficient was given and some properties of the correlation coefficient were obtained by constructing real random variables.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: