Computer Networks最新文献

英文中文

Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-11 DOI: 10.1016/j.comnet.2025.111102

Yurong Lai , Xinhui Han , Xueer Wang , Tse-Tin Chan , Haoyuan Pan

This paper examines the concept of information freshness in a collaborative surveillance scenario utilizing non-orthogonal multiple access (NOMA). In this scenario, each monitoring device observes a portion of a common target and reports the latest status to a common access point (AP), which then recovers the complete observations. We use the age of collection (AoC) as a metric for information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when the AP receives all partial updates from different devices (i.e., successfully receives a “joint” update). Consequently, existing AoI-oriented analyses on NOMA cannot be easily generalized to AoC due to the different update rules between AoC and AoI. Conventional NOMA schemes typically employ multiuser decoding (MUD) techniques to decode update messages from different devices, referred to here as the MUD-only NOMA system. However, MUD techniques are less effective when the signal-to-noise ratios (SNRs) of different NOMA users are nearly balanced. Therefore, we consider network-coded multiple access (NCMA), an advanced NOMA scheme that integrates MUD with physical-layer network coding (PNC). PNC is a technique that transforms wireless mutual interference into useful network-coded information, working well even when the SNRs of different users are similar. Experimental results using software-defined radios indicate that NCMA is a practical solution for achieving low average AoC under varying channel conditions. The combination of MUD and PNC enables the AP to receive joint update messages much faster, significantly reducing the average AoC of the system.

{"title":"Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study","authors":"Yurong Lai , Xinhui Han , Xueer Wang , Tse-Tin Chan , Haoyuan Pan","doi":"10.1016/j.comnet.2025.111102","DOIUrl":"10.1016/j.comnet.2025.111102","url":null,"abstract":"<div><div>This paper examines the concept of information freshness in a collaborative surveillance scenario utilizing non-orthogonal multiple access (NOMA). In this scenario, each monitoring device observes a portion of a common target and reports the latest status to a common access point (AP), which then recovers the complete observations. We use the age of collection (AoC) as a metric for information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when the AP receives all partial updates from different devices (i.e., successfully receives a “joint” update). Consequently, existing AoI-oriented analyses on NOMA cannot be easily generalized to AoC due to the different update rules between AoC and AoI. Conventional NOMA schemes typically employ multiuser decoding (MUD) techniques to decode update messages from different devices, referred to here as the MUD-only NOMA system. However, MUD techniques are less effective when the signal-to-noise ratios (SNRs) of different NOMA users are nearly balanced. Therefore, we consider network-coded multiple access (NCMA), an advanced NOMA scheme that integrates MUD with physical-layer network coding (PNC). PNC is a technique that transforms wireless mutual interference into useful network-coded information, working well even when the SNRs of different users are similar. Experimental results using software-defined radios indicate that NCMA is a practical solution for achieving low average AoC under varying channel conditions. The combination of MUD and PNC enables the AP to receive joint update messages much faster, significantly reducing the average AoC of the system.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111102"},"PeriodicalIF":4.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143402674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning 通过深度强化学习实现联合感知和通信的激励机制车载人群感知

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-10 DOI: 10.1016/j.comnet.2025.111099

Gaoyu Luo , Shanhao Zhan , Chenyi Liang , Zhibin Gao , Yifeng Zhao , Lianfen Huang

Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient

K

and the rewiring probability

p

. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.

{"title":"An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning","authors":"Gaoyu Luo , Shanhao Zhan , Chenyi Liang , Zhibin Gao , Yifeng Zhao , Lianfen Huang","doi":"10.1016/j.comnet.2025.111099","DOIUrl":"10.1016/j.comnet.2025.111099","url":null,"abstract":"<div><div>Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient <span><math><mi>K</mi></math></span> and the rewiring probability <span><math><mi>p</mi></math></span>. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111099"},"PeriodicalIF":4.4,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143421137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Range-free localization algorithm based on modified distance and improved black-winged kite algorithm

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-10 DOI: 10.1016/j.comnet.2025.111091

Haibin Sun, Shuai Yang

