Delegation forwarding

Delegation forwarding
复制标题

DOI:
10.1145/1374618.1374653
复制
发表时间:
2008-05
期刊:
--
影响因子:
--
通讯作者:
Vijay Erramilli;M. Crovella;A. Chaintreau;C. Diot
Vijay Erramilli;M. Crovella;A. Chaintreau;C. Diot
中科院分区:
其他
文献类型:
--
作者:
Vijay Erramilli;M. Crovella;A. Chaintreau;C. Diot

文献摘要

被引文献

相似文献

移动机会网络的特点是不可预测的移动性、接触率的异构性和缺乏全球信息。因此,在这种网络中以低成本和低延迟成功地传递消息是具有挑战性的。大多数转发算法使用与节点相关联的质量度量,通过仅转发到可能是良好中继的节点来避免与泛洪网络相关联的成本。然而,要确定遇到的节点在遇到的时刻是否是好的接力,这不是微不足道的。因此,该问题属于从序列样本在线推断节点质量分布的问题的第一部分,并且与最优停止理论有关。基于这些观察,我们开发了一种新的转发策略,我们称之为委托转发。我们分析了两种不同的委托转发方式,结果表明,虽然向高接触率节点的朴素转发的代价与种群大小成线性关系,但委托转发的代价与种群大小的平方根成正比。然后,我们使用真实的移动性轨迹研究了不同度量下的委托转发,并证明了委托转发的性能与先前提出的算法的性能相当,而代价要低得多。特别地,我们证明了基于目的地接触率的委托方案做得特别好。
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low costs and delays in such networks is thus challenging. Most forwarding algorithms avoid the cost associated with flooding the network by forwarding only to nodes that are likely to be good relays, using a quality metric associated with nodes. However it is non-trivial to decide whether an encountered node is a good relay at the moment of encounter. Thus the problem is in part one of online inference of the quality distribution of nodes from sequential samples, and has connections to optimal stopping theory. Based on these observations we develop a new strategy for forwarding, which we refer to as delegation forwarding. We analyse two variants of delegation forwarding and show that while naive forwarding to high contact rate nodes has cost linear in the population size, the cost of delegation forwarding is proportional to the square root of population size. We then study delegation forwarding with different metrics using real mobility traces and show that delegation forwarding performs as well as previously proposed algorithms at much lower cost. In particular we show that the delegation scheme based on destination contact rate does particularly well.