发表机构
Amirkabir University of Technology (Tehran Polytechnic)（阿米尔卡比尔理工大学（德黑兰理工大学））
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对定向扩散协议存在的延迟聚合和独立ED洪泛问题，提出EDAP协议，利用虚拟汇聚节点构建多路径，实现负载均衡，显著节省能量并延长网络寿命（比DD提升75%）。
AI 中文摘要
定向扩散（DD）协议通过数据聚合和网内处理等机制来抑制额外的数据开销，但无法保证来自邻近源节点的路径在几跳之内汇合。此外，在路径构建过程中，每个源节点都会向网络洪泛一个独立的探索性数据（ED）分组，这对于邻近源节点而言并非必要。本文提出了一种高效数据收集协议（EDAP），通过使用靠近源节点的虚拟汇聚（VS）节点来解决延迟聚合和独立ED洪泛的问题，该虚拟汇聚节点扮演汇聚节点的角色，广播本地兴趣消息，并将收集的数据路由至目的地。此外，该协议在虚拟汇聚节点和汇聚节点之间构建多条路径，从而实现负载均衡并延长网络节点的生命周期。我们的路由协议能够生成一条或多条不相交或交织的路径，并根据路径长度和剩余能量在构建的路径之间合理分配收集的数据。仿真结果表明，该方法能够节省大量能量，并显著延长网络生命周期（比DD协议最多提高75%）。
英文摘要
Directed Diffusion (DD), uses mechanisms such as data aggregation and in-network processing to suppress the additional data overhead however there is no guarantee that paths from nearby sources join after a few hops. Also for path construction, each source floods a distinct exploratory data (ED) packet through the network which is not necessary for nearby sources. In this paper an efficient data-gathering protocol (EDAP) is proposed to address the problems of late-aggregation and distinct ED-flooding through using a virtual sink (VS) node nearby the sources which plays the role of sink node and broadcasts local interest messages and routed gathered data toward destination. Also in this protocol, multiple paths are constructed between virtual sink and the sink node which leads to load-balancing and increase in the life-time of the network nodes. Our routing protocol can produce more than one disjoint or braided path and spread the gathered data properly between constructed paths according to their length and remaining energy. Simulation results shows that in this way a significant amount of energy can be saved and the network lifetime will be increased considerably (up to 75% better than DD).
