Heuristic community path awareness based routing algorithm in opportunistic Networks

IF 4.8 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Ad Hoc Networks Pub Date : 2025-09-01 DOI:10.1016/j.adhoc.2025.104005

Feng Zhang , Yongqiang Shi , Gang Xu , Guanghui Wei , Zixuan Yuan

{"title":"Heuristic community path awareness based routing algorithm in opportunistic Networks","authors":"Feng Zhang , Yongqiang Shi , Gang Xu , Guanghui Wei , Zixuan Yuan","doi":"10.1016/j.adhoc.2025.104005","DOIUrl":null,"url":null,"abstract":"<div><div>To address the challenge of excessive transmission overhead during message delivery in large-scale opportunistic networks, this paper proposes a routing algorithm based on heuristic community path awareness (HCAR). Nodes with similar social relationships are first grouped into communities. Differentiated strategies are then employed for intra-community and inter-community message forwarding. Specifically, within the same community, a heuristic function optimizes routing paths between source and destination nodes. For inter-community message forwarding, a community proximity metric is introduced to evaluate a node’s interaction density with the target community. This metric serves as an encounter-driven heuristic function to identify the shortest inter-community routing path. Relay node selection for both scenarios is dynamically optimized by integrating heuristic functions with encounter probability models. Extensive experiments using both simulation scenarios and real-world datasets were conducted to validate the effectiveness of HCAR. Compared to EPST, BubbleRap, Epidemic, and Prophet routing algorithms, HCAR achieves at least a 15.6% higher message delivery rate, 12% lower latency, and a notably reduced transmission overhead of 36.5%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104005"},"PeriodicalIF":4.8000,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525002537","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

To address the challenge of excessive transmission overhead during message delivery in large-scale opportunistic networks, this paper proposes a routing algorithm based on heuristic community path awareness (HCAR). Nodes with similar social relationships are first grouped into communities. Differentiated strategies are then employed for intra-community and inter-community message forwarding. Specifically, within the same community, a heuristic function optimizes routing paths between source and destination nodes. For inter-community message forwarding, a community proximity metric is introduced to evaluate a node’s interaction density with the target community. This metric serves as an encounter-driven heuristic function to identify the shortest inter-community routing path. Relay node selection for both scenarios is dynamically optimized by integrating heuristic functions with encounter probability models. Extensive experiments using both simulation scenarios and real-world datasets were conducted to validate the effectiveness of HCAR. Compared to EPST, BubbleRap, Epidemic, and Prophet routing algorithms, HCAR achieves at least a 15.6% higher message delivery rate, 12% lower latency, and a notably reduced transmission overhead of 36.5%.

查看原文本刊更多论文

机会网络中基于启发式社区路径感知的路由算法

为了解决大规模机会网络中消息传递过程中传输开销过大的问题，提出了一种基于启发式社区路径感知（HCAR）的路由算法。具有相似社会关系的节点首先被分组为社区。然后对社区内和社区间的消息转发采用差异化策略。具体来说，在同一个社区内，启发式函数优化源节点和目标节点之间的路由路径。在社区间消息转发中，引入社区接近度度量来评估节点与目标社区的交互密度。该度量作为一个偶遇驱动的启发式函数，用于识别最短的社区间路由路径。通过将启发式函数与相遇概率模型相结合，对两种情况下的中继节点选择进行动态优化。利用模拟场景和真实数据集进行了大量实验，以验证HCAR的有效性。与EPST、BubbleRap、Epidemic和Prophet路由算法相比，HCAR的消息传递率至少提高了15.6%，延迟降低了12%，传输开销显著降低了36.5%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Ad Hoc Networks 工程技术-电信学

CiteScore

10.20

自引率

4.20%

发文量

131

审稿时长

4.8 months

期刊介绍： The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.