首页 > 最新文献

Computer Communications最新文献

英文 中文
UAV-AGV cooperated remote toxic gas sensing and automated alarming scheme in smart factory 智能工厂中的无人机-AGV 协同远程有毒气体感应和自动报警方案
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-08 DOI: 10.1016/j.comcom.2024.08.005
Md Masuduzzaman , Ramdhan Nugraha , Soo Young Shin

This study introduces the innovative concepts of the cooperation between unmanned aerial vehicles (UAVs) and automated guided vehicles (AGVs) in remote toxic gas sensing and alarming schemes in a smart factory. Initially, the UAV is dispatched in different directions to detect toxic gas leakage on the fly in the smart factory premises. However, due to the UAVs’ concern about smokeless and high-density gas detection capabilities, AGVs are proposed to cooperate with UAVs in the smart factory, especially in the basement areas. Because of their limited computational power, UAVs and AGVs securely transfer sensor data to a nearby multi-access edge computing (MEC) server for processing. A hybrid cryptographic technique and unique data authentication mechanisms are exploited to ensure security while transmitting the data in this proposed scheme. Subsequently, the MEC server automatically triggers an emergency alarm during toxic gas leakage to alert all the employees inside the boundaries of the smart factory. The implementation results exhibit that the proposed scheme can successfully sense toxic gas leakage using UAVs and AGVs, securely transfer the data to the MEC server to process, and enhance the overall quality of service compared with the other existing literature. Finally, the outcome analysis demonstrates that the proposed scheme is more worthwhile and has distinctive features than other literary works.

本研究介绍了无人驾驶飞行器(UAV)与自动导引车(AGV)在智能工厂有毒气体远程感应和报警方案中的创新合作理念。最初,无人驾驶飞行器被派往不同方向,对智能工厂厂房内的有毒气体泄漏情况进行即时检测。然而,由于无人机对无烟和高密度气体检测能力的担忧,建议 AGV 在智能工厂中与无人机合作,尤其是在地下室区域。由于无人机和 AGV 的计算能力有限,因此要将传感器数据安全地传输到附近的多访问边缘计算(MEC)服务器进行处理。本方案采用混合加密技术和独特的数据认证机制来确保数据传输的安全性。随后,MEC 服务器会在有毒气体泄漏时自动触发紧急警报,提醒智能工厂边界内的所有员工。实施结果表明,与其他现有文献相比,本文提出的方案能够利用无人机和 AGV 成功感知有毒气体泄漏,并安全地将数据传输到 MEC 服务器进行处理,同时提高了整体服务质量。最后,结果分析表明,与其他文献相比,所提出的方案更有价值和特色。
{"title":"UAV-AGV cooperated remote toxic gas sensing and automated alarming scheme in smart factory","authors":"Md Masuduzzaman ,&nbsp;Ramdhan Nugraha ,&nbsp;Soo Young Shin","doi":"10.1016/j.comcom.2024.08.005","DOIUrl":"10.1016/j.comcom.2024.08.005","url":null,"abstract":"<div><p>This study introduces the innovative concepts of the cooperation between unmanned aerial vehicles (UAVs) and automated guided vehicles (AGVs) in remote toxic gas sensing and alarming schemes in a smart factory. Initially, the UAV is dispatched in different directions to detect toxic gas leakage on the fly in the smart factory premises. However, due to the UAVs’ concern about smokeless and high-density gas detection capabilities, AGVs are proposed to cooperate with UAVs in the smart factory, especially in the basement areas. Because of their limited computational power, UAVs and AGVs securely transfer sensor data to a nearby multi-access edge computing (MEC) server for processing. A hybrid cryptographic technique and unique data authentication mechanisms are exploited to ensure security while transmitting the data in this proposed scheme. Subsequently, the MEC server automatically triggers an emergency alarm during toxic gas leakage to alert all the employees inside the boundaries of the smart factory. The implementation results exhibit that the proposed scheme can successfully sense toxic gas leakage using UAVs and AGVs, securely transfer the data to the MEC server to process, and enhance the overall quality of service compared with the other existing literature. Finally, the outcome analysis demonstrates that the proposed scheme is more worthwhile and has distinctive features than other literary works.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107923"},"PeriodicalIF":4.5,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141964680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DRTP: A generic Differentiated Reliable Transport Protocol DRTP:通用的差异化可靠传输协议
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-08 DOI: 10.1016/j.comcom.2024.08.003
Yongmao Ren , Yundong Zhang , Ming Yin , Anmin Xu , Xu Zhou , Cong Li , Yifang Qin , Qinghua Wu , Mohamed Ali Kaafar , Gaogang Xie

With rapid development of network communications, the performance requirements of applications are getting more differentiated. Many applications like high-definition video transfer require high throughput but do tolerate occasional packet losses. Traditional generic transport protocols however, only provide inflexible data transfer guarantees (TCP (Transmission Control Protocol) offers full reliability guarantees and UDP (User Datagram Protocol) offers no guarantees). Moreover, TCP pays a significant price to ensure a full reliability guarantee over lossy wireless communications environment like 5G millimeter wave (mmWave) communications. While existing, “partially” reliable transport protocols are either specifically designed for certain applications or need router’s support. In this paper, we design a new generic Differentiated Reliable Transport Protocol (DRTP), aiming to provide a differentiated and deterministic reliability guarantee for upper layer applications while maximizing the throughput under the constraint of guaranteeing a required reliability of data transfer. DRTP is a generic and pure end-to-end partially reliable transport protocol, and as such is easy to deploy regardless of the application in use and with no need for router’s support. The performance of DRTP is evaluated under various network conditions using extensive NS-3 (Network Simulator) simulations and practical experiments over the mmWave communications environment. The results show much higher throughput compared to typical transport protocols while guaranteeing the required transfer reliability.

