摘要： 已有的数据分发方法多侧重于某方面的优化，不能充分权衡数据分发的可靠性与高效性，难以满足应急场景下可靠快速分发数据的要求。为此，提出一种基于动态组播树的可靠数据分发方法。根据节点间延迟信息对节点进行层次化分簇和编号，以此构建层次化覆盖网，根据节点编号采用基于动态组播树的前缀匹配路由。理论分析和实验结果表明，与MEDYM方法相比，即使短时间内系统中产生大量消息，该方法仍能够可靠快速地分发数据，系统开销较小。

关键词: 数据分发, 应急场景, 动态组播树, 层次化分簇, 覆盖网, 前缀匹配

Abstract: Existing dissemination methods merely focus on single optimization objective and fail to ensure reliability and efficiency simultaneously, this makes them be inadaptable to meet the need of disseminating reliably and efficiently in the emergency environment. A reliable dissemination method based on dynamic multicast tree called RDBDMT is proposed. RDBDMT clusters and identify nodes in a hierarchical manner according to the delays between them, and based on which a hierarchical overlay is built. RDBDMT adopts prefix matching routing which is based on a dynamic multicast tree according to their identifications. Theoretical analysis and experimental results show that, RDBDMT is much more reliable and efficient than the existing methods, even in the emergency environment, where a large number of messages are published simultaneously in a very short time.

Key words: data dissemination, emergency environment, dynamic multicast tree, hierarchical clustering, overlay, prefix matching

中图分类号: 

• TP391