Performance analysis of multi-frame message spreading in delay tolerant networks
Performance analysis of multi-frame message spreading in delay tolerant networks
复制标题
DOI：
10.1016/j.cnsns.2013.05.001
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
Yahui Wu;S. Deng;Hongbin Huang
中科院分区：
文献类型：
--
作者：
Yahui Wu;S. Deng;Hongbin Huang
在容延迟网络中，通信机会是不确定的，因此信息采用存储-前转的方式传输，这取决于节点之间的接触。为了有效地使用该接触，通常将消息分成许多束，这些束非常小，可以在一个接触中成功地传输。这种多帧传播算法是非常重要的，但目前的工作只是假设消息非常小，只有一个包。本文首次提出了一种基于平均场极限的理论框架来评价类流行病多帧传播算法。此外，自私行为会对存储-结转通信模式产生一定的影响，因此我们将模型扩展到节点是自私的情况。仿真结果表明了模型的准确性。数值结果表明，消息的包数越多，平均投递率越低。此外，自私的行为会使表现变得更糟。
Communication opportunities in delay tolerant networks are uncertain, so the message is transmitted in a store-carry-forward way, which depends on the contact between nodes. To use the contact efficiently, the message is often divided into many bundles, which are very small and can be transmitted successfully in one contact. Such multi-frame spreading algorithm is very important, but state of the art works just assume that the message is very small and has only one bundle. This paper proposes a theoretical framework based on mean field limit to evaluate the epidemic-like multi-frame spreading algorithm for the first time. In addition, the selfish behaviors can have certain impact on the store-carry-forward communication mode, so we extend our model to the case that nodes are selfish. Simulations show the accuracy of our model. Numerical results show that the more bundles the message has, the lower the average delivery ratio will be. In addition, the selfish behaviors can make the performance be worse.