随着网络通信的快速发展,应用对性能的要求也越来越多样化。许多应用(如高清视频传输)要求高吞吐量,但又能容忍偶尔的数据包丢失。然而,传统的通用传输协议只能提供不灵活的数据传输保证(TCP(传输控制协议)提供完全的可靠性保证,UDP(用户数据报协议)不提供任何保证)。此外,在 5G 毫米波(mmWave)通信等有损无线通信环境中,TCP 要确保完全的可靠性保证需要付出巨大的代价。现有的 "部分 "可靠传输协议要么是专门为某些应用设计的,要么需要路由器的支持。在本文中,我们设计了一种新的通用差异化可靠传输协议(DRTP),旨在为上层应用提供差异化和确定性的可靠性保证,同时在保证所需数据传输可靠性的约束条件下最大化吞吐量。DRTP 是一种通用的、纯粹的端到端部分可靠传输协议,因此易于部署,无需路由器的支持,也无需考虑使用中的应用程序。在毫米波通信环境下,通过大量的 NS-3(网络模拟器)模拟和实际实验,对 DRTP 在各种网络条件下的性能进行了评估。结果表明,与典型的传输协议相比,DRTP 的吞吐量要高得多,同时还能保证所需的传输可靠性。
{"title":"DRTP: A generic Differentiated Reliable Transport Protocol","authors":"Yongmao Ren ,&nbsp;Yundong Zhang ,&nbsp;Ming Yin ,&nbsp;Anmin Xu ,&nbsp;Xu Zhou ,&nbsp;Cong Li ,&nbsp;Yifang Qin ,&nbsp;Qinghua Wu ,&nbsp;Mohamed Ali Kaafar ,&nbsp;Gaogang Xie","doi":"10.1016/j.comcom.2024.08.003","DOIUrl":"10.1016/j.comcom.2024.08.003","url":null,"abstract":"<div><p>With rapid development of network communications, the performance requirements of applications are getting more differentiated. Many applications like high-definition video transfer require high throughput but do tolerate occasional packet losses. Traditional generic transport protocols however, only provide inflexible data transfer guarantees (TCP (Transmission Control Protocol) offers full reliability guarantees and UDP (User Datagram Protocol) offers no guarantees). Moreover, TCP pays a significant price to ensure a full reliability guarantee over lossy wireless communications environment like 5G millimeter wave (mmWave) communications. While existing, “partially” reliable transport protocols are either specifically designed for certain applications or need router’s support. In this paper, we design a new generic Differentiated Reliable Transport Protocol (DRTP), aiming to provide a differentiated and deterministic reliability guarantee for upper layer applications while maximizing the throughput under the constraint of guaranteeing a required reliability of data transfer. DRTP is a generic and pure end-to-end partially reliable transport protocol, and as such is easy to deploy regardless of the application in use and with no need for router’s support. The performance of DRTP is evaluated under various network conditions using extensive NS-3 (Network Simulator) simulations and practical experiments over the mmWave communications environment. The results show much higher throughput compared to typical transport protocols while guaranteeing the required transfer reliability.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107921"},"PeriodicalIF":4.5,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142006762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning-powered migration of social digital twins at the network edge 网络边缘社交数字双胞胎的学习驱动迁移
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-07 DOI: 10.1016/j.comcom.2024.07.019
Olga Chukhno , Nadezhda Chukhno , Giuseppe Araniti , Claudia Campolo , Antonio Iera , Antonella Molinaro

Digital Twins (DTs), which are paired to Internet of Things (IoT) devices to represent them and augment their capabilities, are gaining ground as a promising technology to enable a wide variety of applications in the sixth-generation (6G) ecosystem, ranging from autonomous driving to extended reality and metaverse. In particular, “social” IoT (SIoT) devices, which are devices capable to establish social relationships with other devices, can be coupled with their virtual counterparts, i.e., social DTS (SDTs), to improve service discovery enabled by browsing the social network of friend devices. However, the mobility of SIoT devices (e.g., smartphones, wearables, vehicular on board units, etc.) may require frequent changes in the corresponding SDT placement in the edge domain to maintain a low latency between the physical device and its digital replica. Triggering SDT relocation at the right time is a critical task, because an incorrect choice could lead to either increased delays or a waste of network resources. This work proposes a learning-powered social-aware orchestration that predicts the mobility of SIoT devices to make more judicious migration decisions and efficiently move the paired SDTs accordingly, while ensuring the minimization of both intra-twin and inter-twin communication latencies. Different machine learning (ML) and deep learning (DL) algorithms are used for SIoT device mobility prediction and compared in terms of a wide set of meaningful metrics in order to identify the model that achieves the best trade-off between prediction accuracy and inference times under different scenarios. Simulation results showcase the improvements of the proposal in terms of reduced network overhead (by up to a factor of 3) and intra-twin and inter-twin communication latency (by up to 10%) compared to a more traditional solution, which activates the relocation of the DTs at fixed time intervals following periodic optimizations.

数字孪生(DTs)与物联网(IoT)设备配对,以代表这些设备并增强其功能,作为第六代(6G)生态系统中实现各种应用(从自动驾驶到扩展现实和元宇宙)的一项前景广阔的技术,它正日益受到重视。特别是 "社交 "物联网(SIoT)设备,即能够与其他设备建立社交关系的设备,可以与其虚拟对应设备(即社交 DTS(SDT))相结合,通过浏览好友设备的社交网络来改进服务发现功能。然而,SIoT 设备(如智能手机、可穿戴设备、车载设备等)的移动性可能要求频繁更改边缘域中相应的 SDT 位置,以保持物理设备与其数字副本之间的低延迟。在正确的时间触发 SDT 重置是一项关键任务,因为错误的选择可能导致延迟增加或网络资源浪费。本研究提出了一种由学习驱动的社会感知协调方法,它可以预测 SIoT 设备的移动性,从而做出更明智的迁移决策,并相应地有效移动配对的 SDT,同时确保最大限度地减少双子内部和双子之间的通信延迟。不同的机器学习(ML)和深度学习(DL)算法被用于 SIoT 设备移动性预测,并根据一系列有意义的指标进行比较,以确定在不同场景下预测准确性和推理时间之间实现最佳权衡的模型。仿真结果表明,与更传统的解决方案(在定期优化后以固定时间间隔激活 DT 的重新定位)相比,该建议在减少网络开销(最多减少 3 倍)以及双机内和双机间通信延迟(最多减少 10%)方面有很大改进。
{"title":"Learning-powered migration of social digital twins at the network edge","authors":"Olga Chukhno ,&nbsp;Nadezhda Chukhno ,&nbsp;Giuseppe Araniti ,&nbsp;Claudia Campolo ,&nbsp;Antonio Iera ,&nbsp;Antonella Molinaro","doi":"10.1016/j.comcom.2024.07.019","DOIUrl":"10.1016/j.comcom.2024.07.019","url":null,"abstract":"<div><p>Digital Twins (DTs), which are paired to Internet of Things (IoT) devices to represent them and augment their capabilities, are gaining ground as a promising technology to enable a wide variety of applications in the sixth-generation (6G) ecosystem, ranging from autonomous driving to extended reality and metaverse. In particular, “social” IoT (SIoT) devices, which are devices capable to establish social relationships with other devices, can be coupled with their virtual counterparts, i.e., social DTS (SDTs), to improve service discovery enabled by browsing the social network of friend devices. However, the mobility of SIoT devices (e.g., smartphones, wearables, vehicular on board units, etc.) may require frequent changes in the corresponding SDT placement in the edge domain to maintain a low latency between the physical device and its digital replica. Triggering SDT relocation at the right time is a critical task, because an incorrect choice could lead to either increased delays or a waste of network resources. This work proposes a learning-powered social-aware orchestration that predicts the mobility of SIoT devices to make more judicious migration decisions and efficiently move the paired SDTs accordingly, while ensuring the minimization of both intra-twin and inter-twin communication latencies. Different machine learning (ML) and deep learning (DL) algorithms are used for SIoT device mobility prediction and compared in terms of a wide set of meaningful metrics in order to identify the model that achieves the best trade-off between prediction accuracy and inference times under different scenarios. Simulation results showcase the improvements of the proposal in terms of reduced network overhead (by up to a factor of 3) and intra-twin and inter-twin communication latency (by up to 10%) compared to a more traditional solution, which activates the relocation of the DTs at fixed time intervals following periodic optimizations.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107918"},"PeriodicalIF":4.5,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002573/pdfft?md5=a76795727c1586c95d81a3c2b6cc030b&pid=1-s2.0-S0140366424002573-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the optimal design of fully identifiable next-generation in-vehicle networks 关于完全可识别的下一代车载网络的优化设计
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-06 DOI: 10.1016/j.comcom.2024.08.002
Amani Ibraheem , Zhengguo Sheng , George Parisis

Due to the emerging advances in connected and autonomous vehicles, today’s in-vehicle networks, unlike traditional networks, are not only internally connected but externally as well, exposing the vehicle to the outside world and making it more vulnerable to cyber-security threats. Monitoring the in-vehicle network, thus, becomes one of the essential and crucial tasks to be implemented in vehicles. However, the closed-in nature of the vehicle’s components hinders the global monitoring of the in-vehicle network, leading to incomplete measurements, which may result in undetected failures. One solution to this is to use network tomography. Nevertheless, applying network tomography in in-vehicle networks is not a trivial task. Mainly because it requires that the in-vehicle network topology should be identifiable. To this end, we propose in this work an identifiable in-vehicle network topology that enables overall monitoring of the network using network tomography. The new topology is proposed based on extensive analysis to ensure full identifiability under the constraint that only edge nodes can monitor the network, which is the case for in-vehicle networks where internal nodes are not directly accessible. We propose two main algorithms to transform existing in-vehicle network topologies. The first algorithm applies to an existing topology which can be transformed into full identifiability by adding extra nodes/links. Evaluation results show the effectiveness of the proposed transformation algorithms with a maximum added weight of only 3% of the original weight. Furthermore, a new optimisation algorithm is also proposed to minimise the topology weight whilst maintaining the full identifiability by redesigning a new topology. With this algorithm, the results show that the total weight can be reduced by 6%. In addition, compared with the existing approaches, monitoring the in-vehicle networks with the proposed approach can achieve better monitoring overhead and a 100% identifiability ratio.

