Please wait a minute...

Current Issue

    25 June 2016, Volume 37 Issue 6
    Papers
    Study of energy efficient WBAN topology optimization in IEEE 802.15.6
    Zheng-you LIANG,Yu-mei YAO
    2016, 37(6):  1-10.  doi:10.11959/j.issn.1000-436x.2016110
    Asbtract ( 338 )   HTML ( 9)   PDF (835KB) ( 664 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An optimization model was proposed to design the network topology of wireless body area network(WBAN).Focusing on the two hops extended star topology given in IEEE 802.15.6 standard,a mixed integer non-linear programming model was constructed to minimize the energy consumption of WBAN.Then,the optimized network topology was obtained by adjusting the number and location of relays to be deployed and the data routing towards the hub.The experimental results show that,compared with Elias’s model (EAWD,energy aware WBAN design),the proposed model can reduce network energy consumption by 40.5%,decrease network delay by 52.4% on average,and extend network lifetime by double.

    Research on Webshell-based botnet
    Ke LI,Bin-xing FANG,Xiang CUI,Qi-xu LIU,Zhi-tao YAN
    2016, 37(6):  11-19.  doi:10.11959/j.issn.1000-436x.2016118
    Asbtract ( 463 )   HTML ( 14)   PDF (824KB) ( 1072 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the rapid rising of Web server-based botnets,traditional channel models were unable to predict threats from them.Based on improving traditional Webshell control method,a command and control channel model based on tree structure was proposed.The model was widely applicable and stealthy and the simulation experimental results show it can achieve rapid and reliable commands delivery.After summarizing the limitations of current defenses against the proposed model,the model’s inherent vulnerabilities is analyzed and feasible defense strategies are put forward.

    Certificateless strong designated verifier multi-signature
    Hong-zhen DU,Qiao-yan WEN
    2016, 37(6):  20-28.  doi:10.11959/j.issn.1000-436x.2016112
    Asbtract ( 303 )   HTML ( 4)   PDF (660KB) ( 660 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless strong designated verifier multi-signature scheme from bilinear pairings was constructed and it was proved that the scheme is existentially unforgeable under the computational bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption.Moreover,the scheme meets the properties of both strong designated verifier signatures and multi-signatures.The scheme achieves high efficiency since the length of designated verifier multi-signature generated by the scheme is only 160 bits and the computational cost of bilinear pairings necessary for verification algorithm is constant,i.e.,one bilinear pairing.So,it can be applied in wireless networks of the limited computing resources and network bandwidth.

    Discrete multi-objective optimization of particle swarm optimizer algorithm for multi-agents collaborative planning
    Xiao-bo SHI,Yin ZHANG,Shan ZHAO,Deng-ming XIAO
    2016, 37(6):  29-37.  doi:10.11959/j.issn.1000-436x.2016113
    Asbtract ( 332 )   HTML ( 5)   PDF (882KB) ( 636 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Although multiple mobile agents(MA)collaboration can quickly and efficiently complete data aggregation in wireless sensor network,the MA carrying data packages extensively increase along with a raise in the number of data source nodes accessed by MA,which causes unbalanced energy load of sensor nodes,high energy consumption of partial source nodes,and shortened lifetime of networks.The existing related works mainly focus on the objective of decreasing total energy consumption of multiple MA,without considering that rapidly energy consumption of partial source nodes has a negative effect on networks lifetime.Therefore,discrete multi-objective optimization of particle swarm algorithm was proposed,which used the total network energy consumption and mobile agent load balancing as fitness function for the approximate optimal itinerary plan in multiple mobile agent collaboration.Furthermore,the simulation result of the proposed algorithm is better than the similar algorithm in total energy consumption and network lifetime.

    Network status aware routing in content-centric network
    Yue-ping CAI,Jun LIU
    2016, 37(6):  38-48.  doi:10.11959/j.issn.1000-436x.2016114
    Asbtract ( 296 )   HTML ( 3)   PDF (865KB) ( 467 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the efficiency of content delivery and to reduce the network overhead of content centric network (CCN),a network status aware routing(NSAR)mechanism was proposed.NSAR utilized data packets from the content server nodes to collect network statuses.The forwarding probability of the matching ports of the nodes on the path would be updated according to the network statuses.The subsequent interest packet forwarding would be based on the updated forwarding probability.Therefore the content delivery efficiency would be improved.Simulation results show that NSAR can effectively reduce the average delay of content requests and the number of packets in network as well as the network bandwidth overhead compared with the traditional routing algorithm in CCN.

    ID-based server-aided verification signature scheme with strong unforgeability
    Xiao-dong YANG,Miao-miao YANG,Guo-juan GAO,Ya-nan LI,Xiao-yong LU,Cai-fen WANG
    2016, 37(6):  49-55.  doi:10.11959/j.issn.1000-436x.2016115
    Asbtract ( 275 )   HTML ( 5)   PDF (600KB) ( 570 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most identity-based signature schemes in the standard model are existentially unforgeable,which cannot prevent adversaries from forging valid signatures on messages that have previously been signed.However,signature verification algorithms of ID-based signature schemes in the standard model require expensive bilinear pairing operations.In order to overcome the shortcomings of the existing ID-based signature schemes such as strong security assumption and high computation cost,a strongly unforgeable ID-based server-aided verification signature scheme was presented.This scheme was proven to be secure under collusion attacks,adaptive chosen identity and message attacks in the standard model.Analysis results show that the proposed scheme effectively reduces computation cost of pairing operation,and it greatly reduces computational complexity of signature verification algorithm.The proposed scheme is more efficient than the existing ID-based signature schemes.

    Method of constructing an anonymous graph based on information loss estimation
    Jie SU,Shuai LIU,Zhi-yong LUO,Guang-lu SUN
    2016, 37(6):  56-64.  doi:10.11959/j.issn.1000-436x.2016116
    Asbtract ( 296 )   HTML ( 3)   PDF (819KB) ( 622 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A potential attack based on degree information by re-identifying target vertexes from a sequence of published graphs was analyzed.To deal with this kind of attack,a k-anonymous graph stream constructing method based on information loss estimation was provided.Information loss caused by re-constructing graph was controlled by using the method of attributes generalization of nodes and the structure generalization of sub-graph.The disturbance in sub-graph was forbidden to prevent the attack.The method of measuring the information loss of nodes and structures during the anonymous process due to re-construction of graph was defined.A k-anonymity cluster algorithm based on greedy clustering algorithm was build,which realized anonymous partition according to the information loss.Finally,a method of constructing anonymous social network for the evolving social network with the least information loss was provided.The experiments on medical diagnostic data set show that the algorithm of constructing anonymous graph based on the information loss estimation can be used to control the loss of information.

    Online hierarchical reinforcement learning based on interrupting Option
    Fei ZHU,Zhi-peng XU,Quan LIU,Yu-chen FU,Hui WANG
    2016, 37(6):  65-74.  doi:10.11959/j.issn.1000-436x.2016117
    Asbtract ( 489 )   HTML ( 14)   PDF (917KB) ( 683 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at dealing with volume of big data,an on-line updating algorithm,named by Macro-Q with in-place updating (MQIU),which was based on Macro-Q algorithm and takes advantage of in-place updating approach,was proposed.The MQIU algorithm updates both the value function of abstract action and the value function of primitive action,and hence speeds up the convergence rate.By introducing the interruption mechanism,a model-free interrupting Macro-Q Option learning algorithm(IMQ),which was based on hierarchical reinforcement learning,was also introduced to order to handle the variability which was hard to process by the conventional Markov decision process model and abstract action so that IMQ was able to learn and improve control strategies in a dynamic environment.Simulations verify the MQIU algorithm speeds up the convergence rate so that it is able to do with the larger scale of data,and the IMQ algorithm solves the task faster with a stable learning performance.

    Monitoring approach for online security of cryptographic protocol
    Yu-na ZHU,Ji-hong HAN,Lin YUAN,Yu-dan FAN,Han-tuo CHEN,Wen GU
    2016, 37(6):  75-85.  doi:10.11959/j.issn.1000-436x.2016293
    Asbtract ( 1040 )   HTML ( 20)   PDF (1411KB) ( 2479 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Previous methods can not detect the low-interaction attacks of protocol logic.A cryptographic protocol online monitoring approach named CPOMA was presented.An ontology framework of cryptographic protocol features was constructed for the unified description of cryptographic protocol features with different types.Based on the framework,a feature weighting method was proposed by fuzzy subspace clustering first,and the individualized feature database of cryptographic protocols was built.On this basis,a self-learning method was presented for protocol identification and session rebuilding,and then abnormal protocol sessions were detected online.Experimental results show that CPOMA can identify protocols,rebuild sessions,detect abnormal sessions efficiently,and can improve the online security of cryptographic protocols.

    Quantitative approach of multi-controller’s consensus in SDN
    Jun-fei LI,Ju-long LAN,Yu-xiang HU,Jiang-xing WU
    2016, 37(6):  86-93.  doi:10.11959/j.issn.1000-436x.2016119
    Asbtract ( 366 )   HTML ( 8)   PDF (726KB) ( 1060 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the problem of multi-controller’s consensus in SDN,a quantitative approach was proposed,which provided a more accurate and effective method of sharing network view for the control layer's east-west extension.Firstly,the metrics of consensus,performance and availability between the controllers with the feature of SDN was provided,establishing the common model for quantitative research.Secondly,for the three typical questions in the research of multi-controller’s consensus,the condition to achieve its optimal value was explicated,which provided a reference for the configuration of consensus.Finally,to verify the validity of the quantitative approach by simulation,experimental results show that this approach can improve the performance and availability of the control layer in SDN effectively.

    Network model and topology control algorithm based on hierarchical autonomous system in space information network
    Wei ZHANG,Geng-xin ZHANG,Dong-ming BIAN,Liang GOU,Zhi-dong XIE
    2016, 37(6):  94-105.  doi:10.11959/j.issn.1000-436x.2016120
    Asbtract ( 368 )   HTML ( 12)   PDF (979KB) ( 546 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the distinguishing characteristics of space information network (SIN) such as large scale,high component complexity and dynamic,a novel network model based on hierarchical autonomous system (AS) was proposed.This model divided the complex SIN into simpler AS and sub-AS networks according to node properties,link capabilities,task features,distribution areas,etc.In these AS or sub-AS networks,different control strategies could be adopted.In this way,the dynamic network was decoupled into semi-static sub-networks,and the high dynamic coupling problem among sub-networks was solved.Then,an AS network topology control algorithm based on the hierarchical autonomous system model was proposed to minimize the time delay in the SIN.Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method was adopted,the proposed algorithm was a hybrid control method.In order to reduce the cost of control,the control message exchange was constrained among neighboring sub-AS networks.It is proved that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity.Simulation results validate the theoretical analysis and effectiveness of the algorithm.

    Time and energy aware virtual network embedding using Bayesian theory analysis
    Ying HU,Lei ZHUANG,Hong-chang CHEN,Ding MA
    2016, 37(6):  106-118.  doi:10.11959/j.issn.1000-436x.2016105
    Asbtract ( 258 )   HTML ( 2)   PDF (1051KB) ( 416 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the energy consumption problem in virtual network embedding,a virtual-network-embedding algorithm was proposed by combining the time and energy aware.Taking the running time during the evaluation of physical nodes and physical paths into account,it considered multiple factors which included the processing time of physical devices,and used probability theory to help analyze the selected probability of each available physical node for a virtual node.During the selection of substrate nodes,the factors of remaining resources,the increment of CPU utilization,the switch state and the amount of extended time of physical nodes were considered.The theory of conditional probability was further used to analyze the importance of available nodes.The factors of the switch state,the amount of extended time and the length of physical paths were also considered.The proposed approach could effectively map the current virtual network request onto a smaller set of nodes and links which are switched on,and also the devices which have less amount of extended time.Experimental results show that the proposed approach has better performance,and can effectively decrease energy consumption comparing with the methods without taking the time factor into consideration.

    Method for determining the lengths of protocol keywords based on maximum likelihood probability
    Jian-zhen LUO,Shun-zheng YU,Jun CAI
    2016, 37(6):  119-128.  doi:10.11959/j.issn.1000-436x.2016121
    Asbtract ( 423 )   HTML ( 14)   PDF (732KB) ( 774 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A left-to-right inhomogeneous cascaded hidden Markov modelwas proposed and applied to model application protocol messages.The proposed modeldescribed the transition probabilities between states and the evolution rule of phases inside the states,revealed the transition feature ofmessage fields and the left-to-right Markov characteristicsinside the fields.The protocol keywords were inferred by selecting lengths with maximum likelihood probability,and then the message format was recovered.The experimental results demonstrated that the proposed method perform well in protocol keyword extraction and message format recovery.

    Efficient certificateless multi-receiver anonymous signcryption scheme
    Yan-lin QIN,Xiao-ping WU,Wei HU
    2016, 37(6):  129-136.  doi:10.11959/j.issn.1000-436x.2016122
    Asbtract ( 346 )   HTML ( 4)   PDF (649KB) ( 562 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the private key escrow problem of identity-based multi-receiver signcryption schemes,the security model for multi-receiver signcryption scheme was constructed,and then a certificateless multi-receiver signcryption scheme based on ECC was proposed.Furthermore,the security of the scheme in the random oracle was based on the computational Diffie-Hellman assumption and elliptic curve discrete logarithm assumption was proved.Meanwhile,the scheme was free from certificate management center and needed no bilinear paring operation in both signcryption and decryption phases.It can also protect both the sender and receivers’identity from leaking out.So the scheme can be applied conveniently to broadcast signcryption in network environment.

    Graph partition based mapping algorithm on multiprocessors for streaming applications
    Qi TANG,Shang-feng WU,Jun-wu SHI,Ji-bo WEI
    2016, 37(6):  137-143.  doi:10.11959/j.issn.1000-436x.2016123
    Asbtract ( 342 )   HTML ( 4)   PDF (548KB) ( 555 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among tasks of the application.An algorithm was also proposed to construct the parallelism graph based on the self-timed schedule and transform the mapping problem to a graph partitioning problem.The graph partitioning problem as a pure 0-1 integer linear programming model was further formulated and the ILP solver to find the optimal result.A lot of randomly generated synchronous dataflow graphs and a set of practical applications were used to evaluate the performance of the proposed method.The experimental results demonstrate that the proposed method outperforms available algorithms.

    Routing algorithm based on characteristics analysis of vehicle trace in vehicular ad hoc network
    Hua TAO,Fu-qin FENG,Peng XIAO,Cheng-wei TAN,Jun TAO
    2016, 37(6):  144-153.  doi:10.11959/j.issn.1000-436x.2016124
    Asbtract ( 349 )   HTML ( 11)   PDF (742KB) ( 860 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The coarse granularity vehicle mobility information is extracted from the vehicle trace data.Then a fine granularity mobility model was presented based on the coarse-grained mobility information.Based on the mobility model,a VANET routing algorithm,RPT-D,was proposed to quickly deliver the packets to the destination according to the mobility attributes.The RPT-GA algorithm,which was integrated with the QoS demands in the path selection objective,was designed.Finally,through the extensive simulations,the proposed algorithms are compared with other typical VANET routing algorithms,IGRP and GPSR,in terms of the transmission latency,the delivery ratio,the hop count and the extra package number.The simulation results verify the performance of the proposed algorithms.

    User social influence analysis based on constrained nonnegative tensor factorization
    Jing-jing WEI,Chang CHEN,Xiang-wen LIAO,Guo-long CHEN,Xue-qi CHENG
    2016, 37(6):  154-162.  doi:10.11959/j.issn.1000-436x.2016125
    Asbtract ( 275 )   HTML ( 1)   PDF (723KB) ( 637 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Existing models for measuring user social influence fail to integrate both opinion and topic information.Therefore,a new constrained nonnegative tensor factorization method combining user’s opinion and the topical relevance was proposed.The method represented user’s comment relations as 3-order tensor,factorized the comments tensor constrained by Laplacian topical matrix,and then measures user influence according to the latent factors resulting from the tensor factorization.Thus,the new method not only was capable to effectively calculate the strength of user social influence on given topic,but also kept the polarity allocation of social influence.The experimental result shows that the performance of the proposed method is better than that of the baseline methods such as OOLAM,TwitterRank,etc.

    Optimal forwarding policy in opportunistic based on social features of nodes
    Zhi-fei WANG,Pei-teng SHI,Su DENG,Hong-bin HUANG,Ya-hui WU
    2016, 37(6):  163-168.  doi:10.11959/j.issn.1000-436x.2016126
    Asbtract ( 258 )   HTML ( 2)   PDF (725KB) ( 477 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A forwarding model of opportunistic network was established based on social features of node and by introducing the Pontryagin’s maximal principle,the optimal policy was got,which obeyed the threshold form.Let h denotes the stop time,when th,the node stops sending messages.Experiments show that the optimal strategy is better than optimal static policy.Further analysis show that the bigger the average number of friends of node is,the smaller the stopping time is,the better the performance is.

    Comprehensive Review
    Survey of security for Android smart terminal
    Yan-ping XU,Zhao-feng MA,Zhong-hua WANG,Xin-xin NIU,Yi-xian YANG
    2016, 37(6):  169-184.  doi:10.11959/j.issn.1000-436x.2016127
    Asbtract ( 760 )   HTML ( 41)   PDF (736KB) ( 2235 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the security,the layered security system was constructed.Firstly,the devices safety protection based on remote anti-theft,biometric identity verification and hardware security module was expounded.Secondly,network security referring to the wireless security network,virus propagation killing and anti-phishing was illustrated.Thirdly,the OS safety was introduced from the perspective of system kernel,runtime environment and application framework.Fourthly,application security was showed containing the reverse engineering static analysis,behavior dynamic analysis,safety reinforcement and safety assessment.Fifthly,the privacy data protection was summarized including tracking,encryption and backup.Finally,the future development direction was prospected on the security framework and intelligent behavior analysis.

    Correspondences
    Research on linear approximations of simplified Trivium
    Meng MA,Ya-qun ZHAO
    2016, 37(6):  185-191.  doi:10.11959/j.issn.1000-436x.2016108
    Asbtract ( 346 )   HTML ( 8)   PDF (578KB) ( 756 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The linear approximations of simplified Trivium with the initialization of 288 clocks(2-round Trivium) was studied.An algorithm was designed to search optimal linear approximations.Moreover,a method was presented to conduct a linear approximation of 2-round Trivium by approximating the first round equation which involved the key bits,

    Adaptive steganography algorithm in digital image based on Arnold transform
    Qi LI,Xin LIAO,Guo-qing QU,Guo-yong CHEN,Jiao DU
    2016, 37(6):  192-198.  doi:10.11959/j.issn.1000-436x.2016128
    Asbtract ( 276 )   HTML ( 8)   PDF (764KB) ( 516 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Previous adaptive steganography algorithms were based on ordinal and full-embedding method.However,these algorithms might cause the concealment of secret information not good enough.Therefore,a random and non-fully embedding method was proposed to improve the concealment.The image system parameters could be obtained,so that the image full capacity was exactly greater than the length of information for non-full embedding.Moreover,these parameters made steganography more flexibility by reducing the modifications of image.Then,secret information embedding sequence was scrambled based on Arnold transform for the purpose that the steganalyst cannot detect out information orderly.Therefore,the secret information can be more concealed,which can improve the security of the algorithms.Experimental results show that the algorithm not only improves the concealment of steganography but also reduces stego distortion,and random non-full embedding operating can be applied to many other similar algorithms.

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: