Integrated data lookup and replication scheme in mobile ad hoc networks

Integrated data lookup and replication scheme in mobile ad hoc networks
复制标题

移动自组织网络中的集成数据查找和复制方案

DOI:
10.1117/12.447999
复制
发表时间:
2001
期刊:
Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003.
影响因子:
--
通讯作者:
K. Nahrstedt
K. Nahrstedt
中科院分区:
--
文献类型:
--
作者:
Kai Chen;K. Nahrstedt

文献摘要

被引文献

相似文献

在移动自组织网络中,访问远程数据是一项具有挑战性的任务。必须解决两个问题:(1)如何了解网络中的可用数据;(2)即使在无法访问数据的原始副本的情况下,如何访问所需的数据。在本文中,我们开发了一个集成的数据查找和复制方案来解决这些问题。在我们的方案中,一组移动节点共同托管一组数据,以提高组中所有成员的数据可访问性。它们通过使用自适应发送速率策略向群广播广告(AD)消息来交换数据可用性信息。广告消息被其他节点用来导出本地数据查找表,并减少连接组内的数据冗余。我们的数据复制方案根据每个节点的当前位置和移动模式来预测组分区,并在分区发生之前将数据复制到其他分区。仿真结果表明,数据可用性信息能够在网络中快速传播,各节点的数据访问成功率显著提高。
Accessing remote data is a challenging task in mobile ad hoc networks. Two problems have to be solved: (1) how to learn about available data in the network; and (2) how to access desired data even when the original copy of the data is unreachable. In this paper, we develop an integrated data lookup and replication scheme to solve these problems. In our scheme, a group of mobile nodes collectively host a set of data to improve data accessibility for all members of the group. They exchange data availability information by broadcasting advertising (ad) messages to the group using an adaptive sending rate policy. The ad messages are used by other nodes to derive a local data lookup table, and to reduce data redundancy within a connected group. Our data replication scheme predicts group partitioning based on each node's current location and movement patterns, and replicates data to other partitions before partitioning occurs. Our simulations show that data availability information can quickly propagate throughout the network, and that the successful data access ratio of each node is significantly improved.