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

Power-efficient Message Routing Algorithm for Community-based Opportunistic Network

社区机会网络中节点的移动具有一定的相关性且不同的节点往往具有不同的移动特点,当前机会网络中主流的多拷贝路由算法并未充分考虑到这些特点,将该算法直接应用于这类网络会导致资源消耗较高、传输成功率低等问题。针对这些问题,提出一种基于社区的低功耗消息路由算法,其能自适应地控制消息拷贝数量,并根据节点与目标社区节点和本地社区节点相遇的历史信息来设置其目标社区和本地社区的活跃度,依靠活跃度较高的节点来完成消息传输。仿真结果表明,在延迟要求比较宽松的社区机会网络中,该算法在消息传输的成功率及占能耗最主要部分的消息转发次数方面明显优于Spray and Focus算法。

The movement of nodes in community-based opportunistic network has some kinds of relativity and different nodes always don＇t have the same moving characteristic. However,the prevalent multi-copy message routing algorithms in opportunistic network don^t consider these characteristics adequately, which leads to high resource consumption and low transmission successful rate when deploying them directly in the community-based opportunistic network. To han- dle the above problems, this paper proposed a community-based power-efficient message routing algorithm. The algo- rithm can control the number of message copies adaptively, calculate the activity degree of target community and local community of nodes according to the meeting history of nodes with both the nodes in target community or in local com- munity,and complete the message transmission relying on the nodes which have higher activity degrees. Simulation re- suits show that the message forwarding times, which are the main part of energy consumption, and message transmis- sion successful rate of the algorithm excel the spray and focus algorithm in evidence in the community-based opportunis- tic network which has loose requirement in delay.