Please wait a minute...

Current Issue

    25 July 2010, Volume 31 Issue 7
    academic paper
    Utility-based resource allocation and scheduling for CR-MIMO-OFDMA/TDM system
    Hao HU,Jun-de SONG,Song CI,Hui TANG
    2010, 31(7):  1-8.  doi:1000-436X(2010)07-0001-08
    Asbtract ( 0 )   HTML ( 0)   PDF (349KB) ( 9 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel dynamic resource allocation and scheduling scheme based on user sum-utility maximization in multiuser MIMO-OFDMA cognitive radio system was proposed. After being transformed into a convex optimization problem via re-laxation method, the NP-hard combinatorial optimization problem could be solved by a Lagrangian primal-dual approach. The optimal solution of the primal problem could be obtained through a sub-gradient iterative algorithm. Simulation results indicate that the propositional algorithm converges to optimal power/rate allocation for primary users and cognitive radio us-ers with maximal sum-utility and achieves optimal user scheduling with low complexity and fast convergence speed.

    Academic paper
    Over determined blind source separation based on maximum ratio combining
    Jun-liang YAO,Xiao-niu YANG,Jian-dong LI,Wei-hong FU,Zhao LI,Yan ZHANG
    2010, 31(7):  9-17.  doi:1000-436X(2010)07-0009-09
    Asbtract ( 0 )   HTML ( 0)   PDF (377KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The blind source separation (BSS) was dealed with in the overdetermined case, i.e. the number of receive an-tennas was larger than that of sources. Firstly, a method which converted the overdetermined BS into complete BSS was given. Secondly, based on the relation between the optimal solution of generalized Rayleigh quotient and the convergence solution of fourth-order cumulant cost function, a maximum ratio combining (MRC) aided BSS algorithm (MRC-FastICA) was proposed. With this method, FastICA was used to obtain multiple estimated ls corresponding to a same source, and then these estimated signals were combined by our MRC method. Simulation results show that, compared with tradi-tional algorithms, the proposed algorithm can obtain diversity gain, and achieve better SINR performance.

    academic paper
    Unsupervised anomaly detection method based on improved CURE clustering algorithm
    Ya-jian ZHOU,CHEN XU,Ji-guo LI
    2010, 31(7):  18-23.  doi:1000-436X(2010)07-0018-06
    Asbtract ( 0 )   HTML ( 0)   PDF (238KB) ( 139 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel unsupervised anomaly detection method based on improved CURE clustering algorithm was presented. By improving this algorithm, the better clusters could be obtained and the performance of the algorithm wasn't changed. These clusters offered the more purely normal data to build normal model. A novel hyper-rectangle-based modeling algorithm was used and it helped to detect intrusions quickly and accurately. Using KDD CUP99 data sets, the expe-riment result shows that this method can detect known trusions and unknown intrusions efficiently in the network connections.

    Quantitative evaluation of topology intrusion tolerance in wireless sensor networks based on semi-Markov process
    Shu-ming XIONG,Liang-min WANG,Yong-zhao ZHAN
    2010, 31(7):  24-32.  doi:1000-436X(2010)07-0024-09
    Asbtract ( 110 )   HTML ( 0)   PDF (325KB) ( 158 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on semi-Markov process (SMP) a quantitative evaluation model was proposed to estimate ability of the topology intrusion-tolerance. For some limitations of node computation ability and storage ability the model was set up on the uniform intruding results to simplify the desig ing the DTMC embedded in SMP to solve attributes describing intrusion-tolerance, thus such attributes of the topology as availability, stability and servicing rate could be obtained. A Bayes network reasoning model was proposed to enhance accuracy of evaluation of intrusion tolerance ability. Sensitivity of parameters in the model was analyzed. It confirms validity of the quantitative evaluating model of topology intrusion tolerance through examples analysis and comparison.

    Wireless cellular network modeling and service matching based on network calculus
    Rui NI,Wu-yang ZHOU,Guo WEI
    2010, 31(7):  33-39.  doi:1000-436X(2010)07-0033-07
    Asbtract ( 76 )   HTML ( 0)   PDF (240KB) ( 385 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The wireless cellular network was modeled to a network calculus system. Based on the wireless cellula net-work model, a new methodology was proposed to analysis the matching problem between services and network, espe-cially considering a variety of service with different effective bandwidth and delay guarantee under wireless cellular net-work.The above network model and methodology could provide a design reference for the future new telecom services.

    Fast multiple reference frame selection algorithm for H.264 based on spatial correlation
    Jing XU,Bing ZHOU,Xue-li HUANG,Wei LI,Lei CAO
    2010, 31(7):  40-45.  doi:1000-436X(2010)07-0040-06
    Asbtract ( 84 )   HTML ( 0)   PDF (207KB) ( 220 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A fast multiple reference frame selection algorithm was proposed for a H.264 encoder to compute the optimal reference frame number. According to the spatial correlation in natural videos, the current macro block's Skip mode was determined before performing the motion estimation in erms of the information from its adjacent macro block coding mode. A fast inter frame selection model algorithm was presented to improve the efficiency of motion estimation. Based on the probability characteristics of the Skip mode in the sequence, the optimal reference frame number was obtained for fast motion estimation. Experiments show that the prop d algorithm can reduce the average encoding time up to 72.5% with the average PSNR degradation no more than 0.07dB.

    Algorithm for the k -means clustering based on minimum cluster size
    Shou-qiang WANG,Da-ming ZHU
    2010, 31(7):  46-52.  doi:1000-436X(2010)07-0046-07
    Asbtract ( 77 )   HTML ( 1)   PDF (285KB) ( 402 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the k -means clustering subproblem that the size of each cluster must meet at least some given value, three randomized approximate algorithms were presented. The first algorithm was an expected 2-approximation randomized algorithm. Before given the algorithm, a subset that includes at least one point of each optimal cluster was first drawn at random. The second randomized algorithm was the (1+ ) approximation algorithm. The probability of getting he suc-e cessful result was proved to be at least 3/2k+2. At last, by means of sampling technique, a local search randomized algo-rithm was also proposed.

    Parameter tuning for stability of FAST TCP?
    Wei LIANG,Shun-yi ZHANG,Xiang-yan NING,Su-lei XU
    2010, 31(7):  53-59.  doi:1000-436X(2010)07-0053-07
    Asbtract ( 80 )   HTML ( 0)   PDF (299KB) ( 183 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The limits of parameter in FAST TCP were studied. Fistly, a continuous time fluid flow model of the link? buffer was considered to create a linear control system related to FAST TCP. Linearing the fluid flow model and window control model, with Laplace transforming, a negative feedback system with open loop transfer function was presented. Secondly, the second-order stabilty of the system was analyzed according to the Routh-Hurwitz criteria. Next, a single FAST flow, two FAST flows and many FAST flows sharing a bottleneck link was quantitativly analyzed. Then a sufficient condition on asymptotical stability of FAST TCP congestion window related to the parameter?was obtained. Finally, packet level ns2 simulations are used to verify the theoretical claims.

    Distributed beamforming in MIMO relay systems with limited feedback
    Chun-guo LI,Chong-xian ZHONG,Lv-xi YANG
    2010, 31(7):  60-67.  doi:1000-436X(2010)07-0060-08
    Asbtract ( 69 )   HTML ( 0)   PDF (298KB) ( 45 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The joint distributed beamforming was investigated for the multiple-input multiple-output (MIMO) systems assisted by cooperative relays with limited feedback. , a mathematical model was established for the joint beam-forming based on the derived lower bound of the received SNR. Secondly, an optimal distributed beamformer was de-rived for multiple cooperative relays. Finally, a code ok of this beamforming scheme was obtained for the limited feed-back via the designed algorithm. Simulation results show that the distributed beamforming scheme acquires considerable gain with a few feedback bits.

    User authentication and monitoring based on mouse behavioral features
    Chao SHEN,Zhong-min CAI,Xiao-hong GUAN,Chao FANG,You-tian DU
    2010, 31(7):  68-75.  doi:1000-436X(2010)07-0068-08
    Asbtract ( 160 )   HTML ( 21)   PDF (274KB) ( 1097 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With an empirical study of mouse behavioral features using qualitative and quantitative analysis from the phy-siological layer and the interactive layer, an identif tion method based on sequential forward greedy selection and SVM was proposed. Specifically, an identity verification experiment, in which 20 participants were involved, showed that the performance of proposed method was encouraging with fa acceptance rate (FAR) of 1.67% and false rejection rate (FRR) of 3.68% for user classification. Experimental results show that the proposed method have better performance than conventional classification and recognition methods (BP, RBF, SOM), and also provide a strong evidence for the effec-tiveness and feasibility of user authentication and monitoring based on mouse activities.

    Design and analysis of the tweakable blockciphers based on the MISTY structure
    Feng-tong WEN
    2010, 31(7):  76-80.  doi:1000-436X(2010)07-0076-05
    Asbtract ( 110 )   HTML ( 8)   PDF (230KB) ( 583 )   Knowledge map   
    References | Related Articles | Metrics

    Abstract:A problem that how to construct tweakable blockciphers without using reexisting blockcipher was re-searched by using MISTY-Type transformation. The feasibility to design tweakable blockciphers by XORing a tweak value into one place in the dataflow of the 4 round and 5 round MISTY-Type transformations was analyzed. The concrete cryptanalysis for the secure 5 round tweakable MISTY-Type blockciphers and the attack methods for 4 round structure were given. The result shows that a CPA-secure tweakable blockcipher need 5 round MISTY-Type structure.

    Iterative channel estimation and Turbo equalization for FMT systems
    Hua ZHONG,Lin-hua ZHENG
    2010, 31(7):  81-87.  doi:1000-436X(2010)07-0081-07
    Asbtract ( 128 )   HTML ( 2)   PDF (279KB) ( 67 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To eliminate the intersymbol interference(ISI) caused by the “imperfect reconstruction” prototype filers and the wireless channel in filtered multitone modulation(FMT) systems, an iterative channel estimation and equalization al-gorithm was proposed. The equivalent response of each subchannel could be iteratively estimated, and then the ISI could be eliminated by the Turbo sub-channel iterative equalizer adopting linear filers. Simulation results indicate that the pro-posed algorithms can yield remarkable improvements in ER performance comparing with the DFE equalizer for both QPSK and 16QAM modulation after no less than two iterations.

    Greedy based sensor set selecting algorithm under correlated log-normal shadowing
    Xiao ZHANG,Jin-long WANG,Qi-hui WU
    2010, 31(7):  88-95.  doi:1000-436X(2010)07-0088-08
    Asbtract ( 43 )   HTML ( 0)   PDF (297KB) ( 67 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By analyzing the upper bound on the probability of false alarm for a sensor set, an adaptive sensor set selecting algorithm based on greedy with a lower complexity was posed, which could get a good trade-off between sensing re-liability and system resources usage efficiency. Analysis and simulation results both demonstrate that the proposed sensor set selecting algorithm can get the suboptimal sensor set y with lower complexity, and the difference between the selected suboptimal sensor set and the optimal one is minor.

    Technical Reports
    Limited-rate feedback resource allocation algorithm based on MIMO-OFDM for cognitive radio systems
    Lei XU,Da-zhuan XU,Xiao-fei ZHANG
    2010, 31(7):  96-103.  doi:1000-436X(2010)07-0096-08
    Asbtract ( 45 )   HTML ( 0)   PDF (329KB) ( 42 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Limited-rate feedback resource allocation algorithm was proposed for cognitive radio systems based on mul-tiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) technology considering the trel-lis coded modulation. Firstly, the algorithm defined the effective set of transmission mode per user. Secondly, it allocated the resource allocation with the goal of maximizing the collaborative awareness group throughput according to the func-tion of link quality indicator. Thirdly, it reallocated the subcarriers and power among the cognitive users with the goal of guaranteeing the cognitive users to access the spectrum fairly. Finally, it updated the Lagrange multipliers utilizing sto-chastic approximation tools and obtained the asymptotic convergence solution of resource allocation by means of on-line recursion. Simulations corroborate that the algorithm only improves the throughput of collaborative awareness group effectively but also ensures the cognitive users to access the spectrum fairly, while requiring low feedback overhead.

    Relationship among three kinds of cryptographic Boolean functions with special Walsh spectrum
    Bin HU,Chen-hui JIN,Zeng-yu SHAO
    2010, 31(7):  104-109.  doi:1000-436X(2010)07-0104-06
    Asbtract ( 52 )   HTML ( 0)   PDF (210KB) ( 117 )   Knowledge map   
    References | Related Articles | Metrics

    The relationship among Bent functions, partially Bent functions and Plateaued functions was discussed, point out that any Bent functions could be divided into two ued functions, and Plateaued function satisfying certain con-ditions could also be divided into two Bent functions.Propose the special relation between Plateaued of n -1 order with non-zero linear structure and Bent functions, and show that partially Bent functions satisfying certain conditions Could be divided into two Plateaued functions. These results show the close connection among the three cryptographic Boolean functions with special Walsh spectrum, which propose the important basis for designing cipher using these functions.

    Signal-subspace-based esprit-like algorithm for coherent DOA estimation
    Hong-shun ZHANG,Yun-lin XU,Jiang-shu ZHAN
    2010, 31(7):  110-116.  doi:1000-436X(2010)07-0110-06
    Asbtract ( 66 )   HTML ( 2)   PDF (231KB) ( 196 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To consider the problem of DOA estimation in coherent environment, the most important issue is to try to eliminate the rank loss of the spatial covariance matr x. The influence of coherent signals on the subspace-based ul-tra-resolution DOA estimation algorithm was analyzed. Then a signal-subspace based ESPRIT-Like algorithm was pro-posed from the thought of matrix reconstruction. The simu ion results demonstrate the validity and superiority of the proposed algorithm.

    Concise Papers
    Image denoising based on spectral graph theory and random walk kernel
    Xiao-ping ZENG,Yi LIU,Guo-jin LIU
    2010, 31(7):  117-121.  doi:1000-436X(2010)07-0116-06
    Asbtract ( 52 )   HTML ( 2)   PDF (226KB) ( 590 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Research of LT code in satellite data broadcasting system
    Hong-peng ZHU,Geng-xin ZHANG,Guang-xia LI
    2010, 31(7):  122-127.  doi:1000-436X(2010)07-0122-06
    Asbtract ( 50 )   HTML ( 1)   PDF (250KB) ( 343 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The optimal degree distribution algorithm of LT code of fountain codes was proposed, and its drawbacks in realization were mentioned. On the basis of optimal degree distribution, a practical sub-optimal degree distribution algo-rithm was put forward. Through simulation, with respect to the channel efficiency in satellite data broadcasting system, advanced LT code based on sub-optimal degree distribution algorithm performs better than classical LT code based on Robust soliton degree distribution algorithm, RSE code and that without packet-level FEC technology. The conclusion of research is practically valuable in improving the channel efficiency of satellite data broadcasting system.

    Renewable (t, n) threshold secret sharing scheme based on one-way hash chain
    Da-wei LI,Geng YANG
    2010, 31(7):  128-135.  doi:1000-436X(2010)07-0128-08
    Asbtract ( 51 )   HTML ( 3)   PDF (264KB) ( 164 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the efficiency of rekeying in rene le secret sharing schemes, on the basis of characteris-tics of one-way hash chain, a new proactive secret sharing scheme as proposed. In the scheme, the updated polynomi-al's coefficients were generated by a one-way hash chain, which can save the computation costs of generating a random polynomial. The process of secret sharing was based on IBE public key algorithm, which has excellent security features. Under the assumption of DL problem in finite fields, the shares verification process can prevent cheating among partici-pants efficiently. Theoretical analysis and simulation results demonstrate th mprovement of the performance.

    BER of non-regeneration cooperative system based on destination-driven
    Wei-jun CHENG,Zhi-hong MA,Bo-cheng ZHU
    2010, 31(7):  136-140.  doi:1000-436X(2010)07-0136-05
    Asbtract ( 47 )   HTML ( 0)   PDF (337KB) ( 74 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A non-regeneration cooperative system based on destination-driven for multi-hop wireless networks was pro-posed. The BER (bit error rate) performance of BPSK (binary phase-shift keying) for the proposed system was analyzed over independent and non-identically distributed (non-i.i.d) Rayleigh fading channels, and its close-form expression was derived. The theoretical analysis and simulation results show that the proposed achieves a good tradeoff between the system performance and the processing complexity of the destination node, and is very helpful to reduce the power consumption the destination node. Otherwise,the simulation results also agree well the analysis results at medium and high SNR (signal to noise ratio) values.

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: