首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 52 毫秒
1.
为了提高认知无线网络主用户通信与次用户通信的和速率,提出了一种新的协同通信方案.该方案中主用户通过机会选择次用户是否协同自身数据传输、允许通信的次用户通过匹配最佳可用信道来最大化认知无线网络的和速率.通过建模将该和速率最大化问题表示为一个组合优化问题,进一步将问题转化为了一个等价的标准指派问题,从而提出了基于匈牙利算法的协同通信方案.仿真结果表明,所提方案显著提高了主次用户的和速率.  相似文献   

2.
张琰  盛敏  李建东  韩维佳  马骁 《通信学报》2011,32(11):35-43
针对多速率认知网络分析了不同体制网络间相互协作的动机及策略.基于排队论模型,提出了不同协作策略的时延分析模型,得到了不同类型用户的业务到达率、分组长度、信道传输速率与业务平均服务时间之间的解析关系,进而揭示了不同协作资源共享机制的时延性能以及适用的场景.数值仿真验证了分析模型的准确性和有效性,同时证明:通过合理利用用户间的协作,不仅可以更好地保障主用户业务的QoS性能,还可以有效提升次级用户的接入机会和QoS保障能力.  相似文献   

3.
针对目前经典的IEEE 802.11速率自适应算法进行分析研究,提出了在基于接收端的自适应速率算法(RBAR)和机遇式自适应速率算法(OAR)基础上根据信道质量对控制帧采用速率自适应从而减少控制帧开销的改进机制,以提高网络资源的利用率和系统的吞吐量。采用NS2网络仿真工具仿真验证其吞吐量,并与经典算法吞吐量进行对比。仿真结果表明,根据对于控制帧采用速率自适应,可以有效提高系统吞吐量和网络资源的利用率,性能优于传统经典的速率自适应算法。  相似文献   

4.
针对认知网络研究一种融合主、次用户多因素优化的局部拓扑控制和路由方法。该方法综合考虑主用户频谱使用情况以及次用户对主用户干扰影响,预测认知链路的稳定性,结合链路功耗,定义一种联合链路代价,提出链路代价最小的局部认知拓扑控制路由 (LCTCR)算法,优化网络拓扑,并在优化后的拓扑上进行网络路由的选择。算法分析和仿真实验证明,在进行认知网络路径选择时,链路功耗和链路稳定性均为重要参数,需联合优化以保证选择更优的实际路由。  相似文献   

5.
基于网络控制的分层多点播送速率控制机制研究   总被引:1,自引:0,他引:1  
本文在视频分层编码及分层传输协议的基础上,将基于网络控制与接收端控制机制相结合,提出一种新的分层多点播送速率控制机制。文中给出了该机制的拥塞检测、流行度权衡和数据层增加和丢弃算法。实验结果表明,该速率控制机制通史对拥塞做也快速响应,并在较好利用宽带的基础上保证高流行度的会话流具有较好的服务质量。  相似文献   

6.
针对认知无线网络中存在的干扰问题和功率消耗过大问题,提出了一种新的基于斯坦克尔伯格(Stackelberg)博弈的功率控制算法。建立了主次用户双层网络模型,将主用户设置为领导者,次用户设置为追随者,并对次用户产生的总干扰进行定量分析。在次用户多次博弈的过程中,动态地调整主用户单位干扰价格,在保证主用户自身正常通信前提下,尽量使得收益最大化,提高主用户的参与积极性。仿真实验表明,该算法在保证主次用户的服务质量(QoS)前提下,有效地减小了次用户的发射功率,而且能获得更高的系统容量。  相似文献   

7.
基于速率的流量控制机理的研究   总被引:2,自引:0,他引:2  
本文研究了两种基于速率的流量控制机制EPRCA和ERICA,并比较了它们的性能,仿真结果表明在瓶颈交换机缓冲区队列长度和源端的允许信元速率(ACR)的稳态、瞬态响应性能和性能的鲁棒性方面,ERICA优于EPRCA。  相似文献   

8.
李施  郦江源 《电信快报》2011,(11):44-47
文章阐述了认知网络的控制架构,并在此架构上建立了基于贝叶斯网络的认知网络推理模型,通过此推理模型预测出网络的性能参数,为认知网络的自主决策提供依据,使得认知网络能在网络环境变化时自适应地做出反应,从而真正实现端到端的QoS(服务质量)目标。  相似文献   

