共查询到17条相似文献,搜索用时 203 毫秒
1.
2.
3.
4.
针对现有异构无线网络负载均衡方法未能综合考虑重载网络业务转移和新业务接入控制的问题,提出了一种混合负载均衡算法.该算法首先根据各小区负载水平和终端移动性,将重载小区的适量业务向重叠覆盖的轻载小区转移;其次通过资源预留和强占优先的接入控制策略,为不同优先级的新到业务提供有差别的服务.仿真结果表明,本文算法在保证系统资源利用率的同时,保障了实时与非实时业务的QoS,并相对于参考算法有效降低了系统阻塞率和业务切换概率. 相似文献
5.
杨筝 《太赫兹科学与电子信息学报》2015,13(6):882-886
对异构无线网络中无线资源管理和接入选择进行研究,提出一种基于D?S证据理论的异构无线网络接入选择算法。针对接入判决所需参数具有时变性和不确定性的特点,结合能够有效反映候选网络负载状况的效用函数,建立基于D?S证据理论的接入效用评估模型,得到各候选网络的综合接入效用值。仿真结果表明,该算法具有复杂度低(一般性)的特点,在保证不同业务服务质量(QoS)需求的前提下能够动态调整各候选网络的负载情况,从而有效降低整个系统的呼叫阻塞率。 相似文献
6.
7.
8.
在超密集异构无线网络中,针对城区交通高峰期,大规模车载终端短时间聚集性移动引起的网络拥塞问题,该文提出一种考虑负载均衡和用户体验(LBUE)的垂直切换算法。首先,引入网络环境感知模型预测网络未来的拥塞程度,并提出一个融合自组织网络的网络架构,缓解网络拥塞。其次,定义业务适应度和负收益因子,并提出一种基于秩和比(RSR)的自适应切换判决算法,为用户筛选出当前环境下满意度最高的目标网络。实验结果表明,该算法能够有效降低终端接入网络的阻塞率和掉话率,实现网络间负载均衡并提升用户体验。 相似文献
9.
LTE网络中多目标优化的动态负载均衡算法 总被引:2,自引:0,他引:2
小区间动态负载均衡算法的优劣对网络性能有很大的影响,现有算法大都顾此失彼,难以保证网络关键性能指标(如呼叫阻塞率等)达到最佳。为解决这个问题,该文将负载均衡问题建模为多目标优化问题,分别对不同服务质量要求用户建模其相应目标优化函数,对有服务质量要求用户的目标函数是负载均衡指示函数和网络平均负载函数的联合优化函数,而对没有服务质量要求用户(BE用户)的目标函数是所有BE用户吞吐量的总效用函数,并将小区可用资源数和用户服务质量要求作为约束条件。另外,考虑到在实际系统中运行的计算复杂度问题,提出一种复杂度较低的分布式负载均衡算法。包括资源调度策略,用户切换条件和呼叫接入控制。仿真结果表明,该文算法可达到较好的负载均衡效果,能有效降低有服务质量要求用户的呼叫阻塞率,提高网络资源利用率。 相似文献
10.
为了充分利用异构网络中的无线资源,提出了一种基于多网络并行传输的异构网络接入选择算法,该算法根据终端接收信号功率确定能够进行通信的无线网络,以这些无线网络的任意非空子集作为候选方案,计算各个方案对应的聚合属性,再根据吞吐量和功耗阈值条件限定候选网络方案,对这些方案建立多属性决策矩阵,采用基于用户偏好的逼近理想值排序法(TOPSIS)得到各个候选网络方案的效用函数值,从中选出与理想方案最接近的多网络接入方案。仿真结果表明该算法能有效改善用户服务质量,提高用户吞吐量,降低用户的单位吞吐量对应的功耗和费用,保证网络的负载均衡。 相似文献
11.
12.
The next generation wireless networks will be the coexistence of heterogeneous wireless technologies. Balancing the traffic load among different networks can effectively utilize the overall radio resources in the system. In this paper, we propose an efficient load balancing scheme for the heterogeneous overlay systems, which is applied in the call admission control process. If the available network(s) cannot provide enough resource for the request call without degrading the quality‐of‐service (QoS) obtained by the ongoing calls, the system will perform load balancing operations first by initiating vertical handoffs among networks in order to create more rooms for the request call. The load balancing algorithm is to minimize the variance between the network utilizations of the entire system, which can be formulated as a quadratic binary programming problem. Simulation results show that the proposed scheme can admit more calls into the system compared with the other three reference schemes and then improve the overall throughput. Meanwhile, the scheme can keep the networks working in effective states and provide a better QoS support for users. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
13.
在星地网络的背景下,为了降低由于地面网络链路负载过高导致的传播时延,提出了一种适用于星地网络的负载均衡算法。算法基于网络的链路容量设置一个链路资源利用率作为阈值,当发现路径出现过载的时候分成两步进行路径的预规划:第一步,运用蚁群算法为链路过载的数据流选择其他的路径,以满足地面网内部的负载均衡;第二步,如果仍出现链路超阈值的情况,通过卸载延迟容忍数据流来执行地面与卫星网络之间的负载均衡。仿真结果表明,设定自适应的过载阈值可以有效降低链路的拥塞,与现有算法相比该算法不仅可以更加均匀地分配地面网络中的流量,而且借助卫星网络使地面网络的平均时延降低了18.3%,提高了网络的服务质量。 相似文献
14.
15.
Afshin Behzadan Alagan Anpalagan Isaac Woungang Bobby Ma 《Wireless Communications and Mobile Computing》2014,14(8):770-788
In wireless sensor networks, achieving load balancing in an energy‐efficient manner to improve the network lifetime as much as possible is still a challenging problem because in such networks, the only energy resource for sensor nodes is their battery supplies. This paper proposes a game theoretical‐based solution in the form of a distributed algorithm for constructing load‐balanced routing trees in wireless sensor networks. In our algorithm, load balancing is realized by adjusting the number of children among parents as much as possible, where child adjustment is considered as a game between the parents and child nodes; parents are considered as cooperative players, and children are considered as selfish players. The gained utility by each node is determined by means of some utility functions defined per role, which themselves determine the behavior of nodes in each role. When the game is over, each node gains the maximum benefit on the basis of its utility function, and the balanced tree is constructed. The proposed method provides additional benefits when in‐network aggregation is applied. Analytical and simulation results are provided, demonstrating that our proposed algorithm outperform two recently proposed benchmarking algorithms [1, 2], in terms of time complexity and communication overhead required for constructing the load‐balanced routing trees. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
16.
Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks 下载免费PDF全文
Soodeh Amiri‐Doomari Ghasem Mirjalily Jamshid Abouei 《International Journal of Communication Systems》2018,31(12)
The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol. 相似文献
17.
无线传感器网络中多移动代理协作能快速高效地完成感知数据汇聚任务,但是随着移动代理访问数据源节点数的增加,移动代理携带的数据分组会逐渐增大,导致传感器节点能量负载不均衡,部分数据源节点能耗过快,网络生存期缩短。目前,针对该问题所设计的能耗均衡算法,多以降低多移动代理总能耗为目标,却未充分考虑部分数据源节点能量消耗过快对网络生存期造成的影响。提出离散多目标优化粒子群算法,以网络的总能耗和移动代理负载均衡作为适应度函数,在多移动代理协作路径规划中寻求近似最优解。通过仿真实验验证,所提出的多移动代理协作路径规划,在网络总能耗和网络生存期方面的性能优于同类其他算法。 相似文献