Please wait a minute...

Current Issue

    25 March 2011, Volume 32 Issue 3
    Papers
    Non-uniform distribution node scheduling scheme in wireless sensor networks
    Gao-juan FAN,Li-juan SUN,Ru-chuan WANG,Hai-ping HUANG,Fu XIAO,Jing LI
    2011, 32(3):  10-17.  doi:1000-436X(2011)03-0010-08
    Asbtract ( 0 )   HTML ( 0)   PDF (180KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the defect that high computational complexity of exact location information and distribution limitation of location information-free in traditional schemes,the node distribution was analyzed theoretically.A node scheduling scheme NDNS (non-uniform distribution node scheduling) was proposed which satisfies with different random distribution.The precision for node redundancy evaluating was improved by using the distance information between the sensor and its neighbors and applicable to any distribution deployment.The scheme was analyzed and validated for performance through experiments.The numerical experiments results illustrate that the longer network lifetime was achieved in preserving networks coverage.

    Computationally sound mechanized proof for a non-repudiation protocol
    Chao FENG,Yue-bing CHEN,Quan ZHANG,Chao-jing TANG
    2011, 32(3):  18-26.  doi:1000-436X(2011)03-0001-09
    Asbtract ( 0 )   HTML ( 0)   PDF (123KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cryptographically sound computer-aided approach for the Zhou-Gollmann protocol was proposed.Firstly,the protocol was formalized in the computational model,and a cryptography-based attack to the protocol was presented.Secondly,a deficiency in formalizing the fairness property in prior works was discovered.The Zhou-Gollmann protocol was proved to be secure when the encryption scheme satisfies both indistinguishability under chosen plaintext attack and integrity of plaintext,and the signature scheme is unforgeable under chosen message attack.The proof was conducted by combining manual proof with the mechanized prover CryptoVerif.Compared with current approaches,this approach is both sound and with high efficiency.

    Design of sequences with intra-group complementary properties for MC-CDMA systems
    Zhen-yu ZHANG,Fan-xin ZENG,Gui-xin XUAN,Hua WU,Yuan-hong ZHONG
    2011, 32(3):  27-32.  doi:1000-436X(2011)03-0027-06
    Asbtract ( 100 )   HTML ( 2)   PDF (147KB) ( 198 )   Knowledge map   
    References | Related Articles | Metrics

    For increasing the capacity of multi-carrier code division multiple access communication systems,a class of sequences with intra-group complementary properties was constructed.The constructed sequence set could be divided into multiple sequence groups.The correlation properties of sequences from the same sequence group were ideal while the correlation functions between sequences from different sequence groups possessed zero cross-correlation zones with different widths.As an expansion of traditional complementary sequence sets,each sequence group of the designed intra-group complementary sequence set becomes a complete complementary sequence set,which can satisfy the requirements to accommodate a large number of users and also can ensure the anti-interference properties of systems.

    Convolutional coding based iterative detection algorithm for DFT-S-GMC systems
    Yun RUI,Si-liang TANG,Ming-qi LI,Yin-hui LUO
    2011, 32(3):  33-39.  doi:1000-436X(2011)03-0033-07
    Asbtract ( 115 )   HTML ( 0)   PDF (168KB) ( 190 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new iterative detection method for discrete Fourier transform spread generalized multi-carrier (DFT-S-GMC) system was proposed.Based on the frequency-domain transceiver structure of DFT-S-GMC system,the linear minimum mean-square error (LMMSE) estimation was performed,which was characterized by the posterior mean and variance.Then,the log likelihood ratio (LLR) information is transferred between detector and decoder according to the probability density function(PDF) of the transmitted symbols.Simulation results show that based on the convolutional decoder,the performance of proposed iterative receiver is much better than the traditional,no-iterative receiver.Moreover,it outperforms the no-iterative receiver based on the Turbo decoder,while its complexity is greatly reduced.

    Analogous quasi-orthogonal designs linear dispersion codes under decode-and-forward cooperative relay networks
    Zheng-quan LI,Lian-feng SHEN,Yong-liang GUO
    2011, 32(3):  40-49.  doi:1000-436X(2011)03-0040-10
    Asbtract ( 64 )   HTML ( 1)   PDF (745KB) ( 86 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Analogous quasi-orthogonal designs linear dispersion codes under amplify-and-forward cooperative relay networks were proposed,the real part and the imaginary part of the code matrices could be separated into code matrices which satisfy quasi-orthogonal designs.Two kinds of decoding algorithms were used in the receiver,one was the total received signals decoded using fast ML algorithm,another was the un-relay received signal and the relay received signal decoding respectively.The computation complexities of the two conditions were analyzed.The channel capacity,the outage probability and the bit error rate of the two conditions were compared through simulation.Simulation results show that the channel capacity of the scheme 2 is bigger than that of the scheme 1,the outage probability and the bit error rate are lower,but the computation complexity is higher than that of the scheme 1.

    Dynamic secure trust management model for P2P e-commerce environments
    Zhi-yuan LI,Ru-chuan WANG
    2011, 32(3):  50-59.  doi:1000-436X(2011)03-0050-10
    Asbtract ( 116 )   HTML ( 2)   PDF (228KB) ( 166 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the trust evaluation problem in P2P e-commerce,a trust cloud-based dynamic secure trust management model (TCDSTM)was proposed.Cloud theory was used to describe the trust and the trust level in TCDSTM.Then an anti-attack global trust aggregation algorithm,the node type identification and topology reconstruction mechanisms were presented.Both theoretical analysis and simulation results show that TCDSTM not only can resist collusion attack,on-off attack and other malicious attacks,but also can improve the success rate of transactions.In addition,TCDSTM has low communication overhead.

    Value-oriented optimal algorithm for battlefield information processing and disseminating
    Guang-cheng QIN,Hao YIN,Qiang CHEN,Ze-min WU,Pan-long YANG
    2011, 32(3):  60-68.  doi:1000-436X(2011)03-0060-09
    Asbtract ( 80 )   HTML ( 2)   PDF (174KB) ( 146 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the information requirements to high quality decision-making and efficient operations,the value-oriented battlefield information processing and distribution fr ework based on the process of battlefield information chain was proposed,while characterized the user information needs by quality of information(QoI),and characterized the value of the information which distributed by the communication system for user to complete the task by the user information requirements satisfy degree index.The value of information(VoI) was assessed which obtained from the information processing according with information quality and user information requirements,and designing the value of greed scheduling algorithm for information dissemination,so that the network transmission of data is valuable information flow.Finally,the simulation experiments were made which based on the object tracking scenario in the military environment to verify the VoI-based distribution compared to the QoS-based distribution methods,the result shows that the resources utilization and user satisfaction for the VoI approach are advantage,especially in the case of the bandwidth resources is lacked.

    Cooperation image compression algorithm using divergence model for visual sensor networks
    Song-tao YE,Ya-ping LIN,Ye-qing YI
    2011, 32(3):  69-78.  doi:1000-436X(2011)03-0069-10
    Asbtract ( 57 )   HTML ( 0)   PDF (197KB) ( 70 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Utilizing the feature of cooperation in visual sensor networks,an image compression algorithm based on divergence model was proposed.Analysis and experimental results demonstrate that the compression scheme proposed can reduce the amount of image data effectively.And,due o the information represented by one byte is shared by several cluster nodes’bi-level pixels after compression,the degradation of received images is controlled.Comparing with the traditional image compression algorithms,the quality of received image measured by PSNR is higher,as the average packet loss rate increases.

    Compensation for channel non-reciprocity caused by I/Q imbalance in TDD-MIMO systems
    De-chun SUN,Fei-fei ZHANG,Zu-jun LIU,Ke-chu YI
    2011, 32(3):  79-85.  doi:1000-436X(2011)03-0079-07
    Asbtract ( 76 )   HTML ( 0)   PDF (210KB) ( 290 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The bad effect of channel non-reciprocity on system capacity was analyzed and a calibration algorithm was proposed for compensation.By link measurement,BS and MS get the channel state information (CSI) of uplink and downlink channels.Then the CSI was gathered by BS to figure out the calibration matrices to be used by BS and MS respectively.Simulation results show that the proposed algorithm can effectively compensate I/Q imbalance,regain the channel reciprocity,and hence eliminate the system capacity loss.

    The lower bound of the second order nonlinearity of Tr(x2n/2+2n/2-1+1)
    Xin-jiao CHEN,Xiang-yong ZENG,Lei HU
    2011, 32(3):  86-90.  doi:1000-436X(2011)03-0086-05
    Asbtract ( 45 )   HTML ( 0)   PDF (110KB) ( 89 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The Boolean functions used in symmetric ciphers should have high r-th order nonlinearity,which was one of the most important factors in system security.Making use of the relationsh between the nonlinearity of derivative and the second order nonlinearity of a Boolean function,the lower bound of the second order nonlinearity could be deter-mined.For a positive integer n≡2(mod 4),the lower bound of the second order nonlinearity of the Boolean function Tr(x2n 2+2n 2?1+1) was given.Compared with two classes of Boolean functions with the same number of variables,the functions discussed had a tighter lower bound on the second order nonlinearity.

    Moving objects detection method based on H.264 compressed video with complex background
    Ming-sheng CHEN,Guang-ming LIANG,Ji-xiang SUN,Dong-hua LIU,Jian ZHAO
    2011, 32(3):  91-97.  doi:1000-436X(2011)03-0091-07
    Asbtract ( 46 )   HTML ( 0)   PDF (145KB) ( 119 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the purpose of abstracting moving objects from H.2 VC bit stream directly,a moving objects detection algorithm on H.264 compressed video with complex background which based on MAP-MRF framework was proposed.Firstly,it retrieved the moving vectors (MV) and the inter-prediction modes of identical 4×4 pixels block in P frames and establishes Gaussian mixture model (GMM) of the phase of MVs as a background,and then created Markov random field (MRF) model based on MV,inter-prediction mode,the GMM of background and spatial and temporal consistency.The moving objects would be retrieved by solving the MRF model.The experimental results show that it can perform robustly in complex environment and the precision and recall has improved 20% and 3.5% by contrast with the traditional algorithm.

    Technical Reports
    Masquerade detection based on shell commands and Markov chain models
    Xi XIAO,Xin-guang TIAN,Qi-bin ZHAI,Run-guo YE
    2011, 32(3):  98-105.  doi:1000-436X(2011)03-0098-08
    Asbtract ( 83 )   HTML ( 3)   PDF (153KB) ( 251 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method for masquerade attack detection based on shell commands was proposed.At the training stage,the variability of users’ behavior and the feature of masquerade attack were thoroughly considered,and stationary homogeneous Markov chains were employed to profile the normal users’behavior.The shell commands were gradationally merged into multiple sets according to their frequencies and then states were constructed accordingly,which significantly reduced the number of states and the memory of the transition probability matrix and improved the generalization of the detection system,compared with existing Markov chain methods.Considering the real-time detection demand and the short-time relevance of shell commands,the states were matched with a high-frequency-first scheme at the detection stage,and the decision measure was computed by smoothing the probabilities of short state sequences.This decreased computational complexity and the false-alarm rate.Experimental results indicate that our method can achieve high detection accuracy and practicability,and is especially applicable for on-line detection.

    Foreground object detection based on time information window adaptive kernel density estimation
    En-ce ZHOU,Chun-ping LIU,Ling-yan ZHANG,Sheng-rong GONG,Quan LIU
    2011, 32(3):  106-115.  doi:1000-436X(2011)03-0106-09
    Asbtract ( 85 )   HTML ( 3)   PDF (301KB) ( 366 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There exist some problems,such as imprecise foreground object detection and lower real-time in remote video monitoring.Based modified non-parametric kernel density estimation,a new algorithm g time information window-kernel density estimation (TIW-KDE) was proposed for adaptive background updating.The algorithm,which took full advantage of the information on the foreground frames along the time line,divided the background into dynamic background region and non-dynamic background region.For the dynamic background ion,the algorithm used non-parametric kernel density estimation algorithm to update it,otherwise,the percent of background and current frame was used to progressively update the non-dynamic background region.This effectively settled the problems of background dirt and decreases the complexity of computation in the background updating phase of the non-parametric kernel density estimation.The experimental results show that the algorithm improved the accuracy of the foreground object detection.Moreover,the algorithm also greatly improved the speed of the detection processing.

    Research on establishing network intrusion modeling based on MLL-AT
    Fen YAN,Xin-chun YIN,Hao HUANG
    2011, 32(3):  115-124.  doi:1000-436X(2011)03-0115-10
    Asbtract ( 102 )   HTML ( 3)   PDF (188KB) ( 114 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The method of modeling attack using attack tree was researched.The main research goal was how to effectively use the attack tree model and denote the multi-stage network attacks.Traditional attack tree was expanded and improved.Nodes of attack tree were redefined,and attack risk of leaf node was quantified.Then the mentality and method for establishing MLL-AT (multi-level& layer attack tree)were proposed.Based on the given attack tree,the MLL-ATDL(multi-level& layer attack tree description language) attack description language was given.The improved attack tree can model the attacks more accurately,in particular the multi-stage network attacks.And it can also be used for appraising system risk,distinguishing the different degrees of system security threats caused by different attack sequences.

    Lattice-based oblivious transfer protocol
    Feng-he WANG,Yu-pu HU,Zhen-hua LIU
    2011, 32(3):  125-130.  doi:1000-436X(2011)03-0125-06
    Asbtract ( 105 )   HTML ( 4)   PDF (234KB) ( 363 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Utilizing a trapdoor one-way function based on learning with errors (LWE),a three moves oblivious transfer OT) protocol was proposed.Both the privacy of the receiver’s choice and the secrecy of the unchosen secret were based n the hardness of the LWE problem.Since merely modular multiplication and modular addition operations were used,he proposed OT protocol was efficient.Moreover,the plaintext-to-ciphertext expansion factor was amortized,which sigificantly shortened the message length,and made the protocol achieved optimal efficiency.

    Concise Papers
    Overlap area assisted guaranteed handover scheme for HAP communications systems
    Shu-feng LI,Ji-bo WEI,Dong-tang MA,Li-jie WANG
    2011, 32(3):  131-137.  doi:1000-436X(2011)03-0131-07
    Asbtract ( 59 )   HTML ( 2)   PDF (248KB) ( 349 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To guarantee the service continuity provided by HAP communications systems,overlap area assisted guaranteed handover scheme (GHS-OA) was proposed.In the connection admission control process of this scheme,overlap areas between cells in addition to the position informat HAP and the users were utilized to decide and block the new call which might introduce a handover failure.The analytical model was established for time based channel reservation algorithm (TCRA) and GHS-OA.The numerical solutions for two kinds of service were derived to ana e the new call blocking performance of these two schemes.Simulation results verify the analytical model.Research results show that the GHS-OA can improve the new call blocking probability significantly while maintaining a zero handoff call dropping probability seen with the TCRA,and that the bigger the overlap ratio and the more number of channel resources are considered in the overlap area of a virtual cell,the the new call blocking performance that the GHS-OA can achieve.

    Formalism ordering method based on term rewriting and plication
    Chen CHEN,Wei-hong CHEN,Zhen-tian YAN,Yue-fei ZHU
    2011, 32(3):  138-142.  doi:1000-436X(2011)03-0138-05
    Asbtract ( 59 )   HTML ( 0)   PDF (77KB) ( 125 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The vector order which based on term rewriting was constructed,it was closed under substitution and composition,and had advantage in realization,the number of transferring rules and automatization compared the other ordering methods.An application in information security was given,i.e.an arithmetic which resolved the problem of XOR equivalent unification,it analysed all conditions and returns the solution.

    Correspondences
    Generic construction of deniable group key establishment from group key establishment
    Ya-zhe ZHANG,Hai-xia XU,Bao LI
    2011, 32(3):  143-149.  doi:1000-436X(2011)03-0143-07
    Asbtract ( 48 )   HTML ( 0)   PDF (126KB) ( 66 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A generic way to construct a deniable group key establishment protocol from an unauthenticated group key establishment protocol was proposed.The construction could be seen as a compiler.By using Schnorr’s zero-knowledge identification scheme,this compiler could transform an unauthenticated group key establishment to a deniable group key establishment protocol with only additional two round communications and one round verification.It is very efficient and practical.The security and deniability proof is in the Random Oracle model.A concrete transforming example of the construction was also presented.

    Hierarchical stateless single-packet IP traceback technique
    Qiong HUANG,Wen-zhu XIONG,Xiao-long YANG,Jie XU,Ke-ping LONG
    2011, 32(3):  150-157.  doi:1000-436X(2011)03-0150-08
    Asbtract ( 81 )   HTML ( 2)   PDF (173KB) ( 54 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel hierarchical stateless single-packet IP traceback (for short HSSIT) technique was proposed.It not only implements the attack-path reconstruction of two level granularities (i.e.,inter-domain and intra-domain),but also need not store any data in the core node.HSSIT redefines the optional field of IP packet head to store the digest information (including IP address and AS number) of path traveled by each IP packet in GBF data structure.As soon as the path reconstruction required,the victim can find the attack-rooted AS using GBFAS.And then the border router within the attack-rooted AS can easily search out the nearest router to attack source using GBFIP.Compared with PPM,SPIE and ASEMby theory analysis and simulations,the results show that HSSIT outperforms in terms of robustness against tampering and counterfeiting node digest information,and the convergence.Finally,the attack-path reconstruction experiments for the general case(i.e.,AS path length about 3~7)show that HSSIT’s inter-domain coincidence degrees and intra-domain ones between original attack-path and reconstructed attack-path are within the ranges 100%~98% and 98%~90%,respectively.The experiments results demonstrate that HSSIT is able to accurately reconstruct attack-path to realize the traceback of attack source.

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: