(p,q)-epidemic, routing for sparsely populated mobile ad hoc networks'
(p,q)-epidemic, routing for sparsely populated mobile ad hoc networks'
复制标题
DOI：
10.1109/jsac.2008.080605
复制
发表时间：
2008-06-01
影响因子：
16.4
通讯作者：
Takine, Tetsuya
中科院分区：
文献类型：
--
作者：
Matsuda, Takahiro;Takine, Tetsuya
本文研究了在人口稀疏的移动的ad hoc网络中的（p，q）-Epidemic路由算法，这是一类存储-携带-转发路由算法。我们的转发方案包括两跳转发和传统的流行病路由作为特殊情况。在这种转发方案中，原始分组被复制多次，并且其分组副本在网络上传播。因此，在数据包到达目的地后，应删除这些数据包副本。我们分析了具有疫苗恢复机制的（p，q）-Epidemic路由的性能。与现有的大多数研究不同，我们深入讨论了（p，q）-流行病路由的性能，考虑到从网络中删除不必要的数据包的恢复过程。
This paper considers (p, q)-Epidemic Routing, a class of store-carry-forward routing schemes, for sparsely populated mobile ad hoc networks. Our forwarding scheme includes Two-Hop Forwarding and the conventional Epidemic Routing as special cases. In such forwarding schemes, the original packet is copied many times and its packet copies spread over the network. Therefore those packet copies should be deleted after a packet reaches the destination. We analyze the performance of (p, q)-Epidemic Routing with VACCINE recovery scheme. Unlike most of the existing studies, we discuss the performance of (p, q)-Epidemic Routing in depth, taking account of the recovery process that deletes unnecessary packets from the network.