The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes i...The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes is time-varied due to primary user/secondary user(PU/SU) activity and mobility, which result in non-determinacy. This paper studies the spectrum allocation for CRNs with non-deterministic bandwidth of spectrum holes. We present a novel probability density function(PDF) through order statistics as well as its simplified form to describe the statistical properties of spectrum holes, with which a statistical spectrum allocation model based on stochastic multiple knapsack problem(MKP) is formulated for spectrum allocation with non-deterministic bandwidth of spectrum holes. To reduce the computational complexity, we transform this stochastic programming problem into a constant MKP through exploiting the properties of cumulative distribution function(CDF), which can be solved via MTHG algorithm by using auxiliary variables. Simulation results illustrate that the proposed statistical spectrum allocation algorithm can achieve better performance compared with the existing algorithms when the bandwidth of spectrum holes is time-varied.展开更多
Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost and being easy to install.However,WMN suffers from high bit error rate,which provides different link capacity among...Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost and being easy to install.However,WMN suffers from high bit error rate,which provides different link capacity among wireless mesh routers.The conventional routing metrics select the path based on link quality.The link with the best quality is preferred as the data transmission path,and thus all nodes likely select the same link,which leads to network performance degradation.This paper proposes a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path.It is confirmed that the proposed method provides higher network performance of reduced delay,reduced packet loss and increased throughput than conventional routing metrics.展开更多
基金supported by the National Natural Science Foundation of China (No.61501065, 91438104,No.61571069 and No.61601067)the Fundamental Research Funds for the Central Universities (No.106112015CDJXY160002,No.106112016CDJXY160001)the Chongqing Research Program of Basic Research and Frontier Technology (No.CSTC2016JCYJA0021)
文摘The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes is time-varied due to primary user/secondary user(PU/SU) activity and mobility, which result in non-determinacy. This paper studies the spectrum allocation for CRNs with non-deterministic bandwidth of spectrum holes. We present a novel probability density function(PDF) through order statistics as well as its simplified form to describe the statistical properties of spectrum holes, with which a statistical spectrum allocation model based on stochastic multiple knapsack problem(MKP) is formulated for spectrum allocation with non-deterministic bandwidth of spectrum holes. To reduce the computational complexity, we transform this stochastic programming problem into a constant MKP through exploiting the properties of cumulative distribution function(CDF), which can be solved via MTHG algorithm by using auxiliary variables. Simulation results illustrate that the proposed statistical spectrum allocation algorithm can achieve better performance compared with the existing algorithms when the bandwidth of spectrum holes is time-varied.
基金supported by the ubiquitous Computing and Network(UCN)Projectthe Ministry of Knowledge and Econ-omy(MKE)Knowledge and Economy Frontier R&DProgramin Korea as a result of UCN′s subproject10C2-C1-20Ssupported by the MKE(The Ministry of Knowledge Economy),Korea,under the Convergence-ITRC(Convergence Infor mation Technology Research Center)support program(NIPA-2011-C6150-1101-0004)
文摘Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost and being easy to install.However,WMN suffers from high bit error rate,which provides different link capacity among wireless mesh routers.The conventional routing metrics select the path based on link quality.The link with the best quality is preferred as the data transmission path,and thus all nodes likely select the same link,which leads to network performance degradation.This paper proposes a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path.It is confirmed that the proposed method provides higher network performance of reduced delay,reduced packet loss and increased throughput than conventional routing metrics.
