Pub Date : 2024-10-16DOI: 10.1016/j.comcom.2024.107976
Colman McGuan , Chansu Yu , Kyoungwon Suh
Website fingerprinting is a passive network traffic analysis technique that enables an adversary to identify the website visited by a user despite encryption and the use of privacy services such as Tor. Several website fingerprinting defenses built on top of Tor have been proposed to guarantee a user’s privacy by concealing trace features that are important to classification. However, some of the best defenses incur a high bandwidth and/or latency overhead. To combat this, new defenses have sought to be both lightweight — i.e., introduce a small amount of bandwidth overhead — and zero-delay to real network traffic. This work introduces a novel zero-delay and lightweight website fingerprinting defense, called BRO, which conceals the feature-rich beginning of a trace while still enabling the obfuscation of features deeper into the trace without spreading the padding budget thin. BRO schedules padding with a randomized beta distribution that can skew to both the extreme left and right, keeping the applied padding clustered to a finite portion of a trace. This work specifically targets deep learning attacks, which continue to be among the most accurate website fingerprinting attacks. Results show that BRO outperforms other well-known website fingerprinting defenses, such as FRONT, with similar bandwidth overhead.
网站指纹识别是一种被动网络流量分析技术，它能让对手在加密和使用 Tor 等隐私服务的情况下识别用户访问的网站。在 Tor 的基础上提出了几种网站指纹识别防御技术，通过隐藏对分类很重要的跟踪特征来保证用户的隐私。然而，一些最好的防御方法会产生很高的带宽和/或延迟开销。为了解决这个问题，新的防御系统力求做到轻量级（即引入少量带宽开销）和对真实网络流量零延迟。这项工作引入了一种新型零延迟轻量级网站指纹防御技术，称为 BRO，它可以隐藏跟踪的开头部分丰富的特征，同时还能混淆跟踪的更深处的特征，而不会分散填充预算。BRO 采用随机贝塔分布调度填充，可向极左和极右倾斜，从而将应用的填充集中在轨迹的有限部分。这项工作专门针对深度学习攻击，这种攻击仍然是最准确的网站指纹攻击之一。结果表明，在带宽开销相似的情况下，BRO 的性能优于 FRONT 等其他著名的网站指纹识别防御系统。
{"title":"Practical and lightweight defense against website fingerprinting","authors":"Colman McGuan , Chansu Yu , Kyoungwon Suh","doi":"10.1016/j.comcom.2024.107976","DOIUrl":"10.1016/j.comcom.2024.107976","url":null,"abstract":"<div><div>Website fingerprinting is a passive network traffic analysis technique that enables an adversary to identify the website visited by a user despite encryption and the use of privacy services such as Tor. Several website fingerprinting defenses built on top of Tor have been proposed to guarantee a user’s privacy by concealing trace features that are important to classification. However, some of the best defenses incur a high bandwidth and/or latency overhead. To combat this, new defenses have sought to be both lightweight — i.e., introduce a small amount of bandwidth overhead — and zero-delay to real network traffic. This work introduces a novel zero-delay and lightweight website fingerprinting defense, called BRO, which conceals the feature-rich beginning of a trace while still enabling the obfuscation of features deeper into the trace without spreading the padding budget thin. BRO schedules padding with a randomized beta distribution that can skew to both the extreme left and right, keeping the applied padding clustered to a finite portion of a trace. This work specifically targets deep learning attacks, which continue to be among the most accurate website fingerprinting attacks. Results show that BRO outperforms other well-known website fingerprinting defenses, such as FRONT, with similar bandwidth overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107976"},"PeriodicalIF":4.5,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-15DOI: 10.1016/j.comcom.2024.107973
Xiaoying Liu , Xinyu Kuang , Yuxin Chen , Kechen Zheng , Jia Liu
To address the issues of energy supply and spectrum scarcity in Internet of Things (IoT), energy harvesting (EH) and cognitive radio (CR) technologies have been proposed and widely applied. In EH-CR networks (EH-CRNs), miss detection causes significant energy and time wastage of IoT devices, especially secondary users (SUs), and causes serious interference to primary users (PUs). To alleviate this concern, we propose a probing-aided spectrum sensing (PaSS) model for EH-CRNs, where pairs of PUs and one pair of SUs coexist. The secondary transmitter (ST) harvests energy from the radio frequency (RF) signals of PUs for opportunistic spectrum access. In the PaSS model, probing operation is employed to further confirm the real state of the spectrum that has been sensed as free in order to avoid the waste of time and energy resulting from miss detection. Based on the PaSS model, we propose a novel hybrid access strategy, where the ST’s actions (i.e., sensing, probing, EH, underlay/overlay transmission mode) depend on the belief vector of channels, energy state and data buffer state of the ST. By developing an adjusted double deep Q-network (ADDQN) reinforcement learning algorithm, we aim to find the optimal strategy that minimizes the long-term average number of packet losses (ANPL) and the ANPL minimization problem is an integer programming problem. Simulation results validate the ANPL performance of the ST in the ADDQN-PaSS model, and reveal impacts of network parameters on the performance of the ST, and find that at least 7.9% reduction of ANPL is achieved by using the ADDQN-PaSS model.
为解决物联网（IoT）中的能源供应和频谱稀缺问题，人们提出并广泛应用了能量收集（EH）和认知无线电（CR）技术。在 EH-CR 网络（EH-CRN）中，漏检会造成物联网设备（尤其是二级用户（SU））大量的能源和时间浪费，并对一级用户（PU）造成严重干扰。为了缓解这一问题，我们为 EH-CRNs 提出了一种探测辅助频谱感知（PaSS）模型，在该模型中，M 对 PU 和一对 SU 共存。辅助发射机（ST）从 PU 的射频（RF）信号中获取能量，以实现机会性频谱接入。在 PaSS 模型中，探测操作被用来进一步确认已感知为空闲的频谱的真实状态，以避免漏检造成的时间和能量浪费。基于 PaSS 模型，我们提出了一种新型混合接入策略，ST 的操作（即感知、探测、EH、下叠/上叠传输模式）取决于 M 信道的信念向量、ST 的能量状态和数据缓冲器状态。通过开发调整后的双深度 Q 网络（ADDQN）强化学习算法，我们的目标是找到使长期平均丢包数（ANPL）最小的最优策略，而 ANPL 最小化问题是一个整数编程问题。仿真结果验证了 ST 在 ADDQN-PaSS 模型中的 ANPL 性能，揭示了网络参数对 ST 性能的影响，并发现使用 ADDQN-PaSS 模型至少能降低 7.9% 的 ANPL。
{"title":"Probing-aided spectrum sensing-based hybrid access strategy for energy harvesting CRNs","authors":"Xiaoying Liu , Xinyu Kuang , Yuxin Chen , Kechen Zheng , Jia Liu","doi":"10.1016/j.comcom.2024.107973","DOIUrl":"10.1016/j.comcom.2024.107973","url":null,"abstract":"<div><div>To address the issues of energy supply and spectrum scarcity in Internet of Things (IoT), energy harvesting (EH) and cognitive radio (CR) technologies have been proposed and widely applied. In EH-CR networks (EH-CRNs), miss detection causes significant energy and time wastage of IoT devices, especially secondary users (SUs), and causes serious interference to primary users (PUs). To alleviate this concern, we propose a probing-aided spectrum sensing (PaSS) model for EH-CRNs, where <span><math><mi>M</mi></math></span> pairs of PUs and one pair of SUs coexist. The secondary transmitter (ST) harvests energy from the radio frequency (RF) signals of PUs for opportunistic spectrum access. In the PaSS model, probing operation is employed to further confirm the real state of the spectrum that has been sensed as free in order to avoid the waste of time and energy resulting from miss detection. Based on the PaSS model, we propose a novel hybrid access strategy, where the ST’s actions (i.e., sensing, probing, EH, underlay/overlay transmission mode) depend on the belief vector of <span><math><mi>M</mi></math></span> channels, energy state and data buffer state of the ST. By developing an adjusted double deep Q-network (ADDQN) reinforcement learning algorithm, we aim to find the optimal strategy that minimizes the long-term average number of packet losses (ANPL) and the ANPL minimization problem is an integer programming problem. Simulation results validate the ANPL performance of the ST in the ADDQN-PaSS model, and reveal impacts of network parameters on the performance of the ST, and find that at least 7.9% reduction of ANPL is achieved by using the ADDQN-PaSS model.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107973"},"PeriodicalIF":4.5,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-10DOI: 10.1016/j.comcom.2024.107962
Ateeq Ur Rehman , Mashael Maashi , Jamal Alsamri , Hany Mahgoub , Randa Allafi , Ashit Kumar Dutta , Wali Ullah Khan , Ali Nauman
In the next-generation communication system, near-field communication (NFC) is a key enabler of contactless transactions, including mobile payments, ticketing, and access control. With the growing demand for contactless solutions, NFC technology will play a pivotal role in enabling secure and convenient payment experiences across various sectors. In contrast, Internet of Things (IoT) devices such as phones’ Point of Sale (PoS) constitute limited battery life and finite computational resources that act as a bottleneck to doing the authentication in a minimal amount of time. Because of this, it garnered considerable attention in both academic and industrial realms. To overcome this, in this work we consider the Multiple Mobile Edge Computing (MEC) as an effective solution that provides extensive computation to PoS connected to it. To address the above, this work considers the PoS-enabled multi-MEC network to guarantee NFC communication reliably and effectively. For this, we formulate the joint optimization problem to maximize the probability of successful authentication while minimizing the queueing delay by jointly optimizing the computation and communication resources by utilizing a multi-agent reinforcement learning optimization approach. Through extensive simulations based on real-world scenarios, the effectiveness of the proposed approach was demonstrated. The results demonstrate that adjusting the complexity and learning rates of the model, coupled with strategic allocation of edge resources, significantly increased authentication success rates. Furthermore, the optimal allocation strategy was found to be crucial in reducing latency and improving authentication success by approximately 9.75%, surpassing other approaches. This study highlights the importance of resource management in optimizing MEC systems, paving the way for advancements in establishing secure, efficient, and dependable systems within the Internet of Things framework.
{"title":"Optimizing point-of-sale services in MEC enabled near field wireless communications using multi-agent reinforcement learning","authors":"Ateeq Ur Rehman , Mashael Maashi , Jamal Alsamri , Hany Mahgoub , Randa Allafi , Ashit Kumar Dutta , Wali Ullah Khan , Ali Nauman","doi":"10.1016/j.comcom.2024.107962","DOIUrl":"10.1016/j.comcom.2024.107962","url":null,"abstract":"<div><div>In the next-generation communication system, near-field communication (NFC) is a key enabler of contactless transactions, including mobile payments, ticketing, and access control. With the growing demand for contactless solutions, NFC technology will play a pivotal role in enabling secure and convenient payment experiences across various sectors. In contrast, Internet of Things (IoT) devices such as phones’ Point of Sale (PoS) constitute limited battery life and finite computational resources that act as a bottleneck to doing the authentication in a minimal amount of time. Because of this, it garnered considerable attention in both academic and industrial realms. To overcome this, in this work we consider the Multiple Mobile Edge Computing (MEC) as an effective solution that provides extensive computation to PoS connected to it. To address the above, this work considers the PoS-enabled multi-MEC network to guarantee NFC communication reliably and effectively. For this, we formulate the joint optimization problem to maximize the probability of successful authentication while minimizing the queueing delay by jointly optimizing the computation and communication resources by utilizing a multi-agent reinforcement learning optimization approach. Through extensive simulations based on real-world scenarios, the effectiveness of the proposed approach was demonstrated. The results demonstrate that adjusting the complexity and learning rates of the model, coupled with strategic allocation of edge resources, significantly increased authentication success rates. Furthermore, the optimal allocation strategy was found to be crucial in reducing latency and improving authentication success by approximately 9.75%, surpassing other approaches. This study highlights the importance of resource management in optimizing MEC systems, paving the way for advancements in establishing secure, efficient, and dependable systems within the Internet of Things framework.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107962"},"PeriodicalIF":4.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142438243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Drones also called Unmanned Aerial Vehicles (UAVs) have become more prominent in several applications such as package delivery, real-time object detection, tracking, traffic monitoring, security surveillance systems, and many others. As a key member of IoT, the group of Radio Frequency IDentification (RFID) technologies is referred to as Automatic Identification and Data Capturing (AIDC). In particular, RFID technology is becoming a contactless and wireless technique used to automatically identify and track the tagged objects via radio frequency signals. It also has drawn a lot of attention among researchers, scientists, industries, and practitioners due to its broad range of real-world applications in various fields. However, RFID systems face two key concerns related to security and privacy, where an adversary performs eavesdropping, tampering, modification, and even interception of the secret information of the RFID tags, which may cause forgery and privacy problems. In contrast to security and privacy, RFID tags have very limited computational power capability. To deal with these issues, this paper puts forward an RFID-based Lightweight and Provably Secure Authentication Protocol (LPSAP) for Unmanned Aerial Vehicle Systems. The proposed protocol uses secure Physically Unclonable Functions (PUFs), Elliptic-Curve Cryptography (ECC), secure one-way hash, bitwise XOR, and concatenation operations. We use Ouafi and Phan’s formal security model for analyzing security and privacy features such as traceability and mutual authentication. The rigorous informal analysis is carried out which ensures that our proposed protocol achieves various security and privacy features as well as resists various known security attacks. The performance analysis demonstrates that our proposed protocol outperforms other existing protocols. In addition, Scyther and Automated Validation of Internet Security Protocols and Applications (AVISPA) tool simulation results demonstrates that there is no security attack possible within bounds. Therefore, our proposed LPSAP protocol achieves an acceptable high level of security with the least computational, communication, and storage costs on passive RFID tags.
无人机又称无人驾驶飞行器（UAV），在包裹递送、实时物体检测、跟踪、交通监控、安全监控系统等多种应用中的作用日益突出。作为物联网的重要成员，射频识别（RFID）技术被称为自动识别和数据采集（AIDC）。其中，RFID 技术正成为一种非接触式无线技术，用于通过射频信号自动识别和跟踪被标记的物体。由于其在各个领域的广泛实际应用，它也引起了研究人员、科学家、工业界和从业人员的广泛关注。然而，RFID 系统面临着与安全和隐私相关的两个关键问题，即对手对 RFID 标签的秘密信息进行窃听、篡改、修改甚至截获，从而可能导致伪造和隐私问题。与安全和隐私问题相反，RFID 标签的计算能力非常有限。针对这些问题，本文提出了一种基于 RFID 的无人机系统轻量级可证明安全认证协议（LPSAP）。所提出的协议使用了安全的物理不可克隆函数（PUF）、椭圆曲线加密算法（ECC）、安全单向散列、位向 XOR 和连接操作。我们使用 Ouafi 和 Phan 的正式安全模型来分析可追溯性和相互验证等安全和隐私特性。我们进行了严格的非正式分析，确保我们提出的协议能够实现各种安全和隐私特性，并抵御各种已知的安全攻击。性能分析表明，我们提出的协议优于其他现有协议。此外，Scyther 和互联网安全协议与应用自动验证（AVISPA）工具的仿真结果表明，在一定范围内不存在任何安全攻击。因此，我们提出的 LPSAP 协议以最低的计算、通信和存储成本在无源 RFID 标签上实现了可接受的高水平安全性。
{"title":"Design of Provably Secure and Lightweight Authentication Protocol for Unmanned Aerial Vehicle systems","authors":"Mohd Shariq , Mauro Conti , Karan Singh , Sanjeev Kumar Dwivedi , Mohammad Abdussami , Ruhul Amin , Mehedi Masud","doi":"10.1016/j.comcom.2024.107971","DOIUrl":"10.1016/j.comcom.2024.107971","url":null,"abstract":"<div><div>Drones also called Unmanned Aerial Vehicles (UAVs) have become more prominent in several applications such as package delivery, real-time object detection, tracking, traffic monitoring, security surveillance systems, and many others. As a key member of IoT, the group of Radio Frequency IDentification (RFID) technologies is referred to as Automatic Identification and Data Capturing (AIDC). In particular, RFID technology is becoming a contactless and wireless technique used to automatically identify and track the tagged objects via radio frequency signals. It also has drawn a lot of attention among researchers, scientists, industries, and practitioners due to its broad range of real-world applications in various fields. However, RFID systems face two key concerns related to security and privacy, where an adversary performs eavesdropping, tampering, modification, and even interception of the secret information of the RFID tags, which may cause forgery and privacy problems. In contrast to security and privacy, RFID tags have very limited computational power capability. To deal with these issues, this paper puts forward an RFID-based Lightweight and Provably Secure Authentication Protocol (LPSAP) for Unmanned Aerial Vehicle Systems. The proposed protocol uses secure Physically Unclonable Functions (PUFs), Elliptic-Curve Cryptography (ECC), secure one-way hash, bitwise XOR, and concatenation operations. We use Ouafi and Phan’s formal security model for analyzing security and privacy features such as traceability and mutual authentication. The rigorous informal analysis is carried out which ensures that our proposed protocol achieves various security and privacy features as well as resists various known security attacks. The performance analysis demonstrates that our proposed protocol outperforms other existing protocols. In addition, Scyther and Automated Validation of Internet Security Protocols and Applications (AVISPA) tool simulation results demonstrates that there is no security attack possible within bounds. Therefore, our proposed LPSAP protocol achieves an acceptable high level of security with the least computational, communication, and storage costs on passive RFID tags.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107971"},"PeriodicalIF":4.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-09DOI: 10.1016/j.comcom.2024.107968
Antonin Le Floch , Rahim Kacimi , Pierre Druart , Yoann Lefebvre , André-Luc Beylot
Localization inside legacy private 5G networks is a daunting task that involves solving the problem of indoor localization using commercial off-the-shelf proprietary hardware. While some previous work has focused on experimental analysis, none has undertaken to develop a realistic solution based on commercial equipment. In this study, we present the first comprehensive and concrete 5G framework that combines fingerprinting with the 3GPP Enhanced Cell ID (E-CID) approach. Our methodology consists of a machine-learning model to deduce the user’s position by comparing the signal strength received from the User Equipment (UE) with a reference radio power map. To achieve this, the 3GPP protocols and functions are improved to provide open, centralized, and universal localization functions. A new reference map paradigm named Optical Radio Power Estimation using Light Analysis (ORPELA) is introduced. Real-world experiments prove that it is reproducible and more accurate than state-of-the-art radio-planning software. Machine-learning models are then designed, trained, and optimized for an ultra-challenging radio context. Finally, a large-scale experimental campaign encompassing a wide range of cases, including line-of-sight or mobility, is being conducted to demonstrate expected location performance within realistic 5G private networks.
{"title":"A comprehensive framework for 5G indoor localization","authors":"Antonin Le Floch , Rahim Kacimi , Pierre Druart , Yoann Lefebvre , André-Luc Beylot","doi":"10.1016/j.comcom.2024.107968","DOIUrl":"10.1016/j.comcom.2024.107968","url":null,"abstract":"<div><div>Localization inside legacy private 5G networks is a daunting task that involves solving the problem of indoor localization using commercial off-the-shelf proprietary hardware. While some previous work has focused on experimental analysis, none has undertaken to develop a realistic solution based on commercial equipment. In this study, we present the first comprehensive and concrete 5G framework that combines fingerprinting with the 3GPP Enhanced Cell ID (E-CID) approach. Our methodology consists of a machine-learning model to deduce the user’s position by comparing the signal strength received from the User Equipment (UE) with a reference radio power map. To achieve this, the 3GPP protocols and functions are improved to provide open, centralized, and universal localization functions. A new reference map paradigm named Optical Radio Power Estimation using Light Analysis (ORPELA) is introduced. Real-world experiments prove that it is reproducible and more accurate than state-of-the-art radio-planning software. Machine-learning models are then designed, trained, and optimized for an ultra-challenging radio context. Finally, a large-scale experimental campaign encompassing a wide range of cases, including line-of-sight or mobility, is being conducted to demonstrate expected location performance within realistic 5G private networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107968"},"PeriodicalIF":4.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142446522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-09DOI: 10.1016/j.comcom.2024.107972
Chaimaa Nairi , Murtaza Cicioğlu , Ali Çalhan
A donation-tracking system leveraging smart contracts and blockchain technology holds transformative potential for reshaping the landscape of charitable giving, especially within the context of Web 3.0. This paper explores how smart contracts and blockchain can be used to create a transparent and secure ledger for tracking charitable donations. We highlight the limitations of traditional donation systems and how a blockchain-based system can help overcome these challenges. The functionality of smart contracts in donation tracking, offering advantages such as automation, reduced transaction fees, and enhanced accountability, is elucidated. The decentralized and tamper-proof nature of blockchain technology is emphasized for increased transparency and fraud prevention. While elucidating the benefits, we also address challenges in implementing such a system, including the need for technical expertise and security considerations. By fostering trust and accountability, a donation-tracking system in Web 3.0, empowered by smart blockchain networks, aims to catalyze a profound positive impact in the realm of philanthropy.
利用智能合约和区块链技术的捐赠追踪系统具有重塑慈善捐赠格局的变革潜力，尤其是在 Web 3.0 的背景下。本文探讨了如何利用智能合约和区块链创建一个透明、安全的分类账来追踪慈善捐款。我们强调了传统捐赠系统的局限性，以及基于区块链的系统如何帮助克服这些挑战。智能合约在追踪捐赠方面的功能，提供了自动化、降低交易费用和增强问责制等优势，我们对此进行了阐述。强调了区块链技术的去中心化和防篡改特性，以提高透明度和防止欺诈。在阐释这些优势的同时，我们还探讨了实施此类系统所面临的挑战，包括对专业技术知识的需求和安全方面的考虑。通过促进信任和问责制，Web 3.0 中的捐赠追踪系统在智能区块链网络的赋能下，旨在对慈善领域产生深远的积极影响。
{"title":"Smart Blockchain Networks: Revolutionizing Donation Tracking in the Web 3.0","authors":"Chaimaa Nairi , Murtaza Cicioğlu , Ali Çalhan","doi":"10.1016/j.comcom.2024.107972","DOIUrl":"10.1016/j.comcom.2024.107972","url":null,"abstract":"<div><div>A donation-tracking system leveraging smart contracts and blockchain technology holds transformative potential for reshaping the landscape of charitable giving, especially within the context of Web 3.0. This paper explores how smart contracts and blockchain can be used to create a transparent and secure ledger for tracking charitable donations. We highlight the limitations of traditional donation systems and how a blockchain-based system can help overcome these challenges. The functionality of smart contracts in donation tracking, offering advantages such as automation, reduced transaction fees, and enhanced accountability, is elucidated. The decentralized and tamper-proof nature of blockchain technology is emphasized for increased transparency and fraud prevention. While elucidating the benefits, we also address challenges in implementing such a system, including the need for technical expertise and security considerations. By fostering trust and accountability, a donation-tracking system in Web 3.0, empowered by smart blockchain networks, aims to catalyze a profound positive impact in the realm of philanthropy.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107972"},"PeriodicalIF":4.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-05DOI: 10.1016/j.comcom.2024.107965
Senay A. Gebreab , Ahmad Musamih , Haya R. Hasan , Khaled Salah , Raja Jayaraman , Yousof Al Hammadi , Mohammed Omar
Digital twins and digital artifacts have become integral components of metaverse platforms, providing users with a rich, immersive, and interactive digital experience through the deployment of diverse digital twins and digital artifacts such as 3D avatars, images, and objects. To date, a significant challenge persists in the lack of practical mechanisms to enable seamless teleportation and cross-metaverse interoperability for these digital twins and digital artifacts. There is also a lack of trusted monetization methods that facilitate trading and leasing of digital twins and digital artifacts. To address these important challenges, this paper proposes a blockchain and Non-Fungible Token (NFT)-based solution that facilitates the integration and teleportation of these digital twins and digital artifacts by providing trusted metadata, verifying ownership, and ensuring the authenticity of digital creations in the virtual world. Key to our solution is the introduction of a bridging mechanism that enables cross-metaverse interoperability, allowing for the portable transfer of NFTs across decentralized metaverse platforms. In addition, our solution focuses on empowering original digital creators by enabling the monetization of their creations through the ownership management capabilities offered by NFTs. To reliably and securely store the metadata and content of tokenized digital twins and digital artifacts, we integrate into our solution the Interplanetary File System (IPFS), a decentralized storage system. To demonstrate the feasibility of our solution, we have developed and deployed all necessary smart contracts that govern the main functionalities and interactions of the proposed system on the Ethereum Goerli Testnet. We present our proposed system architecture, accompanied by informative sequence diagrams, algorithms, and testing details. We discuss how our proposed solution attains the main objectives outlined in the paper. We evaluate our proposed solution in terms of cost and security. We have made the complete source code of our smart contracts publicly available on GitHub.
{"title":"NFTs for accessing, monetizing, and teleporting digital twins and digital artifacts in the metaverse","authors":"Senay A. Gebreab , Ahmad Musamih , Haya R. Hasan , Khaled Salah , Raja Jayaraman , Yousof Al Hammadi , Mohammed Omar","doi":"10.1016/j.comcom.2024.107965","DOIUrl":"10.1016/j.comcom.2024.107965","url":null,"abstract":"<div><div>Digital twins and digital artifacts have become integral components of metaverse platforms, providing users with a rich, immersive, and interactive digital experience through the deployment of diverse digital twins and digital artifacts such as 3D avatars, images, and objects. To date, a significant challenge persists in the lack of practical mechanisms to enable seamless teleportation and cross-metaverse interoperability for these digital twins and digital artifacts. There is also a lack of trusted monetization methods that facilitate trading and leasing of digital twins and digital artifacts. To address these important challenges, this paper proposes a blockchain and Non-Fungible Token (NFT)-based solution that facilitates the integration and teleportation of these digital twins and digital artifacts by providing trusted metadata, verifying ownership, and ensuring the authenticity of digital creations in the virtual world. Key to our solution is the introduction of a bridging mechanism that enables cross-metaverse interoperability, allowing for the portable transfer of NFTs across decentralized metaverse platforms. In addition, our solution focuses on empowering original digital creators by enabling the monetization of their creations through the ownership management capabilities offered by NFTs. To reliably and securely store the metadata and content of tokenized digital twins and digital artifacts, we integrate into our solution the Interplanetary File System (IPFS), a decentralized storage system. To demonstrate the feasibility of our solution, we have developed and deployed all necessary smart contracts that govern the main functionalities and interactions of the proposed system on the Ethereum Goerli Testnet. We present our proposed system architecture, accompanied by informative sequence diagrams, algorithms, and testing details. We discuss how our proposed solution attains the main objectives outlined in the paper. We evaluate our proposed solution in terms of cost and security. We have made the complete source code of our smart contracts publicly available on GitHub.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107965"},"PeriodicalIF":4.5,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-03DOI: 10.1016/j.comcom.2024.107970
Jian Wang , Tengfei Cao , Xingyan Chen , Xiaoying Wang
Vehicle-to-Everything (V2X) communication has the potential to revolutionize the travel experience in intelligent transportation, which has received the great attention recently. However, ensuring the freshness of information from multiple sources is critical for the real-time and reliable communication in vehicular networks, especially for timely updates of service centers. To address this issue, we use a promising metric called Age of Correlated Information (AoCI), which can characterize the freshness of multi-source information. Therefore, we propose a novel model that can dynamically regulate the channel activation matching and edge computing collaboration strategy to minimize AoCI in V2X vehicular networks. Firstly, we describe the system model of a V2X network with edge computing, including definitions and assumptions for freshness of information, edge co-computing, etc. Secondly, we formulate the joint optimization problem as a source-related age minimization (SRAM) problem, which is NP-complete. A heuristic algorithm is proposed to solve it under fast-fading channel. Finally, since traditional graph models cannot capture the changing correlation between nodes in dynamic networks, we use graph convolutional networks(GCN) to extract the features of multi-source correlation. The features extracted by GCN include relevant attributes of the sources and its communication links. The features are provided as input to a double deep Q network (DDQN) for training the model that can adapt to a dynamic network environment. Extensive simulation experiments in different network scenarios validate that our proposed method can effectively and efficiently reduce the average AoCI and the computational resources.
{"title":"Optimization of the age of correlated information in V2X networks with edge computing","authors":"Jian Wang , Tengfei Cao , Xingyan Chen , Xiaoying Wang","doi":"10.1016/j.comcom.2024.107970","DOIUrl":"10.1016/j.comcom.2024.107970","url":null,"abstract":"<div><div>Vehicle-to-Everything (V2X) communication has the potential to revolutionize the travel experience in intelligent transportation, which has received the great attention recently. However, ensuring the freshness of information from multiple sources is critical for the real-time and reliable communication in vehicular networks, especially for timely updates of service centers. To address this issue, we use a promising metric called Age of Correlated Information (AoCI), which can characterize the freshness of multi-source information. Therefore, we propose a novel model that can dynamically regulate the channel activation matching and edge computing collaboration strategy to minimize AoCI in V2X vehicular networks. Firstly, we describe the system model of a V2X network with edge computing, including definitions and assumptions for freshness of information, edge co-computing, etc. Secondly, we formulate the joint optimization problem as a source-related age minimization (SRAM) problem, which is NP-complete. A heuristic algorithm is proposed to solve it under fast-fading channel. Finally, since traditional graph models cannot capture the changing correlation between nodes in dynamic networks, we use graph convolutional networks(GCN) to extract the features of multi-source correlation. The features extracted by GCN include relevant attributes of the sources and its communication links. The features are provided as input to a double deep Q network (DDQN) for training the model that can adapt to a dynamic network environment. Extensive simulation experiments in different network scenarios validate that our proposed method can effectively and efficiently reduce the average AoCI and the computational resources.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107970"},"PeriodicalIF":4.5,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-03DOI: 10.1016/j.comcom.2024.107967
Shimin Sun , Jinqi Dong , Ze Wang , Xiangyun Liu , Li Han
In this paper, we tackle the critical challenges of content edge caching, such as limited storage capacity, content popularity prediction, dynamic user demand, and user privacy, issues that most existing studies only address partially. We present an innovative Genetic Algorithm-based On-demand Collaborative Edge Caching mechanism (GAOCEC), which introduces a multi-tiered caching architecture integrating cloud, fog, and edge computing. To enhance caching efficiency and minimize system cost, a novel on-demand caching quota mechanism is proposed that dynamically allocates cache resources to edge servers. To strengthen user privacy protection during content popularity prediction, a CNN-BiLSTM-based Federated Learning algorithm (CBFL) is presented that ensures high prediction accuracy without the need to upload local data to the cloud. We also refine the genetic algorithm for content placement by fine-tuning various parameter sets to identify the optimal balance between latency reduction and caching cost. Our experimental results validate the effectiveness of our approach, demonstrating increased cache hit rates, decreased content response times, and an overall improvement in system efficiency. This work provides a comprehensive, adaptive, and privacy-preserving solution for the edge–fog–cloud environment.
{"title":"An on-demand collaborative edge caching strategy for edge–fog–cloud environment","authors":"Shimin Sun , Jinqi Dong , Ze Wang , Xiangyun Liu , Li Han","doi":"10.1016/j.comcom.2024.107967","DOIUrl":"10.1016/j.comcom.2024.107967","url":null,"abstract":"<div><div>In this paper, we tackle the critical challenges of content edge caching, such as limited storage capacity, content popularity prediction, dynamic user demand, and user privacy, issues that most existing studies only address partially. We present an innovative Genetic Algorithm-based On-demand Collaborative Edge Caching mechanism (GAOCEC), which introduces a multi-tiered caching architecture integrating cloud, fog, and edge computing. To enhance caching efficiency and minimize system cost, a novel on-demand caching quota mechanism is proposed that dynamically allocates cache resources to edge servers. To strengthen user privacy protection during content popularity prediction, a CNN-BiLSTM-based Federated Learning algorithm (CBFL) is presented that ensures high prediction accuracy without the need to upload local data to the cloud. We also refine the genetic algorithm for content placement by fine-tuning various parameter sets to identify the optimal balance between latency reduction and caching cost. Our experimental results validate the effectiveness of our approach, demonstrating increased cache hit rates, decreased content response times, and an overall improvement in system efficiency. This work provides a comprehensive, adaptive, and privacy-preserving solution for the edge–fog–cloud environment.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107967"},"PeriodicalIF":4.5,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-02DOI: 10.1016/j.comcom.2024.107961
Assis T. de Oliveira Filho , Eduardo Freitas , Pedro R.X. do Carmo , Eduardo Souto , Judith Kelner , Djamel F.H. Sadok
Cloud computing, a central pillar of modern IT infrastructure, faces constant challenges in provisioning and optimizing network performance, specifically regarding low-latency communication. This study investigates the impact of Single Root I/O Virtualization (SR-IOV) as a critical Quality of Service (QoS) enabler in virtualized environments. Data plane innovative technologies for virtual servers, especially SR-IOV technology, emerged as a promising solution adopted in data centers. When combined with Peripheral Component Interconnect (PCI) Passthrough in Docker environments, SR-IOV promises significant network performance gains. Our rigorous experimental methodology demonstrates that integrating SR-IOV reduces Round-Trip Time (RTT) latency by up to 15 times compared to the traditional Linux based Bridge configuration used in Docker, without significant additional costs. This research is particularly relevant for system administrators, data center professionals, and network traffic engineers, providing them valuable information into optimizing communication in cloud computing environments. By addressing this critical gap in knowledge, our study serves as a practical guide for the effective implementation these emerging technologies for network virtualization. In terms of practical applicability, the results raise valuable insights into the performance and implications of implementing SR-IOV and PCI Passthrough in a Docker environment. As a result, more informed decisions are tailored to the specific requirements of different usage scenarios.
{"title":"Analysis of SR-IOV in Docker containers using RTT measurements","authors":"Assis T. de Oliveira Filho , Eduardo Freitas , Pedro R.X. do Carmo , Eduardo Souto , Judith Kelner , Djamel F.H. Sadok","doi":"10.1016/j.comcom.2024.107961","DOIUrl":"10.1016/j.comcom.2024.107961","url":null,"abstract":"<div><div>Cloud computing, a central pillar of modern IT infrastructure, faces constant challenges in provisioning and optimizing network performance, specifically regarding low-latency communication. This study investigates the impact of Single Root I/O Virtualization (SR-IOV) as a critical Quality of Service (QoS) enabler in virtualized environments. Data plane innovative technologies for virtual servers, especially SR-IOV technology, emerged as a promising solution adopted in data centers. When combined with Peripheral Component Interconnect (PCI) Passthrough in Docker environments, SR-IOV promises significant network performance gains. Our rigorous experimental methodology demonstrates that integrating SR-IOV reduces Round-Trip Time (RTT) latency by up to 15 times compared to the traditional Linux based Bridge configuration used in Docker, without significant additional costs. This research is particularly relevant for system administrators, data center professionals, and network traffic engineers, providing them valuable information into optimizing communication in cloud computing environments. By addressing this critical gap in knowledge, our study serves as a practical guide for the effective implementation these emerging technologies for network virtualization. In terms of practical applicability, the results raise valuable insights into the performance and implications of implementing SR-IOV and PCI Passthrough in a Docker environment. As a result, more informed decisions are tailored to the specific requirements of different usage scenarios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107961"},"PeriodicalIF":4.5,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号