首页 > 最新文献

Computer Networks最新文献

英文 中文
3DDPS: A traffic matrix estimation method based on three-dimensional diffusion posterior sampling
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.111007
Minyue Li , Yan Qiao , Rongyao Hu , Pei Zhao , Junjie Wang , Zhenchun Wei , Xuesen Ma , Wenjing Li
Traffic matrix (TM) estimation is an essential but high-cost task for network management. A rational way is to estimate the TMs from the low-cost link load measurements by solving a group of linear equations. However, one open challenge is these linear equations are severely ill-posed in most cases. Fortunately, the emerging deep generative models offer new advanced ways to well address the ill-posed problem. In this paper, we leverage the powerful ability of diffusion models to propose a novel TM estimation framework (named 3DDPS-TME). Different from existing generative-based TM estimation methods, our new method reconstructs the raw TM data into 3D-tensor samples and modifies the typical diffusion framework to 3D-UNet to learn the spatio-temporal correlations of TMs. Furthermore, we adopt diffusion posterior sampling (DPS) for conditional sampling to produce an unbiased TM through a single sampling process. Through extensive experiments and comprehensive comparisons with four state-of-the-art baselines, the experimental results demonstrate that our method exhibits a significant superiority in both estimation accuracy and time consumption. Particularly, using only 0.03%10.43% computational cost of the baseline methods, our method makes an improvement of 27%68% in terms of estimation accuracy. The codes of the experiments with the proposed methods are available at https://github.com/depositoryL/3DDPS-TME.git.
{"title":"3DDPS: A traffic matrix estimation method based on three-dimensional diffusion posterior sampling","authors":"Minyue Li ,&nbsp;Yan Qiao ,&nbsp;Rongyao Hu ,&nbsp;Pei Zhao ,&nbsp;Junjie Wang ,&nbsp;Zhenchun Wei ,&nbsp;Xuesen Ma ,&nbsp;Wenjing Li","doi":"10.1016/j.comnet.2024.111007","DOIUrl":"10.1016/j.comnet.2024.111007","url":null,"abstract":"<div><div>Traffic matrix (TM) estimation is an essential but high-cost task for network management. A rational way is to estimate the TMs from the low-cost link load measurements by solving a group of linear equations. However, one open challenge is these linear equations are severely ill-posed in most cases. Fortunately, the emerging deep generative models offer new advanced ways to well address the ill-posed problem. In this paper, we leverage the powerful ability of diffusion models to propose a novel TM estimation framework (named 3DDPS-TME). Different from existing generative-based TM estimation methods, our new method reconstructs the raw TM data into 3D-tensor samples and modifies the typical diffusion framework to 3D-UNet to learn the spatio-temporal correlations of TMs. Furthermore, we adopt diffusion posterior sampling (DPS) for conditional sampling to produce an unbiased TM through a single sampling process. Through extensive experiments and comprehensive comparisons with four state-of-the-art baselines, the experimental results demonstrate that our method exhibits a significant superiority in both estimation accuracy and time consumption. Particularly, using only 0.03%<span><math><mo>∼</mo></math></span>10.43% computational cost of the baseline methods, our method makes an improvement of 27%<span><math><mo>∼</mo></math></span>68% in terms of estimation accuracy. The codes of the experiments with the proposed methods are available at <span><span>https://github.com/depositoryL/3DDPS-TME.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111007"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129208","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
Physically-consistent EM models-aware RIS-aided communication — A survey
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110963
S. Bidabadi , M.A. Ouameur , M. Bagaa , D. Massicotte , F.D. Figueiredo , A. Chaaban
The rapid development of reconfigurable intelligent surfaces (RISs) has sparked transformative advancements in wireless communication systems. These intelligent metasurfaces, adept at dynamically manipulating electromagnetic (EM) waves, hold vast potential for enhancing network capacity, coverage, and efficiency. However, to fully unleash the capabilities of RIS-aided communication systems, effective optimization is crucial. This article provides a recent development of RIS-assisted communication from the viewpoint of physically-consistent EM models. We delve into the realm of physically-consistent EM models, highlighting their pivotal role in achieving robust and efficient RIS designs. Furthermore, this paper offers a survey of the different optimization models utilized for RIS-assisted wireless communication systems, which consider various EM and physical aspects of RIS. We explore solution approaches aimed at optimizing different objectives like sum-rate/spectral efficiency and energy efficiency, spanning traditional optimization models to machine learning-based methods. Additionally, we discuss some open research issues in this field.
{"title":"Physically-consistent EM models-aware RIS-aided communication — A survey","authors":"S. Bidabadi ,&nbsp;M.A. Ouameur ,&nbsp;M. Bagaa ,&nbsp;D. Massicotte ,&nbsp;F.D. Figueiredo ,&nbsp;A. Chaaban","doi":"10.1016/j.comnet.2024.110963","DOIUrl":"10.1016/j.comnet.2024.110963","url":null,"abstract":"<div><div>The rapid development of reconfigurable intelligent surfaces (RISs) has sparked transformative advancements in wireless communication systems. These intelligent metasurfaces, adept at dynamically manipulating electromagnetic (EM) waves, hold vast potential for enhancing network capacity, coverage, and efficiency. However, to fully unleash the capabilities of RIS-aided communication systems, effective optimization is crucial. This article provides a recent development of RIS-assisted communication from the viewpoint of physically-consistent EM models. We delve into the realm of physically-consistent EM models, highlighting their pivotal role in achieving robust and efficient RIS designs. Furthermore, this paper offers a survey of the different optimization models utilized for RIS-assisted wireless communication systems, which consider various EM and physical aspects of RIS. We explore solution approaches aimed at optimizing different objectives like sum-rate/spectral efficiency and energy efficiency, spanning traditional optimization models to machine learning-based methods. Additionally, we discuss some open research issues in this field.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110963"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129211","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
A DRL-based RAQ-GERT dynamic resource allocation algorithm considering utility for multibeam satellite system
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.110940
Shuang Wu, Zhigeng Fang, Chenchen Hua, Liangyan Tao, Jingru Zhang
With the evolution and popularity of smart devices, the demand and requirement (e.g., communication, file transfer) of satellite users have increased rapidly. Moreover, users have different preferences for services and the quality of service (QoS), like delay and throughput, which leads to user heterogeneity. Facing numerous, time-varying, and heterogeneous users, how to dynamically allocate limited spectrum and on-board power while satisfying user requirements is the major challenge for the multibeam satellite system (MSS). Aiming to seek a solution, firstly, the resource allocation queue graphical evaluation and review technique (RAQ-GERT) network is constructed to describe the service process of the MSS, as well as to compute the channel condition parameters during the whole process. Next, appropriate QoS indicators are selected based on user requirements. Then, QoS indicators are calculated from the results of the RAQ-GERT network, which are combined to form the optimization objective of the MSS by drawing on the Cobb–Douglas utility function. After that, guided by the utility of the MSS, the proximal policy optimization (PPO) algorithm is applied to explore the optimal resource allocation scheme in this heterogeneous user scenario. Finally, the simulation comparisons show that the proposed scheme has enhancements in several performances, up to 42.19 % in service rate, 53.58 % in system capacity, and 3.42 % in throughput with minimal increase in latency.
{"title":"A DRL-based RAQ-GERT dynamic resource allocation algorithm considering utility for multibeam satellite system","authors":"Shuang Wu,&nbsp;Zhigeng Fang,&nbsp;Chenchen Hua,&nbsp;Liangyan Tao,&nbsp;Jingru Zhang","doi":"10.1016/j.comnet.2024.110940","DOIUrl":"10.1016/j.comnet.2024.110940","url":null,"abstract":"<div><div>With the evolution and popularity of smart devices, the demand and requirement (e.g., communication, file transfer) of satellite users have increased rapidly. Moreover, users have different preferences for services and the quality of service (QoS), like delay and throughput, which leads to user heterogeneity. Facing numerous, time-varying, and heterogeneous users, how to dynamically allocate limited spectrum and on-board power while satisfying user requirements is the major challenge for the multibeam satellite system (MSS). Aiming to seek a solution, firstly, the resource allocation queue graphical evaluation and review technique (RAQ-GERT) network is constructed to describe the service process of the MSS, as well as to compute the channel condition parameters during the whole process. Next, appropriate QoS indicators are selected based on user requirements. Then, QoS indicators are calculated from the results of the RAQ-GERT network, which are combined to form the optimization objective of the MSS by drawing on the Cobb–Douglas utility function. After that, guided by the utility of the MSS, the proximal policy optimization (PPO) algorithm is applied to explore the optimal resource allocation scheme in this heterogeneous user scenario. Finally, the simulation comparisons show that the proposed scheme has enhancements in several performances, up to 42.19 % in service rate, 53.58 % in system capacity, and 3.42 % in throughput with minimal increase in latency.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110940"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143129821","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
ES-SDPC: A secure and trusted SDP framework
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2025.111038
Zheng Zhang , Quan Ren , Jie Lu , Yuxiang Hu , Hongchang Chen
Software-Defined Perimeter (SDP) provided a logical perimeter to restrict trusted access to the service. However, because of unknown security vulnerabilities in the controller, the authentication and authorization information has been maliciously tampered with, resulting in SDP controller failure. Therefore, this paper first proposes a flexible and secure Intrinsic Security SDP Controller (ES-SDPC) architecture. The ES-SDPC architecture consists of an endogenous secure SDP controller, which is authorized by the master controller and backed up by the slave controller to avoid the delay increase of multiple control information updates. Secondly, this paper proposes an evaluation model for ES-SDPC to theoretically analyze the intrinsic security performance of the ES-SDPC architecture. Finally, this paper implements ES-SDPC in a prototype system and conducts simulations and experiments in different language groups. The evaluation results indicate that, under reasonable configuration, ES-SDPC can ensure high reliability for 1724.68 h and provide 92.4% secure connections in environments facing three malicious attacks. When facing differential mode attacks, the throughput of ES-SDPC is 18.78% higher than that of Byzantine fault-tolerant systems, and the latency overhead is 16.16% lower.
{"title":"ES-SDPC: A secure and trusted SDP framework","authors":"Zheng Zhang ,&nbsp;Quan Ren ,&nbsp;Jie Lu ,&nbsp;Yuxiang Hu ,&nbsp;Hongchang Chen","doi":"10.1016/j.comnet.2025.111038","DOIUrl":"10.1016/j.comnet.2025.111038","url":null,"abstract":"<div><div>Software-Defined Perimeter (SDP) provided a logical perimeter to restrict trusted access to the service. However, because of unknown security vulnerabilities in the controller, the authentication and authorization information has been maliciously tampered with, resulting in SDP controller failure. Therefore, this paper first proposes a flexible and secure Intrinsic Security SDP Controller (ES-SDPC) architecture. The ES-SDPC architecture consists of an endogenous secure SDP controller, which is authorized by the master controller and backed up by the slave controller to avoid the delay increase of multiple control information updates. Secondly, this paper proposes an evaluation model for ES-SDPC to theoretically analyze the intrinsic security performance of the ES-SDPC architecture. Finally, this paper implements ES-SDPC in a prototype system and conducts simulations and experiments in different language groups. The evaluation results indicate that, under reasonable configuration, ES-SDPC can ensure high reliability for 1724.68 h and provide 92.4% secure connections in environments facing three malicious attacks. When facing differential mode attacks, the throughput of ES-SDPC is 18.78% higher than that of Byzantine fault-tolerant systems, and the latency overhead is 16.16% lower.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111038"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176534","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
Multi-rate multicasting aided NOMA for addressing the multiuser diversity in beyond 5G
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2025.111041
Ernesto Fontes Pupo , Claudia Carballo González , Eneko Iradier , Jon Montalban , Pablo Angueira , Maurizio Murroni
The envisaged fifth-generation (5G) and beyond networks offer unprecedented breakthroughs in media service delivery, stringent requirements, and challenging use cases. In such context, point-to-multipoint communications have proved to be highly efficient in delivering high-quality multimedia services over wireless networks. For the upcoming Beyond-5G (B5G) system releases, the Multicast/Broadcast Services (MBS) capability is an appealing feature that addresses the ever-growing traffic demands, disruptive multimedia services, massive connectivity, and low-latency applications. This paper addresses the multicast users’ channel quality diversity throughout multi-rate multicasting aided non-orthogonal multiple access (NOMA) over B5G MBS use cases. We propose a tailored radio resource management (RRM) strategy aided by K-Means subgrouping to deal with such diversity. We characterize and identify conditions for an effective coexistence of the benchmarks conventional multicast scheme (CMS) and subgrouping based on OMA (SOM) with the proposed subgrouping based on NOMA (SNOM). The proposed solution is assessed under a wide range of users’ distributions, throughput requirements, and network conditions of an MBS use case recreated through link-level millimeter-wave (mmWave) simulations.
{"title":"Multi-rate multicasting aided NOMA for addressing the multiuser diversity in beyond 5G","authors":"Ernesto Fontes Pupo ,&nbsp;Claudia Carballo González ,&nbsp;Eneko Iradier ,&nbsp;Jon Montalban ,&nbsp;Pablo Angueira ,&nbsp;Maurizio Murroni","doi":"10.1016/j.comnet.2025.111041","DOIUrl":"10.1016/j.comnet.2025.111041","url":null,"abstract":"<div><div>The envisaged fifth-generation (5G) and beyond networks offer unprecedented breakthroughs in media service delivery, stringent requirements, and challenging use cases. In such context, point-to-multipoint communications have proved to be highly efficient in delivering high-quality multimedia services over wireless networks. For the upcoming Beyond-5G (B5G) system releases, the Multicast/Broadcast Services (MBS) capability is an appealing feature that addresses the ever-growing traffic demands, disruptive multimedia services, massive connectivity, and low-latency applications. This paper addresses the multicast users’ channel quality diversity throughout multi-rate multicasting aided non-orthogonal multiple access (NOMA) over B5G MBS use cases. We propose a tailored radio resource management (RRM) strategy aided by K-Means subgrouping to deal with such diversity. We characterize and identify conditions for an effective coexistence of the benchmarks conventional multicast scheme (CMS) and subgrouping based on OMA (SOM) with the proposed subgrouping based on NOMA (SNOM). The proposed solution is assessed under a wide range of users’ distributions, throughput requirements, and network conditions of an MBS use case recreated through link-level millimeter-wave (mmWave) simulations.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111041"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176538","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
A novel recommendation-based framework for reconnecting and selecting the efficient friendship path in the heterogeneous social IoT network
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.111016
Babak Farhadi , Parvaneh Asghari , Ebrahim Mahdipour , Hamid Haj Seyyed Javadi
Automating the selection process for the most suitable service in a dynamic Internet of Things (IoT) ecosystem to improve critical metrics such as resilience, throughput, delay, energy consumption, confidence level, and cost is considered an important challenge, and in this regard, the Social Internet of Things (SIoT) paradigm has greatly helped to deal with this challenge through the merging of Complex Network (CN) principles within the IoT domain. In this study, we combined metaheuristics and Deep Reinforcement Learning (DRL) to develop a new unsupervised group-driven recommender framework for predicting, reconnecting, and choosing the optimal friendship path between requester and service provider nodes in a SIoT environment. There are four main phases to the presented framework. We first suggested a new method to learn features associated with the heterogeneous social IoT structure and detect ever-changing semantically related clusters. In the second phase, we propose a novel optimization model that utilizes the Artificial Bee Colony (ABC) metaheuristics to accurately predict community-oriented social connections. We came up with a new strategy to select an efficient group-based friendship path in the third phase. It hybridized the techniques of metaheuristic-driven Ant Colony Optimization (ACO) and DRL-oriented Proximal Policy Optimization (PPO). In the final phase, we introduce an innovative ACO-centered recommender model to improve the framework's accuracy and speed while also providing socially aware, community-driven service recommendations. We conducted extensive experiments on four real-world datasets to assess the efficacy of the proposed framework, and the findings show that it outperforms leading baselines.
{"title":"A novel recommendation-based framework for reconnecting and selecting the efficient friendship path in the heterogeneous social IoT network","authors":"Babak Farhadi ,&nbsp;Parvaneh Asghari ,&nbsp;Ebrahim Mahdipour ,&nbsp;Hamid Haj Seyyed Javadi","doi":"10.1016/j.comnet.2024.111016","DOIUrl":"10.1016/j.comnet.2024.111016","url":null,"abstract":"<div><div>Automating the selection process for the most suitable service in a dynamic Internet of Things (IoT) ecosystem to improve critical metrics such as resilience, throughput, delay, energy consumption, confidence level, and cost is considered an important challenge, and in this regard, the Social Internet of Things (SIoT) paradigm has greatly helped to deal with this challenge through the merging of Complex Network (CN) principles within the IoT domain. In this study, we combined metaheuristics and Deep Reinforcement Learning (DRL) to develop a new unsupervised group-driven recommender framework for predicting, reconnecting, and choosing the optimal friendship path between requester and service provider nodes in a SIoT environment. There are four main phases to the presented framework. We first suggested a new method to learn features associated with the heterogeneous social IoT structure and detect ever-changing semantically related clusters. In the second phase, we propose a novel optimization model that utilizes the Artificial Bee Colony (ABC) metaheuristics to accurately predict community-oriented social connections. We came up with a new strategy to select an efficient group-based friendship path in the third phase. It hybridized the techniques of metaheuristic-driven Ant Colony Optimization (ACO) and DRL-oriented Proximal Policy Optimization (PPO). In the final phase, we introduce an innovative ACO-centered recommender model to improve the framework's accuracy and speed while also providing socially aware, community-driven service recommendations. We conducted extensive experiments on four real-world datasets to assess the efficacy of the proposed framework, and the findings show that it outperforms leading baselines.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111016"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177135","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
Data-driven active session identification for LTE user-perceived QoS analysis
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2025.111042
Jonghun Yoon, Yunbae Kim, Hyeyeon Kwon, Seungkeun Park
While the telecommunications landscape is undergoing a significant transformation with the advent of 5G technology, the continued importance of Long Term Evolution (LTE) is also emphasized due to its widespread adoption and reliability. In this circumstance, mobile network operators must continue to uphold their obligation to ensure Quality of Service (QoS) for LTE users. The actual LTE Base Station (BS) signal measurement data can be effectively exploited in the evaluation of user-perceived QoS. In this work, we utilize Downlink Control Information (DCI) data obtained from LTE BSs through a recently developed platform. The DCI data contains downlink information experienced by all users within the cell, but to assess user-perceived performance, it is necessary to distinguish each active session. We call the grouping of DCI messages that correspond to a continuous service in one active session ‘bundling’. While previous bundling methods have mostly focused on the time gap between DCI messages, we extract features based on the LTE standard that DCI can exhibit at the start of an active session. By combining these features with a probabilistic approach, we establish criteria for implementing bundling. In addition, through the proposed bundling methodology, we analyze the active session duration, number of active sessions, cell edge user performance, etc. The results validate the effectiveness of our bundling approach.
{"title":"Data-driven active session identification for LTE user-perceived QoS analysis","authors":"Jonghun Yoon,&nbsp;Yunbae Kim,&nbsp;Hyeyeon Kwon,&nbsp;Seungkeun Park","doi":"10.1016/j.comnet.2025.111042","DOIUrl":"10.1016/j.comnet.2025.111042","url":null,"abstract":"<div><div>While the telecommunications landscape is undergoing a significant transformation with the advent of 5G technology, the continued importance of Long Term Evolution (LTE) is also emphasized due to its widespread adoption and reliability. In this circumstance, mobile network operators must continue to uphold their obligation to ensure Quality of Service (QoS) for LTE users. The actual LTE Base Station (BS) signal measurement data can be effectively exploited in the evaluation of user-perceived QoS. In this work, we utilize Downlink Control Information (DCI) data obtained from LTE BSs through a recently developed platform. The DCI data contains downlink information experienced by all users within the cell, but to assess user-perceived performance, it is necessary to distinguish each active session. We call the grouping of DCI messages that correspond to a continuous service in one active session ‘bundling’. While previous bundling methods have mostly focused on the time gap between DCI messages, we extract features based on the LTE standard that DCI can exhibit at the start of an active session. By combining these features with a probabilistic approach, we establish criteria for implementing bundling. In addition, through the proposed bundling methodology, we analyze the active session duration, number of active sessions, cell edge user performance, etc. The results validate the effectiveness of our bundling approach.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111042"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177369","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 congestion control framework for heterogeneous storage structure IoT node
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2025.111058
Shi Wang, Dayan Cao, Xiaoying Zhu, Han Jiang, Mingyu Wang
Congestion control schemes are essential to optimize the transmission performance of internet of thing nodes. Under heterogeneous storage structures including single and hybrid storage structures, how to design and evaluate congestion control schemes remains an open question. Aiming at this problem, buffer scheduling probability distribution vector (BSV) is designed for quantitative describe result of inter-buffer scheduling under hybrid storage structures. Congestion control probability distribution vector (CCV) is designed to characterize single-buffer congestion control result. Based on BSV and CCV, a single-node performance evaluation framework with flexibly configurable parameters under heterogeneous storage structures is proposed. The framework capable of obtaining closed-form steady-state solutions for the comprehensive performance evaluation metrics of single nodes such as rejection rate, throughput and delay is proposed. Based on prediction and triage of self-similar network data, a expectation congestion control (PT-ECC) scheme and a probability distribution congestion control (PT-PDCC) scheme aims to improving node’s transmission performance is presented. Numerical results show that the PT-ECC scheme and PT-PDCC scheme can improve node’s performance and suppression effect for data-intensive suddenly traffic congestion compared to existing congestion control schemes. Furthermore, the effectiveness of the proposed system in evaluating and design congestion control schemes based on hybrid storage structures is demonstrated.
{"title":"A congestion control framework for heterogeneous storage structure IoT node","authors":"Shi Wang,&nbsp;Dayan Cao,&nbsp;Xiaoying Zhu,&nbsp;Han Jiang,&nbsp;Mingyu Wang","doi":"10.1016/j.comnet.2025.111058","DOIUrl":"10.1016/j.comnet.2025.111058","url":null,"abstract":"<div><div>Congestion control schemes are essential to optimize the transmission performance of internet of thing nodes. Under heterogeneous storage structures including single and hybrid storage structures, how to design and evaluate congestion control schemes remains an open question. Aiming at this problem, buffer scheduling probability distribution vector (BSV) is designed for quantitative describe result of inter-buffer scheduling under hybrid storage structures. Congestion control probability distribution vector (CCV) is designed to characterize single-buffer congestion control result. Based on BSV and CCV, a single-node performance evaluation framework with flexibly configurable parameters under heterogeneous storage structures is proposed. The framework capable of obtaining closed-form steady-state solutions for the comprehensive performance evaluation metrics of single nodes such as rejection rate, throughput and delay is proposed. Based on prediction and triage of self-similar network data, a expectation congestion control (PT-ECC) scheme and a probability distribution congestion control (PT-PDCC) scheme aims to improving node’s transmission performance is presented. Numerical results show that the PT-ECC scheme and PT-PDCC scheme can improve node’s performance and suppression effect for data-intensive suddenly traffic congestion compared to existing congestion control schemes. Furthermore, the effectiveness of the proposed system in evaluating and design congestion control schemes based on hybrid storage structures is demonstrated.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111058"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143177529","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
Opportunistic routing for mobile edge computing: A community detected and task priority aware approach
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-02-01 DOI: 10.1016/j.comnet.2024.111000
Jia Wu , Tingyi Dai , Peiyuan Guan , Ziru Chen , Fangfang Gou , Amir Taherkordi
As the 5G era develops quickly, there has been a significant growth in the amount of network data. Concurrently, traditional routing algorithms are encountering growing challenges. Traditional routing algorithms typically rely on maintaining stable end-to-end paths to facilitate smooth data transmission. However, in wireless multi-hop networks, the mobility of nodes and the dynamic nature of network topology make maintaining stable end-to-end paths exceedingly difficult, if not impossible. Consequently, data transmission efficiency decreases while network overhead increases. To address these challenges, opportunistic routing has emerged. Opportunistic routing is self-organizing networks that rely on chance encounters between nodes to transmit messages, and the store-and-carry forwarding technique is used for data transmission between nodes. Typically, most traditional opportunistic routing algorithms divide nodes into communities. However, such approaches often overlook node characteristics, potentially leading to disparate nodes being assigned to separate communities despite positive correlations. Thus, accurately dividing communities remains a significant challenge. To address this, we propose the Efficient Community Detection Data Transmitting (ECDDT) algorithm. During community detection, ECDDT combines social attributes and network topology using mobile edge computing. Subsequently, to expedite task execution, we schedule these tasks in a reasonable manner. Through simulation experiments across four diverse real datasets, we evaluate the algorithm’s efficacy. Our findings demonstrate favorable performance in delivery rate and routing overhead.
{"title":"Opportunistic routing for mobile edge computing: A community detected and task priority aware approach","authors":"Jia Wu ,&nbsp;Tingyi Dai ,&nbsp;Peiyuan Guan ,&nbsp;Ziru Chen ,&nbsp;Fangfang Gou ,&nbsp;Amir Taherkordi","doi":"10.1016/j.comnet.2024.111000","DOIUrl":"10.1016/j.comnet.2024.111000","url":null,"abstract":"<div><div>As the 5G era develops quickly, there has been a significant growth in the amount of network data. Concurrently, traditional routing algorithms are encountering growing challenges. Traditional routing algorithms typically rely on maintaining stable end-to-end paths to facilitate smooth data transmission. However, in wireless multi-hop networks, the mobility of nodes and the dynamic nature of network topology make maintaining stable end-to-end paths exceedingly difficult, if not impossible. Consequently, data transmission efficiency decreases while network overhead increases. To address these challenges, opportunistic routing has emerged. Opportunistic routing is self-organizing networks that rely on chance encounters between nodes to transmit messages, and the store-and-carry forwarding technique is used for data transmission between nodes. Typically, most traditional opportunistic routing algorithms divide nodes into communities. However, such approaches often overlook node characteristics, potentially leading to disparate nodes being assigned to separate communities despite positive correlations. Thus, accurately dividing communities remains a significant challenge. To address this, we propose the Efficient Community Detection Data Transmitting (ECDDT) algorithm. During community detection, ECDDT combines social attributes and network topology using mobile edge computing. Subsequently, to expedite task execution, we schedule these tasks in a reasonable manner. Through simulation experiments across four diverse real datasets, we evaluate the algorithm’s efficacy. Our findings demonstrate favorable performance in delivery rate and routing overhead.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111000"},"PeriodicalIF":4.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143178141","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 security-enhanced certificateless conditional privacy-preserving authentication scheme with collusion-resistance for IoV
IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2025-01-31 DOI: 10.1016/j.comnet.2025.111084
Feixiang Ye, Wanqing Wu
Currently, Certificateless Conditional Privacy-Preserving Authentication (CLCPPA) schemes have been widely adopted to address security and privacy issues in the Internet of Vehicles (IoV). Recently, Genc et al. proposed an efficient CLCPPA scheme based on Elliptic Curve Cryptography (ECC), named ELCPAS, which features non-pairing, lightweight, and low-cost characteristics. It also supports batch verification to improve the efficiency of verifying multiple signatures. Unfortunately, the analysis reveals that this scheme is vulnerable to the forgery signature attack from Type-1 and Type-2 adversaries under the certificateless cryptography security model. Additionally, the batch verification algorithm in this scheme, as well as in most related CLCPPA schemes, is susceptible to the collusion attack from the emerging Type-3 adversary. To this end, we analyze Genc et al.’s scheme and provide the attack processes and countermeasures in detail. In particular, we present two potential attack ways from the Type-3 adversary, named injection and signature-swapping attacks. Then, a security-enhanced CLCPPA scheme with collusion-resistance for IoV is proposed, which can be formally proven to resist forgery attacks from Type-1 and Type-2 adversaries based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). Meanwhile, for the Type-3 adversary, we propose the security model applicable to the batch verification scenario and introduce the Small Exponent Test (SET) technology to withstand such attacks, along with the rigorous formal security proof for this method. Performance analysis shows that compared with related CLCPPA schemes, the proposed scheme not only provides more comprehensive security but also maintains lower costs. Specifically, compared with Genc et al.’s scheme, the proposed scheme can maintain similar performance while ensuring enhanced security.
{"title":"A security-enhanced certificateless conditional privacy-preserving authentication scheme with collusion-resistance for IoV","authors":"Feixiang Ye,&nbsp;Wanqing Wu","doi":"10.1016/j.comnet.2025.111084","DOIUrl":"10.1016/j.comnet.2025.111084","url":null,"abstract":"<div><div>Currently, Certificateless Conditional Privacy-Preserving Authentication (CLCPPA) schemes have been widely adopted to address security and privacy issues in the Internet of Vehicles (IoV). Recently, Genc et al. proposed an efficient CLCPPA scheme based on Elliptic Curve Cryptography (ECC), named ELCPAS, which features non-pairing, lightweight, and low-cost characteristics. It also supports batch verification to improve the efficiency of verifying multiple signatures. Unfortunately, the analysis reveals that this scheme is vulnerable to the forgery signature attack from Type-1 and Type-2 adversaries under the certificateless cryptography security model. Additionally, the batch verification algorithm in this scheme, as well as in most related CLCPPA schemes, is susceptible to the collusion attack from the emerging Type-3 adversary. To this end, we analyze Genc et al.’s scheme and provide the attack processes and countermeasures in detail. In particular, we present two potential attack ways from the Type-3 adversary, named injection and signature-swapping attacks. Then, a security-enhanced CLCPPA scheme with collusion-resistance for IoV is proposed, which can be formally proven to resist forgery attacks from Type-1 and Type-2 adversaries based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). Meanwhile, for the Type-3 adversary, we propose the security model applicable to the batch verification scenario and introduce the Small Exponent Test (SET) technology to withstand such attacks, along with the rigorous formal security proof for this method. Performance analysis shows that compared with related CLCPPA schemes, the proposed scheme not only provides more comprehensive security but also maintains lower costs. Specifically, compared with Genc et al.’s scheme, the proposed scheme can maintain similar performance while ensuring enhanced security.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111084"},"PeriodicalIF":4.4,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143153648","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
期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1