文档介绍：一种基于蚁群的机会网络多目标路由算法
王海泉 1,2,3,朱涛 2,3,陈萌 1,3,杨颖 2,3
(,北京 100191;,北京 100191;
室,北京 100191)
摘要:机会网络是一种移动的对等通信节点组成的、节点具有消息存储能力、节点间接触随机出现
的网络。现有的机会网络路由协议绝大多数仅考虑针对单个路由目标进行路由决策,不能很好的适应
上层应用需求或环境的变化,同时难以提高路由协议的综合性能。本文面向可加性、可乘性、极值性
三种类型的路由目标,通过运用多目标决策理论及蚁群算法,给出了一种机会网络中多目标路由算法
(Multiple Objective Decision Making routing,MODM)。该算法中路由决策取决于多项路由指标,能够
为不同的应用需求或环境提供不同的路由服务,提高了机会网络下路由算法的综合性能。实验结果表
明该算法能够根据不同的需求对多个路由目标进行优化,与传染病、 First Contact 等机会网络路由算
法相比拥有更好的综合性能。
关键字:机会网络;路由算法;多目标决策;蚁群算法
中图分类号: 文献标识码:A 文章编号:CACIS12-0001
A Multi-Objective Routing Decision Making Algorithm Based on Ant-Colony for
work
WANG Haiquan1,2,3,ZHU Tao2,3,CHEN Meng1,3,YANG Ying2,3
( puter Science and Engineering Beihang University, Beijing, 100191, China; of Software Beihang
University, Beijing, 100191, China; Key Laboratory work Technology, Beijing, 100191, China)
Abstract: work is a kind posed of mobile munication nodes,
which provide the message storage capacity and the contact between nodes appears randomly. Existing
most routing protocols of work only consider single routing objective when they make
their routing decisions, which can’t satisfy the requirement from the upper application or environment and
can’t improve prehensive performance very well. In this paper, we use ant-colony-b