9.
该文针对发送速率可以调整的无线自组网,研究了最大化网络寿命的速率调整问题。将该问题模型化为混合整数非线性规划问题,通过分支限界法可以求出最优解。该文还提出了一个基于贪心策略的分布式最大化网络寿命速率调整算法MNLRAA,其基本思想是根据网络中节点的流量和剩余能量,尽可能为每条链路选择较低传输速率发送分组来节能。模拟实验结果表明,同所有节点使用最高传输速率的经典技术相比,MNLRAA可延长网络寿命20%以上。  相似文献   

10.
张磊  罗涛  刘蔚 《通信学报》2011,32(11):159-167
构建了基于认知无线电的新型车载网络,并提出基于安全业务服务质量(QoS)保障的两步式频谱共享策略:多认知小区间的频谱分配和单认知小区内的频谱共享。仿真结果表明,提出的GNBS(generalized nash bargaining solution)分配方案综合考虑了系统的公平性和总效用,可获得明显大于最大化最小方案的系统和速率,以及明显优于最大化和速率方案的多认知小区间的公平性;GNBS方案可以根据多小区间频谱需求的差异性来动态调节资源分配的比例,有效地实现了需求非对称的多小区间频谱资源的最优化配置;此外,单小区内的协作频谱共享机制,使得协作双方均获得了优于非协作方案的系统效用,有效地提高了系统吞吐量以及认知OBU间的公平性。  相似文献   

11.
针对不同无线网络间频谱资源利用率不均衡的问题,在IEEE 1900.4标准的框架下提出了基于服务质量(QoS)保证的负载均衡算法,使得认知终端可以通过频谱决策动态地接入不同的无线接入网频段,从而提高频谱利用效率。该算法以网络吞吐量的优化为目标,在资源约束和QoS保证的条件下,通过简化算法而减少开销。仿真结果表明,基于QoS保证的负载均衡频谱决策算法较之传统的基于信噪比(SNR)的频谱接入算法能够使网络的吞吐量得到大幅的提升。  相似文献   

12.
汪志勇  张沪寅  徐宁  郝圣 《电子学报》2018,46(12):2870-2877
传统的认知无线电频谱分配算法往往忽略节点的传输功率对网络干扰的影响,且存在节点间交互成本高的问题.为此,通过量化传输功率等级,以最大化弹性用户收益为目标,构建联合频谱分配与功率控制非合作博弈模型,证明了该博弈为严格潜在博弈且收敛到纳什均衡点.进一步,将随机学习理论引入博弈模型,提出了基于随机学习的策略选择算法,并给出了该算法收敛到纯策略纳什均衡点的充分条件及严格证明.仿真结果表明,所提算法在少量信息交互前提下能获得较高的传输速率,并提升用户满意度.  相似文献   

13.
    
Cognitive femtocell has been considered as a promising technique that can improve the capacity and the utilization of spectrum efficiency in wireless networks because of the short transmission distance and low transmit power. In this paper, we study the win–win solution of energy‐efficient radio resource management in cognitive femtocell networks, where the macrocell tries to maximize its revenue by adjusting spectrum utilization price while the femtocells try to maximize their revenues by dynamically adjusting the transmit power. When the spectrum utilization price is given by macrocell, we formulate the power control problem of standalone femtocells as an optimization problem and introduce a low‐complexity iteration algorithm based on gradient‐assisted binary search algorithm to solve it. Besides, non‐cooperative game is used to formulate the power control problem between collocated femtocells in a collocated femtocell set, and then low complexity and widely used gradient‐based iteration algorithm is applied to obtain the Nash‐equilibrium solution. Specially, asymptotic analysis is applied to find the approximate spectrum utilization price in macrocell, which can greatly reduce the computational complexity of the proposed energy‐efficient radio resource management scheme. Finally, extensive simulation results are presented to verify our theoretical analysis and demonstrate the performance of the proposed scheme. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

14.
    
In cognitive radio networks, Secondary Users (SUs) can access the spectrum simultaneously with the Primary Users (PUs) in underlay mode. In this case, interference caused to the licensed users has to be effectively controlled. The SUs have to make spectrum access decisions in order to enhance their quality of service, but without causing harmful interference to the coexisting PUs. In this paper, we propose a cooperative spectrum decision, which enables the SUs to share the spectrum with the PUs more efficiently. Our approach is based on a new coalitional game in which the coalition value is a function of the SUs' spectral efficiencies, the inter‐SUs interference, and the interference caused to the PUs. By applying new Enter and Leave rules, we obtain a stable coalition structure. Simulation results show that the SUs' spectral efficiencies are considerably increased and that the interference caused to the coexisting PU is reduced by about 7.5% as compared to an opportunistic spectrum access scheme. Moreover, the proposed coalitional game results in a more balanced spectrum sharing in the network. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