由于互联汽车和自动驾驶汽车的不断进步,如今的车载网络与传统网络不同,不仅与内部相连,而且还与外部相连,从而使车辆暴露于外部世界,更容易受到网络安全威胁。因此,对车载网络进行监控就成为车辆必须执行的重要任务之一。然而,车辆组件的封闭性阻碍了对车载网络的全面监控,导致测量不完整,从而可能导致无法检测到的故障。解决这一问题的方法之一是使用网络断层扫描技术。然而,在车载网络中应用网络断层扫描技术并非易事。这主要是因为它要求车载网络拓扑结构必须是可识别的。为此,我们在这项工作中提出了一种可识别的车载网络拓扑结构,以便利用网络断层扫描技术对网络进行整体监控。新拓扑是在广泛分析的基础上提出的,以确保在只有边缘节点可以监控网络的约束条件下完全可识别,而这正是内部节点无法直接访问的车载网络的情况。我们提出了两种主要算法来改造现有的车载网络拓扑结构。第一种算法适用于现有的拓扑结构,通过增加额外的节点/链路可将其转化为完全可识别的拓扑结构。评估结果表明,所建议的转换算法非常有效,增加的最大权重仅为原始权重的 3%。此外,还提出了一种新的优化算法,通过重新设计新的拓扑结构,在保持完全可识别性的同时最大限度地降低拓扑结构权重。结果表明,采用这种算法后,总权重可降低 6%。此外,与现有方法相比,使用所提出的方法监控车载网络可实现更好的监控开销和 100% 的可识别率。
{"title":"On the optimal design of fully identifiable next-generation in-vehicle networks","authors":"Amani Ibraheem ,&nbsp;Zhengguo Sheng ,&nbsp;George Parisis","doi":"10.1016/j.comcom.2024.08.002","DOIUrl":"10.1016/j.comcom.2024.08.002","url":null,"abstract":"<div><p>Due to the emerging advances in connected and autonomous vehicles, today’s in-vehicle networks, unlike traditional networks, are not only internally connected but externally as well, exposing the vehicle to the outside world and making it more vulnerable to cyber-security threats. Monitoring the in-vehicle network, thus, becomes one of the essential and crucial tasks to be implemented in vehicles. However, the closed-in nature of the vehicle’s components hinders the global monitoring of the in-vehicle network, leading to incomplete measurements, which may result in undetected failures. One solution to this is to use network tomography. Nevertheless, applying network tomography in in-vehicle networks is not a trivial task. Mainly because it requires that the in-vehicle network topology should be <em>identifiable</em>. To this end, we propose in this work an identifiable in-vehicle network topology that enables overall monitoring of the network using network tomography. The new topology is proposed based on extensive analysis to ensure full identifiability under the constraint that only edge nodes can monitor the network, which is the case for in-vehicle networks where internal nodes are not directly accessible. We propose two main algorithms to transform existing in-vehicle network topologies. The first algorithm applies to an existing topology which can be transformed into full identifiability by adding extra nodes/links. Evaluation results show the effectiveness of the proposed transformation algorithms with a maximum added weight of only 3% of the original weight. Furthermore, a new optimisation algorithm is also proposed to minimise the topology weight whilst maintaining the full identifiability by redesigning a new topology. With this algorithm, the results show that the total weight can be reduced by 6%. In addition, compared with the existing approaches, monitoring the in-vehicle networks with the proposed approach can achieve better monitoring overhead and a 100% identifiability ratio.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107920"},"PeriodicalIF":4.5,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141978025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Experimental evaluation of interactive Edge/Cloud Virtual Reality gaming over Wi-Fi using unity render streaming 通过 Wi-Fi 使用 unity 渲染流对交互式边缘/云虚拟现实游戏进行实验评估
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-03 DOI: 10.1016/j.comcom.2024.08.001
Miguel Casasnovas, Costas Michaelides, Marc Carrascosa-Zamacois, Boris Bellalta

Virtual Reality (VR) streaming enables end-users to seamlessly immerse themselves in interactive virtual environments using even low-end devices. However, the quality of the VR experience heavily relies on Wireless Fidelity (Wi-Fi) performance, since it serves as the last hop in the network chain. Our study delves into the intricate interplay between Wi-Fi and VR traffic, drawing upon empirical data and leveraging a Wi-Fi simulator. In this work, we further evaluate Wi-Fi’s suitability for VR streaming in terms of the Quality of Service (QoS) it provides. In particular, we employ Unity Render Streaming to remotely stream real-time VR gaming content over Wi-Fi 6 using Web Real-Time Communication (WebRTC), considering a server physically located at the network’s edge, near the end user. Our findings demonstrate the system’s sustained network performance, showcasing minimal round-trip time (RTT) and jitter at 60 and 90 frames per second (fps). In addition, we uncover the characteristics and patterns of the generated traffic streams, unveiling a distinctive video transmission approach inherent to WebRTC-based services: the systematic packetization of video frames (VFs) and their transmission in discrete batches at regular intervals, regardless of the targeted frame rate. This interval-based transmission strategy maintains consistent video packet delays across video frame rates but leads to increased Wi-Fi airtime consumption. Our results demonstrate that shortening the interval between batches is advantageous, as it enhances Wi-Fi efficiency and reduces delays in delivering complete frames.

虚拟现实(VR)流媒体使终端用户即使使用低端设备也能无缝地沉浸在交互式虚拟环境中。然而,VR 体验的质量在很大程度上依赖于无线保真(Wi-Fi)性能,因为它是网络链中的最后一跳。我们的研究利用经验数据和 Wi-Fi 模拟器,深入探讨了 Wi-Fi 和 VR 流量之间错综复杂的相互作用。在这项工作中,我们从服务质量(QoS)的角度进一步评估了 Wi-Fi 对 VR 流媒体的适用性。特别是,我们采用 Unity Render Streaming 技术,通过 Wi-Fi 6 使用网络实时通信(WebRTC)远程流式传输实时 VR 游戏内容,同时考虑到服务器实际位于网络边缘,靠近终端用户。我们的研究结果表明,该系统具有持续的网络性能,在每秒 60 帧和 90 帧的情况下,往返时间(RTT)和抖动极小。此外,我们还揭示了所生成流量流的特征和模式,揭示了基于 WebRTC 的服务所固有的独特视频传输方法:视频帧(VF)的系统化分组,以及无论目标帧速率如何都以固定间隔进行离散批次传输。这种基于时间间隔的传输策略可在不同视频帧速率下保持一致的视频数据包延迟,但会增加 Wi-Fi 通话时间消耗。我们的研究结果表明,缩短批次之间的间隔是有利的,因为这样可以提高 Wi-Fi 效率,减少完整帧传输的延迟。
{"title":"Experimental evaluation of interactive Edge/Cloud Virtual Reality gaming over Wi-Fi using unity render streaming","authors":"Miguel Casasnovas,&nbsp;Costas Michaelides,&nbsp;Marc Carrascosa-Zamacois,&nbsp;Boris Bellalta","doi":"10.1016/j.comcom.2024.08.001","DOIUrl":"10.1016/j.comcom.2024.08.001","url":null,"abstract":"<div><p>Virtual Reality (VR) streaming enables end-users to seamlessly immerse themselves in interactive virtual environments using even low-end devices. However, the quality of the VR experience heavily relies on Wireless Fidelity (Wi-Fi) performance, since it serves as the last hop in the network chain. Our study delves into the intricate interplay between Wi-Fi and VR traffic, drawing upon empirical data and leveraging a Wi-Fi simulator. In this work, we further evaluate Wi-Fi’s suitability for VR streaming in terms of the Quality of Service (QoS) it provides. In particular, we employ Unity Render Streaming to remotely stream real-time VR gaming content over Wi-Fi 6 using Web Real-Time Communication (WebRTC), considering a server physically located at the network’s edge, near the end user. Our findings demonstrate the system’s sustained network performance, showcasing minimal round-trip time (RTT) and jitter at 60 and 90 frames per second (fps). In addition, we uncover the characteristics and patterns of the generated traffic streams, unveiling a distinctive video transmission approach inherent to WebRTC-based services: the systematic packetization of video frames (VFs) and their transmission in discrete batches at regular intervals, regardless of the targeted frame rate. This interval-based transmission strategy maintains consistent video packet delays across video frame rates but leads to increased Wi-Fi airtime consumption. Our results demonstrate that shortening the interval between batches is advantageous, as it enhances Wi-Fi efficiency and reduces delays in delivering complete frames.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107919"},"PeriodicalIF":4.5,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002585/pdfft?md5=03658604669a9b950a6095508919c762&pid=1-s2.0-S0140366424002585-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Energy efficiency optimization for 6G multi-IRS multi-cell NOMA vehicle-to-infrastructure communication networks 优化 6G 多IRS 多蜂窝 NOMA 车对基础设施通信网络的能效
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-02 DOI: 10.1016/j.comcom.2024.07.018
Mashael Maashi , Eatedal Alabdulkreem , Noha Negm , Abdulbasit A. Darem , Mesfer Al Duhayyim , Ashit Kumar Dutta , Wali Ullah Khan , Ali Nauman

Intelligent Reflecting Surfaces (IRS), software-controlled metasurfaces, have emerged as an upcoming sixth-generation (6G) wireless communication technology. IRS intelligently manipulates and optimizes signal propagation using a large-scale array of intelligent elements, enhancing signal coverage, increasing capacity, mitigating path loss, and combating multipath fading This work provides a new energy-efficiency model for multi-IRS-assisted multi-cell non-orthogonal multiple access (NOMA) vehicular to infrastructure communication networks. The objective is the joint optimization of the total power budget at the roadside unit (RSU), NOMA power allocation for the user equipment, and designing phase shifts for IRS in each cell to maximize the achievable energy efficiency of the system. Due to non-convexity, the original non-convex problem is first decoupled and transformed using block coordinate descent and successive convex approximation methods. Then, an efficient solution is achieved using Gradient-based and interior-point methods. We also consider two benchmark schemes: (1) NOMA power optimization at RSU with random phase shift design at IRS and (2) orthogonal multiple access power allocation with optimal phase shift design at IRS. Numerical results show the superiority of the proposed solution compared to the benchmark schemes. The proposed solution outperforms the benchmarks, demonstrating a 59.57% and 151.21% improvement over the NOMA and orthogonal schemes, respectively, at pct=2 dBm. Additionally, it shows up to a 10.43% better performance than OMA at 10 IRS elements.

智能反射面(IRS)是一种由软件控制的元表面,已成为即将出现的第六代(6G)无线通信技术。IRS 利用大规模智能元件阵列智能操控和优化信号传播,从而增强信号覆盖范围、提高容量、减少路径损耗并对抗多径衰落。其目标是联合优化路边单元(RSU)的总功率预算、用户设备的 NOMA 功率分配以及每个小区 IRS 的相移设计,以最大限度地提高系统的可实现能效。由于存在非凸性,因此首先使用块坐标下降和连续凸近似方法对原始非凸问题进行解耦和转换。然后,使用基于梯度的方法和内点法实现高效求解。我们还考虑了两个基准方案:(1) RSU 的 NOMA 功率优化与 IRS 的随机相移设计;(2) 正交多址功率分配与 IRS 的最优相移设计。数值结果表明,与基准方案相比,所提出的解决方案更具优势。建议的解决方案优于基准方案,在 dBm 值上比 NOMA 和正交方案分别提高了 59.57% 和 151.21%。此外,在 10 个 IRS 元素时,该方案比 OMA 性能提高了 10.43%。
{"title":"Energy efficiency optimization for 6G multi-IRS multi-cell NOMA vehicle-to-infrastructure communication networks","authors":"Mashael Maashi ,&nbsp;Eatedal Alabdulkreem ,&nbsp;Noha Negm ,&nbsp;Abdulbasit A. Darem ,&nbsp;Mesfer Al Duhayyim ,&nbsp;Ashit Kumar Dutta ,&nbsp;Wali Ullah Khan ,&nbsp;Ali Nauman","doi":"10.1016/j.comcom.2024.07.018","DOIUrl":"10.1016/j.comcom.2024.07.018","url":null,"abstract":"<div><p>Intelligent Reflecting Surfaces (IRS), software-controlled metasurfaces, have emerged as an upcoming sixth-generation (6G) wireless communication technology. IRS intelligently manipulates and optimizes signal propagation using a large-scale array of intelligent elements, enhancing signal coverage, increasing capacity, mitigating path loss, and combating multipath fading This work provides a new energy-efficiency model for multi-IRS-assisted multi-cell non-orthogonal multiple access (NOMA) vehicular to infrastructure communication networks. The objective is the joint optimization of the total power budget at the roadside unit (RSU), NOMA power allocation for the user equipment, and designing phase shifts for IRS in each cell to maximize the achievable energy efficiency of the system. Due to non-convexity, the original non-convex problem is first decoupled and transformed using block coordinate descent and successive convex approximation methods. Then, an efficient solution is achieved using Gradient-based and interior-point methods. We also consider two benchmark schemes: (1) NOMA power optimization at RSU with random phase shift design at IRS and (2) orthogonal multiple access power allocation with optimal phase shift design at IRS. Numerical results show the superiority of the proposed solution compared to the benchmark schemes. The proposed solution outperforms the benchmarks, demonstrating a 59.57% and 151.21% improvement over the NOMA and orthogonal schemes, respectively, at <span><math><mrow><msub><mrow><mi>p</mi></mrow><mrow><mi>c</mi><mi>t</mi></mrow></msub><mo>=</mo><mn>2</mn></mrow></math></span> dBm. Additionally, it shows up to a 10.43% better performance than OMA at 10 IRS elements.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 350-360"},"PeriodicalIF":4.5,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SDNRoute: Proactive routing optimization in Software Defined Networks SDNRoute:软件定义网络中的主动路由优化
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-27 DOI: 10.1016/j.comcom.2024.07.015
Piotr Boryło, Piotr Chołda, Jerzy Domżał, Piotr Jaglarz, Piotr Jurkiewicz, Michał Rzepka, Grzegorz Rzym, Robert Wójcik

