【24h】

A Data Dissemination Algorithm for Opportunistic Networks

机译:机会网络的数据分发算法

获取原文
获取原文并翻译 | 示例

摘要

Opportunistic networks are an evolution of MANETs, where highly mobile nodes that have no physical route connecting them might need to communicate. In this case routes are built dynamically, as nodes act according to a store-carry-and-forward paradigm. A natural continuation of forwarding in opportunistic networks is data dissemination, which is usually performed using the publish/subscribe model. In this paper, we propose a socially-based data dissemination technique for opportunistic networks called Social Dissemination. The solution assumes that nodes are grouped into communities, where nodes in the same community meet often, while at the same time certain nodes may have relationships with nodes from other communities. When two nodes meet, they exchange information about the data they store, and select data objects from the other node according to a utility function. We define such a utility function and experimentally compare its results with previously proposed state-of-the-art dissemination techniques.
机译:机会网络是MANET的演进,其中没有连接它们的物理路由的高度移动的节点可能需要进行通信。在这种情况下,路由是动态构建的,因为节点根据“存储—转发”范式进行操作。机会网络中转发的自然延续是数据分发,通常使用发布/订阅模型来执行。在本文中,我们为机会网络提出了一种基于社会的数据传播技术,称为社会传播。该解决方案假定节点被分组为社区,同一社区中的节点经常会面,而同时某些节点可能与其他社区的节点有关系。当两个节点相遇时,它们交换有关其存储的数据的信息,并根据实用程序功能从另一个节点中选择数据对象。我们定义了这种效用函数,并通过实验将其结果与先前提出的最新技术进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号