Please wait a minute...

Current Issue

    25 November 2011, Volume 32 Issue 11
    Papers
    Relay-based resource allocation in cognitive networks
    Shi-bing ZHANG,Hao-ye ZHANG,Xue LI,Zhi-hua BAO
    2011, 32(11):  3-10.  doi:1000-436X(2011)11-0003-08
    Asbtract ( 0 )   HTML ( 0)   PDF (817KB) ( 60 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the optimal pairing the subcarriers of uplink and downlink,a spectrum resource allocation algorithm was proposed according to the subcarrier characteristics of the uplink and downlink in cognitive relay networks.The algorithm allocated the subcarriers in downlink according to the difference of subchannel gains.It assigned the subcarriere in uplink to minimize the power of every source nodes and relay nodes,and distributed the bits and powers of all subcarriers to satisfy the immediate request.It could decrease the power transmitted and increase the throughput of the system.The simulation results show that the algorithm proposed reduces the per bit power by 1.5~3 dBμW and improve the performance by one order of magnitude in bit error rate compared with the heuristic centralized scheme and distributed feedback-assisted-transmit power allocation algorithm.

    Frame importance valuation cognition based error control mechanism on cognitive networks
    De-guang LE,Yong JIN,Dong-hui GUO,Jin-yi CHANG
    2011, 32(11):  11-20.  doi:1000-436X(2011)11-0011-10
    Asbtract ( 0 )   HTML ( 0)   PDF (737KB) ( 223 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cognitive error control mechanism for cognitive networks,called CEC was proposed.CEC was based on the cognition of importance of data frames’hops and types,which could select a best error control mechanism to improve the communication performance in cognitive networks.Besides,the energy efficiency model of cognitive networks was built.The mathematical analysis and simulation comparisons show that the proposed CEC mechanism achieves better performance in terms of communication reliability and energy efficiency in cognitive networks.

    Spectrum sensing algorithm based on symmetry of cyclic spectral correlation
    Yu-long GAO,Yan-ping CHEN,Xiu-zhi GUAN,Zhong-zhao ZHANG,Xue-jun SHA
    2011, 32(11):  21-26.  doi:1000-436X(2011)11-0021-06
    Asbtract ( 0 )   HTML ( 1)   PDF (1083KB) ( 701 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In response to the shortcoming of conventional algorithms,modified SSCA was exploited to calculate the cyclic spectral correlation of received signal for decreasing the computational complexity.Symmetry of cyclic spectral correlation (CSC) was used to detect the idle spectrum,criteria and method of selecting and judging symmetry were proposed.Conventional binary hypothesis condition was translated to concrete value according to symmetry.In order to eliminate the effect of interference and noise,non-zero cyclic frequencies were selected.Finally,the performance of the presented algorithm was compared with the conventional algorithms by virtue of simulation.Simulation results proved the correctness and the superiority of new algorithms.Using symmetry improves the successful detection probability for low SNR and reduces the computational complexity.

    Blind spectrum sensing based on goodness of fit test for cognitive radio in noise of uncertain power
    Lei SHEN,Hai-quan WANG,Zhi-jin ZHAO,Min-hong SUN
    2011, 32(11):  27-34.  doi:1000-436X(2011)11-0027-08
    Asbtract ( 0 )   HTML ( 0)   PDF (718KB) ( 581 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on t-distribution and Anderson-Darling test,the first,a method was proposed of spectrum sensing under assumptions that the noise variance was unknown and also the channel information was unknown.Indeed,the sensing was conducted based on Anderson-Darling distance between the distribution of ratio of sample’s mean to sample’s variance and the t-distribution.The second,another sensing method was proposed,under the same assumptions as the above,based on Anderson-Darling distance between the empirical characteristic function and a known characteristic function.The third,lower bounds on detection probabilities of sensings above were given for a flat,slow fading channel.Theoretical analysis and simulations show that the performances of proposed methods are much better than energy detector-based sensing with known noise variance,especially under an environment of a low signal to noise ration(SNR),or small number of samples.

    Cooperative resource sharing for multi rate cognitive networks
    Yan ZHANG,Min SHENG,Jian-dong LI,Wei-jia HAN,Xiao MA
    2011, 32(11):  35-43.  doi:1000-436X(2011)11-0035-09
    Asbtract ( 0 )   HTML ( 0)   PDF (843KB) ( 128 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The motivations and strategies of cooperation between heterogeneous networks were discussed for multi rate cognitive networks.Based on queuing theory,the delay analytical models for different cooperative strategies were proposed and the closed form analysis,which exactly shows the relationship among different users’ traffic arrival rate,packet length,transmission rate and service delay,was obtained to reveal the delay performance and appropriate application scenarios of different cooperative strategies.The simulation results confirm that the proposed analytical model is correct and effective.In addition,it shows that not only the QoS of primary user is better guaranteed,but also the access opportunity and QoS of secondary user are improved by cooperation dramatically.

    Portfolio selection and primary user QoS guarantee based resource allocation in cognitive radio networks
    Hui LIANG,Xiao-hui ZHAO
    2011, 32(11):  44-50.  doi:1000-436X(2011)11-0044-07
    Asbtract ( 0 )   HTML ( 0)   PDF (506KB) ( 112 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Inspired by portfolio selection theory,an efficient primary user QoS guaranteed resource allocation algorithm from secondary user interference by using historical channel state information was proposed.This algorithm formulates the risk as optimization objective,and restricts the interference which comes from secondary system to primary users below a mutual interference threshold.Then quadratic programming method is used to solve this optimization problem.Finally,performance comparison between the original algorithm without protection and the proposed algorithm was given.Simulation results illustrate that the proposed algorithm can minimize secondary system risk under an expected transmission rate and guarantee primary user’s QoS.

    Collision resolution algorithm based on time-series forecasting for cognitive wireless networks
    Shuang-mao YANG,Wei GUO,Wei TANG
    2011, 32(11):  51-58.  doi:1000-436X(2011)11-0051-08
    Asbtract ( 0 )   HTML ( 0)   PDF (644KB) ( 267 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel prediction-based collision resolution algorithm for self-similar traffic in cognitive wireless networks was formulated.The packet collision was resolved by combining the tree splitting scheme and the prediction theory.Through theoretical analysis and simulation experiments,the proposed prediction-based collision resolution algorithm performs better than the binary-tree splitting algorithm in terms of network throughput and collision resolution period.

    Self-adaptive joint routing and spectrum allocation algorithm with QoS constraints in cognitive wireless Mesh networks
    Zhu-fang KUANG,Zhi-gang CHEN,Xiao-heng DENG
    2011, 32(11):  59-70.  doi:1000-436X(2011)11-0059-12
    Asbtract ( 0 )   HTML ( 0)   PDF (719KB) ( 361 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A self-adaptive joint routing (SA2JR) and spectrum allocation algorithm with QoS constraints in cognitive wireless mesh networks was proposed.Maximizing the accept ratio of wireless service was the objective of SA2JR under the QoS constraints.The SA2JR algorithm contained κ-Routing and QDSA algorithm.The κ-Routing algorithm produces κ paths for each wireless service.QDSA algorithm took charge of maintaining a feasible path from the κ paths which produced by κ-Routing algorithm.Simulation results show that SA2JR algorithm can achieve expectation goal.It can achieve a higher accept ratio.

    Joint trade-off optimization algorithm based on cooperative spectrum sensing throughput
    Guo-qing JI,Gang WANG,Hong-bo ZHU
    2011, 32(11):  71-77.  doi:1000-436X(2011)11-0071-07
    Asbtract ( 0 )   HTML ( 0)   PDF (814KB) ( 248 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The achievable data throughput of the cognitive network was modeled to optimize the overhead and performance of the cooperative system thoroughly.Considering the soft data combination decision,the joint trade-off optimization of the local sampling number and cooperative user number was modeled based on the achievable data throughput.The global optimal solution was achieved with inexact line search algorithm,which is based on Armijo rule and lopsided search step technique.Consequently,the validity of the optimization model was verified both by the numerical computation and by Monte-Carlo simulation tests.The joint trade-off optimization of the sampling number and cooperative user number was achieved in cooperative sensing based on the throughput maximizing criterion.

    Blind SNR estimation for OFDM signals in cognitive radio
    Ming-qian LIU,Bing-bing LI,Ning-jie TANG,Zhao LI
    2011, 32(11):  78-84.  doi:1000-436X(2011)11-0078-07
    Asbtract ( 0 )   HTML ( 0)   PDF (696KB) ( 695 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The traditional blind SNR estimation algorithms had problems of poor performance and high computation complexity for OFDM systems in cognitive radio with low signal to noise ratio(SNR)and multi-path channel conditions,in view of which a novel blind SNR estimation method for orthogonal frequency division multiplexing(OFDM)signals was proposed.Firstly,the channel order was roughly estimated by utilizing the characteristics of autocorrelation function to determine the data interval which was free of inter-symbol interference(ISI).Secondly,the signal average power was estimated by computing the autocorrelation values of data in the determined interval.Finally,the noise average power was estimated by utilizing the characteristics that the data in cyclic prefix which was replication of part useful data.So the SNR of the received signals could be estimated.The simulation results show that the proposed method doesn’t need any prior information and has better performance and lower computation complexity,which is more suitable for OFDM systems in cognitive radio.

    Compressive sensing based channel estimation for NC-OFDM systems in cognitive radio context
    Xue-yun HE,Rong-fang SONG,Ke-qin ZHOU
    2011, 32(11):  85-94.  doi:1000-436X(2011)11-0085-10
    Asbtract ( 0 )   HTML ( 0)   PDF (857KB) ( 552 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new channel estimation based on compressive sensing(CS)in non-contiguous orthogonal frequency division multiplexing(NC-OFDM)system was proposed.As for NC-OFDM systems in cognitive radio context,the infrastructure of CS-based channel estimation,the design of pilot patterns and the algorithm of channel estimation were explored.Especially,a criterion of optimizing pilot pattern in the CS-based channel estimation was proposed by minimizing the mutual coherence of the measurement matrix in CS theory.Simulations show that,under many patterns of deactivated subcarriers,CS-based channel estimation obtains much better performance than existing NC-OFDM channel estimation methods in terms of the mean square error of the channel estimate as well as the bit error rate of the system.

    Adaptive spectrum sensing algorithm based on cyclostationary spectrum energy
    Hao-ye ZHANG,Zhi-hua BAO,Shi-bing ZHANG
    2011, 32(11):  95-103.  doi:1000-436X(2011)11-0095-09
    Asbtract ( 0 )   HTML ( 0)   PDF (772KB) ( 521 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Focused on the characteristic of cyclostationary spectrum of signal and the spectrum sensing in low signal-to-noise ratio,an adaptive decision threshold spectrum sensing algorithm was proposed,which combines cyclostationary spectrum sensing with energy detection.By weighting the sum of probabilities of detection and false alarm,estimating the eigenvalues of the cyclostationary spectrum,the algorithm provides an adaptive decision threshold which could differentiate the primary signal from the background noise.The simulation results show that the algorithm could perform well in low signal-to-noise ratio and remove the effect of noise uncertainty on the spectrum sensing.It outperforms maximum-minimum eigenvalue and blind detection with 4dB and 8dB respectively in signal-to-noise ratio,and has robustness to different modulated primary signal.

    On-demand cooperative spectrum sensing and channel allocation in cognitive wireless networks
    Bao-gang LI,Yuan-an LIU,Kai-ming LIU
    2011, 32(11):  104-110.  doi:1000-436X(2011)11-0104-07
    Asbtract ( 0 )   HTML ( 1)   PDF (779KB) ( 196 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Combining of the broadcast feature of control messages in the route discovery and maintenance process,a method to make the mutual information of the spectrum sensing and channel allocation into the route control messages was proposed.The information exchange of cognitive users is started by the route discovery process,and then creates the node cluster for cooperative sensing along the route path,which is maintained by the route maintenance messages.In order to maximize the network capacity of cognitive users,proposed jointly design of the spectrum sensing and the channel allocation.Simulation analysis showed that the overhead of information exchange for cognitive users reduce,and ease the bottleneck effects of the control channel in cognitive wireless networks,meanwhile efficiently re-use the idle spectrum.

    Spectrum allocation with SINR guarantee for cognitive wireless multi-hop networks
    Jie SUN,Wei GUO,Wei TANG
    2011, 32(11):  111-117.  doi:1000-436X(2011)11-0111-07
    Asbtract ( 0 )   HTML ( 0)   PDF (726KB) ( 360 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems inherent in fixed spectrum allocation wireless multi-hop networks such as channel collision,a full distributed spectrum allocation algorithm in‘underlay’fashion was proposed by using dynamic spectrum allocation technology in cognition radio,which was designed for wireless multi-hop networks formed with secondary users (SUs).This algorithm modeled the spectrum allocation problem as a static non-cooperative game,proofed the existence of Nash equilibrium (NE),and proposed an iterative algorithm to solve the NE.Extensive numerical experiments demonstrated that this algorithm can achieve the joint allocation of channels and power,and guarantee SUs’ signal to interference plus noise ratio(SINR)request while satisfying primary users’interference power limit.

    Optimization model and heuristic solution method for multi-channel cooperative sensing in cognitive radio networks
    Wei YANG,Dong-song BAN,Huan-zhong LI,Wen-hua DOU
    2011, 32(11):  118-125.  doi:1000-436X(2011)11-0118-08
    Asbtract ( 0 )   HTML ( 0)   PDF (883KB) ( 265 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An optimization model under the scenario where multi-channels are cooperatively sensed and used by multi-secondary users (SU) was proposed.The model aims to maximize the system throughput and optimizes the parameters including the sensing time and the weight coefficient of the sampling result of each SU for each channel,meanwhile the false access probability for each channel must not violate the given constraints.To solve this non-linear optimization model,a sequential parameters optimization method(SPO)was proposed.The method begins with deriving the lower bound of the objective function of the optimization model.Then it maximizes this lower bound by optimizing the weight coefficients through solving a series of sub-optimal problems using Lagrange method,and finally finding an optimized sensing time parameter by the golden search algorithm.Extensive experiments by simulations demonstrate the effectiveness of the proposed method and the advantage of the proposed model on improving the system throughput.

    Handover trigger time selection algorithm in heterogeneous wireless networks environment
    Ji-lei YAN,Jian-dong LI,Lin-jing ZHAO
    2011, 32(11):  126-132.  doi:1000-436X(2011)11-0126-07
    Asbtract ( 0 )   HTML ( 4)   PDF (756KB) ( 571 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The handover trigger time selection problem for mobile user in the heterogeneous networks environment was discussed.Firstly,theoretical analysis of the handover trigger time selection was presented and the constraint which the optimal handover trigger time should satisfy was obtained.Then,an algorithm was proposed to predict the optimal handover trigger time based on the estimation of handover delay and the prediction of received signal strength.Simulation results show that this algorithm can effectively reduce the packet loss ratio and the probability of handover failure.

    Technical Reports
    Optimum iterative water-filling algorithm for cognitive MIMO MAC
    Fei WEI,Zhen YANG
    2011, 32(11):  133-139.  doi:1000-436X(2011)11-0133-07
    Asbtract ( 0 )   HTML ( 0)   PDF (745KB) ( 1168 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The sum-rate maximization problem of the cognitive multiple-input multiple-output multiple access channel (MIMO MAC) under transmit power and interference temperature constraints was addressed.By exploiting the partial dual decomposition technique to relax the interference temperature constraint,the original problem was decomposed into more tractable subproblems.An iterative algorithm,in which the dual variable update and the iterative water-filling computation were performed alternately,was proposed to obtain the optimum transmit covariance matrices that achieved the maximum sum-rate.Finally,simulation results have been presented to verify the effectiveness of the algorithm.

    Multiscale admission control algorithm for statistical QoS guarantee
    Yan-ping CHEN,Hui-qiang WANG,Guang-sheng FENG,Yu-long GAO
    2011, 32(11):  140-146.  doi:1000-436X(2011)11-0140-07
    Asbtract ( 0 )   HTML ( 0)   PDF (654KB) ( 177 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Statistical properties of the traffic were calculated to estimate the burst level through online measurement for selecting proper traffic model.In order to guarantee traffic QoS,the effective envelope of self-similarity and multiracial traffic was derived using the transformation theory between the effective bandwidth and effective envelope.Then,QoS parameters were obtained using network calculus to perform admission decision;furthermore appropriate admission time was chosen to reduce the proposed algorithm’s impact on QoS performance.The simulations prove that the traffic model can be selected accurately,statistical delay can be ensured and utilization efficiency of network is improved.

    Comprehensive Review
    Cognitive wireless networks:key techniques and sate of the art
    Ji-bo WEI,Shan WANG,Hai-tao ZHAO
    2011, 32(11):  147-158.  doi:1000-436X(2011)11-0147-12
    Asbtract ( 0 )   HTML ( 3)   PDF (614KB) ( 1245 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Key techniques in cognitive wireless networks and the state-of-the-art of this research were surveyed.The first focus was on the techniques to obtain network information,which was classified into spectrum sensing in PHY layer and available bandwidth estimation in network layer.Second,the design of multi-channel MAC protocols was introduced.In particular,both the characteristics and the applicable scenarios were analyzed for different types of multi-channel MAC protocols.Third,key techniques in the intelligent decision and the network reconfiguration were discussed.In the end,several suggestions on future research topics that should be put more effort in this field were given.

    Correspondences
    Novel spectrum sharing strategy based on QoS support in cognitive vehicular network
    Lei ZHANG,Tao LUO,Wei LIU
    2011, 32(11):  159-167.  doi:1000-436X(2011)11-0159-09
    Asbtract ( 0 )   HTML ( 0)   PDF (793KB) ( 392 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A two-step spectrum sharing strategy consisting of inter-cell allocation and intra-cell allocation was developed to guarantee the system quality of service(QoS)in the cognitive vehicular network(CVN).Simulation results indicate that the proposed GNBS scheme considering both the fairness and utility can obtain larger transmission rate than Max-min scheme and achieve much better fairness than Max-rate scheme.Considering the difference of spectrum requirements between cognitive cells,GNBS scheme can allocate the spectrum resource dynamically in a weighted fairness manner.Furthermore,the cognitive cooperative spectrum sharing scheme outperforms than the non-cooperative scheme,and it can greatly improve the system utility and fairness between OBU than the non-cooperative schemes.

    Cognitive network routing algorithm based on service awareness and policy choice
    Cheng-jie GU,Shun-yi ZHANG,Yan-fei SUN
    2011, 32(11):  168-175.  doi:1000-436X(2011)11-0168-08
    Asbtract ( 0 )   HTML ( 0)   PDF (864KB) ( 776 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cognitive network routing (CNR) algorithm based on service awareness and policy choice oriented to cognitive network was proposed.This algorithm takes network resource,flow,policy choice into account and obtains the flow characteristics and network resources condition in advance.CNR algorithm fulfills the distribution of resources through offline network allocation and gets the optimal path of each flow by online path computation.Simulation verified the effectiveness of cognitive network routing algorithm and showed that compared with the traditional routing algorithms,the cognitive network routing algorithm can improve the cognitive utilization of network resources,avoid network congestion coursed by resources allocation and optimize network performance at different levels.

    Detection probability analysis of cooperative spectrum sensing with the Nthbest relay selection
    Xiao-ge ZHANG,Shi-bing ZHANG,Gong-an QIU
    2011, 32(11):  176-182.  doi:1000-436X(2011)11-0176-07
    Asbtract ( 0 )   HTML ( 0)   PDF (596KB) ( 69 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the cognitive radio system,the optimal relay would be selected from the n available ones to obtain the best sensing performance.However,in actual systems,the secondary or even the more general Nthbest relay may be selected for various reasons.Therefore,the cooperative spectrum sensing based on the Nthbest relay selection was proposed.The closed-form expression of the detection probability was derived in Rayleigh fading channels.Numerical results show that the detection probability declines continuously even below the one of the arbitrary selection as N increases,and that the one based on the optimal or suboptimal selection increases obviously but the one based on the worst or near worst selection decreases slightly as n increases.

    Primary-user behavior based joint routing and channel allocation algorithm in cognitive radio networks
    Jing LIU,Pin-yi REN,Shao-li XUE,Chao ZHANG
    2011, 32(11):  183-190.  doi:1000-436X(2011)11-0183-08
    Asbtract ( 0 )   HTML ( 0)   PDF (546KB) ( 151 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To resolve the unstable routing problem due to the variation of spectrum availability caused by primary users’ behaviors in cognitive radio networks (CRN),a primary-user behavior based joint routing and channel allocation (PUB-JRCA) algorithm was proposed.The PUC-JRCA algorithm characterized the primary-user behavior by using the call-based model.According to the route discovery mechanism in the dynamic source routing protocol,the destination node selected the route which received the least impact from primary-user behaviors after receiving a number of route requests.Then,the destination sent back the route reply packet (RREP) along the selected route,and the channel allocation was performed when the RREP passed each node on this route.Theoretic analyses prove that the expected available transmission time for the packet delivery is inversely proportional to the probability that PU is active.Moreover,the computational complexity of the proposed algorithm is proportional to the number of nodes in the CRN.Simulation results show that the proposed algorithm has higher packet delivery ratio and lower average packet delay than the Gymkhana routing scheme.

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: