基于分组索引增量交换的机会网络高效低时延路由算法  

An Efficient Low-Delay Routing Algorithm for Opportunistic Networks Based on Exchange of Increments in Packet Indexes

作　　者：任智[1] 黄勇[1] 陈前斌[1] 

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《计算机学报》2010年第9期1634-1642,共9页Chinese Journal of Computers

基　　金：国家自然科学基金(60972068);重庆市自然科学基金(2009BB2085);重庆市教委科研项目(KJ090524);重庆邮电大学科研基金(A2008-13)资助~~

摘　　要：基于Epidemic机制的路由算法为机会网络提供了一类可靠的数据传送方式,但在相遇节点感知和分组交换的操作中存在冗余,导致开销和时延增加;对此,作者提出一种基于分组索引增量交换的机会网络路由算法——ERBEI,在分组索引的交换过程中只传递增量信息,并借助Request消息从节点缓存中删除已到达目的节点的分组,同时在相遇节点感知过程中只使用Hello消息,且优先发送位于最后1跳的数据分组,从而减少开销、降低分组时延.理论分析和仿真结果说明,与经典的Epidemic路由算法和它的一种改进算法ARER相比,ERBEI算法在控制开销、分组端到端时延、存储空间占用等方面的性能得到整体提升.Epidemic-based routing algorithms can reliably transmit data in opportunistic networks. However, they have some redundant control overhead in sensing encountered nodes and exchanging data packets. To address the issue this paper proposes ERBEI （Efficient Routing Based on Exchange of Increments of packet indexes）, an efficient low-delay routing algorithm. ERBEI transmits only the increments of packet indexes in the process of packet exchange, deletes the packets reaching destinations from nodes＇ memory, utilizes only the Hello messages to sense the encountered nodes, and sends the packets approaching their destinations firstly. Theoretical analysis and simulation results show that ERBEI outperforms the classical epidemic routing algorithm and one of its present improvements in the terms of control overhead, end-to-end delay, and memory overhead.

关 键 词：机会网络 路由算法 分组索引 增量 交换 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]