Routing algorithm for sparse unstructured P2P networks using honey bee behavior

IF 1.7 4区计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC

International Journal of Communication Systems Pub Date : 2024-09-09 DOI:10.1002/dac.5978

Aman Verma, Sanat Thakur, Ankush Kumar, Dharmendra Prasad Mahato

{"title":"Routing algorithm for sparse unstructured P2P networks using honey bee behavior","authors":"Aman Verma, Sanat Thakur, Ankush Kumar, Dharmendra Prasad Mahato","doi":"10.1002/dac.5978","DOIUrl":null,"url":null,"abstract":"SummaryUnstructured peer‐to‐peer (P2P) networks pose unique challenges for efficient and scalable routing. In this study, we introduce a novel routing algorithm inspired by the foraging behavior of honey bees named Honey Bee Optimization in P2P Networks (HBO_P2P) to address the inherent limitations of routing in unstructured P2P networks, focusing on improving packet delivery, minimizing hop count, reducing message overhead, and optimizing overall throughput. To evaluate the performance of our proposed algorithm, we conducted comprehensive experiments comparing it with existing algorithms commonly used in P2P networks, namely, particle swarm optimization (PSO), genetic algorithm (GA), and ant colony optimization (ACO). After the simulation, we got the results as follows: Our algorithm outperforms ACO, GA, and PSO by exhibiting the highest number of data hops indicating potential efficiency in route optimization. Routing overhead is also minimal as compared to ACO, GA, and PSO. The average data packet delay is also low in our algorithm as compared to ACO, GA, and PSO. HBO_P2P achieves the highest throughput, nearly reaching 100 Mbps. While ACO and GA exhibit similar throughput of around 80 Mbps, and PSO has the lowest throughput, approximately 60 Mbps.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Communication Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1002/dac.5978","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}

引用次数: 0

Abstract

SummaryUnstructured peer‐to‐peer (P2P) networks pose unique challenges for efficient and scalable routing. In this study, we introduce a novel routing algorithm inspired by the foraging behavior of honey bees named Honey Bee Optimization in P2P Networks (HBO_P2P) to address the inherent limitations of routing in unstructured P2P networks, focusing on improving packet delivery, minimizing hop count, reducing message overhead, and optimizing overall throughput. To evaluate the performance of our proposed algorithm, we conducted comprehensive experiments comparing it with existing algorithms commonly used in P2P networks, namely, particle swarm optimization (PSO), genetic algorithm (GA), and ant colony optimization (ACO). After the simulation, we got the results as follows: Our algorithm outperforms ACO, GA, and PSO by exhibiting the highest number of data hops indicating potential efficiency in route optimization. Routing overhead is also minimal as compared to ACO, GA, and PSO. The average data packet delay is also low in our algorithm as compared to ACO, GA, and PSO. HBO_P2P achieves the highest throughput, nearly reaching 100 Mbps. While ACO and GA exhibit similar throughput of around 80 Mbps, and PSO has the lowest throughput, approximately 60 Mbps.

查看原文本刊更多论文

利用蜜蜂行为的稀疏非结构化 P2P 网络路由算法

摘要无结构的点对点（P2P）网络对高效和可扩展的路由选择提出了独特的挑战。本研究从蜜蜂的觅食行为中汲取灵感，提出了一种名为 "P2P 网络中的蜜蜂优化（HBO_P2P）"的新型路由算法，以解决非结构化 P2P 网络中路由的固有局限性，重点是改善数据包传输、最小化跳数、减少消息开销和优化总体吞吐量。为了评估我们提出的算法的性能，我们进行了综合实验，将其与 P2P 网络中常用的现有算法，即粒子群优化（PSO）、遗传算法（GA）和蚁群优化（ACO）进行了比较。经过仿真，我们得到了如下结果：我们的算法优于 ACO、GA 和 PSO，数据跳数最高，表明路由优化的潜在效率。与 ACO、GA 和 PSO 相比，路由开销也最小。与 ACO、GA 和 PSO 相比，我们的算法的平均数据包延迟也很低。HBO_P2P 的吞吐量最高，接近 100 Mbps。ACO 和 GA 的吞吐量相近，约为 80 Mbps，而 PSO 的吞吐量最低，约为 60 Mbps。

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

求助全文

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

来源期刊

International Journal of Communication Systems 工程技术-电信学

CiteScore

5.90

自引率

9.50%

发文量

323

审稿时长

7.9 months

期刊介绍： The International Journal of Communication Systems provides a forum for R&D, open to researchers from all types of institutions and organisations worldwide, aimed at the increasingly important area of communication technology. The Journal''s emphasis is particularly on the issues impacting behaviour at the system, service and management levels. Published twelve times a year, it provides coverage of advances that have a significant potential to impact the immense technical and commercial opportunities in the communications sector. The International Journal of Communication Systems strives to select a balance of contributions that promotes technical innovation allied to practical relevance across the range of system types and issues. The Journal addresses both public communication systems (Telecommunication, mobile, Internet, and Cable TV) and private systems (Intranets, enterprise networks, LANs, MANs, WANs). The following key areas and issues are regularly covered: -Transmission/Switching/Distribution technologies (ATM, SDH, TCP/IP, routers, DSL, cable modems, VoD, VoIP, WDM, etc.) -System control, network/service management -Network and Internet protocols and standards -Client-server, distributed and Web-based communication systems -Broadband and multimedia systems and applications, with a focus on increased service variety and interactivity -Trials of advanced systems and services; their implementation and evaluation -Novel concepts and improvements in technique; their theoretical basis and performance analysis using measurement/testing, modelling and simulation -Performance evaluation issues and methods.