15.
Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.  相似文献   

16.
    
Collocated cognitive radio networks (CRNs) employ coexistence protocols to share the spectrum when it is not being used by the licensed primary users. These protocols work under the assumption that all spectrum bands provide the same level of quality of service, which is somewhat simplistic because channel conditions as well as the licensee's usage of allocated channels can vary significantly with time and space. These circumstances dictate that some channels may be considered better than others; therefore, CRNs are expected to have a preference over the choice of available channels. Because all CRNs are assumed to be rational and select the best available channels, it can lead to an imbalance in contention for disparate channels, degraded quality of service, and an overall inefficient utilization of spectrum resource. In this paper, we analyze this situation from a game theoretic perspective and model the coexistence of CRNs with heterogeneous spectrum as an evolutionary anti‐coordination spectrum‐sharing game. We derive the evolutionarily stable strategy (ESS) of the game by proving that it cannot be invaded by a greedy strategy. We also derive the replicator dynamics of the proposed evolutionary game, a mechanism with which players can learn from their payoff outcomes of strategic interactions and modify their strategies at every stage of the game and subsequently converge to ESS. Because all CRNs approach ESS based solely upon the common knowledge payoff observations, the evolutionary game can be implemented in a distributed manner. Finally, we analyze the game from the perspective of fairness using Jain's fairness index under selfish behavior from CRNs. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

17.
朱江  巴少为  杜清敏 《电讯技术》2016,56(12):1301-1309
针对现有的功率控制算法中存在的干扰问题和功率消耗过大问题,设计出一种新的效用函数,并根据此效用函数提出了一个基于非合作博弈的新的功率控制算法。首先,在效用函数中分别为信干噪比和功率设定了不同的代价因子,并将信道状态概念引入到代价因子里面,使其能够更加合理地控制用户,避免用户过度增加发射功率,同时减小了用户间的干扰;其次,证明了该算法纳什均衡的存在性和唯一性;最后,给出了所提算法的流程图。仿真结果表明,与Nash算法相比,在保证非授权用户服务质量( QoS)前提下,该算法功率消耗明显降低,并且具有较好的抗背景噪声性能;与K-G( Koskie-Gajic)算法相比,该算法保证了所有的用户的信干噪比满足上下限阈值要求,并且提高了系统容量。  相似文献   

18.
马良  朱琦 《信号处理》2012,28(1):26-32
针对已有的干扰温度模型在降低主用户受到的干扰方面的不足,本文加强了主用户在干扰控制中的主观能动性。在次用户相互博弈,调整发射功率和传输速率,降低次用户之间干扰的同时,主用户对受到次用户的干扰进行监测,在保证不超过干扰门限的同时,设计了干扰惩罚因子,对其干扰越大的次用户受到的惩罚越大,进一步合理地分配次用户的发射功率,减少对主用户的干扰。仿真结果表明,提出的干扰博弈方法能够降低次用户的发射功率,减小对主用户产生的干扰,提高了主用户的系统容量。同时,在次用户网络内,因为发射功率的降低,次用户彼此的干扰减小,接收信干比有了一定的改善。   相似文献   

19.
高丽  赵海峰  穆晓敏 《电讯技术》2012,52(7):1183-1187
为了提高频谱共享的有效性和公平性,提出了一个基于合作博弈的认知网络频谱共享模型和接入控制策略.博弈规则为在满足各用户最小收益的前提下,认知用户进行相互合作,并最大化总体收益;接入控制策略以满足服务质量需求为约束条件,并引入惩罚函数,迫使认知用户按照其实际需求竞争频谱资源.仿真结果表明:提出的合作博弈模型和接入策略提高了认知用户的总体收益和公平性,改善了系统中认知用户的满意度.  相似文献   

20.
张恒  郭超平 《现代电子技术》2010,33(24):120-123,126
IEEE 802.16无线城域网协议未给出网络带宽分配算法或建议。在此针对IEEE 802.16的QoS定义,通过在用户与网络间建立价格机制,提出多周期的广义Virckrey拍卖(GVA)机制(MP-GVA),实现多周期、连续资源预留机制以及对服务流带宽的动态按需分配。MP-GVA机制利用价格杠杆来调节用户需求和控制资源分配,达到优化系统资源配置和激励用户协作两个目标,而且通信开销较小,与IEEE 802.16具有良好的兼容性。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号

京公网安备 11010802026262号