Node localization is an important issue in wireless sensor networks and has received increasing attention in the field of IoT in recent years. The Distance Vector-Hop (DV-Hop) algorithm has been widely used due to its low cost and ease of application. However, it suffers from a large error due to the hop counting method and the network structures. In this paper, we optimize the distance estimation process in DV-Hop by proposing an error factor and designing an improved black-winged kite optimization algorithm (IBKA) to solve the problem of location calculation. In simulation tests, the convergence speed and accuracy of the IBKA are verified using different benchmark functions. In addition, the DV-Hop algorithm based on the IBKA is applied to the node localization process and compared with the four recent algorithms. The experimental results show that the algorithm obtains the best localization results on different network environments and C, H, and X-shaped network structures.

引用次数: 0

Exploring coverage and security challenges in wireless sensor networks: A survey

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-08 DOI: 10.1016/j.comnet.2025.111096

Mari M. Moslehi

This survey paper addresses critical issues related to area coverage and security in wireless sensor networks (WSNs). It highlights the essential challenges and corresponding solutions necessary for achieving effective and secure network deployments. The paper underscores the significance of integrating both coverage and security considerations in practical applications, such as environmental monitoring, precision agriculture, and surveillance. Various strategic methods for sensor deployment are discussed, including two-dimensional and three-dimensional approaches, as well as deterministic and stochastic methods. The impact of these strategies on coverage, connectivity, energy efficiency, and scalability is thoroughly analyzed. Additionally, the deployment of both homogeneous and heterogeneous sensors are explored, investigating how differing design criteria influence network deployment, operation, and security.

Key security challenges examined include encryption, authentication mechanisms, intrusion detection, resource depletion, and countermeasures for node compromise attacks. The insights gained from this analysis contribute to enhancing the reliability, energy efficiency, and overall resilience of WSNs, thereby establishing a foundation for future research on secure and efficient network deployment.

{"title":"Exploring coverage and security challenges in wireless sensor networks: A survey","authors":"Mari M. Moslehi","doi":"10.1016/j.comnet.2025.111096","DOIUrl":"10.1016/j.comnet.2025.111096","url":null,"abstract":"<div><div>This survey paper addresses critical issues related to area coverage and security in wireless sensor networks (WSNs). It highlights the essential challenges and corresponding solutions necessary for achieving effective and secure network deployments. The paper underscores the significance of integrating both coverage and security considerations in practical applications, such as environmental monitoring, precision agriculture, and surveillance. Various strategic methods for sensor deployment are discussed, including two-dimensional and three-dimensional approaches, as well as deterministic and stochastic methods. The impact of these strategies on coverage, connectivity, energy efficiency, and scalability is thoroughly analyzed. Additionally, the deployment of both homogeneous and heterogeneous sensors are explored, investigating how differing design criteria influence network deployment, operation, and security.</div><div>Key security challenges examined include encryption, authentication mechanisms, intrusion detection, resource depletion, and countermeasures for node compromise attacks. The insights gained from this analysis contribute to enhancing the reliability, energy efficiency, and overall resilience of WSNs, thereby establishing a foundation for future research on secure and efficient network deployment.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111096"},"PeriodicalIF":4.4,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143394578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Machine learning approaches for predicting link failures in production networks

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-08 DOI: 10.1016/j.comnet.2025.111098

Bruck W. Wubete, Babak Esfandiari, Thomas Kunz

Resolving network failures after they occur through human investigation is a costly and time-consuming process. Predicting upcoming failures could mitigate this to a large extent. In this work, we collect data from a large intercontinental network and study the problem of flapping links, which are indicative of link failures. Such flapping links have their routing metric increased to divert traffic away; this is followed by corrective actions, and eventually their routing metric is lowered again to carry traffic. Using the collected data, primarily metrics reported from Internet Protocol (IP) and optical layers of the network, we develop ML models to predict upcoming link failures. Exploring a sequence of increasingly complex models, we study the relevance of optical metrics, the underlying temporal relations, and the topological relations in improving the predictive model performance. We discovered that optical features such as optical maximum and minimum power or unavailable and errored seconds increased the model’s performance (measured in average precision) by about 9 percentage points while temporal and spatial features improved it further by 8 and 7 percentage points respectively for a total improvement of 24 percentage points.

{"title":"Machine learning approaches for predicting link failures in production networks","authors":"Bruck W. Wubete, Babak Esfandiari, Thomas Kunz","doi":"10.1016/j.comnet.2025.111098","DOIUrl":"10.1016/j.comnet.2025.111098","url":null,"abstract":"<div><div>Resolving network failures after they occur through human investigation is a costly and time-consuming process. Predicting upcoming failures could mitigate this to a large extent. In this work, we collect data from a large intercontinental network and study the problem of flapping links, which are indicative of link failures. Such flapping links have their routing metric increased to divert traffic away; this is followed by corrective actions, and eventually their routing metric is lowered again to carry traffic. Using the collected data, primarily metrics reported from Internet Protocol (IP) and optical layers of the network, we develop ML models to predict upcoming link failures. Exploring a sequence of increasingly complex models, we study the relevance of optical metrics, the underlying temporal relations, and the topological relations in improving the predictive model performance. We discovered that optical features such as optical maximum and minimum power or unavailable and errored seconds increased the model’s performance (measured in average precision) by about 9 percentage points while temporal and spatial features improved it further by 8 and 7 percentage points respectively for a total improvement of 24 percentage points.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111098"},"PeriodicalIF":4.4,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

EVFL-DCs: Enhancing verifiability of federated learning by double commitments based on blockchain

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-07 DOI: 10.1016/j.comnet.2025.111097

Qianjin Wei , Xuanjing Wu , Zhiquan Liu , Gang Rao

In decentralized federated learning networks, the presence of malicious users can lead to distrust among participants, significantly undermining the efficiency of model training. Polynomial commitment techniques map gradients into polynomials and have been widely used in decentralized federated learning schemes. However, existing schemes have yet to address the consistency issue between noisy or masked gradients and their corresponding commitments, specifically the verification of whether a commitment is derived from the original gradient of the noisy or masked gradient. To address this issue, this paper proposes an Enhancing Verifiability and Privacy-Preserving of Federated Learning by Double Commitments based on Blockchain (EVFL-DCs). This scheme addresses the consistency issue between noisy gradients and commitments by designing two commitments based on the statistical properties of differential privacy. In the verification committee, the Central Limit Theorem (CLT) is used to constrain the difference between a noisy gradient and the double commitments, ensuring their consistency. Additionally, the scheme achieves lossless aggregation by aggregating masked gradients. Given that attackers may upload masked gradients inconsistent with their signature commitments, a grouped verification mechanism is introduced. This mechanism refines the scope of consistency verification between masked gradients and commitments by performing aggregation within groups and verifying the consistency of the aggregated gradients and commitments for each group. Even if the verification fails for a particular group, the results of the other groups remain unaffected, thereby ensuring the correctness of the overall aggregation result. Experimental results demonstrate that EVFL-DCs effectively verifies the consistency between noisy or masked gradients and their commitments. Moreover, when the proportion of deceptive attackers is less than 30%, the model’s accuracy is nearly identical to that of a decentralized federated learning scheme without attackers. Furthermore, even when noise impacts the gradients, the accuracy of filtering benign noisy gradients is close to that of filtering benign original gradients.

{"title":"EVFL-DCs: Enhancing verifiability of federated learning by double commitments based on blockchain","authors":"Qianjin Wei , Xuanjing Wu , Zhiquan Liu , Gang Rao","doi":"10.1016/j.comnet.2025.111097","DOIUrl":"10.1016/j.comnet.2025.111097","url":null,"abstract":"<div><div>In decentralized federated learning networks, the presence of malicious users can lead to distrust among participants, significantly undermining the efficiency of model training. Polynomial commitment techniques map gradients into polynomials and have been widely used in decentralized federated learning schemes. However, existing schemes have yet to address the consistency issue between noisy or masked gradients and their corresponding commitments, specifically the verification of whether a commitment is derived from the original gradient of the noisy or masked gradient. To address this issue, this paper proposes an Enhancing Verifiability and Privacy-Preserving of Federated Learning by Double Commitments based on Blockchain (EVFL-DCs). This scheme addresses the consistency issue between noisy gradients and commitments by designing two commitments based on the statistical properties of differential privacy. In the verification committee, the Central Limit Theorem (CLT) is used to constrain the difference between a noisy gradient and the double commitments, ensuring their consistency. Additionally, the scheme achieves lossless aggregation by aggregating masked gradients. Given that attackers may upload masked gradients inconsistent with their signature commitments, a grouped verification mechanism is introduced. This mechanism refines the scope of consistency verification between masked gradients and commitments by performing aggregation within groups and verifying the consistency of the aggregated gradients and commitments for each group. Even if the verification fails for a particular group, the results of the other groups remain unaffected, thereby ensuring the correctness of the overall aggregation result. Experimental results demonstrate that EVFL-DCs effectively verifies the consistency between noisy or masked gradients and their commitments. Moreover, when the proportion of deceptive attackers is less than 30%, the model’s accuracy is nearly identical to that of a decentralized federated learning scheme without attackers. Furthermore, even when noise impacts the gradients, the accuracy of filtering benign noisy gradients is close to that of filtering benign original gradients.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111097"},"PeriodicalIF":4.4,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143429406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhancing Extended Reality Assisted Surgery through a Field-of-View Video Delivery Optimization

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-06 DOI: 10.1016/j.comnet.2025.111093

Daria Alekseeva , Anzhelika Mezina , Radim Burget , Otso Arponen , Elena Simona Lohan , Aleksandr Ometov

Emerging Extended Reality (XR) applications bring new opportunities for digital healthcare systems, i.e., eHealth. XR-assisted surgery is one of the most outstanding examples of future technology that has a high social impact on the healthcare and medical educational system. The current work presents the intelligent design for remote XR-assisted surgery. The study presents the Field-of-View (FoV)-based viewport model empowered with behavioral data. It applies the viewport prediction model based on the behavioral data by applying Artificial Neural Network (ANN) and Long Short-Term Memory (LSTM). In the final analysis, LSTM showed lower errors and a higher coefficient of determination, but ANN performed much faster. Finally, the study defines the dynamic system’s states for adaptive and fast video delivery concerning Quality of Experience (QoE). The presented approach aims to mitigate the delay to ensure smooth playback and display high-quality images.

引用次数: 0

KTWIN: A serverless Kubernetes-based Digital Twin platform

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-06 DOI: 10.1016/j.comnet.2025.111095

Alexandre Gustavo Wermann, Juliano Araujo Wickboldt

Digital Twins (DTs) systems are virtual representations of physical assets allowing organizations to gain insights and improve existing processes. In practice, DTs require proper modeling, coherent development and seamless deployment along cloud and edge landscapes relying on established patterns to reduce operational costs. In this work, we propose KTWIN a Kubernetes-based Serverless Platform for Digital Twins. KTWIN was developed using the state-of-the-art open-source Cloud Native tools, allowing DT operators to easily define models through open standards and configure details of the underlying services and infrastructure. The experiments carried out with the developed prototype show that KTWIN can provide a higher level of abstraction to model and deploy a Digital Twin use case without compromising the solution scalability. The tests performed also show cost savings ranging between 60% and 80% compared to overprovisioned scenarios.

引用次数: 0

Mx-TORU: Location-aware multi-hop task offloading and resource optimization protocol for connected vehicle networks

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-06 DOI: 10.1016/j.comnet.2025.111094

Oğuzhan Akyıldız , Feyza Yıldırım Okay , İbrahim Kök , Suat Özdemir

Connected Vehicle Networks (CVNs), as a part of Internet of Vehicles (IoV), represent an innovative solution for enhancing communication between vehicles and Internet of Things (IoT) devices within transportation infrastructures. However, task offloading in CVNs presents significant challenges due to high computational demands and the dynamic nature of network conditions. While traditional static fog networks support CVNs, they often suffer from inefficiencies in resource allocation, leading to underutilization or over-utilization, as well as elevated maintenance costs. To address these limitations, mobile fog computing emerges as a more adaptable solution, enabling efficient task processing by leveraging the resources of nearby vehicles. In this paper, we introduce a novel mobility-driven protocol, Mx-TORU, which combines multi-hop task offloading with resource optimization to enhance task processing efficiency in CVNs. This protocol builds upon our previously proposed MobTORU framework, aiming to maximize resource utilization through dynamic multi-hop strategies. Extensive experiments using real-world vehicular mobility data demonstrate that Mx-TORU improves resource utilization by up to 17.8% compared to one-hop methods. Additionally, our Mx-TORU protocol and the employed RELiOff algorithm show a consistent improvement of at least 5% in task offloading efficiency across various test scenarios including intelligent transformation systems.