Despite opening attractive perspectives, the concept of Software Defined Networking raises doubts about the performance and practical feasibility. To contradict these concerns, we propose a deployment-ready system aimed at proactive and periodic optimization of flow paths. The modular system consists of modules responsible for traffic prediction, static optimization, measurements, flow management, and validation of optimization results. To make the system efficient, we resolved several scientific issues and proposed novel and valuable solutions, for example methods for efficient proactive flow management and periodic re-optimization of routing policies. Simultaneously, to make the system production-ready and create a reliable research environment, we provide solutions to several technical obstacles.

We validate the proposed system with three network topologies, each with three load levels, following real-life traffic models. We consider Equal-Cost Multi-Path Routing as a baseline. The results indicate that the system allows network operators to handle more traffic (packet loss reduced by up to 30%), improve quality of service (less congested links resulted in even 2.5 times lower latency), and reduce operational expenses (energy consumption lowered by up to 10%).

尽管软件定义网络(Software Defined Networking)的概念前景诱人,但其性能和实际可行性却令人怀疑。为了消除这些疑虑,我们提出了一种部署就绪的系统,旨在主动定期优化流量路径。该模块化系统由负责流量预测、静态优化、测量、流量管理和优化结果验证的模块组成。为了提高系统的效率,我们解决了一些科学问题,并提出了新颖而有价值的解决方案,例如高效的主动流量管理方法和路由策略的定期重新优化方法。同时,为了使系统能够投入生产并创造一个可靠的研究环境,我们还为一些技术障碍提供了解决方案。我们根据现实生活中的流量模型,用三种网络拓扑结构验证了所提出的系统,每种拓扑结构都有三种负载水平。我们将等成本多路径路由(Equal-Cost Multi-Path Routing)作为基准。结果表明,该系统能让网络运营商处理更多的流量(数据包丢失率降低达 30%),提高服务质量(减少拥堵链路,使延迟时间降低 2.5 倍),并降低运营成本(能耗降低达 10%)。
{"title":"SDNRoute: Proactive routing optimization in Software Defined Networks","authors":"Piotr Boryło,&nbsp;Piotr Chołda,&nbsp;Jerzy Domżał,&nbsp;Piotr Jaglarz,&nbsp;Piotr Jurkiewicz,&nbsp;Michał Rzepka,&nbsp;Grzegorz Rzym,&nbsp;Robert Wójcik","doi":"10.1016/j.comcom.2024.07.015","DOIUrl":"10.1016/j.comcom.2024.07.015","url":null,"abstract":"<div><p>Despite opening attractive perspectives, the concept of Software Defined Networking raises doubts about the performance and practical feasibility. To contradict these concerns, we propose a deployment-ready system aimed at proactive and periodic optimization of flow paths. The modular system consists of modules responsible for traffic prediction, static optimization, measurements, flow management, and validation of optimization results. To make the system efficient, we resolved several scientific issues and proposed novel and valuable solutions, for example methods for efficient proactive flow management and periodic re-optimization of routing policies. Simultaneously, to make the system production-ready and create a reliable research environment, we provide solutions to several technical obstacles.</p><p>We validate the proposed system with three network topologies, each with three load levels, following real-life traffic models. We consider Equal-Cost Multi-Path Routing as a baseline. The results indicate that the system allows network operators to handle more traffic (packet loss reduced by up to 30%), improve quality of service (less congested links resulted in even 2.5 times lower latency), and reduce operational expenses (energy consumption lowered by up to 10%).</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 250-278"},"PeriodicalIF":4.5,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002536/pdfft?md5=075b84c34b671c9f60c6e8a088aefac1&pid=1-s2.0-S0140366424002536-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141852480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tethering Layer 2 solutions to the blockchain: A survey on proving schemes 将第 2 层解决方案与区块链绑定:证明方案调查
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-26 DOI: 10.1016/j.comcom.2024.07.017
Domenico Tortola , Andrea Lisi , Paolo Mori , Laura Ricci

A blockchain is a data structure consisting of a list of blocks containing transactions and maintained by a network of nodes in a decentralized manner. In permissionless blockchains, anyone can contribute to the decentralization and security of the transactions. With the advent of smart contracts, programs whose execution is replicated by all the nodes of the network, the blockchain can be deemed not only a reliable and auditable data repository, but also a secure and verifiable computational infrastructure. However, due to the aforementioned features, the throughput of most permissionless blockchains is low, and executing a smart contract can be expensive, depending on its computational complexity. To mitigate these issues, a popular research line studies the implementation of Layer 2 solutions, which consists of nodes that operate off-chain yet remaining tethered to the blockchain. Our literature analysis revealed that a majority of the research articles surveying Layer 2 technologies and solutions typically classify them on the basis of the Layer 2 operations they perform, as well as their ability to improve the processing capacity of the blockchain. In this paper, instead, we survey the methodologies that provide a secure binding between Layer 2 and the blockchain. We refer to these binding techniques as “proving schemes” which we classify as: data integrity proofs, validity proofs, and fraud proofs. For each proving scheme, we describe its intended purpose, the advantages it offers, the methodologies commonly used to connect the operations performed at Layer 2 with the blockchain, and the applications that benefit from such scheme. Finally, we discuss and compare them to give a general comprehension about how schemes can satisfy general requirements common to most Decentralized Applications.

区块链是一种数据结构,由包含交易的区块列表组成,由节点网络以去中心化的方式维护。在无权限区块链中,任何人都可以为交易的去中心化和安全性做出贡献。随着智能合约(网络中的所有节点都可以复制执行的程序)的出现,区块链不仅可以被视为可靠、可审计的数据存储库,还可以被视为安全、可验证的计算基础设施。然而,由于上述特点,大多数无权限区块链的吞吐量较低,而且执行智能合约的成本可能很高,这取决于其计算复杂度。为了缓解这些问题,一个流行的研究方向是研究第 2 层解决方案的实施,其中包括在链外运行但仍与区块链保持联系的节点。我们的文献分析表明,大多数调查第 2 层技术和解决方案的研究文章通常根据其执行的第 2 层操作以及提高区块链处理能力的能力对其进行分类。而在本文中,我们调查的是在第 2 层和区块链之间提供安全绑定的方法。我们将这些绑定技术称为 "证明方案",并将其分为:数据完整性证明、有效性证明和欺诈证明。对于每种证明方案,我们都会描述其预期目的、提供的优势、将第 2 层执行的操作与区块链连接起来的常用方法,以及受益于此类方案的应用。最后,我们将对这些方案进行讨论和比较,以全面了解这些方案如何满足大多数去中心化应用的一般要求。
{"title":"Tethering Layer 2 solutions to the blockchain: A survey on proving schemes","authors":"Domenico Tortola ,&nbsp;Andrea Lisi ,&nbsp;Paolo Mori ,&nbsp;Laura Ricci","doi":"10.1016/j.comcom.2024.07.017","DOIUrl":"10.1016/j.comcom.2024.07.017","url":null,"abstract":"<div><p>A blockchain is a data structure consisting of a list of blocks containing transactions and maintained by a network of nodes in a decentralized manner. In permissionless blockchains, anyone can contribute to the decentralization and security of the transactions. With the advent of smart contracts, programs whose execution is replicated by all the nodes of the network, the blockchain can be deemed not only a reliable and auditable data repository, but also a secure and verifiable computational infrastructure. However, due to the aforementioned features, the throughput of most permissionless blockchains is low, and executing a smart contract can be expensive, depending on its computational complexity. To mitigate these issues, a popular research line studies the implementation of Layer 2 solutions, which consists of nodes that operate off-chain yet remaining tethered to the blockchain. Our literature analysis revealed that a majority of the research articles surveying Layer 2 technologies and solutions typically classify them on the basis of the Layer 2 operations they perform, as well as their ability to improve the processing capacity of the blockchain. In this paper, instead, we survey the methodologies that provide a secure binding between Layer 2 and the blockchain. We refer to these binding techniques as “proving schemes” which we classify as: data integrity proofs, validity proofs, and fraud proofs. For each proving scheme, we describe its intended purpose, the advantages it offers, the methodologies commonly used to connect the operations performed at Layer 2 with the blockchain, and the applications that benefit from such scheme. Finally, we discuss and compare them to give a general comprehension about how schemes can satisfy general requirements common to most Decentralized Applications.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 289-310"},"PeriodicalIF":4.5,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S014036642400255X/pdfft?md5=34bf105a60f16c6625fec02f703c12b8&pid=1-s2.0-S014036642400255X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141852333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving WiFi fingerprint-based people counting for crowd management 用于人群管理的基于 WiFi 指纹的隐私保护人员计数系统
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-25 DOI: 10.1016/j.comcom.2024.07.010
Riccardo Rusca, Diego Gasco, Claudio Casetti, Paolo Giaccone

The practice of people counting serves as an indispensable tool for meticulously monitoring crowd dynamics, enabling informed decision-making in critical situations, and optimizing the management of urban spaces, facilities, and services. Beyond its fundamental role in safety and security, tracking people’s flows has evolved into a necessity for diverse business applications and the effective administration of both outdoor and indoor urban environments. In the ongoing exploration of the study, emphasis is placed on employing a passive counting technique. This method leverages WiFi probe request messages emitted by smart devices to assess the number of devices, providing a reliable estimate of the number of people in a specific area. However, it is crucial to acknowledge the dynamic landscape of privacy regulations and the concerted efforts by leading smart-device manufacturers to fortify user privacy, as evidenced by the adoption of MAC address randomization. In response to these considerations, an enhanced iteration of the WiFi traffic generator has been introduced. This upgraded version is designed to generate realistic datasets with ground truth, aligning with the evolving privacy landscape. Additionally, leveraging a profound understanding of probe requests and the capabilities of the designed generator, a novel crowd monitoring solution that incorporates machine learning techniques, named ARGO, has been developed. This innovative approach effectively addresses challenges posed by randomized MAC addresses, incorporating Bloom filters to ensure a formal “deniability” that complies with stringent regulations, including the European GDPR (European Parliament, Council of the European Union, Regulation (EU), 2016). The proposed solution adeptly addresses the pivotal task of people counting by harnessing WiFi probe request messages. Significantly, it prioritizes users’ privacy, aligning with the foundational principles outlined in regulations such as the European GDPR.

