一种低功耗的社区机会网络消息路由算法

发布时间：2018-06-22 02:27

本文选题：机会网络 + 社区　；参考：《计算机科学》2014年01期

【摘要】：社区机会网络中节点的移动具有一定的相关性且不同的节点往往具有不同的移动特点,当前机会网络中主流的多拷贝路由算法并未充分考虑到这些特点,将该算法直接应用于这类网络会导致资源消耗较高、传输成功率低等问题。针对这些问题,提出一种基于社区的低功耗消息路由算法,其能自适应地控制消息拷贝数量,并根据节点与目标社区节点和本地社区节点相遇的历史信息来设置其目标社区和本地社区的活跃度,依靠活跃度较高的节点来完成消息传输。仿真结果表明,在延迟要求比较宽松的社区机会网络中,该算法在消息传输的成功率及占能耗最主要部分的消息转发次数方面明显优于Spray and Focus算法。
[Abstract]:The mobility of nodes in the community opportunity network has certain correlation and different nodes often have different mobile characteristics. The current mainstream multi-copy routing algorithms in the opportunity network do not fully take these characteristics into account. Applying this algorithm directly to this kind of network will lead to high resource consumption and low transmission success rate. To solve these problems, a community based low power message routing algorithm is proposed, which can adaptively control the number of message copies. According to the historical information of the node meeting with the target community node and the local community node, the activity degree of the target community and the local community is set, and the high activity node is used to complete the message transmission. The simulation results show that the proposed algorithm is superior to the Spray and focus algorithm in terms of the success rate of message transmission and the number of times of message forwarding, which accounts for the most important part of energy consumption, in the community opportunity network where the delay requirement is relatively loose.
【作者单位】：湖南大学信息科学与工程学院;
【基金】：国家自然科学基金(61173038,60973127) 中央高校基本科研业务费专项资金(531107040195) 可信系统与网络省重点实验室开放基金项目(201103)资助
【分类号】：TN929.5

【参考文献】