{"title":"Mobile LoRa Gateway for Communication and Sensing on the Railway","authors":"J. Soares, Miguel Luís, S. Sargento","doi":"10.1109/ISCC58397.2023.10218029","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218029","url":null,"abstract":"This work presents a LoRa channel access strategy that allows a single-channel high-speed moving LoRa gate-way to discover and receive sensing data from end devices installed in the railroad. This medium access is based on control messages to coordinate the communication between the mobile gateway and static sensors. The proposed approach is tested in a real mobile environment and compared with the well established LoRaWAN protocol. The results show that our solution outperforms LoRaWAN both in packet error rate and throughput, revealing the differences between a non-awareness solution such as LoRaWAN, and a solution where the end node only transmits when receiving a control message alerting that a LoRa gateway is nearby.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132582687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Andrea De Salve, D. Maesa, Fabio Federico, P. Mori, L. Ricci
{"title":"AlgoID: A Blockchain Reliant Self-Sovereign Identity Framework on Algorand","authors":"Andrea De Salve, D. Maesa, Fabio Federico, P. Mori, L. Ricci","doi":"10.1109/ISCC58397.2023.10218198","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218198","url":null,"abstract":"The Self-Sovereign Identity (SSI) is a novel paradigm aimed at giving back users sovereignty over their digital identities. Adopting the SSI approach prevents users to have a distinct identity for each service they use, instead, use a unique decentralised identity for all the services they need to access. However, to really benefit from the SSI advantages, an actual decentralised implementation is needed to fit the specific requirements and limits of decentralised architectures, such as blockchain. To this aim, this paper proposes Algorand Identity (AlgoID), a new SSI framework for the Algorand blockchain which differs from the already existing one, because it is fully blockchain based, i.e., it exploits Algorand itself for the storage of the data identity and as the registry location. The proposed framework has been completely implemented and validated through experiments, showing that the time required to execute the framework operations is acceptably low in realistic use cases.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"400 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Zinno, Antonia Affinito, N. Pasquino, G. Ventre, A. Botta
{"title":"Prediction of RTT Through Radio-Layer Parameters in 4G/5G Dual-Connectivity Mobile Networks","authors":"S. Zinno, Antonia Affinito, N. Pasquino, G. Ventre, A. Botta","doi":"10.1109/ISCC58397.2023.10218091","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218091","url":null,"abstract":"With E-UTRA-NR Dual Connectivity, terminals can connect to 4G Long-Term Evolution and 5G New Radio networks at the same time. This technology allows using multiple bandwidths belonging to the two radio layers, enhancing the overall system performance. The system also adopts Multiple Input Multiple Output on top of the dual radio layer access. Authors predict application-layer Round-Trip Time with Machine Learning algorithms leveraging radio layer parameters such as received power and signal quality. Binary classification techniques are adopted to predict if Round-Trip Time values are above or below a threshold. The prediction is tested with real data collected in two measurement campaigns. Results show that Random Forest and Decision Tree Classifiers are the best algorithms with a precision score of respectively 0.84 and 0.92 in both measurement setups. They also evidence the radio- and physical-layer information having more importance for predicting application-layer RTT.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Cognitive Module for Secondary Radios Operating at the 2.5 GHz LTE Band on Indoor Environments","authors":"Marilson Duarte Soares, D. Passos, P. Castellanos","doi":"10.1109/ISCC58397.2023.10218298","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218298","url":null,"abstract":"The 2.5 GHz band is allocated to licensed systems of the LTE. Due to the propagation characteristics in this band, the signal is severely degraded by walls and other similar obstacles, making coverage in indoor environments difficult. While this is an issue for the purpose of providing LTE indoor coverage, it may also produce spectrum opportunities for secondary users. In this paper, we introduce a design of a cognitive module for secondary radios to operate on this band alongside the primary LTE users. This module leverages both statistical and Machine Learning methods to detect idle channel periods and to estimate for how long the secondary user may use the band. Based on real data of LTE channel usage in indoor environments, we propose a mathematical model for the length of idle periods and show that a small set of narrow-band energy sensors is enough to detect transmission opportunities.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"125 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133801238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Accelerating Block Propagation with Sender Switchover in a Blockchain","authors":"Akira Sakurai, Kazuyuki Shudo","doi":"10.1109/iscc58397.2023.10217880","DOIUrl":"https://doi.org/10.1109/iscc58397.2023.10217880","url":null,"abstract":"In a public blockchain, the block propagation time has a significant impact on the performance, security and fairness of mining. Reducing the propagation time can increase the transaction processing performance, reduce the fork rate, and increase security. We propose a method to improve block propagation with block sender switchover, even if a node is receiving a block. The method is not vulnerable to eclipse attacks because the neighboring nodes are not changed. Our simulation shows that the proposed method improves the 90th percentile value of the propagation time by up to 18% and the fork rate by up to 7.9%.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115342842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Contrastive Learning with Attention Mechanism and Multi-Scale Sample Network for Unpaired Image-to-Image Translation","authors":"Yunhao Liu, Songyi Zhong, Zhenglin Li, Yangqiaoyu Zhou","doi":"10.1109/ISCC58397.2023.10218053","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218053","url":null,"abstract":"The aim of unpaired image translation is to learn how to transform images from a source to a target domain, while preserving as many domain-invariant features as possible. Previous methods have not been able to separate foreground and background well, resulting in texture being added to the background. Moreover, these methods often fail to distinguish different objects or different parts of the same object. In this paper, we propose an attention-based generator (AG) that can redistribute the weights of visual features, significantly enhancing the network's performance in separating foreground and background. We also embed a multi-scale multilayer perceptron (MSMLP) into the framework to capture features across a broader range of scales, which improves the discrimination of various parts of objects. Our method outperforms existing methods on various datasets in terms of Fréchet inception distance. We further analyze the impact of different modules in our approach through subsequent ablation experiments.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115550967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"FedEF: Federated Learning for Heterogeneous and Class Imbalance Data","authors":"Hong Peng, Tongtong Wu, Zhenkui Shi, Xianxian Li","doi":"10.1109/ISCC58397.2023.10218040","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218040","url":null,"abstract":"Federated learning (FL) is a scheme that enables multiple participants to cooperate to train a high-performance machine learning model in a way that data cannot be exported. FL effectively protects the data privacy of all participants and reduces communication costs. However, a key challenge for federated learning is the data heterogeneity across clients. In addition, in real FL applications, the class distribution of data is usually unbalanced. Although many researches have been conducted to solve the problem of data heterogeneity, class imbalance problem usually arises along with the heterogeneity data, resulting in the poor performance of the global model. In this paper, a novel FL method (we call it FedEF) is designed for heterogeneous data and local class imbalance problem via optimize feature extractors and classifiers. FedEF optimizes the local feature extractor representation of individual clients through contrastive learning to maximize the consistency of the feature extractor representation trained by the local client and the central server to handle heterogeneous data. Meanwhile, we modified the cross entropy loss in the model, assigned different loss weights to different classes of data, paid more attention to the class with fewer samples in the training process, and corrected the biased classifier to alleviate the problem of class imbalance, thus can improve the performance of the global model. Experiments show that FedEF is an effective solution to FL model obtained under heterogeneous and local class imbalance.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of a Collision Prediction System for VRUs Using V2X and Machine Learning: Intersection Collision Avoidance for Motorcycles","authors":"B. Ribeiro, Alexandre J. T. Santos, M. J. Nicolau","doi":"10.1109/ISCC58397.2023.10218254","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218254","url":null,"abstract":"The safety factor of ITS is particularly important for VRUs, as they are typically more prone to accidents and fatalities than other road users. The implementation of safety systems for these users is challenging, especially due to their agility and hard to predict intentions. Still, using ML mechanisms on data that is collected from V2X communications, has the potential to implement such systems in an intelligent and automatic way. This paper evaluates the performance of a collision prediction system for VRUs (motorcycles in intersections), by using LSTMs on V2X data - generated using the VEINS simulation framework. Results show that the proposed system is able to prevent at least 74% of the collisions of Scenario A and 69% of Scenario B on the worst case of perception-reaction times; In the best cases, the system is able to prevent 94% of the collisions of Scenario A and 96% of Scenario B.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"39 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124825117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cross-Regional Task Offloading with Multi-Agent Reinforcement Learning for Hierarchical Vehicular Fog Computing","authors":"Yukai Hou, Zhiwei Wei, Shiyang Liu, Bing Li, Rongqing Zhang, Xiang Cheng, Liuqing Yang","doi":"10.1109/ISCC58397.2023.10217881","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217881","url":null,"abstract":"Vehicular fog computing (VFC) can make full use of computing resources of idle vehicles to increase computing capability. However, most current VFC architectures only focus on the local region and ignore the spatio-temporal distribution of computing resources, resulting that some regions have idle computing resources while others cannot satisfy the requirements of tasks. Therefore, we propose a hierarchical VFC architecture, where neighboring regions can share their idle computing resources. Considering that the existing centralized offloading mode is not scalable enough and the high complexity of cooperative task offloading, we put forward a distributed task offloading strategy based on multi-agent reinforcement learning. Moreover, to tackle the inefficiency caused by the multi-agent credit assignment problem, we provide the counterfactual multi-agent reinforcement learning approach which exploits a counterfactual baseline to evaluate the action of each agent. Simulation results validate that the hierarchical architecture and the distributed algorithm improves the efficiency of global performance.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124962135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"FedCrowdSensing: Incentive Mechanism for Crowdsensing Based on Reputation and Federated Learning","authors":"Jian-quan Ouyang, Wenke Wang","doi":"10.1109/ISCC58397.2023.10217955","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217955","url":null,"abstract":"In recent years, crowds en sing has become a hot topic in contemporary research. However, the traditional crowd-sensing model has some issues, such as low-quality data uploaded by users, privacy and security issues, and a lack of incentive for user participation. To address these challenges, we propose a crowdsensing framework that combines blockchain and federated learning to build a decentralized security framework. Our framework enables each participant to upload model gradient data to the crowdsensing platform for aggregation while ensuring user privacy and security. And we proposed a model aggregation method based on reputation value. In addition, we also designed a reverse auction algorithm based on historical reputation to filter the set of candidates who want to participate in the task, to obtain a higher quality set of participants. Security analysis and experimental results show that this model guarantees data quality and data privacy, and enhances user participation motivation.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121907090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}