arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.0882cs.NI
收藏

在中断容忍网络中使用超越一跳的邻域

Using Neighborhood Beyond One Hop in Disruption-Tolerant Networks

Tiphaine Phe-Neau, Marcelo Dias de Amorim, Vania Conan

摘要:

文献中的大多数容断网络(DTN)协议都只关注联系和相互联系的特征来做出转发决策。尽管如此,联系背后有一个世界:仅仅因为一个节点没有与某个潜在的目的地联系,并不意味着这个节点是孤独的。可能存在通过其他附近节点的有趣的端到端传输机会。现有的协议通过维护简单的基于接触的网络视图而错过了这样的可能性。在本文中,我们研究如何通过时间节点的附近演变,以及这些信息是否可以路由数据时是有用的。我们观察到一个明确的权衡路由性能和监控邻居的成本。我们的分析表明,限制一个节点的邻居视图到三个或四个跳是足够的,以显着提高转发效率,而不会产生高昂的开销。

英文摘要:

Most disruption-tolerant networking (DTN) protocols available in the literature have focused on mere contact and intercontact characteristics to make forwarding decisions. Nevertheless, there is a world behind contacts: just because one node is not in contact with some potential destination, it does not mean that this node is alone. There may be interesting end-to-end transmission opportunities through other nearby nodes. Existing protocols miss such possibilities by maintaining a simple contact-based view of the network. In this paper, we investigate how the vicinity of a node evolves through time and whether such information can be useful when routing data. We observe a clear tradeoff between routing performance and the cost for monitoring the neighborhood. Our analyses suggest that limiting a node's neighborhood view to three or four hops is more than enough to significantly improve forwarding efficiency without incurring prohibitive overhead.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