共查询到16条相似文献,搜索用时 78 毫秒
1.
动态频谱接入是解决无线电频谱资源短缺和频谱使用效率低下问题的有效方法,它允许次级用户在授权频谱空闲时动态地接入,以进行数据传输。而频谱感知是实现动态频谱接入的关键挑战之一。由于次级用户的感知能力有限,为了获得更多的频谱接入机会,需要尽快找到频谱空闲概率最大的频段,并研究频谱感知次序问题。考虑到频谱空闲概率对次级用户是不可知的,并且会随时间变化,提出了在线学习框架,把频谱感知次序问题归纳成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法处理优化问题。仿真结果表明,和其他算法相比,所提算法可以获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。 相似文献
2.
认知无线电允许次级用户在频谱没有被主用户使用时动态地接入频谱进行数据传输。动态频谱接入是解决无线电频谱资源短缺和使用效率低下问题的有效方案,而频谱感知是实现动态频谱接入的关键挑战之一。次级用户的感知能力有限,为了快速找到频谱空闲概率最大的频段从而获得更多的频谱接入机会,研究了频谱感知次序问题。考虑到频谱空闲概率会随时间变化且对次级用户不可知,提出了一个在线学习框架,把频谱感知次序问题规约成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法(satisficing discounted Thompson sampling)处理优化问题。仿真结果表明,和其他算法相比,所提算法可获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。 相似文献
3.
动态频谱接入技术能够有效缓解日益突出的频谱资源紧缺问题,然而随着认知无线电技术的发展,多个次级网络接入授权频段面临的共存问题也变得更加严峻。近年来的研究表明,传统的频谱感知结果可靠性不足,无法充分保证异构网络间的共存。基于地理频谱数据库的共存技术,能够为网络提供可用频谱信息以及共存信息,从而使得异构网络的共存成为可能。文章首先阐述了地理频谱数据库的发展趋势和技术挑战,接着分析了异构网络共存面临的挑战和研究现状,然后提出了一个基于地理频谱数据库接入授权频谱的系统架构,最后介绍了异构网络共存的关键技术和主要的共存机制,进一步地,为指导共存机制和算法的设计将共存问题公式化地描述成具有一般性的优化问题。 相似文献
4.
5.
6.
为适应信息化条件下联合作战中电磁频谱管控分布性、实时性、动态性等需求,基于MAS理论与技术,对战场电磁频谱管控原型系统的总体结构进行了设计.论述了战场电磁频谱管控的工作流程,建立了基于合同网协议的多Agent模型,并按照BDI体系架构技术,对战场电磁频谱功能Agent、职能Agent和应用Agent的结构进行了详细设计... 相似文献
7.
8.
无线认知网络被认为是下一代无线网络的核心架构之一。该网络能解决日益增长的频谱使用需求和低下的频谱使用率之间的矛盾。通过伺机接入临时可用频谱资源,其频谱利用率能得到大幅的提高。由于频谱资源分配是影响频谱资源利用率的关键,因此如何对频谱资源进行高效的分配一直是无线认知网络的重要研究领域之一。我们证明了在异构频谱使用概率条件下的最优频谱分配是NP难的问题。为了有效解决该问题,本文提出了一种基于分布式最大加权独立集的频谱分配算法——DMWIS。该算法的时间复杂度为O(V2/2)。通过大量的仿真实验,验证了在90%以上的不同随机网络环境下算法能在3轮内收敛,并且该算法一般能获得最优解90%的性能。 相似文献
9.
10.
11.
12.
We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016 相似文献
13.
Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials 下载免费PDF全文
This article investigates joining strategies and admission control policy for secondary users (SUs) with retrial behavior in a cognitive radio (CR) system where a single primary user (PU) coexists with multiple SUs. Under a certain reward‐cost structure, SUs opportunistically access the PU band when it is not occupied by the PU. If the band is available upon arrival, an SU decides with a probability either to use the band immediately or to balk the system. If the band is occupied, the SU must decide whether to enter the system as a retrial customer or to leave the system. Once the PU requests for service, the service of SU being served, if any, will be interrupted, and the interrupted SU leaves the band and retries for service after a random amount of time. In this article, we study the equilibrium behavior of non‐cooperative SUs who want to maximize their benefit in a selfish, distributed manner with delay‐sensitive utility function. The socially optimal strategies of SUs are also derived. To utilize the PU band more efficiently and rationally, an admission control policy is proposed to regulate SUs who enter the system in order to eliminate the gap between the individually and socially optimal strategies. 相似文献
14.
访问控制是保护计算机上文件安全的重要技术手段。针对文件攻击,提出一种量化的评估方法,对主流访问控制策略进行了量化评估,指出主流访问控制策略的脆弱性在于赋予了程序访问用户能够访问的文件集合的权利。提出一种基于用户意愿的访问控制策略,其风险远远小于主流访问控制策略,能够防御未知文件攻击,证明了策略的安全性质,并讨论了其实现方案。 相似文献
15.
针对现有基于角色访问控制的缺陷和分布式工作流管理系统的特性,在传统的基于角色的访问控制模型中引入任务集(Tasks)、任务实例集(TaskInstances)和任务上下文(TaskContext)的概念,将传统的user role permission权限赋予结构修改为user role task permission权限赋予结构,建立了基于任务和角色的访问控制模型,给出了其形式化定义。该模型解决了传统的基于角色访问控制中的动态适应性差和最小权限约束假象的问题,用于分布式工作流管理系统,提高了安全性、实用性。 相似文献
16.
This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献