Please wait a minute...

Current Issue

    25 January 2013, Volume 34 Issue 1
    Papers
    Spectrum-efficiency and energy-efficiency functions of green cellular networks
    Jin-kang ZHU,Li XU
    2013, 34(1):  1-7.  doi:1000-436X(2013)01-0001-07
    Asbtract ( 1520 )   HTML ( 20)   PDF (254KB) ( 1507 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To provide a research and design standard for green cellular networks with the presence of multi-cell interference and handover cases,the network transmission capacity (network spectral efficiency) and energy efficiency functions of the cellular network was researched,and the relationship between the power consumption and the spectrum efficiency in the cellular networks was revealed.First,the energy efficiency function of the cellular networks was defined.Based on this,the cell interference depth and the handoff dynamic model of cellular networks were proposed,and then the network spectrum-efficiency of the cellular networks was analyzed in the presence of multi-cell interference and handoff,and its mathematical expression was derived.Finally,the energy-efficiency function of the cellular networks and its numerical results were deducted and discussed.These results will provide a useful theoretical basis for green design of cellular networks.

    Spatio-temporal periodic behavior mining algorithm for social networks
    Yu-peng HU,Hao LUO,Ya-ping LIN,Zheng QIN,Bo YIN
    2013, 34(1):  8-18.  doi:1000-436X(2013)01-0008-11
    Asbtract ( 1059 )   HTML ( 9)   PDF (403KB) ( 922 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A hierarchical bipartite graph based model and a mining algorithm were presented to obtain the potential spatio-temporal periodic behavior,meanwhile avoided the subset omitting problem in previous schemes.Then the location analysis algorithm was designed to achieve the nearly inimum location dominating subset,it could monitor the small portion of the locations as early as possible.Finally experiments results show that the algorithms can find out the periodic location set as well as obtain nearly minimum location dominating subset,so as to cover the major portion of objectives using those popular locations.

    Effect of UDP traffic on TCP’s round-trip delay
    Hai-ting ZHU,Wei DING,Li-hua MIAO,Jian GONG
    2013, 34(1):  19-29.  doi:1000-436X(2013)01-0019-11
    Asbtract ( 1019 )   HTML ( 17)   PDF (371KB) ( 752 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A single link-oriented TCP transmission performance metric called “R”was proposed.The relationship between metric R and two indicators (the utilized link bandwidth and the UDP traffic proportion) on the same link was analyzed,and the experiment results on passive measurement datasets from two bidirectional network links separately located in USA and China were laid out.The results show that the metric can be expressed as a normally distributed sto-R chastic process with distinct parameters decided by the utilized bandwidth and the UDP traffic proportion.Further,by using fitting methods on local datasets,a concrete function,which was acceptable at a high confidence level,was given to describe the relationship between the mean value of R 's normal distribution and the two indicators mentioned before.This work offers a reference to the study of network fairness.

    Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection
    Mao-hua SUN,Shou-shan LUO,Yang XIN,Yi-xian YANG
    2013, 34(1):  30-42.  doi:1000-436X(2013)01-0030-13
    Asbtract ( 106 )   HTML ( 0)   PDF (441KB) ( 934 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The model and framework of secure multi-party computational geometry were presented based on the existing protocols.The new framework has three dimensions,the math model,the security model and the communication model.Using the new model and framework,a secure two-party line segments intersection protocol based on Paillier homomorphic encryption scheme is proposed.This protocol solves the problem that the existing secure two party intersect-determination schemes of line segments cannot output the exact coordinates of the intersection.The security of the protocol is demonstrated using Goldreich method.The results show that this protocol has better efficiency than the existing ones.In addition,the secure two-party line segments intersection in malicious model is also designed.As an application,a privacy-preserving convex hull intersection protocol is proposed based on the O’Rourke scheme.This application makes up for the gap in privacy-preserving convex hull intersection protocol in the area of secure multi-party computational geometry.

    Impact of user behavior on network performance reliability
    Juan ZHAO,Ping GUO,Hong-zhong DENG,Jun WU,Yue-jin TAN,Min ZHANG
    2013, 34(1):  43-50.  doi:1000-436X(2013)01-0043-08
    Asbtract ( 75 )   HTML ( 1)   PDF (379KB) ( 211 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on a lattice network,a user access behavior model was established to describe the statistical characteristics of user behavior including the clustering characteristics and the power law distribution.The phase transition point was used to analysis the influence of the statistical characteristics of user behavior on the network performance reliability.It was shown that the network performance reliability almost independent on the degree distribution of the server-visited bipartite network;however the hot changing of the small subset with the high degree server nodes improved the network reliability.The strength,frequency and the duration of the clustering characteristics have certain impact on the phase transition of network performance reliability.The phase transition point of network performance reliability moved to the right with the increase of the difference between the number of active users when the clustering characteristics happened and don’t.

    Blind detection for image steganography using short du ate codes statistical model for Hilbert scanning sequences
    Shang-ping ZHONG,Qiao-fen XU,Wen-zhong GUO,Bin LIAO
    2013, 34(1):  51-60.  doi:1000-436X(2013)01-0051-10
    Asbtract ( 75 )   HTML ( 2)   PDF (363KB) ( 134 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By analyzing and proving the correlation between the detection capability of a short duplicate code statistical feature and the probability of cumulating short duplicate codes、the dimension of short duplicate codes,a method to improving the detection capability of a short duplicate code statistical feature was found.Then,a blind detection method for image steganography using short duplicate codes statistical model for Hilbert scanning sequences was proposed.The proposed method used Poisson distribution test to detect the stego-message based on the statistical feature of short duplicate code with same elements in LSB Hilbert scanning sequences.So,the proposed method could make full use of Hilbert curve to maintain the good properties of local correlation,and could not only use the correlation of adjacent elements,but also use the correlation of elements in local regions.Theoretical lysis and experiments show that the proposed method can effectively improve the detection rate under the condition of effectively controlling the false alarm rate.

    Stackelberg games-based distributed algorithm of pricing and resource allocation in heterogeneous wireless networks
    Yong JIANG,Shan-zhi CHEN,Bo HU
    2013, 34(1):  61-68.  doi:1000-436X(2013)01-0061-08
    Asbtract ( 200 )   HTML ( 10)   PDF (295KB) ( 1133 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To deal with resource allocation in heterogeneous wireless networks,an algorithm based on multi-leader multi-follower Stackelberg games model was proposed to satisfy optimal utility of both operators and mobile users.The mobile user’s utility function with payoff and cost was designed,and it was demonstrated that the utility function obey concave function condition after defining operator price strategy,which assured the existence of Nash equilibrium point.A distributed iterative algorithm was presented to obtain optimal strategies of mobile user’s bandwidth allocation and operator’s pricing.At last,simulation experiments acquire player’s optimal strategies and Subgame perfect Nash equilibrium.

    Multi-cell downlink coordinated beam forming algorithm based on fairness duality theory
    Shi-wen HE,Yong-ming HUANG,Lv-xi YANG
    2013, 34(1):  69-76.  doi:1000-436X(2013)01-0069-08
    Asbtract ( 75 )   HTML ( 0)   PDF (367KB) ( 287 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the goal to optimize the multi-cell downlink beamforming based on the criterion of the worst-user rate maximization,the Lagrangian duality theory was first used to derive a virtual multi-cell uplink optimization problem that was dual to the primal multi-cell downlink beamforming optimization problem.Base on that,an iterative algorithm was developed to solve the virtual uplink problem by combining the methods of bisection search and geometric programming.Then,the primal multi-cell downlink coordinated beamforming optimization problem could be solved by converting the solution of the virtual uplink problem to the downlink.Simulation results demonstrate that,in contrast to the existing coordinated beamforming schemes,the proposed scheme achieves better performance in terms of both the worst-user rate and the rate per energy (RPE).

    Gradient descent Sarsa(?)algorithm based on the adaptive potential function shaping reward mechanism
    Fei XIAO,Quan LIU,Qi-ming FU,Hong-kun SUN,Long GAO
    2013, 34(1):  77-89.  doi:1000-436X(2013)01-0077-12
    Asbtract ( 63 )   HTML ( 0)   PDF (448KB) ( 1345 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the reinforcement leaning tasks with continuous state spaces,the algorithms are usually facing the problems of ill initial performance and low convergence speed.In order to solve these problems,the potential function shaping reward mechanism was proposed to improve the reinforcement learning algorithms.This mechanism propagates model knowledge to the learner adaptively in the form of the additional reward signal,so that the initial performance and convergence speed could be improved effectively.In view of the good performance and existing problems of the radial basis function (RBF) network,the adaptive normalized RBF (ANRBF) network was put forward to use as a potential function to generate the shaping rewards.A gradient descent (GD)algorithm named ANRBF-GD-Sarsa(?) was proposed based on the ANRBF network.The convergence of ANRBF-GD-Sarsa(?) algorithm was analyzed theoretically.Extensive experiments are conducted to show the good initial performance and high convergence speed of the proposed algorithm.

    On one class of symmetric Boolean functions
    Zhi-hui OU,Ya-qun ZHAO
    2013, 34(1):  90-95.  doi:1000-436X(2013)01-0089-07
    Asbtract ( 40 )   HTML ( 0)   PDF (294KB) ( 314 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The properties of one class of symmetric Boolean funct which was denoted by ? was discussed,a different method for proving that one subclass of ? having maximum algebraic immunity was presented.A necessary condition was proposed for the functions of ? with maximum algebraic immunity,of which a lower bound of the number was also given.Meanwhile,the algebraic degree of most functions of ? was determined and linear structure and correlation immunity of ? were also analyzed.The results show that the functions of ? have no non-zero linear structure and only two functions of ? have 1-correlation immunity.

    MVDR beamforming for correlated signal with vector smoothing
    Zhi-yong LIN,Jian-wu TAO
    2013, 34(1):  96-104.  doi:1000-436X(2013)01-0096-09
    Asbtract ( 35 )   HTML ( 0)   PDF (422KB) ( 739 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The MVDR beamforming algorithm for correlated signal with smoothing was proposed based on electromagnetic vector sensor array.First,the decorrelation principle of MVDR beamforming with vector smoothing was analyzed,and the output SINR of VS-MVDR beamforming in the presence of a single correlated interference was derived.The proposed algorithm is suitable for arbitrary array structures and has better performance in multipath propagation.Simulation results are shown to verify the efficacy of the proposed algorithm.

    Cooperative spectrum sensing detector based on generalized eigenvalue
    Ming JIN,You-ming LI,Yang GAO
    2013, 34(1):  105-110.  doi:1000-436X(2013)01-0105-06
    Asbtract ( 59 )   HTML ( 1)   PDF (351KB) ( 225 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The available eigenvalue based cooperative spectrum sensing detectors require that the primary signals among sensing nodes were correlated.A maximum generalized eigenvalue based cooperative spectrum sensing detector was proposed.The proposed detector exploited the received signals from the previous sensing durations without primary user.The maximum generalized eigenvalue between the sample iance matrices from current and previous sensing durations was taken as test-statistic to implement spectrum sensing.No prior knowledge of primary signal and noise power was needed in the proposed detector.The proposed detector still has high detection performance while the primary signals among sensing nodes are uncorrelated,although the available eigenvalue based detectors fail.Finally,the val ity of the detector is proved by simulations.

    Traffic measurement algorithm based on least recent used and Bloom filter
    Zhen ZHANG,Bin-qiang WANG,Feng-yu ZHANG,Ning-ning LIANG
    2013, 34(1):  111-120.  doi:1000-436X(2013)01-0111-10
    Asbtract ( 71 )   HTML ( 0)   PDF (385KB) ( 688 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the na?ve algorithm’s deficiency of high false negative probability,a novel scheme called LRU-BF(least recent used &Bloom filter) was presented.In order to achieve high accuracy,the algorithm adopted mechanisms of LRU eliminating and Bloom filter representation to separate the process of heavy-hitter fliteration from the heavy-hitter recognition.Based on statistical theory,analytical expressions about upper-bound error probability were deduced.Simulated results indicate that LRU-BF can achieve space saving and lower error probabilit compared with Na?ve-LRU algorithm.Meanwhile,it can also support the 10Gbit/s line-speed processing.

    Technical Reports
    Fast motion estimation based on the special and temporal characteristic
    Long LIU,Qi-jun SONG,Tai-fei ZHAO,Xiang-hui YUAN
    2013, 34(1):  121-127.  doi:1000-436X(2013)01-0121-07
    Asbtract ( 42 )   HTML ( 0)   PDF (227KB) ( 254 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The spacial and temporal character of motion vector were analysed according to the spacial and temporal characteristic of motion vector,the different proposed search schemes were adopted for motion estimation;The experimental results shows the proposed algorithm reduce the prediction error and has a significant computational speedup compared with other algorithms,but offers a similar,even better performance.

    Anomaly detection system with hole coverage optimization based on negative selection algorithm
    Tian-liang LU,Kang-feng ZHENG,Rong-rong FU,Yi-xian YANG,Bin WU,Shi-ze GUO
    2013, 34(1):  128-135.  doi:1000-436X(2013)01-0128-08
    Asbtract ( 68 )   HTML ( 0)   PDF (313KB) ( 373 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the problem that a large number of undetectable holes existed in negative selection algorithm,an algorithm of directional generating holes’detectors using r -chunk matching rule with variable matching threshold based on hole-set and self-set was proposed.Improvement was made to negative selection algorithm that NSA with double layers detectors was proposed.This algorithm achieved a wider range of non-self space coverage with the precondition of ensuring fast detection speed by increasing the detection of holes.Simulation result shows that comparing with NSA using variable matching length of r -contiguous bits this algorithm can achieve higher non-self space coverage,especially better performance in hole-space coverage.

    Novel blind recognition method for self-synchronized scrambler
    Hong-shu LIAO,Ye YUAN,Lu GAN
    2013, 34(1):  136-143.  doi:1000-436X(2013)01-0136-08
    Asbtract ( 80 )   HTML ( 3)   PDF (297KB) ( 588 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In non-cooperative communication systems,an adversary has to blindly estimate the coding parameters of scrambler from intercepted sequence.On the condition biased information source,a new method was proposed which can blindly recover the generating polynomial of self-synchronized scrambler.This method was based on the corrected squared Euclidean distance which was used to measure the distance between the actual stat ical probability and the uniform distribution.The simulation results verify the theory analysis and the validity of the algorithm.

    Comprehensive Revisers
    Security in cognitive radio networks
    Qing-qi PEI,Hong-ning LI,Hong-yang ZHAO,Nan LI,Ying MIN
    2013, 34(1):  144-158.  doi:1000-436X(2013)01-0144-15
    Asbtract ( 96 )   HTML ( 3)   PDF (502KB) ( 1234 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Cognitive radio can obtain and access spectrum white holes without interfering primary users by sensing wireless environment to meet with the more spectrum requirement of users and improve spectrum utilization.However,it also brings new secure challenges that different from traditional wireless networks.Relying cognition cycle,the security issues in cognitive radio networks are presented from data channel,control channel and terminal equipment,then the existing defensive measures and propose the secure recommendations of cognitive radio networks are introduced.

    Survey of negative selection algorithms
    Zhang-zan JIN,Ming-hong LIAO,Gang XIAO
    2013, 34(1):  159-170.  doi:1000-436X(2013)01-0159-12
    Asbtract ( 129 )   HTML ( 9)   PDF (466KB) ( 1172 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A review of NS was given.Firstly,the basic principle of negative selection algorithm and its history were introduced.Secondly,various negative selection algorithms were grouped into different categories by different criteria and the application of NS was described.Besides,some open problems in the development of NS algorithms were presented and analyzed.Finally,a discussion of future trends was conclued.

    Correspondences
    Host’s source address verification based on stream authentication in the IPv6 access subnet
    Yue CHEN,Hong-yong JIA,Peng-xu TAN,Jing SHAO
    2013, 34(1):  171-177.  doi:1000-436X(2013)01-0171-07
    Asbtract ( 68 )   HTML ( 0)   PDF (231KB) ( 237 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cryptographically-implemented high-speed source address verification scheme for the hosts in the IPv6 access subnet was proposed.The MAC address was used as the identity of the host machine and bounded with the host’s public key.Then the IPv6 address was derived from the host machine’s public key using the cryptographically generated address algorithm.The address authenticity was guaranteed by the digital signature and the fast and secure source address verification for packet stream was achieved through message authentication code algorithm and stream authentication.The experimental system show that the scheme could ver fy the source addresses of data packets at a loss cost.Thus,it is a secure and feasible scheme.

    Approximation algorithm to symmetric alpha stable distribution with bi-region curve model
    Kang WANG,Zhi-jiang XU,Li-min MENG
    2013, 34(1):  178-184.  doi:1000-436X(2013)01-0178-07
    Asbtract ( 42 )   HTML ( 0)   PDF (344KB) ( 338 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The symmetric alpha stable (S S) was used to model a non-Gaussian,heavy tail and impulsive noise of com-α munication channels.However,explicit expressions for the probability density functions (PDF) in terms of elementary functions are still unknown except for some special cases,which limits the application of the SαS distribution in practice,which the bi-region separated by the triple divergence was proposed Specially,within the triple divergence,a simple exponential function with two special parameters was constructed,the two parameters were determined by using Taylor serial expansion.Compared with conventional algorithms using the series expansion,the proposed algorithm avoids the selecting the number of the series items and the risk of series expansion divergence.Moreover,numerical results verify that the proposed approximation is closer to the actual SαS PDF than the conventional Cauchy-Gaussian mixture approximation.

    Blind frequency-domain channel estimation for STBC-SC-FDE systems via redundant precoding
    Yong-chuan WANG,Zi-li CHEN
    2013, 34(1):  185-190.  doi:1000-436X(2013)01-0185-06
    Asbtract ( 43 )   HTML ( 0)   PDF (238KB) ( 534 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A blind subspace frequency-domain channel estimation algorithm based on redundant precoding was proposed for single-carrier system with frequency-domain equalization and space-time block codes (STBC-SC-FDE) over frequency-selective fading channels.Blind channel identifiability was guaranteed up to one scalar ambiguity,and the residual scalar ambiguity could be resolved.The proposed algorithm can estimate the channel impulse response of STBC-SC-FDE systems with redundant precoder only relying on the second-order statistics of the received frequency-domain signal.Simulation results confirm the proposed algorithm is stable and reliable,and has high estimation and equalization performance.

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: