Computer Communications最新文献

筛选
英文 中文
Resource allocation and UAV deployment for a UAV-assisted URLLC system
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-08 DOI: 10.1016/j.comcom.2025.108049
Xinyue Gu, Hong Jiang, Hao Yang
{"title":"Resource allocation and UAV deployment for a UAV-assisted URLLC system","authors":"Xinyue Gu,&nbsp;Hong Jiang,&nbsp;Hao Yang","doi":"10.1016/j.comcom.2025.108049","DOIUrl":"10.1016/j.comcom.2025.108049","url":null,"abstract":"<div><div>The unmanned aerial vehicle (UAV)-assisted transmission in ultra-reliable low-latency communication (URLLC) can achieve precise control in environments where communication infrastructures are unavailable, with enormous benefits in military and commercial applications. This paper investigates a three-hop decode-and-forward UAV-assisted system to guarantee the stringent quality-and-service requirements in long-distance URLLC. First, the block error rate (BLER) is derived for air-to-ground and air-to-air channels. Then, the transmit power, blocklength, and UAV deployment in three-dimensional space are optimized together to jointly minimize the overall BLER and UAV communication energy consumption. The formulated non-convex problem is divided into subproblems and an iterative algorithm is proposed to tackle it by utilizing the block coordinate descent. Different search techniques and the block successive convex approximation approach are used to conquer the subproblems. Finally, simulations are conducted to demonstrate the system performance and the effectiveness of the proposed algorithm.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108049"},"PeriodicalIF":4.5,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph convolutional networks and deep reinforcement learning for intelligent edge routing in IoT environment
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-08 DOI: 10.1016/j.comcom.2025.108050
Zhi Wang , Bo Yi , Saru Kumari , Chien Ming Chen , Mohammed J.F. Alenazi
{"title":"Graph convolutional networks and deep reinforcement learning for intelligent edge routing in IoT environment","authors":"Zhi Wang ,&nbsp;Bo Yi ,&nbsp;Saru Kumari ,&nbsp;Chien Ming Chen ,&nbsp;Mohammed J.F. Alenazi","doi":"10.1016/j.comcom.2025.108050","DOIUrl":"10.1016/j.comcom.2025.108050","url":null,"abstract":"<div><div>The rapid growth of the Internet of Things (IoT) has increased the demand for Quality of Service (QoS) in various applications. Intelligent routing algorithms have emerged to meet these high QoS requirements. However, existing algorithms face challenges such as long training time, limited generalization capabilities, and difficulties in handling high-dimensional continuous action spaces, which hinder their ability to achieve optimal routing solutions. To address these challenges, this paper proposes a novel intelligent edge routing optimization (RO) algorithm that integrates node classification (NC) using a graph convolutional network (GCN) with path selection (PS) based on deep reinforcement learning (DRL). This approach aims to intelligently select optimal paths while meeting high QoS requirements in complex, dynamically changing IoT Edge Network Environments (IENEs). The NC module reduces the computational complexity and enhances the generalization capability of the RO algorithm by transforming network topology and link state information into node features, effectively filtering out low-performing nodes. To cope with high-dimensional continuous action spaces and meet QoS requirements, the PS module utilizes the refined network topology and state information from NC to determine optimal routing paths. Simulation results show that the proposed algorithm outperforms state-of-the-art methods in key performance metrics such as average network delay, packet loss rate, and throughput. In addition, it shows significant improvements in convergence speed and generalization ability.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108050"},"PeriodicalIF":4.5,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DBVA: Double-layered blockchain architecture for enhanced security in VANET vehicular authentication
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-07 DOI: 10.1016/j.comcom.2025.108048
Samuel Akwasi Frimpong , Mu Han , Usman Ahmad , Otu Larbi-Siaw , Joseph Kwame Adjei
{"title":"DBVA: Double-layered blockchain architecture for enhanced security in VANET vehicular authentication","authors":"Samuel Akwasi Frimpong ,&nbsp;Mu Han ,&nbsp;Usman Ahmad ,&nbsp;Otu Larbi-Siaw ,&nbsp;Joseph Kwame Adjei","doi":"10.1016/j.comcom.2025.108048","DOIUrl":"10.1016/j.comcom.2025.108048","url":null,"abstract":"<div><div>Vehicular ad-hoc networks (VANET) are crucial for improving road safety and traffic management in Intelligent Transportation Systems (ITS). However, these networks face significant security and privacy challenges due to their dynamic and decentralized nature. Traditional authentication methods, such as Public Key Infrastructure (PKI) and centralized systems, struggle with scalability, single points of failure, and privacy issues. To address these issues, this paper introduces DBVA, a Double-Layered Blockchain Architecture that integrates private and consortium blockchains to create a robust and scalable authentication framework for VANET. The DBVA framework segregates public transactions, such as traffic data, from private transactions, such as identity and location information, into separate blockchain layers, preserving privacy and enhancing security. Additionally, DBVA introduces strict access control smart contracts for the decentralized revocation of unauthorized vehicle privileges, minimizing communication risks and enhancing system resilience. A dynamic pseudonym identity generation mechanism with periodic updates further strengthens privacy by segregating real and pseudonymous identities into separate blockchain layers. Comprehensive performance evaluations reveal that DBVA significantly enhances computational efficiency, reducing the computational cost to 18.34 ms, lowering communication overhead to 992 bits per message, and minimizing storage requirements to just 50 units, making it competitive among contemporary schemes. Extensive security analysis and formal proof confirm that DBVA effectively meets all essential privacy and security requirements, making it a robust, reliable, and scalable solution for enhancing the security, privacy, and resilience of VANET.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108048"},"PeriodicalIF":4.5,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Next-generation cloudlet federation for Internet of Things in healthcare: Enhancing response time and energy efficiency
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-07 DOI: 10.1016/j.comcom.2025.108046
Rahima Tanveer , Muhammad Ziad Nayyer , Muhammad Hasan Jamal , Imran Raza , Claude Fachkha
{"title":"Next-generation cloudlet federation for Internet of Things in healthcare: Enhancing response time and energy efficiency","authors":"Rahima Tanveer ,&nbsp;Muhammad Ziad Nayyer ,&nbsp;Muhammad Hasan Jamal ,&nbsp;Imran Raza ,&nbsp;Claude Fachkha","doi":"10.1016/j.comcom.2025.108046","DOIUrl":"10.1016/j.comcom.2025.108046","url":null,"abstract":"<div><div>The integration of the Internet of Things (IoT) with edge computing has revolutionized various sectors, including healthcare, by enabling timely patient monitoring and service availability. These services encompass emergency responses, regular treatment, and physician assistance. Healthcare systems leverage mobile edge computing, fog computing, and cloudlet computing to offload data and computations and minimize delays and energy consumption. However, edge computing solutions face limitations such as restricted area coverage, diverse service requirements, and insufficient computational power, making them unsuitable for large-scale data processing and computation. To address the growing need for seamless patient information sharing among doctors and specialists across different hospitals, a resource-sharing solution, such as the cloudlet federation, is essential. Nonetheless, integrating IoT systems with cloudlet federations in healthcare presents challenges, primarily because of the necessity for mobile nodes such as ambulances, in addition to the fixed-edge nodes and brokers typical of traditional cloudlet federations. This study proposes a modified cloudlet federation model designed to overcome these challenges by effectively managing data from heterogeneous nodes. Our approach enhanced response times, reduced energy consumption, and ensured the availability of comprehensive patient information. The experimental results demonstrate a 49% improvement in response time and a 51% reduction in energy consumption compared with existing cloud-based solutions.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108046"},"PeriodicalIF":4.5,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DCDIM: Diversified influence maximization on dynamic social networks
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-06 DOI: 10.1016/j.comcom.2025.108045
Sunil Kumar Meena , Shashank Sheshar Singh , Kuldeep Singh
{"title":"DCDIM: Diversified influence maximization on dynamic social networks","authors":"Sunil Kumar Meena ,&nbsp;Shashank Sheshar Singh ,&nbsp;Kuldeep Singh","doi":"10.1016/j.comcom.2025.108045","DOIUrl":"10.1016/j.comcom.2025.108045","url":null,"abstract":"<div><div>The problem of influence maximization (IM) identifies the top <span><math><mi>k</mi></math></span> nodes that can maximize the expected influence in social networks. IM has many applications, such as viral marketing, business strategy, and profit maximization. However, most of the existing studies focus on maximizing the influenced node in the static social network, and overlook the diversity of the influenced nodes. To address this issue, this work proposes a framework to diversify the influenced node in dynamic social networks. Utilizing the framework, our DCDIM algorithm identifies the communities dynamically and maximizes the communities of influential nodes using a proposed objective function. We prove that the proposed objective function is Monotonic, Submodular, and NP-Hard. The experiments have been conducted on four datasets, and the experimental results show that the proposed approach achieves the maximum number of communities and gives competitive influenced node with the benchmark algorithms.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108045"},"PeriodicalIF":4.5,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
UAVs deployment optimization in cell-free aerial communication networks
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-06 DOI: 10.1016/j.comcom.2024.108041
Aya Ahmed , Cirine Chaieb , Wessam Ajib , Halima Elbiaze , Roch Glitho
{"title":"UAVs deployment optimization in cell-free aerial communication networks","authors":"Aya Ahmed ,&nbsp;Cirine Chaieb ,&nbsp;Wessam Ajib ,&nbsp;Halima Elbiaze ,&nbsp;Roch Glitho","doi":"10.1016/j.comcom.2024.108041","DOIUrl":"10.1016/j.comcom.2024.108041","url":null,"abstract":"<div><div>This paper tackles the joint problem of user association, channel assignment, UAV placement, and transmit power allocation in cell-free wireless networks. Each user can either be directly connected to a ground base station (GBS) or through UAVs acting as relays. To address this, we formulate the problem mathematically as a mixed-integer non-convex program, to minimize the number of deployed UAVs under data rate requirements and coverage constraints. Since the problem is <span><math><mi>NP</mi></math></span>-hard, we propose a model-free algorithm utilizing the deep deterministic policy gradient method to handle UAV deployment and positioning within a continuous space domain. We also propose efficient heuristic and meta-heuristic algorithms for comparison purposes. Simulation results demonstrate the benefits of the cell-free concept in satisfying users and improving the performance of UAV-assisted wireless networks. They also validate the effectiveness of the proposed algorithms in minimizing the required number of deployed UAVs to meet stringent user requirements.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108041"},"PeriodicalIF":4.5,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
5G for connected and automated mobility - Network level evaluation on real neighboring 5G networks: The Greece - Turkey cross border corridor
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2025-01-04 DOI: 10.1016/j.comcom.2025.108047
Konstantinos Trichias , Serhat Col , Ioannis Masmanidis , Afrim Berisha , Foteini Setaki , Panagiotis Demestichas , Symeon Papavassiliou , Nikolaos Mitrou
{"title":"5G for connected and automated mobility - Network level evaluation on real neighboring 5G networks: The Greece - Turkey cross border corridor","authors":"Konstantinos Trichias ,&nbsp;Serhat Col ,&nbsp;Ioannis Masmanidis ,&nbsp;Afrim Berisha ,&nbsp;Foteini Setaki ,&nbsp;Panagiotis Demestichas ,&nbsp;Symeon Papavassiliou ,&nbsp;Nikolaos Mitrou","doi":"10.1016/j.comcom.2025.108047","DOIUrl":"10.1016/j.comcom.2025.108047","url":null,"abstract":"<div><div>The automotive industry has been one of the vertical sectors eagerly waiting for the extended availability of 5G connectivity in order to deliver Connected and Automated Mobility (CAM) services. These services require extremely fast and reliable, uninterrupted communication to guarantee the safety of the drivers and other road users. Even though extended analysis and evaluation of the expected performance of 5G for CAM services has taken place in the past years via simulation studies and local trials based on 5G experimental testbeds, performance evaluation based on real 5G networks has been extremely limited, due to their unavailability until recently. Even more so in rural/highway conditions, as the 5G deployments so far have been focused on urban environments with greater population coverage. This article is among the first to present evaluation data and the corresponding analysis of the 5G Non-Stand Alone (NSA) network performance for CAM services based on neighboring 5G (overlay) networks in the cross-border corridor between Greece and Turkey, by one of the leading global 5G vendors and two of the top national operators. The performance evaluation focuses on the effect of inter-PLMN (Public Land Mobile Network) Handovers on the throughput, latency and interruption time experienced by a mobile user, and the network metrics achievable under various network configurations.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108047"},"PeriodicalIF":4.5,"publicationDate":"2025-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143161655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Contextual Aware Enhanced LoRaWAN Adaptive Data Rate for mobile IoT applications
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2024-12-29 DOI: 10.1016/j.comcom.2024.108042
Muhammad Ali Lodhi , Lei Wang , Arshad Farhad , Khalid Ibrahim Qureshi , Jenhu Chen , Khalid Mahmood , Ashok Kumar Das
{"title":"A Contextual Aware Enhanced LoRaWAN Adaptive Data Rate for mobile IoT applications","authors":"Muhammad Ali Lodhi ,&nbsp;Lei Wang ,&nbsp;Arshad Farhad ,&nbsp;Khalid Ibrahim Qureshi ,&nbsp;Jenhu Chen ,&nbsp;Khalid Mahmood ,&nbsp;Ashok Kumar Das","doi":"10.1016/j.comcom.2024.108042","DOIUrl":"10.1016/j.comcom.2024.108042","url":null,"abstract":"<div><div>Long range wide area network (LoRaWAN) utilize Adaptive Data Rate (ADR) for static Internet of Things (IoT) applications such as smart parking in smart city. Blind ADR (BADR) has been introduced for end devices to manage the resources of mobile applications such as assets tracking. However, the predetermined mechanism of allocating the spreading factors (SFs) to mobile end devices is not adequate in terms of energy depletion. Recently, AI-based solutions to resource allocation have been introduced in the existing literature. However, implementing complex models directly on low-power devices is not ideal in terms of energy and processing power. Therefore, considering these challenges, in this paper, we present a novel Contextual Aware Enhanced LoRaWAN Adaptive Data Rate (CA-ADR) for mobile IoT Applications. The proposed CA-ADR comprises two modes offline and online. In offline mode, we compile a dataset based on successful acknowledgments received by the end devices. Later, dataset is modified by implementing contextual rule-based learning (CRL), following which we train a hybrid CNN-LSTM model. In the online mode, we utilize pre-trained model for efficient resource allocation (e.g., SF) to static and mobile end devices. The proposed CA-ADR has been implemented using TinyML, recommended for low-power and computational devices, which has shown improved results in terms of packet success ratio and energy consumption.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108042"},"PeriodicalIF":4.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143161654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blockchain-empowered multi-skilled crowdsourcing for mobile web 3.0
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2024-12-19 DOI: 10.1016/j.comcom.2024.108037
Yu Li , Yueheng Lu , Xinyu Yang , Wenjian Xu , Zhe Peng
{"title":"Blockchain-empowered multi-skilled crowdsourcing for mobile web 3.0","authors":"Yu Li ,&nbsp;Yueheng Lu ,&nbsp;Xinyu Yang ,&nbsp;Wenjian Xu ,&nbsp;Zhe Peng","doi":"10.1016/j.comcom.2024.108037","DOIUrl":"10.1016/j.comcom.2024.108037","url":null,"abstract":"<div><div>As the next generation of the world wide web, web 3.0 is envisioned as a decentralized internet which improves data security and self-sovereign identity. The mobile web 3.0 mainly focuses on decentralized internet for mobile users and mobile applications. With the rapid development of mobile crowdsourcing research, existing mobile crowdsourcing models can achieve efficient allocation of tasks and responders. Benefiting from the inherent decentralization and immutability, more and more crowdsourcing models over mobile web 3.0 have been deployed on blockchain systems to enhance data verifiability. However, executing these crowdsourcing-oriented smart contracts on a blockchain may incur a large amount of gas consumption, leading to significant costs for the system and increasing users’ expenses. In addition, the existing crowdsourcing model does not take into account the expected quality of task completion in the matching link between tasks and responders, which will cause some tasks to fail to achieve effects and damage the interests of task publishers. In order to solve these problems, this paper proposes a decentralized multi-skill mobile crowdsourcing model with guaranteed task quality and gas optimization (DMCQG), which performs task matching while considering skill coverage and expected quality of task completion, and guarantees the final completion quality of each task. In addition, DMCQG also optimizes the gas value consumed by smart contracts at the code level, reducing the cost of crowdsourcing task participation. In order to verify whether DMCQG is effective, we deployed the model on the Ethereum platform for testing. Through inspection, it was proved that the final expected quality of the tasks matched by DMCQG was better than other models. And it is verified that after optimization, the gas consumption of DMCQG is significantly reduced.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"232 ","pages":"Article 108037"},"PeriodicalIF":4.5,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143160893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards proactive rumor control: When a budget constraint meets impression counts 主动控制谣言:当预算受限时,印象很重要
IF 4.5 3区 计算机科学
Computer Communications Pub Date : 2024-11-28 DOI: 10.1016/j.comcom.2024.108010
Pengfei Xu, Zhiyong Peng, Liwei Wang
{"title":"Towards proactive rumor control: When a budget constraint meets impression counts","authors":"Pengfei Xu,&nbsp;Zhiyong Peng,&nbsp;Liwei Wang","doi":"10.1016/j.comcom.2024.108010","DOIUrl":"10.1016/j.comcom.2024.108010","url":null,"abstract":"<div><div>The proliferation of rumors in online networks poses significant public safety risks and economic repercussions. Addressing this, we investigate the understudied aspect of rumor control: the interplay between influence block effect and user impression counts under budget constraints. We introduce two problem variants, RCIC and RCICB, tailored for diverse application contexts. Our study confronts two inherent challenges: the NP-hard nature of the problems and the non-submodularity of the influence block, which precludes direct greedy approaches. We develop a novel branch-and-bound framework for RCIC, achieving a (<span><math><mrow><mn>1</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>e</mi><mo>−</mo><mi>ϵ</mi></mrow></math></span>) approximation ratio, and enhance its efficacy with a progressive upper bound estimation, refining the ratio to (<span><math><mrow><mn>1</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>e</mi><mo>−</mo><mi>ϵ</mi><mo>−</mo><mi>ρ</mi></mrow></math></span>). Extending these techniques to RCICB, we attain approximation ratios of (<span><math><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mrow><mo>(</mo><mn>1</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>e</mi><mo>)</mo></mrow><mo>−</mo><mi>ϵ</mi></mrow></math></span>) and (<span><math><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mrow><mo>(</mo><mn>1</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>e</mi><mo>−</mo><mi>ρ</mi><mo>)</mo></mrow><mo>−</mo><mi>ϵ</mi></mrow></math></span>). We conduct experiments on real-world datasets to verify the efficiency, effectiveness, and scalability of our methods.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"230 ","pages":"Article 108010"},"PeriodicalIF":4.5,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142745161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信