首页> 外文会议>IEEE International Performance Computing and Communications Conference >Network coding based transmission schemes in DTNs with group meetings
【24h】

Network coding based transmission schemes in DTNs with group meetings

机译:带有小组会议的DTN中基于网络编码的传输方案

获取原文

摘要

Most existing studies on Delay/Disruption Tolerant Networks (DTNs) consider pair-wise node encountering that assumes nodes only meet in pairs. In many mobile wireless networks, a group of nodes, instead of only a pair of nodes, may meet each other. In this paper, we study how to effectively transmit a set of packets from a source to a destination in such group meeting scenarios. The optimization goal is to minimize the delay for the packets to reach the destination while limiting the energy consumption. We first assume that node encountering is known beforehand, and develop an algorithm to obtain the minimum delay. We then develop two practical network coding based schemes. Both schemes use a token technique to limit the total number of transmissions, and only incur signaling at the beginning of a group meeting. One scheme requires nodes in a group to exchange their encoding matrices with each other, while the other only requires exchanging rank information. Simulation results demonstrate that both schemes achieve delays close to the minimum delay for moderate number of tokens. They present different tradeoffs in the number of transmissions and the signaling overhead.
机译:现有的大多数关于时延/中断容忍网络(DTN)的研究都考虑了成对结对,即假定节点仅成对相遇。在许多移动无线网络中,一组节点而不是仅一对节点可能会面。在本文中,我们研究了在这种小组会议情况下如何有效地将一组数据包从源发送到目的地。优化目标是最大程度地减少数据包到达目的地的延迟,同时限制能耗。我们首先假设节点遭遇是事先已知的,然后开发一种算法来获得最小延迟。然后,我们开发两个基于网络编码的实用方案。两种方案都使用令牌技术来限制传输的总数,并且仅在组会议开始时才发信号。一种方案要求组中的节点彼此交换其编码矩阵,而另一种方案仅需要交换秩信息。仿真结果表明,对于中等数量的令牌,这两种方案均实现了接近最小延迟的延迟。它们在传输数量和信令开销方面表现出不同的权衡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号