Please wait a minute...

Current Issue

    25 January 2012, Volume 33 Issue 1
    Papers
    Self-healing algorithm based on feedback mechanism
    Ji-hong ZHAO,Hua QU,Wen-dong CHEN
    2012, 33(1):  1-9.  doi:1000-436X(2012)01-0001-09
    Asbtract ( 0 )   HTML ( 1)   PDF (228KB) ( 335 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A network self-healing algorithm was presented.The proposed algorithm reduced the probability of selecting the failure or congestion paths and achieved self-healing by selecting recovery path adaptively when the nodes failure or link congestion in the network,which was based on Q-learning feedback mechanism,multi-QoS constrained of the evaluation function and path selection strategy using Boltzmann-Gibbs distribution.Simulation results show that the proposed algorithm outperforms in the recovery rate,the diffserv-aware capability and network resource optimization.

    Novel and effective secret sharing scheme
    Run-hua SHI,Liu-sheng HUANG,Wei YANG,Hong ZHONG
    2012, 33(1):  10-16.  doi:1000-436X(2012)01-0010-07
    Asbtract ( 0 )   HTML ( 0)   PDF (130KB) ( 416 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel secret sharing scheme was proposed.This scheme consisted of two layer protocols:in the first layer,a larger secret was split into t smaller integers (sub-secrets) based on the Stern-Brocot tree; in the lower layer,t sub-secrets obtained from the first layer were regarded as t initial states in one-dimensional cellular automaton model,and then from the t initial states it could dynamic create all participants’ shares according to the simple fixed rule.This scheme could dynamic add new member,adjust the threshold value and renew the secret and the shares.Besides,there were still other advantages that the costs of the computation were very low and the size of the shares was very small.The results of analysis show that it was secure and very efficient.

    Performance analysis and evaluation of a hybrid erasure error correction scheme in wireless real-time multicast systems
    Guo-ping TAN,Li-zhong XU,Xi-jun YAN,Zai-jun HUA
    2012, 33(1):  17-23.  doi:1000-436X(2012)01-0017-07
    Asbtract ( 0 )   HTML ( 0)   PDF (118KB) ( 310 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to analyze and evaluate accurately the performance of erasure error correction (EEC) schemes in wireless real-time multicast (WRM) systems,A method which relying on the Gilbert-Elliot (GE) channel model and the practical experimental data was proposed.Namely,a closed-form expression for analyzing the performance of a hybrid EEC scheme over GE channel was contributed.Then,a validating and evaluating system w th real-time multicast services over WLAN was designed.Based on the system,the maximum likelihood estimation method was adopted for statistical evaluations.The results show that the GE model can match the practical erasure error channel accurately.Both the analysis results of the hybrid EEC scheme and the experimental lts are basically coincident,which validates the accuracy of the method.This method is of reference significance for analyzing and evaluating accurately all kinds of EEC schemes in WRM systems.

    New chaos-particle swarm optimization algorithm
    Xiao-bo XU,Kang-feng ZHENG,Dan LI,Bin WU,Yi-xian YANG
    2012, 33(1):  24-30.  doi:1000-436X(2012)01-0024-07
    Asbtract ( 0 )   HTML ( 1)   PDF (201KB) ( 2070 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The original particle swarm optimization (PSO)algorithm has the advantages of fast convergence,but with the shortcoming of premature and local convergence.To overcome this problem,a new chaos-particle swarm optimization algorithm was presented,which was different from the conventional method of replacing pre-particle.Instead,the algorithm in this paper made the motion of particles with characteristics of chaos,so as to make particles move between the state of chaos and stable,and gradually close to the optimal value.The nonlinear dynamics of the proposed Mathematical model are analyzed,and the results of the experiment show that the proposed algorithm can result in encouraging results.

    Range matching method based on TCAM:C-TCAM
    Guo-sheng ZHU,Shao-hua YU
    2012, 33(1):  31-37.  doi:1000-436X(2012)01-0031-07
    Asbtract ( 176 )   HTML ( 5)   PDF (188KB) ( 1032 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new TCAM range matching method called C-TCAM(compressed TCAM) was proposed.Firstly C-TCAM could compress two expanded TCAM entries into one and the expansion factor of w-1 and w-2 respectively in the worst case.Secondly,a new TCAM matching algorithm to lower down the power dissipation was designed by avoiding matching of unnessary TCAM entries.Analysis and simul ion showed that C-TCAM gets advantages over other schemes in TCAM space efficiency and power dissipation.

    Spatio-frequency domain opportunistic access in CR-MIMO system based on primary transmission mode information
    Zhao LI,Jian-dong LI,Li-yuan XIAO
    2012, 33(1):  38-44.  doi:1000-436X(2012)01-0038-07
    Asbtract ( 82 )   HTML ( 0)   PDF (165KB) ( 308 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An opportunistic spatio-frequency access (OSFA) strategy for CR-MIMO system was designed.When spectrum holes exist,cognitive service was implemented applying overlay approach.While there was no idle spectrum available,primary transmission mode information (PTMI) and inter-system interference channel information were exploited.And cognitive service was implemented using underlay approach.The method utilizes both spatial correlation and eigenmode transmission gain in spatial resource quality aluation.Consequently,selection diversity of both authorized channel and cognitive eigenmode was achieved.Moreover,PTMI based signal processing reduced the antenna requirement for cognitive system as well as the power loss of cognitive signal.Simulation results indicate that the proposed method could achieve significant improvement of cognitive service and near-optimal cognitive throughput on the premise that no interference is imposed on the primary.

    Cooperative multiple access broadcast transmission strategy and performance analysis in asymmetric two-way relay system
    Dan WU,Ya-fei TIAN,Chen-yang YANG
    2012, 33(1):  45-52.  doi:1000-436X(2012)01-0045-08
    Asbtract ( 73 )   HTML ( 0)   PDF (204KB) ( 494 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In a two-way relay system where two nodes exchange information via a half-duplex relay,the achievable data rates of both directions are limited by the weaker link.When the two-way channel is asymmetric due to relay positioning or channel fading,the sum rate of the two-way relay system will suffer from severe degradation.In order to compensate for the performance degradation caused by the weaker l k,a novel three-time-slot cooperative multiple access broadcast strategy was proposed where the source node with better channel quality cooperatively transmitted with the relay node and each node transmitted at the maximum rate of each link.As a result,the weighted sum rate of the two-way relay system can be thus improved.The upper bound of the capacity for the new strategy and an achievable rate region with decode-and-forward protocol were derived.Time slot allocation and power allocation at the relay were optimized to achieve the maximum weighted sum rate.Simulation results show that the proposed strategy outperforms existing strategies under asymmetric channel conditions both in AWGN and Rayleigh fading channels.

    MUMF:a mixed uni-and multicast fair scheduling scheme for CICQ switches
    Hong-chao HU,Yun-fei GUO,Shu-qiao CHEN,Peng YI
    2012, 33(1):  53-63.  doi:1000-436X(2012)01-0053-11
    Asbtract ( 61 )   HTML ( 0)   PDF (260KB) ( 389 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the CICQ (combined input and cross-point buffered) switches,how to support fair scheduli for uni-and multicast traffic was discussed thoroughly.Then,comed up with an ideal theoretical switching model for CICQ switches.Based on the theoretical model,a mixed uni-and multicast fair scheduling (MUMF) scheme was proposed.With MUMF,each input port and output port can schedule variable length packets independently.Simulation results based on SPES (switch performance evaluation system) show that MUMF can provide good delay,fair and throughput performance.

    Efficient broadcast transmission algorithms based on opportunistic network coding
    Ji LU,Cheng-ke WU,Song XIAO,Ran ZHANG
    2012, 33(1):  64-70.  doi:1000-436X(2012)01-0064-07
    Asbtract ( 73 )   HTML ( 0)   PDF (160KB) ( 456 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Opportunistic network coding (ONC) based broadcast transmission algorithms were proposed to improve the transmission efficiency for wireless single-hop networks.Based on the traditional wireless broadcast transmission model,ONC based solo combination packet broadcast transmission (ONCSB) algorithm and ONC based multiple combination packets broadcast transmission (ONCMB) algorithm were osed respectively.By employing the method of combination different lost packets with different strategies,the ONCSB and ONCMB can improve the throughput with recovering lost packets via a combination packet efficiently.The simulation results show that either ONCSB or ONCMB can lead to better transmission bandwidth performance compared with other algorithms under different wireless channel conditions.

    Fault analysis on elliptic curve cryptosystems with sliding window method
    Jin-zhong ZHANG,Ying-zhan KOU,Tao WANG,Shi-ze GUO,Xin-jie ZHAO
    2012, 33(1):  71-78.  doi:1000-436X(2012)01-0071-08
    Asbtract ( 68 )   HTML ( 0)   PDF (125KB) ( 404 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the principle of sign change fault attacks,an improved fault analysis method was presented against elliptic curve cryptosystems with sliding window method for point multiplication.When faults on double instruction it could effectively solve the “zero block failure” problem.Experiment results demonstrate that 15 times fault injections are enough to recover full 192bit key.When faults on add instruction,a new fault analysis method was proposed.Experiment results demonstrate one fault injection can reduce searching space 27~215.The method presented here can provide some ideas for fault attack on other cryptosystems using sliding window method.

    Shared carrier vertical network transformation algorithm in heterogeneous wireless networks
    Liang ZHAO,Liang JIN,Kai-zhi HUANG,Mei-yue YANG
    2012, 33(1):  79-88.  doi:1000-436X(2012)01-0079-10
    Asbtract ( 76 )   HTML ( 0)   PDF (295KB) ( 514 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to enhance the spectrum efficiency in heterogeneous wireless networks,the idea of dynamic spectrum allocation (DSA) used in cognitive radio was introduced into the heterogeneous wireless networks,the idea of vertical handoff for multi-mode mobile users was introduced into the base station side,thereafter,the shared carrier vertical network transformation (SCVNT) algorithm in heterogeneous wireless networks was proposed.The theoretical analysis and simulation results show that SCVNT algorithm can effectively enhance the total channel efficiency in heterogeneous wireless networks,improve fairness in resource allocation,and will be able to achieve smooth upgrade,which is of a relatively high application value.

    Multi-user channel estimation for uplink OFDMA systems based on the random-set theory
    Yuan JING,Bin NIU,Ying-ying TAI
    2012, 33(1):  89-95.  doi:1000-436X(2012)01-0089-07
    Asbtract ( 38 )   HTML ( 0)   PDF (190KB) ( 276 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the uplink OFDMA systems,a random-set theory based multi-user channel estimation algorithm was proposed.In the proposed algorithm,states of the users the multi-path channels were modeled and described by a finite random set.Then the Bayes filtering was utilized to formulate the problem of multi-user channel estimation.To obtain both the accepted channel estimation performance and low computational complexity,the Rao-Blackwellized particle filtering algorithm was applied to approximately solve this Bayes filtering problem with small number of particles.Simulation results show the effectiveness of the proposed algorithm.

    Symbol rate estimation of PSK signal based on PLL and wavelet transform
    Nan XIA,Tian-shuang QIU,Jing-chun LI
    2012, 33(1):  96-101.  doi:1000-436X(2012)01-0096-06
    Asbtract ( 58 )   HTML ( 2)   PDF (186KB) ( 429 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An improved algorithm for symbol rate estimation based on wavelet transform was proposed.The PLL based phase adaptive tracking approach was applied to synchronize the phase between the receiver and the itter and extract the signal envelope.The symbol rate was estimated from the wavelet transform magnitudes of the base-band signal.The improved algorithm effectively solved the problem on the result of estimation suffering from initial phases and noise occurred in the classical Chan’s algorithm.Simulation results verify that the novel algorithm is efficient and superior to the existing algorithms.

    Self-adaptive fair scheduling algorithm in wireless network
    Lu YANG,Qing-liang WU
    2012, 33(1):  102-106.  doi:1000-436X(2012)01-0102-05
    Asbtract ( 79 )   HTML ( 2)   PDF (116KB) ( 576 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The fair scheduling model in wireless/mobile environment was studied,The necessity of DiffServe and compensatory scheduling mechanism was chorused,a two-level wireless fair scheduling algorithm (TWFS) which differentiates service types and allocates network resources fairly was devised.As for the contemporary service intermittence due to link failure,service compensations was made at link leve and packet level.The packet level fair resource allocation ensured the graceful degradation of service quality.

    Dynamic hierarchy resource management for heterogeneous cognitive network
    Juan WEN,Min SHENG,Yan ZHANG
    2012, 33(1):  107-113.  doi:1000-436X(2012)01-0107-07
    Asbtract ( 61 )   HTML ( 0)   PDF (171KB) ( 236 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A dynamic hierarchy resource management approach-DHRM based on intelligent prediction was proposed for heterogeneous cognitive network.In DHRM,according to different time scale,the method of wavelet neural network,wiener prediction and reinforcement learning were brought to get the variation of traffic d ion,the resource requirement of the handover calls,and the information of users’preferences,and available hierarchical resources of all networks were allocated flexibly.Multi-attribute decision making method,based on network status and user preference was used to make decision to dynamically assign network traffic flow to the most appropriate network.Simulation results show that,the system capacity is improved about 20% by DHRM compared with the other joint radio resource management algorithms.

    Analysis of properties and counting of orbits for k-rotation symmetric Boolean functions
    Quan LI,Guang-pu GAO,Wen-fen LIU
    2012, 33(1):  114-119.  doi:1000-436X(2012)01-0114-06
    Asbtract ( 80 )   HTML ( 3)   PDF (129KB) ( 415 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The properties of k-rotation symmetric Boolean functions (k-RSBF) were analyzed.It was presented that the Walsh spectrum and auto-correlation value were invariant when the parameters of a k-rotation symmetric Boolean function were under k-circular translation of indices were presented.The analysis of the properties showed that many properties of k-RSBF could be described by their orbits,and the counting formulas of long cycles and short cycles on k-RSBF’ orbits were given.

    Security against differential and linear cryptanalysis for general SPT models
    Feng-mei LIU,Lian-jun CHEN,Chun-xiang LI,Yan-mei LI,Guo-shuang ZHANG
    2012, 33(1):  120-127.  doi:1000-436X(2012)01-0120-08
    Asbtract ( 72 )   HTML ( 0)   PDF (128KB) ( 306 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To use SP network in stream ciphers safely and efficiently,the ability against differential and linear cryptanalysis of SPT models was studied,where S and T denote different layers for substitution,in which compression could be achieved,and P denotes the layer for permutation.The upper bound of the maximum differentia lity was given when the branch number of P was optimal,and the upper bound of the maximum linear approximation probability and the maximum linear hull probability are given when the branch number of P was optimal and when S and T were balanced.As a consequence,the problem about evaluating the security against differential and linear cryptanalysis for general SPT models was resolved partially.

    Research on cognitive user pairing and cooperative sensing
    Zhi-hua BAO,Shi-bing ZHANG,Xiao-ge ZHANG,Gong-an QIU
    2012, 33(1):  128-135.  doi:1000-436X(2012)01-0128-08
    Asbtract ( 66 )   HTML ( 0)   PDF (204KB) ( 356 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aim at the shortages of the cooperative algorithm in sensing and time slot spent,an optimal cognitive users pairing and cooperative sensing algorithm was proposed.To achieve the best sensing performance,the pairing criterion was adopted where the one with the best receive SNR was used for the sense user and the one with the second-best receive SNR was used for the relay.According to optimizing cooperation threshold,non-cooperative or cooperative mode was selected,which made time slot spent much lower but sensing ability slight decreasing.Meanwhile,a lower bound of the detection probability and the time slot spent were derived in Rayleigh flat fading channels.Numerical results show the proposed algorithm has higher detection probability and lower time slot spent than the existing one.

    Automated intrusion response system model based on danger theory
    Ling-xi PENG,Dong-qing XIE,Ying-fang FU,Wei XIONG,Yu-li SHEN
    2012, 33(1):  136-144.  doi:1000-436X(2012)01-0136-09
    Asbtract ( 59 )   HTML ( 1)   PDF (273KB) ( 546 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel automated response system model based on the danger theory (AIRSDT) was given.With the descriptions of self,non-self,immunocyte,memory detector,mature detector and immature detector of the network transactions,network danger evaluation equations for host and network were built up.Then,the automated response actions were taken or adjusted according to the danger of each network attack,including holistic risk degrees of the host and network.Both the theory analysis and experimental results prove that AIRSDT not only helps to solve the problem that the current automated response models could not detect the ‘true’ intrusion or attack action,but also greatly reduces the response times and response cost.

    Fast application-level traffic classification using NetFlow records
    Liang CHEN,Jian GONG
    2012, 33(1):  145-152.  doi:1000-436X(2012)01-0145-08
    Asbtract ( 56 )   HTML ( 1)   PDF (127KB) ( 1028 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the performance and reduce the resources usage of application-level traffic classification,a novel fast application-level traffic classification(FATC) algorithm using IP flow record from NetFlow as input was presented.FATC adopted metric selection algorithm based on correlation coefficient to measure the correlation among flow metric variables,and deleted the irrelevant or redundant metrics,then used Bayes discrimination to classify network traffic to the application category that of smallest misjudge loss.The theoretical analysis and experimental results show that,with more than 95% accuracy,the FATC algorithm greatl reduces the time and space complexity of current application-level traffic classification algorithms during the training and classification processes,and can work efficiently on 10Gbit/s backbone network in real time.

    Research on high dynamic high altitude platforms network oriented routing protocol
    Wei-qiang WU,Shi ZHENG,Qin-yu ZHANG
    2012, 33(1):  153-159.  doi:1000-436X(2012)01-0153-07
    Asbtract ( 56 )   HTML ( 3)   PDF (169KB) ( 284 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A high dynamic high altitude platforms network oriented routing protocol was proposed.In this protocol,high dynamic users were looked up on demand,and then data forwarded by platforms according to the route table based on the shortest delay time.The protocol can keep the continuity of data transmission by the handoff strategy.The simulation results show that this routing protocol is adapted to the network in which users move with high speed and handoff frequently.It has character of high reliability,short delay,low route load and invulnerability.So it can be a feasible solution of data forward problem in high dynamic high altitude platforms network.

    Fast and low-complexity video down-sizing transcoder
    Zhuo-yi LV,Ke-bin JIA,Wan-chi WIU
    2012, 33(1):  160-166.  doi:1000-436X(2012)01-0160-07
    Asbtract ( 50 )   HTML ( 0)   PDF (125KB) ( 433 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient mode decision scheme for down-sizing video transcoding in H.264 using support vector machines (SVM)was proposed.In order to reduce the high computationa complexity of using conventional mode decision in the H.264 re-encoder,the proposed scheme used SVM to exploit the correlation between coding information extracted from the input high-resolution bit-stream and the coding modes of macro-blocks in down-sized video frames.The key techniques of training and predicting SVM including feature vector and kernel function were studied and then the SVM model was trained.After the hierarchical SVM classifier,improbable modes were eliminated and only a small number of candidate modes were carried out using the RDO operations.Hence,remarkable computing time could be saved,up to 67.31%,while maintaining nearly the same quality of the transcoded pictures.

    Robust reconstruction of Wyner-Ziv frame for no-feedback distributed video coding
    Hao QIN,Xue-lu PENG,Bin SONG,Hai-hua LIU
    2012, 33(1):  167-173.  doi:1000-436X(2012)01-0167-07
    Asbtract ( 30 )   HTML ( 0)   PDF (202KB) ( 273 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In no-feedback distributed video coding,a robust reconstruction algorithm for Wyner-Ziv frame was proposed.To avoid the video quality degradation caused by the bit plane decoding errors,DC coefficients and AC coefficients were reconstructed with different methods.In particular,for each failure decoded quantized DC coefficient,with the help of the correlation information from the encoder,the algorithm was able to adaptively adjust the contribution of the quantized side information and the decoded quantized DC coefficient to the reconstruction.Simulation results show that compared with the MMSE (minimum mean square error) algorithm,the proposed method can increase the average PSNR (peak signal-to-noise ratio) of reconstructed video greatly,and also yield significant improvement of the subjective video quality.

    Application of Kalman filtering based on sequential processing for satellite navigation
    Can-hui CHEN,Xiao-lin ZHANG,Hang-yu HUO
    2012, 33(1):  174-181.  doi:1000-436X(2012)01-0174-08
    Asbtract ( 54 )   HTML ( 3)   PDF (158KB) ( 1149 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to reduce the operational volume and ensure the real-time capability of navigation algorithm of Kalman filtering,a novel filtering method called single-satellite sequential extended Kalman filtering (S3EKF) was proposed based on extended Kalman filtering (EKF) and sequential processing,where the single-satellite was as basic filtering unit.Simulation results show that,compared with the traditional EKF method,the S3EKF method can decrease the computation load efficiently when the number of visible satellites is no less than 7,and the reduction of computation load increases with the increase of the satellite’s visible n r,the decrease will reach more than 50% when the number of visible satellites is no less than 15.On the other hand,the consistency and stability of navigation solution are good when the satellites and their number are time-vraiant in S3EKF method.

    Network traffic detection based on multi-resolution low rank model
    Guo-zhen CHENG,Dong-nian CHENG,Ding-jiu YU
    2012, 33(1):  182-190.  doi:1000-436X(2012)01-0182-09
    Asbtract ( 41 )   HTML ( 1)   PDF (221KB) ( 696 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Because network traffic was usually characterized by its higher-dimensional features,related detectors and classifiers for identifying traffic anomalies were suffering the increased complexity.Several key observations given by existing studies showed that network anomalies were distributed typically in a sparse way,and each of anomalies was essentially characterized by its lower-dimensional features.Based on this important finding,a novel model detecting traffic anomalies—multi-resolution low rank (MRLR) was developed.The proposed MRLR allowed us to dynamically filter the “proper”feature sets and then to classify anomalies accurately.The validation shows that MRLR can accurately reduce the dimensions of flow features to lower than 10%,on the other hand,the complexity of MRLR-classifiers is O(n).

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: