机会网络中一种低缓存占用的Epidemic路由算法

摘要

由于机会网络中节点的缓存空间有限，容易导致数据分组丢失和时延增加。针对部分数据分组已经到达目的节点，但是该类分组仍在网络中其它节点存储、传输问题，提出一种低缓存占用的Epidemic路由算法（RBER）。该算法通过SV运算进行节点缓存清理，从而避免这类冗余数据分组对缓存的占用。理论分析和仿真结果表明，该机制能够降低网络开销、数据分组的发送和缓存占用。%To address the problem in opportunistic network that the existing epidemic-mechanism-based routing algorithms incur redundant communication overhead during the transmission of data packets, which is part of the data packets have already arrived at the destination nodes, but the data is still in the network storage and transmission, a kind of reduce buffer overhead Epidemic routing algorithm for opportunistic networks, called RBER was proposed. The algorithm based on SV information operation, to avoid redundant data takes up the cache. Theoretical analysis and simulation results show that the mechanism can reduce network overhead, redundant data packet sending and cache usage.