一种基于蚁群的机会网络多目标路由算法

发布时间：2018-03-26 02:45

本文选题：机会网络　切入点：路由算法　出处：《系统仿真学报》2013年01期

【摘要】：机会网络是一种由移动对等通信节点组成、节点具有消息存储能力、节点间接触随机出现的网络。现有的机会网络路由协议绝大多数仅考虑针对单个路由目标进行路由决策,不能很好的适应上层应用需求或环境的变化,同时难以提高路由协议的综合性能。面向可加性、可乘性、极值性三种类型的路由目标,通过运用多目标决策理论及蚁群算法,给出了一种机会网络中多目标路由算法(Multiple ObjectiveDecision Making routing,MODM)。该算法中路由决策取决于多项路由指标,能够为不同的应用需求或环境提供不同的路由服务,提高了机会网络下路由算法的综合性能。实验结果表明该算法能够根据不同的需求对多个路由目标进行优化,与传染病、FirstContact等机会网络路由算法相比拥有较好的综合性能。
[Abstract]:Opportunistic network is a network composed of mobile peer-to-peer communication nodes with message storage capability and random contact between nodes. Most of the existing routing protocols only consider routing decisions for a single routing target. It is difficult to improve the comprehensive performance of routing protocol. It is difficult to adapt to the change of upper application requirements or environment, and it is difficult to improve the comprehensive performance of routing protocol. For the three types of routing objectives: additivity, multiplicability and extremum, the multi-objective decision theory and ant colony algorithm are used. In this paper, a multi-objective routing algorithm in opportunistic networks is presented. In this algorithm, the routing decision depends on multiple routing indexes and can provide different routing services for different application requirements or environments. The experimental results show that the algorithm can optimize multiple routing targets according to different requirements and has better performance than the opportunistic network routing algorithms such as first contact.
【作者单位】：北京航空航天大学计算机学院;北京航空航天大学软件学院;网络技术北京市重点实验室;
【基金】：国家自然科学基金(61170295) 北京市教育委员会共建项目(JD100060630) 中央高校基本科研业务费项目(YWF-11-02-001) 航空基金项目(2011ZC51024)
【分类号】：TP393.02;TP18

【相似文献】