Please wait a minute...

Current Issue

    25 December 2011, Volume 32 Issue 12
    Papers
    No-feedback rate control algorithm for Wyner-Ziv video coding
    Bin SONG,Ming-ming YANG,Hao QIN,Hong HE
    2011, 32(12):  1-7.  doi:1000-436X(2011)12-0001-07
    Asbtract ( 0 )   HTML ( 0)   PDF (154KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To avoid using feedback channel,an encoder rate control algorithm for Wyner-Ziv video coding was proposed.Firstly,using the target frame-rate and the target bit-rate,It could determine the bit allocation for each group-of-picture (GOP).According to the correlation between adjacent frames,the bit budget for a GOP were further allocated to key frame and Wyner-Ziv frames within the GOP by dynamically choosing quantization parameter and quantization matrices.Then,with refinement of correlation-noise model(CNM) parameter,different LDPC (low-density parity-check) check matrices might be chosen for each bitplane to control the encoding bitrate of Wyner-Ziv frame.Experimental results show that the difference between expected target bitrate and actual encoded bitrate is less than 0.57% using the proposed method,and compared with existing algorithm,average PSNR (peak signal-to-noise ratio)of decoded video quality can be increased by 1 dB.In addition,our algorithm slightly increases encoder complexity,and can be used in practice.

    Research on secure DPC localization algorithm of WSN
    Jie ZHAN,Hong-li LIU,Da-wei LIU,Ming ZHAO
    2011, 32(12):  8-17.  doi:1000-436X(2011)12-0008-10
    Asbtract ( 1 )   HTML ( 0)   PDF (227KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In resource-constrained sensor networks,how to locate the sensor’s coordinates securely and effectively is one of the most challenging problems.A lot of algorithms of the security localization were analyzed,and a distributed RSSI-based DPC (distance and position consistent) security location algorithm was brought forth.The algorithm can detect and filter out the false nodes that are generated by malicious attacks applying the consistency of measure and computing; meanwhile all the nodes are involved in the activation without a central node.The performance of the algorithm is studied,and the experimental results show that DPC still has very high efficiency and good robustness in noisy conditions with a number of false nodes.

    CAR:a P2P content addressable and auto-retrievable algorithm for M ANET
    Hua-feng WU,Chao-jian SHI,Chuan-shan GAO
    2011, 32(12):  18-28.  doi:1000-436X(2011)12-0018-11
    Asbtract ( 0 )   HTML ( 0)   PDF (193KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To be directed at the unique features of mobile ad-hoc network (MANET)environment,a kind of mobile P2P (MP2P)index structure.Geographic-information-based hierarchical hash index structure(GH2I),was presented based on DHT (Distributed Hash Table).On the basis of GH2I,a MP2P resource search and retrieval algorithm CAR (content addressable and auto-retrievable) was further proposed,and a scalable efficient and mobility adaptive MP2P overlay network was finally constructed.

    Influence of stochastic delay contaminations on IP netw k coordinate system and contamination mitigation methods
    Min ZHANG,Liang ZHOU,Qiong HUANG,Xiao-long YANG,Ke-ping LONG
    2011, 32(12):  29-35.  doi:1000-436X(2011)12-0029-07
    Asbtract ( 0 )   HTML ( 0)   PDF (233KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There are various stochastic delay contaminations in the IP networks,which have a great impact on the performance of IP network coordinates system in terms of delay prediction accuracy and the coordinate stability.Here,from the perspective of keeping the statistical characteristic of delay without a loss and suppressing the abnormal delay jitter,two contamination mitigation methods were proposed respectively,i.e.,t-Filter and?-Filter.Through the PlanetLab datasets,compared with MP-Filter,the simulation results show that both t-Filter and ?-Filter can enhance the delay prediction accuracy,the system stability and the system convergence in the more effective methods.

    Research on resource reconfiguration model of substrate carrier network based on hardware virtualization
    Yu-xiang HU,Ju-long LAN,Jiang-xing WU
    2011, 32(12):  36-42.  doi:1000-436X(2011)12-0036-07
    Asbtract ( 0 )   HTML ( 0)   PDF (141KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the heterogeneous environment of tri-network convergence,a resource reconfiguration model of substrate carrier network based on hardware virtualization was proposed.In terms of resource assigning a gorithm which is the key issue in dynamic reconfiguration network,a resource assigning algorithm was proposed based on dynamic reconfiguration at last.Based on the idea of platform support and component processing,the model facilitates the reconfiguration network based on hardware virtualization by supporting dynamic reconfiguration which could provide more flexible and high-speed multi-service networks.

    Slot-predicting based ALOHA algorithm for RFID anti-collision
    Meng LI,Zhi-hong QIAN,Xu ZHANG,Yi-jun WANG
    2011, 32(12):  43-50.  doi:1000-436X(2011)12-0043-08
    Asbtract ( 0 )   HTML ( 0)   PDF (220KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The proposed algorithm modified the prior frame size by comparison with the preset decision threshold and identified the end conditions based on the value of accumulation factor C of EPC protocol.The slot-predicting binary selection scheme was used in each frame to accelerate idle slots and solve collisions with binary selection instantly,so that to reduce the invalid slots.Simulation results show that the proposed algor m can increase the system throughput and consumes less power and fewer time slots than previous work,and provide a solution for data collection of Internet of Things which takes RFID tags as perceptive terminal nodes.

    Measuring the complexity of military communication network based on supernetwork theory
    Fu-li SHI,Yi-fan ZHU
    2011, 32(12):  51-59.  doi:1000-436X(2011)12-0051-09
    Asbtract ( 0 )   HTML ( 0)   PDF (175KB) ( 10 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the structural and functional characteristics of military communication network (MCN),through constructing the military communication supernetwork ( description model,the concept of adjacent matrix of supernetwork,correlation matrix of classified nodes,type assortativity coefficient,and the definitions of supernetwork motif,core and the entropy of the motif were introduced.Then regarding motifs as basic construct modules of MCSN,the supernetwork motif entropy(SNME) was proposed as a complexity measure of MCN.Finally,by taking the complexity measuring steps of a naval vessels fleet communication supernetwork structure which was discussed in detail as an example,the computing results of SNME were compared with the present complexity measures,and it was demonstrated that SNME could measure the functional complexity of network when its structural complexity was determined.

    New time-frequency method of harmonic signal extraction in chaotic secure communication system
    Er-fu WANG,Dong-qing WANG,Qun DING
    2011, 32(12):  60-64.  doi:1000-436X(2011)12-0060-05
    Asbtract ( 0 )   HTML ( 0)   PDF (127KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    after the time-frequency character analyses of the chaos,the noise and the harmonic signal,a new two-step extraction method of time-frequency was put forward,aimed to complement each other’s advantages and mutual fusion for wavelet multi-scale decomposition and empirical mode decomposition.problem that the influence of the amplitude,frequency and noise energy on the extraction performance is also dissuced.Computer simulation verified that the method has high availability.

    Adaptive resource allocation in multiuser OFDM system based on fairness threshold
    Chun-fa ZHANG,Xiao-hui ZHAO
    2011, 32(12):  65-71.  doi:1000-436X(2011)12-0065-07
    Asbtract ( 0 )   HTML ( 0)   PDF (187KB) ( 9 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In traditional sub-carrier allocation process,user with the highest priority can choose best sub-carrier,which will result in low utilization of sub-carriers.Current improved algorithms can improve system capacity and reduce algorithm complexity by sacrificing certain fairness,but they may not achieve fairness requirement among users.In order to solve this problem,a new adaptive resource allocation algorithm based on fairness threshold was proposed,in which the priority of the sub-carrier allocation was determined by fairness threshold to achieve a rough between capacity and fairness.Then power allocation base on particle swarm optimization(PSO) was introduced to realize the required the fairness requirement threshold and improve system capacity.fairness.Experimental results show that the proposed adaptive resource allocation algorithm can satisfy

    Approach of service evaluation based on trust reasoning for cloud computing
    Chun-hua HU,Xin-xing LUO,Si-chun WANG,Yao LIU
    2011, 32(12):  72-81.  doi:1000-436X(2011)12-0072-10
    Asbtract ( 0 )   HTML ( 0)   PDF (152KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The credibility reasoning and deducing of SC and SP were proposed,which were mainly in the direct trust relationship established in interactive process among service entities,the public credibility of the feedback system as a supplement.The model used probability density function to represents the credibility of entities based on probability theory,which systematically proposed the reasoning and deducing methods of computing,reasoning and merging based on trust relationship in probability density.Then a new method of correcting QoS of SP entities was provided.Finally,the algorithm based on trust reasoning and correcting of QoS service was provided.This model can effectively evaluate the credibility of service participants,weakening the influence of unreliable entities in service evaluation and enhancing the qualities and accuracy of result in service selection through simulated experiment.

    Amplitude estimating algorithm for single channel mixing signals
    Guo-sheng RUI,Bin XU,Song ZHANG
    2011, 32(12):  81-87.  doi:1000-436X(2011)12-0082-06
    Asbtract ( 0 )   HTML ( 0)   PDF (119KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aimed at non-cooperative communication situations an amplitude estimating question for single channel MSK mixing signals with the same modulating parameters was studied.Based on the derivation of cyclic spectrum for MSK mixture,amplitudes of mixing signals were estimated by searching high-intensity spectral lines along cyclic frequency axis at zero frequency.The envelop of leakage spectrum introduced by fast cyclic spectrum calculation was applied to eliminate the illegibility of spectral line selection.The envelop values of leakage spectrum located at high-intensity spectral lines were used to correct the corresponding amplitudes of cyclic spectrum in order to improve estimating accuracy.Simulation results show its good performance for mixing signals without large power difference when the SNR is greater than-15dB.It is worthy for lower SNR applications without any prior information.

    Research on weak greedy routing over graph embedding for wireless sensor networks
    Zhi-gang LI,Wei-wei CHEN,Nong XIAO,Ge-ming XIA
    2011, 32(12):  88-95.  doi:1000-436X(2011)12-0088-08
    Asbtract ( 0 )   HTML ( 0)   PDF (153KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The greedy routing in sensor networks can be classified into two categories,strong greedy routing and weak greedy routing.The weak greedy routing protocol needs geographic location and strong greedy routing needs greedy embedding network.In order to solve these problems and minimize operation complexity and energy overhead,a light-weight tree-based network embedding graph (TNEG)was proposed and over the TNEG,a local monotone function was designed and two routing rules were proposed,then two weak greedy routing protocols,TGR and biTGR were designed.The simulation shows two protocols achieve good performance on path stretch factor and load balance factor.

    Technical Reports
    Information-theoretic secure verifiable secret sharing scheme on elliptic curve group
    You-liang TIAN,Jian-feng MA,Chang-gen PENG,Xi CHEN
    2011, 32(12):  96-102.  doi:1000-436X(2011)12-0096-07
    Asbtract ( 0 )   HTML ( 0)   PDF (100KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the bilinear pair on elliptic curves,a verifiable secret g (VSS)and distributed verifiable secret sharing were constructed.The information rate of the scheme is 2/3.Compared with Pederson’s scheme (Crypto91)and the related schemes,the scheme is more efficient under the same security level.At the same time,the security of the scheme was proved theoretically.The result reveals that the scheme is information-theoretic security.Finally,the VSS has been extensions to the case without a dealer (or without a trusted center).A distributive verifiable secret sharing based on bilinear pair was proposed.Analysis shows that these schemes are more secure and effective than others,and it can be more applicable in special situation.

    Enhanced-AAWP,a heterogeneous network oriented worm propagation model
    Bo LIU,Huai-min WANG,Feng-tao XIAO,Xin CHEN
    2011, 32(12):  103-113.  doi:1000-436X(2011)12-0103-11
    Asbtract ( 0 )   HTML ( 1)   PDF (238KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A logical worm propagation model contributes to the analysis of how exactly various worms spread in Internet.With the abstract of heterogeneous network environments,and considering the impact of infection time on worm propagation,a heterogeneous network oriented worm propagation model namely Enhanced-AAWP was derived using discrete time and deterministic approximation.Then,the worms which employed local preference scanning or random scanning were studied based on Enhanced-AAWP.As the simulation results show,the amount of NA ,the density of vulnerable hosts in NATs,and the probability of local preference scanning are influencing factors during the course of worm propagations in heterogeneous network environments.

    Multi-version consolidation method for block-level backup data
    Shu-peng WANG,Guang-jun WU,Zhi-gang WU,Xiao-chun YUN
    2011, 32(12):  114-121.  doi:1000-436X(2011)12-0114-08
    Asbtract ( 0 )   HTML ( 1)   PDF (141KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Historical version backup data query efficiency was dependent on the version chain length in a multi-version backup data storage system.A novel block-level backup data multi-version consolidation method was presented for this problem.Any version of a historical full system snapshot could be generated within the incremental backup data version sequence.Theoretical analysis showed that it could increase the target snapshot version query efficiency significantly in the version chain.A variable-length block version merging algorithm was presented to decrease the computing complexity in the process of snapshot version merging,according to the block-level backup data distribution features.Finally,the concrete applications and performance analysis for block-level version consolidation method was also introduced.The simulated experiments results expose that the version consolidation method can eliminate redundant version of backup data with the same version chain length,and it can increase full system recovery efficiency than traditional methods significantly.

    IEEE 802.11 WLAN analytical model for M2M small data service
    Ya-hui WANG,Xue-fen CHI
    2011, 32(12):  122-130.  doi:1000-436X(2011)12-0122-09
    Asbtract ( 0 )   HTML ( 0)   PDF (196KB) ( 11 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Machine to machine (M2M) communications had a huge potential market.Wireless local area network (WLAN) as the main complement for 3G networks would carry a lot of M2M services.Considering the characteristics of typical M2M small data service which was delay toleran and retry patient,a large time-scale backoff algorithm was proposed in the network model of IEEE 802.11 DCF.MAC layer service time probability distribution was derived,and IPP/G/1/K discrete-time queuing model was established in order to analyze the QoS performance of M2M under unsaturated traffic condition and imperfect channel in the WLAN.Simulation results indicate that the proposed algorithm effectively enhances system throughput and reduces system blocking rate.

    Research on CID based compression mechanism for WiMAX
    Qing-bo ZHANG,Jia-ming HE,Yan ZHU
    2011, 32(12):  131-135.  doi:1000-436X(2011)12-0131-05
    Asbtract ( 0 )   HTML ( 0)   PDF (110KB) ( 4 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The format of sub-MAC PDU’s header and sub-header was analyzed in WiMAX system.And a compression algorithm was proposed,which encoding CID using reserved bits of the sub-MAC PDU’s header and sub-header,thus redundant information was compressed efficiently after information classification.Algorithm flow was introduced in details,radio channel and CID mapping table were analyzed quantitatively.The simulation results show that the proposed compression mechanism achieves satisfactory compression effect.

    Networking algorithm based on self-organizing map neural network for VANET
    Yi WU,Qiong YANG,Qing-xiang WU,Lian-feng SHEN,Xiao LIN
    2011, 32(12):  136-145.  doi:1000-436X(2011)12-0136-10
    Asbtract ( 0 )   HTML ( 0)   PDF (245KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An approach was proposed to apply a self-organizing map neural network to organize vehicular ad hoc networks,which were used for car driving-aid systems and automatic driverless systems in intell gent transportation area.Based on the location and driving direction information of the periodic message of each vehicle,the vehicles were organized into vehicular ad hoc networks according to the s ilarity of destination and driving direction.The organized vehicles only communicate mainly with the vehicles in the same vehicular ad hoc network and deal with messages from the same network.Theoretic analysis and simulation results show that the system transmission delay of this proposed algorithm is lower than one of the previous method,and the system throughput is remarkably improved.

    User signal recovery based on channel matrix division
    Bin GUO,Xue-mei BAI,Mohammed F.
    2011, 32(12):  146-150.  doi:1000-436X(2011)12-0146-05
    Asbtract ( 0 )   HTML ( 0)   PDF (116KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multi-user MIMO-OFDM channel dispersion effects can be considered as a set of instantaneous mixtures from the viewpoint of frequency bin (FB).Upon the arrival of a new user,the new interferences will be introduced,resulting in an expanding channel matrix structure.The expanded matrix contains known and unknown information,a blind separation structure containing two parts which correspond the two types of information.To select a blind separation method,a proposed method uses the correlation between the signa ve a new structure of the mixing matrix.Then the signals from different users at each FB are separated using th known channel information,thus the uncertainty of blind separation is corrected.The validity of the proposed method is demonstrated by computer simulations.

    Correspondences
    Anomaly detection in backbone networks using Filter-ary-Sketch
    Li-ming ZHENG,Peng ZOU,Wei-hong HAN,Ai-ping LI,Yan JIA
    2011, 32(12):  151-160.  doi:1000-436X(2011)12-0151-10
    Asbtract ( 0 )   HTML ( 0)   PDF (205KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the special requirements of anomaly detection in backbone networks,an anomaly detection method was proposed based in the summary data structure:Filter-ary-Sketch.It recorded the network traffic information in Filter-are-Sketch online and detected anomalies based on multi-dimensional entropy at every circle.If an anomaly was detected,the anomaly point located according to data am recorded in Filter-ary-Sketch.Finally,malicious traffic blocked using the source IPs recorded in Bloom filter.The method was effective in detecting a variety of network attacks; especially it could block the malicious traffic.Evaluated by the experiment,the method can detect anomaly in the backbone network with small computing and memory resource and block the IP flows that are responsible for the anomaly.

    Fast intra prediction algorithm applied in QS enhancement layer
    Da-yong WANG,Jian SHU
    2011, 32(12):  161-170.  doi:1000-436X(2011)12-0161-10
    Asbtract ( 0 )   HTML ( 0)   PDF (201KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A fast intra coding algorithm was proposed which was suitable for enhancement layer in quality salability.Base on the coding structure of quality scalability,our algorithm used the relationships between layers,the relationships between rate distortion and modes,and temporal and spatial relationships to predict the modes and coding order to be applied,with an early termination determined by the relationships between quantization parameters and modes,residual coefficients,and rate distortion.The experimental resu ts show that the encoding speed of the proposed algorithm can be improved by 70%,with negligible coding loss.

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: