Future Generation Computer Systems-The International Journal of Escience最新文献

{"title":"Scalable compute continuum","authors":"Valeria Cardellini ,&nbsp;Patrizio Dazzi ,&nbsp;Gabriele Mencagli ,&nbsp;Matteo Nardelli ,&nbsp;Massimo Torquati","doi":"10.1016/j.future.2024.107697","DOIUrl":"10.1016/j.future.2024.107697","url":null,"abstract":"<div><div>The Compute Continuum paradigm addresses the challenges of heterogeneous and dynamic computing resources, facilitating distributed application execution while enhancing data locality, performance, availability, adaptability, and energy efficiency. By integrating IoT, edge, and cloud resources into a cohesive continuum, applications can operate closer to data sources and end users. This approach supports refined adaptation strategies tailored to specific infrastructure components, enabling reduced latency, optimized bandwidth use, and improved privacy. To fully realize the Compute Continuum’s potential, autonomous and proactive management is essential, leveraging interdisciplinary methods from optimization theory, control theory, machine learning, and artificial intelligence. This special issue highlights advancements in three key areas: resource characterization and scheduling, middleware for application deployment and reconfiguration, and applications in the Compute Continuum. These contributions highlight innovative solutions for resource optimization, dynamic management, and real-world implementations, showcasing the potential of the Compute Continuum to revolutionize distributed computing across diverse domains.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107697"},"PeriodicalIF":6.2,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Towards efficient privacy-preserving conjunctive keywords search over encrypted cloud data","authors":"Yaru Liu ,&nbsp;Xiaodong Xiao ,&nbsp;Fanyu Kong ,&nbsp;Hanlin Zhang ,&nbsp;Jia Yu","doi":"10.1016/j.future.2025.107716","DOIUrl":"10.1016/j.future.2025.107716","url":null,"abstract":"<div><div>With increasing popularity of cloud computing, more and more users choose to store data on cloud servers. Privacy-preserving keyword search is a critical technology in the field of cloud computing, which can directly search for encrypted data stored on cloud servers. In this paper, we propose a new scheme which can achieve conjunctive keywords search in a privacy-preserving way, and maintain forward security. In order to realize conjunctive keywords search with reduced communication cost and leakage, our scheme constructs a secure index based on the full binary tree data structure. Each leaf node represents a keyword, and the node stores the file identifier containing the keyword. Thus, all files containing searched keywords can be searched at one time without searching one file by one. The search time is only related to the number of search keywords and not related to the number of files. Each non-leaf node stores the keywords of its left and right child nodes, which are mapped to the Indistinguishable Bloom Filter(IBF). To achieve forward security, we choose a random string as the latest state to update trapdoors for each update query. Thus, update trapdoor cannot match with previous search trapdoors to achieve forward security. Finally, detailed experiments and security analysis prove that our scheme is secure and efficient.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107716"},"PeriodicalIF":6.2,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Service-driven dynamic QoS on-demand routing algorithm","authors":"Hao She,&nbsp;Lixing Yan,&nbsp;Chuanfeng Mao,&nbsp;Qihui Bu,&nbsp;Yongan Guo","doi":"10.1016/j.future.2024.107685","DOIUrl":"10.1016/j.future.2024.107685","url":null,"abstract":"<div><div>With the proliferation of Internet of Things (IoT) devices, the scale of networks is growing exponentially. However, dynamically meeting the diverse quality of service (QoS) routing requirements for users and services in large-scale networks remains a critical challenge. To address this issue, this paper proposes a Service-Driven Dynamic QoS On-Demand model and establishes a corresponding QoS optimization objective function. The SHA-256 hash algorithm is utilized to simplify the large-scale network model, effectively reducing the number of Segment Routing (SR) nodes. The proposed Service-Driven Dynamic QoS On-Demand Routing Algorithm (SDDRL) identifies the optimal path, which is then uniformly disseminated by the SDN controller, thereby addressing existing challenges in SDN-IoT networks. Compared to OSPF-based and DDQN-based algorithms, the SDDRL algorithm reduces the average delay by 53.85% and 31.63%, respectively. The proposed algorithm reduces the packet loss rate, improves the average network congestion degree and route calculation time compared to other existing algorithms, and it demonstrates superior performance in handling complex tasks.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107685"},"PeriodicalIF":6.2,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Enhancing IoT security: Assessing instantaneous communication trust to detect man-in-the-middle attacks","authors":"Rabeya Basri ,&nbsp;Gour Karmakar ,&nbsp;S.H. Shah Newaz ,&nbsp;Joarder Kamruzzaman ,&nbsp;Linh Nguyen ,&nbsp;Mohammad Mahabub Alam ,&nbsp;Muhammad Usman","doi":"10.1016/j.future.2025.107714","DOIUrl":"10.1016/j.future.2025.107714","url":null,"abstract":"<div><div>Communication trust is regarded as an effective tool to detect various dangerous cyber attacks, including Man-in-the-Middle (MITM) attacks and acts as a complement to zero trust. There exist some approaches in the literature to calculate inter-node communication trust in Wireless Sensor Networks (WSNs) and IoT networks and leverage it to detect attacks. In WSNs, since promiscuous communication mode is used in calculating inter-node communication trust, it is not suitable for IoT networks. For IoT, the packet forwarding behavior of edge nodes is used in calculating inter-node communication trust, which is limited to detect the MITM attacks effectively unless an edge node is compromised and acts as an MITM attacker. Additionally, these trust calculation mechanisms neither leverage communication channel characteristics nor the communication trust between sensor and edge nodes. Protecting IoT networks from various cyber attacks like MITM attacks requires the instantaneous trust calculation using communication channel characteristics. Since active MITM attacks incur delays, consideration of delay in trust calculation appears to be an effective means in identifying attacks. Neither end-to-end (E2E) delay nor delay due to attacks has been used in communication trust calculation in the existing literature. To bridge this research gap and detect active MITM attacks accurately and spontaneously, in this paper, a new conceptual model, named IPCTCM is introduced for instantaneous trust calculation of an IoT communication channel leveraging delay due to active MITM attacks. Two popular time-series data estimation tools, named Kalman filter and LSTM are used to estimate the expected E2E delay to identify delay due to attacks. Our proposed communication trust calculation model is validated using the data, generated by a testbed implementation in our IoT lab at Federation University Australia. Performance evaluation shows our proposed model achieves an attack detection accuracy of 98.9%, which outperforms an existing intrusion detection method with the improvement of 48.1% accuracy. Furthermore, our trust calculation method has broader applicability in other communication domains as well.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107714"},"PeriodicalIF":6.2,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143167023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MSCPR: A maintainable vector commitment-based stateless cryptocurrency system with privacy preservation and regulatory compliance","authors":"Xingyu Yang,&nbsp;Lei Xu,&nbsp;Liehuang Zhu","doi":"10.1016/j.future.2025.107713","DOIUrl":"10.1016/j.future.2025.107713","url":null,"abstract":"<div><div>In traditional account-based cryptocurrency systems, maintaining the <em>state</em> of all accounts consumes significant storage space. To reduce storage costs, recently some studies propose to leverage vector commitment schemes to design <em>stateless</em> cryptocurrency systems. In such systems, validators only need to store a commitment to the state vector to validate transactions. However, to prove membership in the state vector, each user is required to locally maintain a <em>position proof</em>. This introduces a burden as users need to update their proofs every time the commitment value changes. Additionally, existing stateless systems often include users’ account balances and transferred values in transactions explicitly, which compromises privacy. To address above issues, we propose a stateless cryptocurrency system based on a maintainable vector commitment scheme. In the proposed system, a bucketing technique is employed to simplify the proof update operations. And we leverage the homomorphic property of vector commitments to preserve the confidentiality of transactions. Furthermore, by constructing an anonymity set, transaction anonymity is ensured. To prevent adversaries from taking advantage of the anonymity, we design a predicate encryption-based regulation scheme. Through a series of simulations, we demonstrate that the proposed system is storage-efficient, with acceptable time overhead for privacy preservation and regulatory compliance.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107713"},"PeriodicalIF":6.2,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hybrid deep learning-based cyberthreat detection and IoMT data authentication model in smart healthcare","authors":"Manish Kumar ,&nbsp;Sushil Kumar Singh ,&nbsp;Sunggon Kim","doi":"10.1016/j.future.2025.107711","DOIUrl":"10.1016/j.future.2025.107711","url":null,"abstract":"<div><div>The Internet of Medical Things (IoMT)-based medical devices and sensors play a significant role in healthcare applications, enabling on-site and remote monitoring of vital parameters in patients and alerting medical personnel in critical situations. However, these networks are vulnerable to cybersecurity threats, resulting in issues such as patient safety concerns, data breaches, ransom demands, and device tampering. Detecting cyberthreats efficiently is challenging because IoMT generates large temporal data. Furthermore, cyberattacks typically involve imbalanced classification, where classes are not equally represented. The absence of data authentication can lead to severe consequences, including threats to patient privacy and financial ramifications, ultimately eroding trust in the healthcare system.</div><div>This paper proposes an improved deep learning-based model for cyberthreat detection and IoMT data authentication in smart healthcare. First, it introduces an embedded Ensemble Learning (EL) technique to select important features of IoMT, which trims unnecessary features and reduces the possibility of overfitting by classifiers. These scaled inputs are fed into the proposed One-Dimensional Convolution Long Short-Term Memory (1D-CLSTM) Neural Network to classify cyberthreats. The random undersampling boosting technique has been applied to address issues like imbalance classification. The PoAh consensus algorithm is applied in the fog layer for data authentication. The proposed model is evaluated based on various performance metrics and compared to state-of-the-art techniques such as 1D-CNN, LSTM, and GRU. Evaluation results show that the proposed 1D-CLSTM achieves 100% accuracy with the WUSTL-EHMS-2020 and 98.55% test accuracy with the ECU-IoHT datasets. The PoAh-based authentication takes 3.47 s at average 9th iteration.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107711"},"PeriodicalIF":6.2,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multilayer multivariate forecasting network for precise resource utilization prediction in edge data centers","authors":"Shivani Tripathi ,&nbsp;Priyadarshni ,&nbsp;Rajiv Misra ,&nbsp;T.N. Singh","doi":"10.1016/j.future.2024.107692","DOIUrl":"10.1016/j.future.2024.107692","url":null,"abstract":"<div><div>Efficient resource management and accurate prediction of cloud workloads are vital in modern cloud computing environments, where dynamic and volatile workloads present significant challenges. Traditional forecasting models often fail to fully capture the intricate temporal dependencies and non-linear patterns inherent in cloud data, leading to inefficiencies in resource utilization. To overcome these limitations, this research introduces the MultiLayer Multivariate Resource Predictor (MMRP), a novel deep learning architecture that seamlessly integrates a Multi-Head Attention Transformer model with Convolutional Neural Networks and Bidirectional Long Short-Term Memory units. The proposed model is designed to excel in capturing long-range dependencies and complex patterns, thereby significantly enhancing the accuracy of workload predictions. Extensive, rigorous experimentation using real-world Alibaba and Google cluster traces reveals that the proposed model consistently outperforms existing state-of-the-art models and related cloud resource utilization prediction in both univariate and multivariate time series forecasting tasks. The model demonstrates a remarkable improvement in prediction performance, with an average R squared increase of 5.76% and a Mean Absolute Percentage Error reduction of 84.9% compared to the best-performing baseline models. Furthermore, our model achieves a significant reduction in Root Mean Square Error by approximately 35.34% and decreases Mean Absolute Error by about 39.49% on average. Its scalability and adaptability across various cloud environments underscore the proposed model’s potential to optimize resource allocation, paving the way for more efficient and reliable cloud-based systems.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107692"},"PeriodicalIF":6.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"FedShufde: A privacy preserving framework of federated learning for edge-based smart UAV delivery system","authors":"Aiting Yao ,&nbsp;Shantanu Pal ,&nbsp;Gang Li ,&nbsp;Xuejun Li ,&nbsp;Zheng Zhang ,&nbsp;Frank Jiang ,&nbsp;Chengzu Dong ,&nbsp;Jia Xu ,&nbsp;Xiao Liu","doi":"10.1016/j.future.2025.107706","DOIUrl":"10.1016/j.future.2025.107706","url":null,"abstract":"<div><div>In recent years, there has been a rapid increase in the integration of Internet of Things (IoT) systems into edge computing. This integration offers several advantages over traditional cloud computing, including lower latency and reduced network traffic. In addition, edge computing facilitates the protection of users’ sensitive data by processing it at the edge before transmitting it to the cloud using techniques such as Federated Learning (FL) and Differential Privacy (DP). However, these techniques have limitations, such as the risk of user information being obtained by attackers through the uploaded weights/model parameters in FL and the randomness of DP, which limits data availability. To address these issues, this paper proposes a framework called FedShufde (<strong><u>Fed</u></strong>erated Learning with a <strong><u>Shuf</u></strong>fle Model and <strong><u>D</u></strong>ifferential Privacy in <strong><u>E</u></strong>dge Computing Environments) to protect user privacy in edge computing-based IoT systems, using an Unmanned Aerial Vehicle (UAV) delivery system as an example. FedShufde uses local differential privacy and the shuffle model to prevent attackers from inferring user privacy from information such as UAV’s location, flight conditions, or delivery address. In addition, the network connection between the UAV and the edge server cannot be obtained by the cloud aggregator, and the shuffle model reduces the communication cost between the edge server and the cloud aggregator. Our experiments on a real-world edge-based smart UAV delivery system using public datasets demonstrate the significant advantages of our proposed framework over baseline strategies.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107706"},"PeriodicalIF":6.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143167024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"UD-LDP: A Technique for optimally catalyzing user driven Local Differential Privacy","authors":"Gnanakumar Thedchanamoorthy ,&nbsp;Michael Bewong ,&nbsp;Meisam Mohammady ,&nbsp;Tanveer Zia ,&nbsp;Md Zahidul Islam","doi":"10.1016/j.future.2025.107712","DOIUrl":"10.1016/j.future.2025.107712","url":null,"abstract":"<div><div>Local Differential Privacy (LDP) has emerged as a popular mechanism for crowd-sourced data collection, but enforcing a uniform level of perturbation may hinder the participation of individuals with higher privacy needs, while high privacy levels that satisfy more users can reduce utility. To address this, we propose a cohort-based mechanism that allows participants to choose the privacy level from a predefined set. We investigate optimal cohort configurations and uncover insights about utility convexity, enabling the identification of privacy-utility balanced settings. Our proposed mechanism, called UD-LDP, empowers users, promotes transparency, and facilitates suitable privacy budget selection. We demonstrate the effectiveness of cohortisation through experiments on synthetic and real-world datasets.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107712"},"PeriodicalIF":6.2,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Task replication based energy management using random-weighted privacy-preserving distributed algorithm for real-time embedded system","authors":"Dr． A. Velliangiri ,&nbsp;Dr. Jayaraj Velusamy ,&nbsp;Dr. Maheswari M ,&nbsp;Dr. R．Leena Rose","doi":"10.1016/j.future.2025.107708","DOIUrl":"10.1016/j.future.2025.107708","url":null,"abstract":"<div><div>Efficient energy management in real-time embedded systems is increasingly challenging due to the growing complexity of distributed tasks and the need for robust privacy preservation. Conventional task mapping and repartitioning techniques have focused on increasing the system reliability, efficiency, and lifespan, but typically incurred a high peak power generation because of Thermal Design Power (TDP) limitations which confines the scalability and applicability. To overcome these problems, the Task Replication-based Energy Management using Random-weighted Privacy-preserving Distributed Algorithm (TR-EM-R-RWPPDA-RTES) is proposed as a new scheme for real-time embedded systems. This architecture integrates Hotspot-Aware Task Mapping (HATM) to optimally load tasks across cores, Dynamic Heterogeneous Earliest Finish Time (DHEFT) scheduling to improve execution timing, and a Reliability-based Random-Weighted Privacy-Preserving Distributed Algorithm (R-RWPPDA) to optimize power consumption. Using these elements, the proposed approach reduces both system energy consumption and system trustworthiness. Comprehensive simulations based on the MiBench benchmark suite, as well as gem5 and McPAT simulators on ARM multicore processors (4, 8, and 16 cores), are also shown to validate the robustness of the proposed method. TR-EM-R-RWPPDA-RTES yields 23.73 %, 36.33 %, and37.84 % peak power consumption reduction with respect to the state-of-the-art solutions, thus providing a robust solution for energy-efficient, robust and reliable real-time embedded systems.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"167 ","pages":"Article 107708"},"PeriodicalIF":6.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143321949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}