{"title":"Mx-TORU: Location-aware multi-hop task offloading and resource optimization protocol for connected vehicle networks","authors":"Oğuzhan Akyıldız , Feyza Yıldırım Okay , İbrahim Kök , Suat Özdemir","doi":"10.1016/j.comnet.2025.111094","DOIUrl":"10.1016/j.comnet.2025.111094","url":null,"abstract":"<div><div>Connected Vehicle Networks (CVNs), as a part of Internet of Vehicles (IoV), represent an innovative solution for enhancing communication between vehicles and Internet of Things (IoT) devices within transportation infrastructures. However, task offloading in CVNs presents significant challenges due to high computational demands and the dynamic nature of network conditions. While traditional static fog networks support CVNs, they often suffer from inefficiencies in resource allocation, leading to underutilization or over-utilization, as well as elevated maintenance costs. To address these limitations, mobile fog computing emerges as a more adaptable solution, enabling efficient task processing by leveraging the resources of nearby vehicles. In this paper, we introduce a novel mobility-driven protocol, Mx-TORU, which combines multi-hop task offloading with resource optimization to enhance task processing efficiency in CVNs. This protocol builds upon our previously proposed MobTORU framework, aiming to maximize resource utilization through dynamic multi-hop strategies. Extensive experiments using real-world vehicular mobility data demonstrate that Mx-TORU improves resource utilization by up to 17.8% compared to one-hop methods. Additionally, our Mx-TORU protocol and the employed RELiOff algorithm show a consistent improvement of at least 5% in task offloading efficiency across various test scenarios including intelligent transformation systems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111094"},"PeriodicalIF":4.4,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143372267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A cost-efficient traffic engineering framework with various pricing schemes in clouds

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks

Pub Date : 2025-02-06 DOI: 10.1016/j.comnet.2025.111090

Jingzhou Wang , Gongming Zhao , Hongli Xu , Chunming Qiao , He Huang

The rapid growth of cloud services has brought a significant increase in inter-datacenter traffic. To transfer data among geographically distributed datacenters, cloud providers need to purchase bandwidth from ISPs. The data transferring cost has become one of the major expenses for cloud providers. Therefore, it is essential for a cloud provider to carefully allocate inter-datacenter traffic among the ISPs’ links to minimize the costs. Exiting solutions mainly focus on the situations where all links adopt the same pricing scheme. However, in practice, ISPs usually provide multiple pricing schemes for their links due to market competition, which makes the existing solutions non-optimal. Thus, a new traffic engineering approach that considers various pricing schemes is needed. This paper presents COIN, a new framework for cost-efficient traffic engineering with various pricing schemes. We propose a partition rounding traffic engineering algorithm based on linear independence analysis. The approximation factors and time complexity are formally analyzed. We further conduct large-scale simulations with real-world topologies and datasets. Extensive simulation results show that COIN can save the data transferring cost by up to 63.4% compared with the state-of-the-art solutions.

{"title":"A cost-efficient traffic engineering framework with various pricing schemes in clouds","authors":"Jingzhou Wang , Gongming Zhao , Hongli Xu , Chunming Qiao , He Huang","doi":"10.1016/j.comnet.2025.111090","DOIUrl":"10.1016/j.comnet.2025.111090","url":null,"abstract":"<div><div>The rapid growth of cloud services has brought a significant increase in inter-datacenter traffic. To transfer data among geographically distributed datacenters, cloud providers need to purchase bandwidth from ISPs. The data transferring cost has become one of the major expenses for cloud providers. Therefore, it is essential for a cloud provider to carefully allocate inter-datacenter traffic among the ISPs’ links to minimize the costs. Exiting solutions mainly focus on the situations where all links adopt the same pricing scheme. However, in practice, ISPs usually provide multiple pricing schemes for their links due to market competition, which makes the existing solutions non-optimal. Thus, a new traffic engineering approach that considers various pricing schemes is needed. This paper presents COIN, a new framework for cost-efficient traffic engineering with various pricing schemes. We propose a partition rounding traffic engineering algorithm based on linear independence analysis. The approximation factors and time complexity are formally analyzed. We further conduct large-scale simulations with real-world topologies and datasets. Extensive simulation results show that COIN can save the data transferring cost by up to 63.4% compared with the state-of-the-art solutions.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111090"},"PeriodicalIF":4.4,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Computer Networks

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