检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]福建工程学院福建省汽车电子与电驱动技术重点实验室,福州350118
出 处:《电信科学》2013年第6期115-120,共6页Telecommunications Science
基 金:福建省自然科学基金资助项目(No.2012J01243)
摘 要:资源分配是移动容迟容断网络的核心问题之一,影响着容迟容断网络路由甚至整个系统的效率。然而目前移动容迟容断网络的资源分配策略大多基于神经网络和遗传算法的混合算法,计算量大,不利于实时应用。为此根据移动网络可预测环境,提出了接入路由器消息矩阵及准二维接入带宽的约束条件,在此基础上建立了基于效用函数的资源分配策略,以满足实时要求。算法具有O(n)的算法复杂度,仿真结果显示切换掉话率和新呼叫阻塞率仅比最优化算法升高约1/4,计算用时则只有其36.99%。说明其在保证实时性的前提下仍能提供较好的QoS。算法可以进一步推广到二维移动场景中。Resource allocation is one of the core techniques in multi-homing delay/disrupt tolerant networking(DTN), which decides the efficiency of DTN routing, and even affects the whole system. However, schemes based on neural network and genetic algorithms are of computational complexity that is not applied to real-time applications. Therefore the information matrix of access routers and quasi-two-dimensional access bandwidth constraints were designed based on predictable environment of train mobile network, and then an approximation algorithm with O(n) algorithm complexity, based on utility differential, was proposed to meet the real-time applications. Finally simulation showed that call-drop-rate in handover and new call-block-rate only increase by about 1/4, compared with that of the optimized-algorithm, but calculation time decrease down to its 36.99%. It means the algorithm ensures real-time response and could provide good QoS at the same time. The algorithm could be further applied to the real 2-dimensional moving scene.
关 键 词:资源分配 移动网络接入 实时 容迟容断网络 效用函数 服务质量
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117