A Privacy Assessment Framework For Data Tiers In Multilayered Ecosystem Architectures
A Privacy Assessment Framework For Data Tiers In Multilayered Ecosystem Architectures
Ionela Chereja, Rudolf Erdei, Emil Pasca, Daniela Delinschi, Anca Avram, Oliviu Matei
Abstract. As smart agriculture evolves into an interconnected Internet of Fields, massive amounts of data flow through multiple architectural layers, from ground-level sensors to cloud storage and complex analytics. This paper proposes a Privacy Assessment Framework specifically designed for data tiers within multilayered ecosystem architectures. The framework provides a systematic method to classify and measure privacy risks across different architectural layers (Edge, Fog, Cloud), to map vulnerabilities at the data collection, processing and transmission levels, and to support secure-by-design ecosystem decisions. The proposed framework offers a structured path to build more robust, compliant and trustworthy agricultural ecosystems that resist data breaches and misuse.
Keywords: privacy assessment; multilayered architecture; data tiers; edge-fog-cloud; smart agriculture
📋 Cite this publication
Ionela Chereja, Rudolf Erdei, Emil Pasca, Daniela Delinschi, Anca Avram, Oliviu Matei, "A Privacy Assessment Framework For Data Tiers In Multilayered Ecosystem Architectures", Mathematics (Basel), vol. 13, no. 7, MDPI, 2025, 2023. DOI: https://doi.org/10.3390/math13071116.
Reference: Mathematics (Basel), vol. 13, no. 7, MDPI, 2025. DOI: 10.3390/math13071116
Augmenting API Security Testing with Automated LLM-Driven Test Generation
Augmenting API Security Testing with Automated LLM-Driven Test GenerationEmil Marian Pasca, Rudolf...
Data Quality Assessment Methodology
Data Quality Assessment MethodologyDaniela Delinschi, Rudolf Erdei, Emil Pasca, Oliviu Matei...
Privacy Assessment Methodology for Machine Learning Models and Data Sources
Privacy Assessment Methodology for Machine Learning Models and Data SourcesRudolf Erdei, Emil...
Aggregation Strategy for Federated Machine Learning Algorithm
Aggregation Strategy for Federated Machine Learning AlgorithmRudolf Erdei, Daniela Delinschi,...
Evaluation of Feature Selection Methods in Estimation of Precipitation Based on Deep Learning Artificial Neural Networks
Precipitation is the most important element of the water cycle and an indispensable element of water resources management. This paper aims to model the monthly precipitation in 8 precipitation observation stations. The effects and role of different feature weights pre-processing methods (Weight by deviation, Weight by PCA, Weight by correlation, and Weight by Support Vector Machine) on artificial intelligence modeling were investigated.
A Comparison of different crossover operators in genetic algorithms for clusters shortest-path tree problem
The clustered shortest-path tree (CluSPT) problem is an extension of the classical shortest path problem, given a graph with the nodes partitioned into several mutually exclusive and collectively exhaustive clusters looks for a shortest-path spanning tree from a predefined source node to all the other nodes of the graph, with the property that every cluster should generate a connected subgraph.
A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical traveling salesman
problem (TSP), and it is among the most researched combinatorial optimization problems due to its theoretical properties, complexity aspects, and real-life applications in various areas: location-routing problems, material flow design problem, distribution of medical supplies, urban waste collection management, airport selection and routing the courier airplanes, image retrieval and ranking, digital garment manufacturing, etc.
A hybrid based genetic algorithm for solving the clustered generalized traveling salesman problem
We study the clustered generalized traveling salesman problem (CGTSP), which is an extension of the generalized traveling salesman problem (GTSP), which in turn generalizes the well-known traveling salesman problem (TSP).
0 Comments