Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2025.02.001
Donghyun Kim , Hwi Sung Park , Bang Chul Jung
In this paper, we investigate a Reconfigurable Intelligent Surface (RIS)-assisted Free-Space Optics–Radio Frequency (FSO–RF) mixed dual-hop communication system for Unmanned Aerial Vehicles (UAVs). In the first hop, a source UAV transmits data to a relay UAV using the FSO technique. In the second hop, the relay UAV forwards data to a destination Mobile Station (MS) via an RF channel, with the RIS enhancing coverage and performance. The relay UAV operates in a Decode-and-Forward (DF) mode. As the main contribution, we provide a mathematical performance analysis of the RIS-assisted FSO–RF mixed dual-hop UAV system, evaluating outage probability, Bit-Error Rate (BER), and average capacity. The analysis accounts for factors such as atmospheric attenuation, turbulence, geometric losses, and link interruptions caused by UAV hovering behaviors. To the best of our knowledge, this is the first theoretical investigation of RIS-assisted FSO–RF mixed dual-hop UAV communication systems. Our analytical results show strong agreement with Monte Carlo simulation outcomes. Furthermore, simulation results demonstrate that RIS significantly enhances the performance of UAV-aided mixed RF/FSO systems, although performance saturation is observed due to uncertainties stemming from UAV hovering behavior.
{"title":"Performance analysis of RIS-assisted dual-hop mixed FSO-RF UAV communication systems","authors":"Donghyun Kim , Hwi Sung Park , Bang Chul Jung","doi":"10.1016/j.dcan.2025.02.001","DOIUrl":"10.1016/j.dcan.2025.02.001","url":null,"abstract":"<div><div>In this paper, we investigate a Reconfigurable Intelligent Surface (RIS)-assisted Free-Space Optics–Radio Frequency (FSO–RF) mixed dual-hop communication system for Unmanned Aerial Vehicles (UAVs). In the first hop, a source UAV transmits data to a relay UAV using the FSO technique. In the second hop, the relay UAV forwards data to a destination Mobile Station (MS) via an RF channel, with the RIS enhancing coverage and performance. The relay UAV operates in a Decode-and-Forward (DF) mode. As the main contribution, we provide a mathematical performance analysis of the RIS-assisted FSO–RF mixed dual-hop UAV system, evaluating outage probability, Bit-Error Rate (BER), and average capacity. The analysis accounts for factors such as atmospheric attenuation, turbulence, geometric losses, and link interruptions caused by UAV hovering behaviors. To the best of our knowledge, this is the first theoretical investigation of RIS-assisted FSO–RF mixed dual-hop UAV communication systems. Our analytical results show strong agreement with Monte Carlo simulation outcomes. Furthermore, simulation results demonstrate that RIS significantly enhances the performance of UAV-aided mixed RF/FSO systems, although performance saturation is observed due to uncertainties stemming from UAV hovering behavior.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1271-1279"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926718","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}
With technological advancements, high-speed rail has emerged as a prevalent mode of transportation. During travel, passengers exhibit a growing demand for streaming media services. However, the high-speed mobile networks environment poses challenges, including frequent base station handoffs, which significantly degrade wireless network transmission performance. Improving transmission efficiency in high-speed mobile networks and optimizing spatiotemporal wireless resource allocation to enhance passengers' media experiences are key research priorities. To address these issues, we propose an Adaptive Cross-Layer Optimization Transmission Method with Environment Awareness (ACOTM-EA) tailored for high-speed rail streaming media. Within this framework, we develop a channel quality prediction model utilizing Kalman filtering and an algorithm to identify packet loss causes. Additionally, we introduce a proactive base station handoff strategy to minimize handoff-related disruptions and optimize resource distribution across adjacent base stations. Moreover, this study presents a wireless resource allocation approach based on an enhanced genetic algorithm, coupled with an adaptive bitrate selection mechanism, to maximize passenger Quality of Experience (QoE). To evaluate the proposed method, we designed a simulation experiment and compared ACOTM-EA with established algorithms. Results indicate that ACOTM-EA improves throughput by 11% and enhances passengers' media experience by 5%.
{"title":"Environment-aware streaming media transmission method in high-speed mobile networks","authors":"Jia Guo, Jinqi Zhu, Xiang Li, Bowen Sun, Qian Gao, Weijia Feng","doi":"10.1016/j.dcan.2025.03.007","DOIUrl":"10.1016/j.dcan.2025.03.007","url":null,"abstract":"<div><div>With technological advancements, high-speed rail has emerged as a prevalent mode of transportation. During travel, passengers exhibit a growing demand for streaming media services. However, the high-speed mobile networks environment poses challenges, including frequent base station handoffs, which significantly degrade wireless network transmission performance. Improving transmission efficiency in high-speed mobile networks and optimizing spatiotemporal wireless resource allocation to enhance passengers' media experiences are key research priorities. To address these issues, we propose an Adaptive Cross-Layer Optimization Transmission Method with Environment Awareness (ACOTM-EA) tailored for high-speed rail streaming media. Within this framework, we develop a channel quality prediction model utilizing Kalman filtering and an algorithm to identify packet loss causes. Additionally, we introduce a proactive base station handoff strategy to minimize handoff-related disruptions and optimize resource distribution across adjacent base stations. Moreover, this study presents a wireless resource allocation approach based on an enhanced genetic algorithm, coupled with an adaptive bitrate selection mechanism, to maximize passenger Quality of Experience (QoE). To evaluate the proposed method, we designed a simulation experiment and compared ACOTM-EA with established algorithms. Results indicate that ACOTM-EA improves throughput by 11% and enhances passengers' media experience by 5%.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 992-1006"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926834","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.12.006
Dan Wang, Yalu Bai, Bin Song
Existing wireless networks are flooded with video data transmissions, and the demand for high-speed and low-latency video services continues to surge. This has brought with it challenges to networks in the form of congestion as well as the need for more resources and more dedicated caching schemes. Recently, Multi-access Edge Computing (MEC)-enabled heterogeneous networks, which leverage edge caches for proximity delivery, have emerged as a promising solution to all of these problems. Designing an effective edge caching scheme is critical to its success, however, in the face of limited resources. We propose a novel Knowledge Graph (KG)-based Dueling Deep Q-Network (KG-DDQN) for cooperative caching in MEC-enabled heterogeneous networks. The KG-DDQN scheme leverages a KG to uncover video relations, providing valuable insights into user preferences for the caching scheme. Specifically, the KG guides the selection of related videos as caching candidates (i.e., actions in the DDQN), thus providing a rich reference for implementing a personalized caching scheme while also improving the decision efficiency of the DDQN. Extensive simulation results validate the convergence effectiveness of the KG-DDQN, and it also outperforms baselines regarding cache hit rate and service delay.
现有的无线网络充斥着视频数据传输,对高速和低延迟视频服务的需求持续激增。这给网络带来了拥堵的挑战,也需要更多的资源和更专用的缓存方案。最近,支持多访问边缘计算(MEC)的异构网络,利用边缘缓存进行近距离传输,已经成为解决所有这些问题的有希望的解决方案。然而,在资源有限的情况下,设计一个有效的边缘缓存方案是其成功的关键。我们提出了一种新的基于知识图(KG)的Dueling Deep Q-Network (KG- ddqn),用于支持mec的异构网络中的协同缓存。KG- ddqn方案利用KG来发现视频关系,为用户对缓存方案的偏好提供有价值的见解。具体来说,KG指导选择相关视频作为缓存候选(即DDQN中的动作),从而为实现个性化缓存方案提供了丰富的参考,同时也提高了DDQN的决策效率。大量的仿真结果验证了KG-DDQN的收敛有效性,并且在缓存命中率和服务延迟方面也优于基线。
{"title":"A knowledge graph-based reinforcement learning approach for cooperative caching in MEC-enabled heterogeneous networks","authors":"Dan Wang, Yalu Bai, Bin Song","doi":"10.1016/j.dcan.2024.12.006","DOIUrl":"10.1016/j.dcan.2024.12.006","url":null,"abstract":"<div><div>Existing wireless networks are flooded with video data transmissions, and the demand for high-speed and low-latency video services continues to surge. This has brought with it challenges to networks in the form of congestion as well as the need for more resources and more dedicated caching schemes. Recently, Multi-access Edge Computing (MEC)-enabled heterogeneous networks, which leverage edge caches for proximity delivery, have emerged as a promising solution to all of these problems. Designing an effective edge caching scheme is critical to its success, however, in the face of limited resources. We propose a novel Knowledge Graph (KG)-based Dueling Deep Q-Network (KG-DDQN) for cooperative caching in MEC-enabled heterogeneous networks. The KG-DDQN scheme leverages a KG to uncover video relations, providing valuable insights into user preferences for the caching scheme. Specifically, the KG guides the selection of related videos as caching candidates (i.e., actions in the DDQN), thus providing a rich reference for implementing a personalized caching scheme while also improving the decision efficiency of the DDQN. Extensive simulation results validate the convergence effectiveness of the KG-DDQN, and it also outperforms baselines regarding cache hit rate and service delay.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1237-1245"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926715","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2025.01.001
Shaohua Cao , Quancheng Zheng , Zijun Zhan , Yansheng Yang , Huaqi Lv , Danyang Zheng , Weishan Zhang
With the rapid development of 5G technology, the proportion of video traffic on the Internet is increasing, bringing pressure on the network infrastructure. Edge computing technology provides a feasible solution for optimizing video content distribution. However, the limited edge node cache capacity and dynamic user requests make edge caching more complex. Therefore, we propose a recommendation-driven edge Caching network architecture for the Full life cycle of video streaming (FlyCache) designed to improve users' Quality of Experience (QoE) and reduce backhaul traffic consumption. FlyCache implements intelligent caching management across three key stages: before-playback, during-playback, and after-playback. Specifically, we introduce a cache placement policy for the before-playback stage, a dynamic prefetching and cache admission policy for the during-playback stage, and a progressive cache eviction policy for the after-playback stage. To validate the effectiveness of FlyCache, we developed a user behavior-driven edge caching simulation framework incorporating recommendation mechanisms. Experiments conducted on the MovieLens and synthetic datasets demonstrate that FlyCache outperforms other caching strategies in terms of byte hit rate, backhaul traffic, and delayed startup rate.
{"title":"FlyCache: Recommendation-driven edge caching architecture for full life cycle of video streaming","authors":"Shaohua Cao , Quancheng Zheng , Zijun Zhan , Yansheng Yang , Huaqi Lv , Danyang Zheng , Weishan Zhang","doi":"10.1016/j.dcan.2025.01.001","DOIUrl":"10.1016/j.dcan.2025.01.001","url":null,"abstract":"<div><div>With the rapid development of 5G technology, the proportion of video traffic on the Internet is increasing, bringing pressure on the network infrastructure. Edge computing technology provides a feasible solution for optimizing video content distribution. However, the limited edge node cache capacity and dynamic user requests make edge caching more complex. Therefore, we propose a recommendation-driven edge <strong>C</strong>aching network architecture for the <strong>F</strong>ull <strong>l</strong>ife c<strong>y</strong>cle of video streaming (FlyCache) designed to improve users' Quality of Experience (QoE) and reduce backhaul traffic consumption. FlyCache implements intelligent caching management across three key stages: before-playback, during-playback, and after-playback. Specifically, we introduce a cache placement policy for the before-playback stage, a dynamic prefetching and cache admission policy for the during-playback stage, and a progressive cache eviction policy for the after-playback stage. To validate the effectiveness of FlyCache, we developed a user behavior-driven edge caching simulation framework incorporating recommendation mechanisms. Experiments conducted on the MovieLens and synthetic datasets demonstrate that FlyCache outperforms other caching strategies in terms of byte hit rate, backhaul traffic, and delayed startup rate.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 961-974"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144925845","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.06.009
Linlin Xu , Qi Zhu , Wenchao Xia , Jun Zhang , Gan Zheng , Hongbo Zhu
Unmanned Aerial Vehicles (UAVs) have been considered to have great potential in supporting reliable and timely data harvesting for Sensor Nodes (SNs) from an Internet of Things (IoT) perspective. However, due to physical limitations, UAVs are unable to further process the harvested data and have to rely on terrestrial servers, thus extra spectrum resource is needed to convey the harvested data. To avoid the cost of extra servers and spectrum resources, in this paper, we consider a UAV-based data harvesting network supported by a Cell-Free massive Multiple-Input-Multiple-Output (CF-mMIMO) system, where a UAV is used to collect and transmit data from SNs to the central processing unit of CF-mMIMO system for processing. In order to avoid using additional spectrum resources, the entire bandwidth is shared among radio access networks and wireless fronthaul links. Moreover, considering the limited capacity of the fronthaul links, the compress-and-forward scheme is adopted. In this work, in order to maximize the ergodically achievable sum rate of SNs, the power allocation of ground access points, the compression of fronthaul links, and also the bandwidth fraction between radio access networks and wireless fronthaul links are jointly optimized. To avoid the high overhead introduced by computing ergodically achievable rates, we introduce an approximate problem, using the large-dimensional random matrix theory, which relies only on statistical channel state information. We solve the nontrivial problem in three steps and propose an algorithm based on weighted minimum mean square error and Dinkelbach's methods to find solutions. Finally, simulation results show that the proposed algorithm converges quickly and outperforms the baseline algorithms.
{"title":"Sum rate maximization in UAV-assisted data harvesting network supported by CF-mMIMO system exploiting statistical CSI","authors":"Linlin Xu , Qi Zhu , Wenchao Xia , Jun Zhang , Gan Zheng , Hongbo Zhu","doi":"10.1016/j.dcan.2024.06.009","DOIUrl":"10.1016/j.dcan.2024.06.009","url":null,"abstract":"<div><div>Unmanned Aerial Vehicles (UAVs) have been considered to have great potential in supporting reliable and timely data harvesting for Sensor Nodes (SNs) from an Internet of Things (IoT) perspective. However, due to physical limitations, UAVs are unable to further process the harvested data and have to rely on terrestrial servers, thus extra spectrum resource is needed to convey the harvested data. To avoid the cost of extra servers and spectrum resources, in this paper, we consider a UAV-based data harvesting network supported by a Cell-Free massive Multiple-Input-Multiple-Output (CF-mMIMO) system, where a UAV is used to collect and transmit data from SNs to the central processing unit of CF-mMIMO system for processing. In order to avoid using additional spectrum resources, the entire bandwidth is shared among radio access networks and wireless fronthaul links. Moreover, considering the limited capacity of the fronthaul links, the compress-and-forward scheme is adopted. In this work, in order to maximize the ergodically achievable sum rate of SNs, the power allocation of ground access points, the compression of fronthaul links, and also the bandwidth fraction between radio access networks and wireless fronthaul links are jointly optimized. To avoid the high overhead introduced by computing ergodically achievable rates, we introduce an approximate problem, using the large-dimensional random matrix theory, which relies only on statistical channel state information. We solve the nontrivial problem in three steps and propose an algorithm based on weighted minimum mean square error and Dinkelbach's methods to find solutions. Finally, simulation results show that the proposed algorithm converges quickly and outperforms the baseline algorithms.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1280-1292"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926719","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.10.014
Chang Liu , Zhili Wang , Qun Zhang , Shaoyong Guo , Xuesong Qiu
Data trading is a crucial means of unlocking the value of Internet of Things (IoT) data. However, IoT data differs from traditional material goods due to its intangible and replicable nature. This difference leads to ambiguous data rights, confusing pricing, and challenges in matching. Additionally, centralized IoT data trading platforms pose risks such as privacy leakage. To address these issues, we propose a profit-driven distributed trading mechanism for IoT data. First, a blockchain-based trading architecture for IoT data, leveraging the transparent and tamper-proof features of blockchain technology, is proposed to establish trust between data owners and data requesters. Second, an IoT data registration method that encompasses both rights confirmation and pricing is designed. The data right confirmation method uses non-fungible token to record ownership and authenticate IoT data. For pricing, we develop an IoT data value assessment index system and introduce a pricing model based on a combination of the sparrow search algorithm and the back propagation neural network. Finally, an IoT data matching method is designed based on the Stackelberg game. This establishes a Stackelberg game model involving multiple data owners and requesters, employing a hierarchical optimization method to determine the optimal purchase strategy. The security of the mechanism is analyzed and the performance of both the pricing method and matching method is evaluated. Experiments demonstrate that both methods outperform traditional approaches in terms of error rates and profit maximization.
{"title":"Profit-driven distributed trading mechanism for IoT data","authors":"Chang Liu , Zhili Wang , Qun Zhang , Shaoyong Guo , Xuesong Qiu","doi":"10.1016/j.dcan.2024.10.014","DOIUrl":"10.1016/j.dcan.2024.10.014","url":null,"abstract":"<div><div>Data trading is a crucial means of unlocking the value of Internet of Things (IoT) data. However, IoT data differs from traditional material goods due to its intangible and replicable nature. This difference leads to ambiguous data rights, confusing pricing, and challenges in matching. Additionally, centralized IoT data trading platforms pose risks such as privacy leakage. To address these issues, we propose a profit-driven distributed trading mechanism for IoT data. First, a blockchain-based trading architecture for IoT data, leveraging the transparent and tamper-proof features of blockchain technology, is proposed to establish trust between data owners and data requesters. Second, an IoT data registration method that encompasses both rights confirmation and pricing is designed. The data right confirmation method uses non-fungible token to record ownership and authenticate IoT data. For pricing, we develop an IoT data value assessment index system and introduce a pricing model based on a combination of the sparrow search algorithm and the back propagation neural network. Finally, an IoT data matching method is designed based on the Stackelberg game. This establishes a Stackelberg game model involving multiple data owners and requesters, employing a hierarchical optimization method to determine the optimal purchase strategy. The security of the mechanism is analyzed and the performance of both the pricing method and matching method is evaluated. Experiments demonstrate that both methods outperform traditional approaches in terms of error rates and profit maximization.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1067-1079"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926842","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.11.017
Haoyu Wang , Yang Liu , Zijun Li , Yu Zhang , Wenjing Gong , Tao Jiang , Ting Bi , Jiaxi Zhou
High-quality services in today's mobile networks require stable delivery of bandwidth-intensive network content. Multipath QUIC (MPQUIC), as a multipath protocol that extends QUIC, can utilize multiple paths to support stable and efficient transmission. The standard coupled congestion control algorithm in MPQUIC synchronizes these paths to manage congestion, meeting fairness requirements and improving transmission efficiency. However, current algorithms' Congestion Window (CWND) reduction approach significantly decreases CWND upon packet loss, which lowers effective throughput, regardless of the congestion origin. Furthermore, the uncoupled Slow-Start (SS) in MPQUIC leads to independent exponential CWND growth on each path, potentially causing buffer overflow. To address these issues, we propose the CC-OLIA, which incorporates Packet Loss Classifcation (PLC) and Coupled Slow-Start (CSS). The PLC distinguishes between congestion-induced and random packet losses, adjusting CWND reduction accordingly to maintain throughput. Concurrently, the CSS module coordinates CWND growth during the SS, preventing abrupt increases. Implementation on MININET shows that CC-OLIA not only maintains fair performance but also enhances transmission efficiency across diverse network conditions.
{"title":"CC-OLIA: A dynamic congestion control algorithm for multipath QUIC in mobile networks","authors":"Haoyu Wang , Yang Liu , Zijun Li , Yu Zhang , Wenjing Gong , Tao Jiang , Ting Bi , Jiaxi Zhou","doi":"10.1016/j.dcan.2024.11.017","DOIUrl":"10.1016/j.dcan.2024.11.017","url":null,"abstract":"<div><div>High-quality services in today's mobile networks require stable delivery of bandwidth-intensive network content. Multipath QUIC (MPQUIC), as a multipath protocol that extends QUIC, can utilize multiple paths to support stable and efficient transmission. The standard coupled congestion control algorithm in MPQUIC synchronizes these paths to manage congestion, meeting fairness requirements and improving transmission efficiency. However, current algorithms' Congestion Window (CWND) reduction approach significantly decreases CWND upon packet loss, which lowers effective throughput, regardless of the congestion origin. Furthermore, the uncoupled Slow-Start (SS) in MPQUIC leads to independent exponential CWND growth on each path, potentially causing buffer overflow. To address these issues, we propose the CC-OLIA, which incorporates Packet Loss Classifcation (PLC) and Coupled Slow-Start (CSS). The PLC distinguishes between congestion-induced and random packet losses, adjusting CWND reduction accordingly to maintain throughput. Concurrently, the CSS module coordinates CWND growth during the SS, preventing abrupt increases. Implementation on MININET shows that CC-OLIA not only maintains fair performance but also enhances transmission efficiency across diverse network conditions.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1181-1191"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926850","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.12.005
Xia Feng , Yaru Wang , Kaiping Cui , Liangmin Wang
The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks (VANETs). However, the messages transmitted over the public channel in the open and dynamic VANETs are vulnerable to malicious attacks. Although numerous researchers have proposed authentication schemes to enhance the security of Vehicle-to-Vehicle (V2V) communication, most existing methodologies face two significant challenges: (1) the majority of the schemes are not lightweight enough to support real-time message interaction among vehicles; (2) the sensitive information like identity and position is at risk of being compromised. To tackle these issues, we propose a lightweight dual authentication protocol for V2V communication based on Physical Unclonable Function (PUF). The proposed scheme accomplishes dual authentication between vehicles by the combination of Zero-Knowledge Proof (ZKP) and MASK function. The security analysis proves that our scheme provides both anonymous authentication and information unlinkability. Additionally, the performance analysis demonstrates that the computation overhead of our scheme is approximately reduced 23.4% compared to the state-of-the-art schemes. The practical simulation conducted in a 6G network environment demonstrates the feasibility of 6G-based VANETs and their potential for future advancements.
{"title":"A lightweight dual authentication scheme for V2V communication in 6G-based vanets","authors":"Xia Feng , Yaru Wang , Kaiping Cui , Liangmin Wang","doi":"10.1016/j.dcan.2024.12.005","DOIUrl":"10.1016/j.dcan.2024.12.005","url":null,"abstract":"<div><div>The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks (VANETs). However, the messages transmitted over the public channel in the open and dynamic VANETs are vulnerable to malicious attacks. Although numerous researchers have proposed authentication schemes to enhance the security of Vehicle-to-Vehicle (V2V) communication, most existing methodologies face two significant challenges: (1) the majority of the schemes are not lightweight enough to support real-time message interaction among vehicles; (2) the sensitive information like identity and position is at risk of being compromised. To tackle these issues, we propose a lightweight dual authentication protocol for V2V communication based on Physical Unclonable Function (PUF). The proposed scheme accomplishes dual authentication between vehicles by the combination of Zero-Knowledge Proof (ZKP) and <em>MASK</em> function. The security analysis proves that our scheme provides both anonymous authentication and information unlinkability. Additionally, the performance analysis demonstrates that the computation overhead of our scheme is approximately reduced 23.4% compared to the state-of-the-art schemes. The practical simulation conducted in a 6G network environment demonstrates the feasibility of 6G-based VANETs and their potential for future advancements.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1225-1236"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926714","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.11.002
Yinxiao Zhuo , Zhaocheng Wang
Integrated Sensing and Communication (ISAC) is envisioned as a promising technology for Sixth-Generation (6G) wireless communications, which enables simultaneous high-rate communication and high-precision target localization. Compared to independent sensing and communication modules, dual-function ISAC could leverage the strengths of both communication and sensing in order to achieve cooperative gains. When considering the communication core network, ISAC system facilitates multiple communication devices to collaborate for networked sensing. This paper investigates such kind of cooperative ISAC systems with distributed transmitters and receivers to support non-connected and multi-target localization. Specifically, we introduce a Time of Arrival (TOA) based multi-target localization scheme, which leverages the bi-static range measurements between the transmitter, target, and receiver channels in order to achieve elliptical localization. To obtain the low-complexity localization, a two-stage search-refine localization methodology is proposed. In the first stage, we propose a Successive Greedy Grid-Search (SGGS) algorithm and a Successive-Cancellation-List Grid-Search (SCLGS) algorithm to address the Measurement-to-Target Association (MTA) problem with relatively low computational complexity. In the second stage, a linear approximation refinement algorithm is derived to facilitate high-precision localization. Simulation results are presented to validate the effectiveness and superiority of our proposed multi-target localization method.
{"title":"Low-complexity multi-target localization via multi-BS sensing","authors":"Yinxiao Zhuo , Zhaocheng Wang","doi":"10.1016/j.dcan.2024.11.002","DOIUrl":"10.1016/j.dcan.2024.11.002","url":null,"abstract":"<div><div>Integrated Sensing and Communication (ISAC) is envisioned as a promising technology for Sixth-Generation (6G) wireless communications, which enables simultaneous high-rate communication and high-precision target localization. Compared to independent sensing and communication modules, dual-function ISAC could leverage the strengths of both communication and sensing in order to achieve cooperative gains. When considering the communication core network, ISAC system facilitates multiple communication devices to collaborate for networked sensing. This paper investigates such kind of cooperative ISAC systems with distributed transmitters and receivers to support non-connected and multi-target localization. Specifically, we introduce a Time of Arrival (TOA) based multi-target localization scheme, which leverages the bi-static range measurements between the transmitter, target, and receiver channels in order to achieve elliptical localization. To obtain the low-complexity localization, a two-stage search-refine localization methodology is proposed. In the first stage, we propose a Successive Greedy Grid-Search (SGGS) algorithm and a Successive-Cancellation-List Grid-Search (SCLGS) algorithm to address the Measurement-to-Target Association (MTA) problem with relatively low computational complexity. In the second stage, a linear approximation refinement algorithm is derived to facilitate high-precision localization. Simulation results are presented to validate the effectiveness and superiority of our proposed multi-target localization method.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1141-1149"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926846","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}
Pub Date : 2025-08-01DOI: 10.1016/j.dcan.2024.11.018
Fengqi Li , Yingjie Zhao , Kaiyang Zhang , Hui Xu , Yanjuan Wang , Deguang Wang
To facilitate cross-domain data interaction in the Industrial Internet of Things (IIoT), establishing trust between multiple administrative domains is essential. Although blockchain technology has been proposed as a solution, current techniques still suffer from issues related to efficiency, security, and privacy. Our research aims to address these challenges by proposing a lightweight, trusted data interaction scheme based on blockchain, which reduces redundant interactions among entities. We enhance the traditional Practical Byzantine Fault Tolerance (PBFT) algorithm to support lightweight distributed consensus in large-scale IIoT scenarios. Introducing a composite digital signature algorithm and incorporating veto power minimizes resource consumption and eliminates ineffective consensus operations. The experimental results show that, compared with PBFT, our scheme reduces latency by 27.2%, thereby improving communication efficiency and resource utilization. Furthermore, we develop a lightweight authentication technique specifically for cross-domain IIoT, leveraging blockchain technology to achieve distributed collaborative authentication. The performance comparisons indicate that our method significantly outperforms traditional schemes, with an average authentication latency of approximately 151 milliseconds. Additionally, we introduce a trusted federated learning (FL) algorithm that ensures comprehensive trust assessments for devices across different domains while protecting data privacy. Extensive simulations and experiments validate the reliability of our approach.
{"title":"Blockchain-based lightweight trusted data interaction scheme for cross-domain IIoT","authors":"Fengqi Li , Yingjie Zhao , Kaiyang Zhang , Hui Xu , Yanjuan Wang , Deguang Wang","doi":"10.1016/j.dcan.2024.11.018","DOIUrl":"10.1016/j.dcan.2024.11.018","url":null,"abstract":"<div><div>To facilitate cross-domain data interaction in the Industrial Internet of Things (IIoT), establishing trust between multiple administrative domains is essential. Although blockchain technology has been proposed as a solution, current techniques still suffer from issues related to efficiency, security, and privacy. Our research aims to address these challenges by proposing a lightweight, trusted data interaction scheme based on blockchain, which reduces redundant interactions among entities. We enhance the traditional Practical Byzantine Fault Tolerance (PBFT) algorithm to support lightweight distributed consensus in large-scale IIoT scenarios. Introducing a composite digital signature algorithm and incorporating veto power minimizes resource consumption and eliminates ineffective consensus operations. The experimental results show that, compared with PBFT, our scheme reduces latency by 27.2%, thereby improving communication efficiency and resource utilization. Furthermore, we develop a lightweight authentication technique specifically for cross-domain IIoT, leveraging blockchain technology to achieve distributed collaborative authentication. The performance comparisons indicate that our method significantly outperforms traditional schemes, with an average authentication latency of approximately 151 milliseconds. Additionally, we introduce a trusted federated learning (FL) algorithm that ensures comprehensive trust assessments for devices across different domains while protecting data privacy. Extensive simulations and experiments validate the reliability of our approach.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1192-1204"},"PeriodicalIF":7.5,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144926851","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}