Please wait a minute...

Current Issue

    25 November 2015, Volume 36 Issue Z1
    Academic paper
    Collaboration coding to multi-node repair program under the twin-MDS codes framework in cloud storage systems
    Xian-zhong XIE,Qian HUANG,Liu-su WANG
    2015, 36(Z1):  1-8.  doi:10.11959/j.issn.1000-436x.2015275
    Asbtract ( 322 )   HTML ( 4)   PDF (659KB) ( 749 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multi-node exact repair code scheme,which can repair multiple system nodes or redundant nodes simultaneously,was shown and proved to against the disadvantages of the existing multi-node repair model in cloud storage.The multi-node exact repair code was combined with a twin-MDS codes framework with health cooperative nodes.In this way,repair bandwidth,the number of repair links and the amount of data to be treated in an intermediate node were reduced,while multi-node were repaired.Finally,numerical simulation results show that this scheme has greater improvements.In particular,it reduces the load in an intermediate node.And the advantages was more obvious with the more storage nodes in cloud storage.

    Content popularity difference-aware cache eviction scheme for CDN-P2P hybrid networks
    Hua NIE,Min ZHANG,Jing-rong GUO,Xiao-long YANG
    2015, 36(Z1):  9-15.  doi:10.11959/j.issn.1000-436x.2015276
    Asbtract ( 577 )   HTML ( 12)   PDF (617KB) ( 810 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In CDN-P2P hybrid network,it is important for the cache eviction schemes to improve the delivery efficiency of content.However,most of them only consider the holistic popularity of content file,and neglect the difference between the individual popularities of segments within a content file.Hence,it was difficult to improve the hit rate of pre-cached content segments,and to reduce the user access delay.Hence based on the difference between the attributes of content popularity,a new cache eviction scheme (i.e.,Diff-Attribute) was proposed.Bewildered the holistic popularity of a content file,it also considered the individual popularity of its segment.More importantly,based on the concept of entropy,A method to measure the popularity difference between content files or segments was put forward.If the popularities of the segments within a content file are equalizing,its prefix segment would be pre-cached.Otherwise,the requested segments or files directly based on its popularity would be cached.Compared with traditional schemes (e.g.,LFU,LRU,MRU,FIFO),the simulation results show that Diff-Attribute can improve the cache hit rate and the byte hit rate by at least 6%,8% respectively,and can reduce the access startup delay rate and the transmission cost rate by at least 13%,7% respectively.

    Research on safety methods of airborne embedded software
    Ya-hui LI,Ya-di ZHANG,Peng GUO
    2015, 36(Z1):  16-21.  doi:10.11959/j.issn.1000-436x.2015277
    Asbtract ( 545 )   HTML ( 24)   PDF (1403KB) ( 773 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By analyzed the process of development and running of airborne software with the standards of airworthiness and information security,the factors and threats related with airborne software safety were presented,and the security protected mechanisms based on embedded TMP and MILS software architecture were provided,which all support the research on safety of embedded software on aircrafts.

    Congestion control mechanism based on data delivery probability in DTN data dissemination network
    Yi XIA,Guang-hong DENG
    2015, 36(Z1):  22-39.  doi:10.11959/j.issn.1000-436x.2015278
    Asbtract ( 362 )   HTML ( 6)   PDF (697KB) ( 606 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A congestion control mechanism based on data delivery probability (CCM-DP) was proposed to work out the decline of data delivery performance on account of data congestion in delay tolerant networks (DTN) network coding-based data dissemination process.Considering the node mobility model,data delivery probability and data congestion degree,the data delivery probability model was constructed,and the congestion control mechanism was designed from two aspects,on the one hand,by the means of adjusting the packet forwarding process,it equilibriums the data packet delivery to avoid node congestion caused by too many packets received; and on the other hand,through the design of efficient discarding strategy,it reduces the impact of packet loss caused by data congestion.Ultimately,it was put into use in data dissemination process and some simulations were taken,the simulation results show that,CCM-DP can improve data delivery performance in data congestion environment.

    Location fingerprint optimization based access point deployment in indoor WLAN localization
    Mu ZHOU,Qiao-lin PU,Zeng-shan TIAN
    2015, 36(Z1):  30-41.  doi:10.11959/j.issn.1000-436x.2015279
    Asbtract ( 450 )   HTML ( 8)   PDF (5295KB) ( 778 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel access point (AP) deployment approach by optimizing the location fingerprints in indoor WLAN localization was proposed.Firstly,constructing the water-filling optimization model based on the maximum of the Euclidean distance of RSS between every two location fingerprints.Secoudly,after the process of the iterative cross-zero adjustment and discrete adjustment,the nonnegative and discrete weights of candidate AP locations were obtained.Finally,by using the criterion of maximum average weight,the APs,and consequently optimize the location fingerprints were deployed rationally.The experimental results demonstrate that the proposed approach is able to achieve high location fingerprint based localization precision,as well as consume low time overhead involved in the optimal AP location searching.

    Secure supply and demand relationship perception routing in intermittently connected wireless networks
    Peng YANG,Yang TANG,Na SHU,Ru-yan WANG
    2015, 36(Z1):  42-52.  doi:10.11959/j.issn.1000-436x.2015280
    Asbtract ( 412 )   HTML ( 4)   PDF (967KB) ( 573 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Because of low message delivery probability and nodes malicious attack behaviors in the quota-limit routing for intermittently connected wireless networks,a secure routing is proposed based on supply and demand relationship perception.According to activity degree,average residual buffer ratio of neighbors and encountered nodes reputation dynamically perceived by nodes,the encountered nodes in real time build the supply and demand model and determine the message quota allocation combined with the message survival ratio in common.When network status meets constraint situations,update message quota dynamically based on demand elasticity of message.Simulation results show that the proposed strategy effectively reduces influence of nodes malicious behaviors and improve network performance greatly.

    Papers
    Research of malicious nodes identification based on DPAM-DM algorithm for WSN
    2015, 36(Z1):  53-59.  doi:10.11959/j.issn.1000-436x.2015281
    Asbtract ( 344 )   PDF (660KB) ( 613 )   Knowledge map   
    Related Articles | Metrics
    With the continuous development of wireless sensor networks, malicious nodes was a major threat to its security. The traditional credit threshold model could not accurately identify the malicious nodes, such as sub attack node. And there will be a low recognition rate and high false positive rate and other issues. To solve these problems, a new recognition method based on DPAM-MD algorithm was introduced, which was based on the traditional credit threshold model, combining manhattan metric with DPAM algorithm to distinguish the sub attack node. A new clustering algorithm based on density was proposed, which was based on the objective function of the distance equalization between the intra-cluster and the inter-cluster. The proposed algorithm can improve the quality of clustering, shorten the time of clustering, and improve the efficiency of recognition of malicious nodes .Through simulation results ,verify the improved algorithm effectively identify undistinguishable node.
    Academic paper
    GHSOM intrusion detection based on Dempster-Shafer theory
    Jie SU,Wei-wei DONG,Xuan XU,Shuai LIU,Li-peng XIE
    2015, 36(Z1):  60-64.  doi:10.11959/j.issn.1000-436x.2015282
    Asbtract ( 391 )   HTML ( 6)   PDF (506KB) ( 870 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    On the basis of incremental GHSOM,the GHSOM neural network intrusion detection based on the theory of evidence reasoning method was put forward.It can deal with the uncertainty caused by randomness and fuzziness,as well as can constantly narrowing assumptions set by accumulate the evidence,effectively control dynamic growth of network and keep a good accuracy in noise environment.Experiments show that GHSOM intrusion detection method based on the Dempster Shafer theory realized the dynamic control for the scale of expended subnet during the process of detection.It has the better detection accuracy in the noise environment and improves the adaptability and extensibility of incremental GHSOM neural network intrusion detection method when the scale of network is expanded.

    Papers
    Security authentication protocol for RFID based on PRESENT algorithm
    2015, 36(Z1):  65-74.  doi:10.11959/j.issn.1000-436x.2015283
    Asbtract ( 357 )   PDF (881KB) ( 526 )   Knowledge map   
    Related Articles | Metrics
    Although RFID technologies in the Internet of Things are widely applied. The security of the RFID system has very big challenges. The communication channel between the tag and the reader of the RFID system was most vulnerable, so the integrity and the confidentiality of data transmission could not be guaranteed. Therefore, A protocol to strengthen the security of RFID system communication need to be consider. Taking into account the RFID system hardware conditions and cost constraints, to establish a suitable RFID system security authentication protocol so as to solve the problems encountered in the information transmission. The PRESENT algorithm was a lightweight block cipher, so the PRESENT algorithm was combined with the security authentication protocol in RFID system, and form a new RFID security authentication protocol PRSA (Present based RFID security authentication). PRSA protocol can not only enhance the RFID system security, but also occupy very few hardware resources. Thus PRSA protocol can adapt to the security of communication in the low-cost RFID system.
    Academic paper
    Analysis on VANET routing protocols
    Zhen-hua WU,Peng HU
    2015, 36(Z1):  75-84.  doi:10.11959/j.issn.1000-436x.2015284
    Asbtract ( 464 )   HTML ( 13)   PDF (649KB) ( 1541 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Many present VANET routing algorithms were carefully analyzed and the result turned to classify into 4 classes:location based greedy routing algorithm,anchor node based routing algorithm,street row based routing algorithm and cluster based routing algorithm.Characters for each kind of algorithm were implemented and compared to each other by using the NS2.The experiment data and analysis result will provide a new subject for further research of VANET routing.

    Papers
    Research on second-order SQL injection techniques
    2015, 36(Z1):  85-93.  doi:10.11959/j.issn.1000-436x.2015285
    Asbtract ( 899 )   PDF (569KB) ( 6071 )   Knowledge map   
    Related Articles | Metrics
    With the environment of new Web technologies, three kinds of second-order SQL injection techniques were proposed: blind second-order SQL injection, second-order SQL injection attacks the operating system and client second-order SQL injection. Experiments show that second-order SQL injection vulnerabilities exist widely in Web applications, and the proposed new second-order injection techniques can effectively commit attacks both server and client.
    Academic paper
    Uncertain trajectory privacy-preserving method of moving object
    Shuang WANG,Fu-cai ZHOU,Li-na WU
    2015, 36(Z1):  94-102.  doi:10.11959/j.issn.1000-436x.2015286
    Asbtract ( 379 )   HTML ( 5)   PDF (1209KB) ( 1014 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the development of location based service(LBS) and location-aware devices,the amount of trajectories of moving objects collected by service providers was continuously increasing,meanwhile,it can cause great threaten for personal privacy.Most researches of trajectory privacy preserving were on deterministic data,however,trajectory’s uncertainty was inherent due to the inaccuracy of data acquisition equipment,delayed update,and so on.A new method was prosed to protect the privacy of trajectory data in publishing.It is the first time to present the idea that transforming the trajectory to an uncertain area to cluster.First,a probability statistics method to model the trajectory to an uncertain area was proposed.Second,the similar uncertain area into a cluster was put and sanitized in an equivalence class.Finally,the performance of the proposal was compared with (K δ)-anonymity model in real datasets.

    Fault diagnosis and restoration strategy based on Voronoi diagram and resolving set
    Xiao-ding WANG,Li XU,Shu-ming ZHOU,Hui LIN
    2015, 36(Z1):  103-109.  doi:10.11959/j.issn.1000-436x.2015287
    Asbtract ( 372 )   HTML ( 5)   PDF (1577KB) ( 597 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    As a communication backbone,high fault tolerance was a significant property in communication of WSNs.A novel fault diagnosis and restoration strategy based on Voronoi diagram and resolving set was designed.This strategy effectively reduced the communication cost during the fault diagnosis and recovery process through introducing a resolving set based coordinate system.Theoretical analysis and simulation results validate the performance of the proposed strategy.

    QoS modeling and evaluation of mobile application service based on scene
    Yan-zhi HU,Feng-bin ZHANG,Zhi-chun GAN,Tian TIAN,Cai-hua YIN
    2015, 36(Z1):  110-117.  doi:10.11959/j.issn.1000-436x.2015288
    Asbtract ( 414 )   HTML ( 5)   PDF (867KB) ( 713 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The current static QoS model can not reflect the QoS time varying and location correlation of mobile application service.An QoS model was presented based on scene for mobile applications service.The QoS index system of mobile application service was defined and the QoS value matrix was constructed.Further,three types of assessment problems were proposed,which were QoS overall assessment,QoS assessment of specific region or specific time periods,and QoS assessment of hot region and busy time.By using genetic algorithm and data clustering algorithm,the location and time of the two scene conditions were quantified,which combine the region division of service request location density and the time division of service request frequency.According to the limiting conditions,QoS value matrix was reconstructed,and the service evaluation method was introduced based on the statistical analysis of the matrix.Finally,the normalized evaluation process and application framework of QoS were given.

    Design and implementation of a model for OS kernel integrity protection
    Dong-hai TIAN,Jun-hua CHEN,Xiao-qi JIA,Chang-zhen HU
    2015, 36(Z1):  118-125.  doi:10.11959/j.issn.1000-436x.2015289
    Asbtract ( 525 )   HTML ( 11)   PDF (1067KB) ( 1683 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Untrusted kernel extensions were considered to be a big threat to OS kernel integrity because once they were loaded into the kernel space,then they may corrupt both the OS kernel data and code at will.To address this problem,MAC-based model named MOKIP for OS kernel integrity protection was presented.The basic idea of MOKIP was to set different integrity labels for different entities in the kernel space,and then ensure that the entities with low integrity label cannot harm the entities with high integrity label.A prototype system based on the hardware assisted virtualization technology was implemented.The experimental results show that proposed system is effective at defending against various malicious kernel extension attacks within a little performance overhead which is less than 13%.

    Clustering-based dynamic privacy preserving method for social networks
    Yong-hao GU,Jiu-chuan LIN,Da GUO
    2015, 36(Z1):  126-130.  doi:10.11959/j.issn.1000-436x.2015290
    Asbtract ( 524 )   HTML ( 11)   PDF (488KB) ( 1579 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the dynamic characteristics of the social network graph structure,an effective dynamic privacy preserving method was needed.To solve the problems of the existing dynamic privacy preservation methods,such as attacker’s too little background knowledge and the low adaptability to the dynamic characteristics of graph structure,a clustering-based dynamic privacy preservation method was provided.The analysis shows that the proposed method can resist many kinds of background knowledge attacks and has good adaptability to the dynamic characteristics of the social network graph structure.

    Mutual information power analysis attack in the frequency domain of the crypto chip
    Min WANG,Zhen WU,Jin-tao RAO,Zhi-bo DU
    2015, 36(Z1):  131-135.  doi:10.11959/j.issn.1000-436x.2015291
    Asbtract ( 442 )   HTML ( 11)   PDF (549KB) ( 1082 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the mutual information power analysis attack in time domain of the crypto chip,a method for analyzing the energy of the maximum mutual information coefficient in the frequency domain was proposed.This method combined the principle of password chip information leakage in frequency domain and the principle of mutual information power analysis.The concept of maximum mutual information coefficient was introduced,which avoided the operation of accurate alignment in time domain.Experiments on the algorithm of SMS4 show that the effectiveness of the maximum mutual information coefficient attack in the frequency domain is extended to the method of the side channel energy analysis.

    Security sharing and associated deleting scheme for multi-replica in cloud
    Jin-bo XIONG,Wei-wei SHEN,Yang-qun HUANG,Zhi-qiang YAO
    2015, 36(Z1):  136-140.  doi:10.11959/j.issn.1000-436x.2015292
    Asbtract ( 381 )   HTML ( 5)   PDF (514KB) ( 759 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to protect the privacy of data stored in public cloud environment,a security sharing and associated deleting scheme for multi-replica was proposed,which was based on symmetric encryption algorithm,attribute encryption algorithm and replica location technology.In this security scheme,the user’s data was first encrypted and encapsulated into the replication associated objects (RAO),then the RAO was shared in cloud service provider and managed by the replica correlation model.The comprehensive analyses show that the scheme is security and effective,and is able to support the data security sharing and associated deleting for multi-replica to protect the data privacy.

    Efficient segment pattern based method for malicious URL detection
    Hai-lun LIN,Yan LI,Wei-ping WANG,Yin-liang YUE,Zheng LIN
    2015, 36(Z1):  141-148.  doi:10.11959/j.issn.1000-436x.2015293
    Asbtract ( 545 )   HTML ( 15)   PDF (835KB) ( 1705 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient segment based method for detecting malicious URL was proposed.Firstly it analyzed the annotated malicious URLs in terms of three semantic segments,i.e.,domain segment,path segment and file segment.Secondly it quickly calculated the common pattern of each semantic segment exploiting the tri-gram model based inverted index.Finally it decided whether a given URL was malicious based on the segment patterns returned by searching the inverted index.Moreover,this method also supported the Jaccard based random domain name identification technique for deciding malicious URLs with random domain name.Experimental results show that proposed method outperforms the state-of-the-art baseline methods,and can achieve good efficiency and scalability on malicious URL detection.

    Research and implementation of intelligent terminal lightweight face recognition system
    Guo-jun MA,Hai-dong ZHOU
    2015, 36(Z1):  149-156.  doi:10.11959/j.issn.1000-436x.2015294
    Asbtract ( 379 )   HTML ( 18)   PDF (506KB) ( 1171 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve this problem that traditional face recognition scheme was not efficiently suitable to intelligent terminal scene.An improved lightweight scheme of feature weighted clustering matching based on SIFT was presented.The scheme can learn automatically and adaptively add test samples to the training sample space.Reasonable division and scientific distribution of weight make this scheme has improved at run time and recognition rate.The improved algorithm has been tested in the ORL face database and Yale face database,compared with the classical SIFT algorithm the recognition rate improved by 6.13% and 14.11%,the running efficiency increased 9.1% and 4.7%.At the same time,in accordance with the test method by Zhou,in the ORL face database,the recognition rate was up to 74.05%,significantly improved than PCA,LBP and other classical algorithm.The algorithm in Android terminal is implemented,and the improved algorithm is verified to be available in the Android system by experiments.Finally,an improved scheme was proposed based on the cloud architecture.

    Bayes decision theory based risk minimization authorization mapping
    Bin ZHAO,Jing-sha HE
    2015, 36(Z1):  157-161.  doi:10.11959/j.issn.1000-436x.2015295
    Asbtract ( 352 )   HTML ( 7)   PDF (750KB) ( 788 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Authorization decision was one of the key issues in the control access.In order to effectively enhance the security of authorization in trust based access control authorization,according to minimization risk Bayes decision theory,authorization was the object to the subject in access control as found that the problem of optimal decision.A method that minimizates risk based authorization mapping to realize correct authorization operation in the access control was proposed.Example analysis and simulation experiment show that the method is able to reduce risk accurately to interaction final authorization.

    RIM-MAC:a receiver initiated multi-session MAC protocol for underwater acoustic networks
    Chao LI,Yong-jun XU,Bo-yu DIAO,Feng WANG,Qi WANG
    2015, 36(Z1):  162-170.  doi:10.11959/j.issn.1000-436x.2015296
    Asbtract ( 402 )   HTML ( 9)   PDF (1175KB) ( 749 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Acoustic waves are major means of communication in underwater networks.Unfortunately,acoustic waves incur long propagation delays and limited bandwidth that must be taken into account in the MAC design to achieve a high throughput.A multi-session random access MAC protocol for underwater acoustic networks based on receiver reservation named RIM-MAC is proposed.It is a handshaking based protocol that addresses the channel’s long propagation delay characteristic by utilizing receiver-initiated reservations reducing the number of handshaking processes,as well as by passively-acquired local information (i.e.,neighboring nodes’ propagation delay maps and expected transmission schedules) to launch multiple simultaneous sessions.RIM-MAC increases the chances of concurrent transmissions in the underwater channel and achieve the channel reuse at both the sender and receiver side,improving the overall throughput at least 36% compared to the typical MAC protocols.Moreover,a traffic prediction based adaptive data polling scheme named fair traffic algorithm (FTA) guarantees fairness across multiple contending nodes.Extensive simulation results have confirmed that the RIM-MAC protocol outperforms existing MAC protocols and provides fair medium access in representative long propagation delay scenarios.

    Time synchronization method for wireless sensor networks based on mobile reference nodes
    Yu-qiang ZHANG,Jing-sha HE,Jing XU,Bin ZHAO,Fang-bo CAI
    2015, 36(Z1):  171-180.  doi:10.11959/j.issn.1000-436x.2015297
    Asbtract ( 404 )   HTML ( 10)   PDF (2572KB) ( 694 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most existing time synchronization methods in wireless sensor networks depend on the existence of one or more fixed reference nodes and on the propagation of synchronization messages in the networks.Thus,they often suffer from the disadvantages of high energy consumption and large cumulative error due to multiple layers of communication.To address such issues,a new time synchronization method based on a mobile reference node and the optimal mobile path is proposed.Firstly,the cellular coverage technique is analyzed to identify the optimal synchronization points.Then,the optimal mobile path with minimal length is designed.Finally,an efficient single hop time synchronize mechanism based on multiple timestamps in the MAC layer is presented.Comparison with other methods shows that the proposed method can achieve both higher synchronization accuracy and lower energy consumption.

    SC-CFDMA uplink symbol synchronization method based on multi-rate satellite-ground loop
    Dan DING,Nai-ping CHENG,Yu-rong LIAO
    2015, 36(Z1):  181-187.  doi:10.11959/j.issn.1000-436x.2015298
    Asbtract ( 465 )   HTML ( 8)   PDF (1362KB) ( 569 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    SC-CFDMA(single carrier code and frequency division multiple access) system,whose synchronization is more difficult than that of common orthogonal multi-carrier systems,requires the symbol synchronization to achieve a chip-level precision.Therefore,a synchronization method based on multi-rate satellite-ground loop is proposed.This method extends the closed-loop control on the non-sampling points of the loop through raising the control rates of some loop components,so as to promote the adaptability to users with different speeds.Besides,the state-space equations of the loop and related components are derived.The Matlab simulation results show that,even in GEO satellite system,the synchronization method proposed can adjust the SC-CFDMA uplink symbol timing errors between several supersonic users within chip-level duration,thus providing stable communication.

    SDFAC:software defined flow access control mechanism
    Xiu-lei WANG,Guo-min ZHANG,Chao HU,Ming CHEN,Xiang-lin WEI
    2015, 36(Z1):  188-196.  doi:10.11959/j.issn.1000-436x.2015299
    Asbtract ( 426 )   HTML ( 6)   PDF (1551KB) ( 743 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The software defined networking paradigm decouples control plane from data plane,offering flexible centralized control and fine grain flow management.Based on these advantages,a novel software defined access control mechanism SDFAC was proposed.Firstly,an analysis of the access control model was given from the flow granularity,and the precondition for the fine-grained access control was deduced from the model.Secondly,the framework and basic working process of the SDFAC was described.The flow authentication protocol was designed to support the function of SDFAC.Finally,the experiment results prove the feasibility and availability of SDFAC.

    Large-scale log compressing system based on differential compression
    Qiu TANG,Lei JIANG,Qiong DAI
    2015, 36(Z1):  197-202.  doi:10.11959/j.issn.1000-436x.2015300
    Asbtract ( 652 )   HTML ( 25)   PDF (1071KB) ( 1201 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The scale of log data produced by the large scale information system is growing rapidly.It leads to the big challenge of line-speed compressing and saving the large scale log data.By analysis on massive network log data,it is found that the log data has redundant pattern in terms of log structure and time local similarity in terms of log content.A differential log compression architecture based on template is proposed.Fine-grained differential compressive strategies in the architecture can be configured for a special log data.Experimental results show that,compared with gizp,the proposed log compressing architecture improves 2~10 times’ compressive speed and gain a better compressing ratio approaching to 10%.

    Friends mechanism-based routing intrusion detection model for mobile ad hoc network
    Yang XIAO,Lei BAI,Xian WANG
    2015, 36(Z1):  203-214.  doi:10.11959/j.issn.1000-436x.2015301
    Asbtract ( 352 )   HTML ( 11)   PDF (1765KB) ( 2092 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The proposed model mainly focused on how to effectively detect routing invasions from mobile ad hoc network as well as how to accurately respond to the malicious nodes,providing a trusted routing environment.A lightweight intrusion detection model was proposed to based on the friends mechanism,taking black hole attack for example,the OPNET software gives the simulation test,and results show that the schemes can effectively detect attacks,it is validated and compared with other conventional models.

    Approach to weak signal extraction and detection via sparse representation
    Ya-fei TANG,Yun-yong ZHANG,Zhi-bin GUO
    2015, 36(Z1):  215-223.  doi:10.11959/j.issn.1000-436x.2015302
    Asbtract ( 414 )   HTML ( 14)   PDF (1059KB) ( 1015 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The sparsity models and their popular evaluation algorithms were presented.A sparse representation based approach to weak signal extraction and detection was proposed.Furthermore,a fast algorithm was developed to reduce the computational complexity of the proposed method.In addition,both qualitative and quantitative evaluation methods were designed to analyze the proposed approach.A large number of experiments demonstrate the robustness and the adaptivity of the proposed approach.

    Overview
    Survey on vertical handoff in heterogeneous wireless networks
    Yu-wei WANG,Min LIU,Bing-yi FANG
    2015, 36(Z1):  224-234.  doi:10.11959/j.issn.1000-436x.2015303
    Asbtract ( 686 )   HTML ( 44)   PDF (1242KB) ( 1591 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Vertical handoff between different access technologies is the basic requirement for convergence of different access technologies.It is also the key technology to implement interconnection of heterogeneous networks and support seamless integration of different access networks.As a result,providing efficient solutions for vertical handoff has received tremendous attention from the academia and industry all over the world.With the trend of diversity of access technologies,unification of networks and synthesis of applications,cellular mobile communication,broadband wireless access and fixed access will be connected to a unified IP-based core network.The integration of existing and emerging heterogeneous wireless networks requires the design of intelligent vertical handoff techniques to enable mobile users to switch network access points and experience uninterrupted service continuity.During the vertical handoff procedure,handoff decision is a crucial issue for an efficient mobility.The definition and key concept of vertical handoff are given and its categories are introduced.Subsequently,the authors classify the vertical handoff decision algorithms into three main categories and overview their basic principles.Especially,the features of these three categories of algorithms are analyzed and compared.Finally,future works about vertical handoff are outlined.

    Academic communication
    New attack based on smartwatch motion sensors and the protection method research
    Chen-guang SONG,Jian-wei LIU,Qian-hong WU,Zhen-yu GUAN
    2015, 36(Z1):  235-242.  doi:10.11959/j.issn.1000-436x.2015304
    Asbtract ( 505 )   HTML ( 12)   PDF (1821KB) ( 1244 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Smart watch shipped with various embedded motion sensors,such as the accelerometer and gyroscope.Smart watch can follow the movement of hand to recognize the corresponding displacement,so that others can steal user’s external keyboard input through smart watches.The feasibility of intelligent device based on 6 axis accelerometer/gyroscope to infer the user’s keyboard input was researched,and the user’s keyboard input kinematic model for motion classification recognition was established.When users perform sensitive inputting,such as passwords inputting on digital keyboard,the passwords according to sensor information can be deduced.The results show that the approach can effectively recognize the PIN code on keyboard,which absolutely prove the seriousness of this safety problem.

    Privacy protection method on time-series data publication
    Dong YU,Hai-yan KANG
    2015, 36(Z1):  243-249.  doi:10.11959/j.issn.1000-436x.2015305
    Asbtract ( 623 )   HTML ( 23)   PDF (834KB) ( 1275 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A differential privacy model was proposed based on the sampling filtering and the mechanism of evaluation.Firstly,fixed sampling method was used to sample the original data and the non-sampling data be published directly.Secondly,for the sampling date,utilize the differential privacy mechanism to add the noise.Then,use Kalman to correct the sampling date.Finally,use the mutual information to evaluate data under different sampling intervals.Through the experiment,it is proved that the mechanism can achieve a good balance between the practicality and protective.

    Naval fleet across-domain communication scheme based on CP-ABE
    Wei GUO,Xue-guang ZHOU,Cheng-qin QU,Fang LUO,Xiang-jun JI
    2015, 36(Z1):  250-258.  doi:10.11959/j.issn.1000-436x.2015306
    Asbtract ( 414 )   HTML ( 8)   PDF (1082KB) ( 836 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Attribute-based encryption (ABE) provides a fine-grained access control mechanism and it can realize one-to-many secure communication.Proxy re-encryption can transform an encrypted data to another kind encrypted between different domains.Aiming at the demand of secure communication of across-domain naval fleet,a scheme that based on CP-ABE was proposed.At last,a security analysis of this scheme and an example of the scheme were proposed.This scheme combining the technology of ABE and proxy re-encryption realizes a secure communication of across-domain naval fleet and one-to-many secure communication among the naval fleet.At the meantime,it meets the needs of meet and access of vessel.

    Application of keyword searchable encryption in cloud
    Peng LIN,Jie JIANG,Tie-ming CHEN
    2015, 36(Z1):  259-265.  doi:10.11959/j.issn.1000-436x.2015307
    Asbtract ( 499 )   HTML ( 18)   PDF (1024KB) ( 1333 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Recently,some schemes combined keyword searchable encryption with attribute based encryption,solved access control problem in cloud environment,but they didn’t consider security problems like keyword guessing attack and security channels,so they couldn’t be applied to cloud.A keyword searchable attribute based encryption scheme with a designated tester was proposed,which could be against online/offline keyword guessing attacks and without security channel.Moreover,the user was able to encrypt data by setting a fine-gained access control policy.The efficiency of the scheme is analyzed it can be applied to cloud.

    Adjusted automata learning algorithm for security protocol adaptive model checking
    Jing YANG,Dan FAN,Yu-qing ZHANG
    2015, 36(Z1):  266-276.  doi:10.11959/j.issn.1000-436x.2015308
    Asbtract ( 376 )   HTML ( 6)   PDF (636KB) ( 989 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Modifications and improvements for adjusted automata learning algorithms,which were enabled by recent developments.Adjusted automata learning algorithm La* is correct and efficient.It will be helpful to improve adaptive model checking efficiency,reduce the cost,solve state space explosion problem and resist many kinds of attack methods for security protocols.

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: