Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
复制标题
DOI：
10.1109/tnet.2007.897964
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
T. Spyropoulos;K. Psounis;C. Raghavendra
中科院分区：
文献类型：
--
作者：
T. Spyropoulos;K. Psounis;C. Raghavendra
间歇连接的移动网络是指大多数情况下从源到目的地并不存在完整路径的无线网络。有许多真实的网络遵循这种模型，例如野生动物跟踪传感器网络、军事网络、车载自组织网络等。在这种情况下，传统的路由方案失败了，因为它们试图在任何数据发送之前建立完整的端到端路径。为了处理这样的网络，研究人员建议使用基于洪泛的路由方案。虽然基于洪泛的方案具有很高的传输概率，但它们浪费大量能量，并遭受激烈的竞争，这可能会显著降低其性能。此外，为减少基于洪水的方案的开销而提出的努力往往受到巨大延误的困扰。考虑到这一点，我们引入了一系列新的路由方案，将几个消息副本“喷射”到网络中，然后将每个副本独立地路由到目的地。我们证明，如果精心设计，喷雾路由不仅每条消息的传输次数显著减少，而且具有比现有方案更低的平均递送延迟；此外，它具有高度的可扩展性，并在大范围的场景下保持良好的性能。最后，我们使用我们在2004年的论文中提出的理论框架来分析喷雾路由的性能。我们还使用这个理论来说明如何选择要喷洒的拷贝数，以及如何将这些拷贝最佳地分配给继电器。
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.