人流统计是一种不可或缺的工具,可用于细致监控人群动态,在危急情况下做出明智决策,以及优化城市空间、设施和服务的管理。除了在安全和安保方面的基本作用外,追踪人流已发展成为各种商业应用以及有效管理室外和室内城市环境的必要手段。在目前的研究探索中,重点是采用一种被动计数技术。这种方法利用智能设备发出的 WiFi 探测请求信息来评估设备数量,从而对特定区域的人数做出可靠的估计。然而,我们必须认识到隐私法规的动态发展,以及主要智能设备制造商为保护用户隐私而做出的共同努力,MAC 地址随机化的采用就证明了这一点。基于这些考虑,我们推出了 WiFi 流量生成器的增强迭代版本。该升级版本旨在生成具有地面实况的真实数据集,以适应不断变化的隐私环境。此外,利用对探针请求和所设计生成器功能的深刻理解,我们还开发了一种融合了机器学习技术的新型人群监控解决方案(名为 ARGO)。这种创新方法有效地解决了随机 MAC 地址带来的挑战,并结合了 Bloom 过滤器,以确保形式上的 "可抵赖性",从而符合严格的法规,包括欧洲 GDPR(欧洲议会、欧盟理事会、法规(EU),2016 年)。拟议的解决方案通过利用 WiFi 探针请求信息,巧妙地解决了人数统计这一关键任务。值得注意的是,它优先考虑了用户隐私,符合欧洲 GDPR 等法规中概述的基本原则。
{"title":"Privacy-preserving WiFi fingerprint-based people counting for crowd management","authors":"Riccardo Rusca,&nbsp;Diego Gasco,&nbsp;Claudio Casetti,&nbsp;Paolo Giaccone","doi":"10.1016/j.comcom.2024.07.010","DOIUrl":"10.1016/j.comcom.2024.07.010","url":null,"abstract":"<div><p>The practice of people counting serves as an indispensable tool for meticulously monitoring crowd dynamics, enabling informed decision-making in critical situations, and optimizing the management of urban spaces, facilities, and services. Beyond its fundamental role in safety and security, tracking people’s flows has evolved into a necessity for diverse business applications and the effective administration of both outdoor and indoor urban environments. In the ongoing exploration of the study, emphasis is placed on employing a passive counting technique. This method leverages WiFi probe request messages emitted by smart devices to assess the number of devices, providing a reliable estimate of the number of people in a specific area. However, it is crucial to acknowledge the dynamic landscape of privacy regulations and the concerted efforts by leading smart-device manufacturers to fortify user privacy, as evidenced by the adoption of MAC address randomization. In response to these considerations, an enhanced iteration of the WiFi traffic generator has been introduced. This upgraded version is designed to generate realistic datasets with ground truth, aligning with the evolving privacy landscape. Additionally, leveraging a profound understanding of probe requests and the capabilities of the designed generator, a novel crowd monitoring solution that incorporates machine learning techniques, named <strong>ARGO</strong>, has been developed. This innovative approach effectively addresses challenges posed by randomized MAC addresses, incorporating Bloom filters to ensure a formal “deniability” that complies with stringent regulations, including the European GDPR (European Parliament, Council of the European Union, Regulation (EU), 2016). The proposed solution adeptly addresses the pivotal task of people counting by harnessing WiFi probe request messages. Significantly, it prioritizes users’ privacy, aligning with the foundational principles outlined in regulations such as the European GDPR.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 339-349"},"PeriodicalIF":4.5,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002482/pdfft?md5=9457ab8d762cad7b7fa0ca64c873b035&pid=1-s2.0-S0140366424002482-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141847883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A parallel machine learning-based approach for tsunami waves forecasting using regression trees 基于并行机器学习的回归树海啸波预报方法
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-24 DOI: 10.1016/j.comcom.2024.07.016
Eugenio Cesario , Salvatore Giampá , Enrico Baglione , Louise Cordrie , Jacopo Selva , Domenico Talia

Following a seismic event, tsunami early warning systems (TEWSs) try to provide precise forecasts of the maximum height of incoming waves at designated target points along the coast. This information is crucial to trigger early warnings in areas where the impact of tsunami waves is predicted to be dangerous (or potentially cause destruction), to help the management of the potential impact of a tsunami as well as reduce environmental destruction and losses of human lives. For such a reason, it is crucial that TEWSs produce predictions with short computation time while maintaining a high prediction accuracy. This paper presents a parallel machine learning approach, based on regression trees, to discover tsunami predictive models from simulation data. In order to achieve the results in a short time, the proposed approach relies on the parallelization of the most time consuming tasks and on incremental learning executions, in order to achieve higher performances in terms of execution time, efficiency and scalability. The experimental evaluation, performed on two real tsunami cases occurred in the Western and Eastern Mediterranean basin in 2003 and 2017, shows reasonable advantages in terms of scalability and execution time, which is an important benefit in a urgent-computing scenarios.

地震事件发生后,海啸预警系统(TEWS)会在沿岸指定的目标点对来袭海浪的最大高度进行精确预报。这些信息对于在预测海啸波冲击会造成危险(或可能造成破坏)的地区触发预警、帮助管理海啸的潜在影响以及减少环境破坏和人员伤亡至关重要。因此,海啸预警系统必须在保持较高预测精度的同时,以较短的计算时间做出预测。本文提出了一种基于回归树的并行机器学习方法,用于从模拟数据中发现海啸预测模型。为了在短时间内获得结果,所提出的方法依赖于最耗时任务的并行化和增量学习执行,以便在执行时间、效率和可扩展性方面获得更高的性能。在 2003 年和 2017 年发生在地中海盆地西部和东部的两个真实海啸案例中进行的实验评估显示,该方法在可扩展性和执行时间方面具有合理的优势,这在紧急计算场景中是一个重要优势。
{"title":"A parallel machine learning-based approach for tsunami waves forecasting using regression trees","authors":"Eugenio Cesario ,&nbsp;Salvatore Giampá ,&nbsp;Enrico Baglione ,&nbsp;Louise Cordrie ,&nbsp;Jacopo Selva ,&nbsp;Domenico Talia","doi":"10.1016/j.comcom.2024.07.016","DOIUrl":"10.1016/j.comcom.2024.07.016","url":null,"abstract":"<div><p>Following a seismic event, tsunami early warning systems (TEWSs) try to provide precise forecasts of the maximum height of incoming waves at designated target points along the coast. This information is crucial to trigger early warnings in areas where the impact of tsunami waves is predicted to be dangerous (or potentially cause destruction), to help the management of the potential impact of a tsunami as well as reduce environmental destruction and losses of human lives. For such a reason, it is crucial that TEWSs produce predictions with short computation time while maintaining a high prediction accuracy. This paper presents a parallel machine learning approach, based on regression trees, to discover tsunami predictive models from simulation data. In order to achieve the results in a short time, the proposed approach relies on the parallelization of the most time consuming tasks and on incremental learning executions, in order to achieve higher performances in terms of execution time, efficiency and scalability. The experimental evaluation, performed on two real tsunami cases occurred in the Western and Eastern Mediterranean basin in 2003 and 2017, shows reasonable advantages in terms of scalability and execution time, which is an important benefit in a urgent-computing scenarios.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 217-228"},"PeriodicalIF":4.5,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002548/pdfft?md5=ffb356f16788d8b2eff52b72c2b7187b&pid=1-s2.0-S0140366424002548-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141848754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Computer Communications
全部 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