首页> 外文会议>IEEE Consumer Communications and Networking Conference >Probabilistic store-carry-forward message delivery based on node density estimation
【24h】

Probabilistic store-carry-forward message delivery based on node density estimation

机译:基于节点密度估计的概率存储 - 转发消息传递

获取原文

摘要

We propose a probabilistic store-carry-forward message delivery scheme based on node density estimation. In our scheme, when a node with a message copy encounters another node, the former forwards its copy to the latter with a certain probability. The forwarding probability is determined depending on a node density at the contact location where two nodes encounter. More specifically, when the node density is high, the forwarding probability is set to be low. This policy is designed to avoid excess message copy transmissions in a high node-density area. In general, nodes frequently encounter each other in high node-density areas and message copies rapidly spread over the nodes. In order to determine whether the node density is high or not, each node estimates the node density distribution over the whole network based on the contact location information. The information is collected by each node and exchanged among nodes. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the number of forwarded message copies.
机译:我们提出了一种基于节点密度估计的概率存储载重消息传递方案。在我们的方案中,当带有消息复制的节点遇到另一个节点时,前者将其复制转发到后者具有一定概率。转发概率根据两个节点遇到的接触位置处的节点密度确定。更具体地,当节点密度高时,将转发概率设置为低。此策略旨在避免高端浓度区域中的多余消息复制传输。通常,节点经常在高节点密度区域中彼此遇到,并且消息副本快速地扩展节点。为了确定节点密度是否高,每个节点基于联系地点信息估计整个网络上的节点密度分布。每个节点收集信息并在节点之间交换。通过仿真实验,我们在平均交付延迟和转发消息副本的数量方面评估我们的计划的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号