Journal of Sensor and Actuator Networks最新文献

{"title":"Featured Papers on Network Security and Privacy","authors":"Jordi Mongay Batalla","doi":"10.3390/jsan13010011","DOIUrl":"https://doi.org/10.3390/jsan13010011","url":null,"abstract":"There is an urgent need to introduce security-by-design in networks [...]","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139820576","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":"Service-Aware Hierarchical Fog–Cloud Resource Mappingfor e-Health with Enhanced-Kernel SVM","authors":"Alaa AlZailaa, Hao Ran Chi, A. Radwan, Rui L. Aguiar","doi":"10.3390/jsan13010010","DOIUrl":"https://doi.org/10.3390/jsan13010010","url":null,"abstract":"Fog–cloud-based hierarchical task-scheduling methods are embracing significant challenges to support e-Health applications due to the large number of users, high task diversity, and harsher service-level requirements. Addressing the challenges of fog–cloud integration, this paper proposes a new service/network-aware fog–cloud hierarchical resource-mapping scheme, which achieves optimized resource utilization efficiency and minimized latency for service-level critical tasks in e-Health applications. Concretely, we develop a service/network-aware task classification algorithm. We adopt support vector machine as a backbone with fast computational speed to support real-time task scheduling, and we develop a new kernel, fusing convolution, cross-correlation, and auto-correlation, to gain enhanced specificity and sensitivity. Based on task classification, we propose task priority assignment and resource-mapping algorithms, which aim to achieve minimized overall latency for critical tasks and improve resource utilization efficiency. Simulation results showcase that the proposed algorithm is able to achieve average execution times for critical/non-critical tasks of 0.23/0.50 ms in diverse networking setups, which surpass the benchmark scheme by 73.88%/52.01%, respectively.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139832534","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":"Varactor-Based Tunable Sensor for Dielectric Measurements of Solid and Liquid Materials","authors":"Waseem Shahzad, Weidong Hu, Qasim Ali, Ali Raza Barket, Gulab Shah","doi":"10.3390/jsan13010008","DOIUrl":"https://doi.org/10.3390/jsan13010008","url":null,"abstract":"In this article, a tunable RF sensor is presented for the measurement of dielectric materials (liquids and solids) based on a metamaterial resonator. The proposed novel configuration sensor has a microstrip line-loaded metamaterial resonator with tunable characteristics by utilizing a single varactor diode in the series of the resonator. CST Microwave studio is employed for 3D simulations of the tunable sensor, and the desired performance is attained by optimizing various structural parameters to enhance the transmission coefficient (S21 magnitude) notch depth performance. The proposed RF sensor can be tuned in L and S-bands using the varactor diode biasing voltage range of 0–20 V. To validate the performance of the sensor, the proposed design has been simulated, fabricated, and tested for the dielectric characterization of different solid and liquid materials. Material testing is performed in the bandwidth of 1354 MHz by incorporating a single metamaterial resonator-based sensor. Agilent’s Network Analyzer is used for measuring the S-parameters of the proposed sensor topology under loaded and unloaded conditions. Simulated and measured S-parameter results correspond substantially in the 1.79 to 3.15 GHz frequency band during the testing of the fabricated sensor. This novel tunable resonator design has various applications in modulators, phase shifters, and filters as well as in biosensors for liquid materials.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139615092","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":"On Maximizing the Probability of Achieving Deadlines in Communication Networks","authors":"Benjamin Becker, Christian Oberli, Tobias Meuser, Ralf Steinmetz","doi":"10.3390/jsan13010009","DOIUrl":"https://doi.org/10.3390/jsan13010009","url":null,"abstract":"We consider the problem of meeting deadline constraints in wireless communication networks. Fulfilling deadlines depends heavily on the routing algorithm used. We study this dependence generically for a broad class of routing algorithms. For analyzing the impact of routing decisions on deadline fulfillment, we adopt a stochastic model from operations research to capture the source-to-destination delay distribution and the corresponding probability of successfully delivering data before a given deadline. Based on this model, we propose a decentralized algorithm that operates locally at each node and exchanges information solely with direct neighbors in order to determine the probabilities of achieving deadlines. A modified version of the algorithm also improves routing tables iteratively to progressively increase the deadline achievement probabilities. This modified algorithm is shown to deliver routing tables that maximize the deadline achievement probabilities for all nodes in a given network. We tested the approach by simulation and compared it with routing strategies based on established metrics, specifically the average delay, minimum hop count, and expected transmission count. Our evaluations encompass different channel quality and small-scale fading conditions, as well as various traffic load scenarios. Notably, our solution consistently outperforms the other approaches in all tested scenarios.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139615853","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":"Game Theory-Based Incentive Design for Mitigating Malicious Behavior in Blockchain Networks","authors":"Souhail Mssassi, Anas Abou El Kalam","doi":"10.3390/jsan13010007","DOIUrl":"https://doi.org/10.3390/jsan13010007","url":null,"abstract":"This paper presents an innovative incentive model that utilizes graph and game theories to address the issue of node incentives in decentralized blockchain networks such as EVM blockchains. The lack of incentives for nodes within EVM networks gives rise to potential weaknesses that might be used for various purposes, such as broadcasting fake transactions or withholding blocks. This affects the overall trust and integrity of the network. To address this issue, the current study offers a network model that incorporates the concepts of graph theory and utilizes a matrix representation for reward and trust optimization. Furthermore, this study presents a game-theoretic framework that encourages cooperative conduct and discourages malicious actions, ultimately producing a state of equilibrium according to the Nash equilibrium. The simulations validated the model’s efficacy in addressing fraudulent transactions and emphasized its scalability, security, and fairness benefits. This study makes a valuable contribution to the field of blockchain technology by presenting an incentive model that effectively encourages the development of secure and trusted decentralized systems.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139620827","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":"Experiences Using Ethereum and Quorum Blockchain Smart Contracts in Dairy Production","authors":"Filisia Melissari, Andreas Papadakis, Dimitris Chatzitheodorou, Duc Tran, J. Schouteten, Georgia Athanasiou, T. Zahariadis","doi":"10.3390/jsan13010006","DOIUrl":"https://doi.org/10.3390/jsan13010006","url":null,"abstract":"feta cheese is a Greek protected designation of origin (PDO) product that is produced in three main phases: milk collection, cheese preparation and maturation, and product packaging. Each phase must be aligned with quantitative rules, stemming from the legislation framework and best practices. The production complexity, the increased production cost, centralised and monolithic traceability systems, and the lack of a systematic monitoring framework have made dairy products a commodity with increased frequency of food fraud. Given the context of the dairy section in Greece, this study aims to examine (a) whether it is possible to model the end-to-end process of PDO feta cheese considering production rules to develop a trustworthy blockchain-based traceability system (b) how to associate the (‘easy-to-retrieve’, operational) traceability data with the (difficult-to-assess) product characteristics meaningful to the consumer, (c) how to design a technical solution ensuring that information is accessible by the stakeholders and the consumer, while minimising blockchain-related delay, and (d) how to design a graphical user interface and offer tools to consumers so that traceability information is communicated effectively and they can verify it through access to the blockchain. In terms of methods, we analyse and model the process steps, identify measurable, operational parameters and translate the legislative framework into rules. These rules are designed and codified as blockchain smart contracts that ensure the food authenticity and compliance with legislation. The blockchain infrastructure consists of the private Quorum blockchain that is anchored to the public infrastructure of Ethereum. Mechanisms to address scalability in terms of dynamic data volumes, effective data coding, and data verification at the edge as well as relevant limitations are discussed. Consumers are informed about traceability information by using QR codes on food packaging and can verify the data using the blockchain tools and services.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139532098","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":"Dynamic and Distributed Intelligence over Smart Devices, Internet of Things Edges, and Cloud Computing for Human Activity Recognition Using Wearable Sensors","authors":"Ayman Wazwaz, Khalid Amin, Noura Semary, Tamer Ghanem","doi":"10.3390/jsan13010005","DOIUrl":"https://doi.org/10.3390/jsan13010005","url":null,"abstract":"A wide range of applications, including sports and healthcare, use human activity recognition (HAR). The Internet of Things (IoT), using cloud systems, offers enormous resources but produces high delays and huge amounts of traffic. This study proposes a distributed intelligence and dynamic HAR architecture using smart IoT devices, edge devices, and cloud computing. These systems were used to train models, store results, and process real-time predictions. Wearable sensors and smartphones were deployed on the human body to detect activities from three positions; accelerometer and gyroscope parameters were utilized to recognize activities. A dynamic selection of models was used, depending on the availability of the data and the mobility of the users. The results showed that this system could handle different scenarios dynamically according to the available features; its prediction accuracy was 99.23% using the LightGBM algorithm during the training stage, when 18 features were used. The prediction time was around 6.4 milliseconds per prediction on the smart end device and 1.6 milliseconds on the Raspberry Pi edge, which can serve more than 30 end devices simultaneously and reduce the need for the cloud. The cloud was used for storing users’ profiles and can be used for real-time prediction in 391 milliseconds per request.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139390065","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":"Output Stream from the AQM Queue with BMAP Arrivals","authors":"A. Chydzinski","doi":"10.3390/jsan13010004","DOIUrl":"https://doi.org/10.3390/jsan13010004","url":null,"abstract":"We analyse the output stream from a packet buffer governed by the policy that incoming packets are dropped with a probability related to the buffer occupancy. The results include formulas for the number of packets departing the buffer in a specific time, for the time-dependent output rate and for the steady-state output rate. The latter is the key performance measure of the buffering mechanism, as it reflects its ability to process a specific number of packets in a time unit. To ensure broad applicability of the results in various networks and traffic types, a powerful and versatile model of the input stream is used, i.e., a BMAP. Numeric examples are provided, with several parameterisations of the BMAP, dropping probabilities and loads of the system.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139390437","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":"Multi-Objective Optimization of Gateway Location Selection in Long-Range Wide Area Networks: A Tradeoff Analysis between System Costs and Bitrate Maximization","authors":"Charuay Savithi, Chutchai Kaewta","doi":"10.3390/jsan13010003","DOIUrl":"https://doi.org/10.3390/jsan13010003","url":null,"abstract":"LoRaWANs play a critical role in various applications such as smart farming, industrial IoT, and smart cities. The strategic placement of gateways significantly influences network performance optimization. This study presents a comprehensive analysis of the tradeoffs between system costs and bitrate maximization for selecting optimal gateway locations in LoRaWANs. To address this challenge, a rigorous mathematical model is formulated to incorporate essential factors and constraints related to gateway selection. Furthermore, we propose an innovative metaheuristic algorithm known as the M-VaNSAS algorithm, which effectively explores the solution space and identifies favorable gateway locations. The Pareto front and TOPSIS methods are employed to evaluate and rank the generated solutions, providing a robust assessment framework. Our research findings highlight the suitability of a network model comprising 144 gateways tailored for the Ubon Ratchathani province. Among the evaluated algorithms, the M-VaNSAS method demonstrates exceptional efficiency in gateway location selection, outperforming the PSO, DE, and GA methods.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139391262","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":"Robust ISAC Localization in Smart Cities: A Hybrid Network Approach for NLOS Challenges with Uncertain Parameters","authors":"Turke Althobaiti, R. A. Khalil, Nasir Saeed","doi":"10.3390/jsan13010002","DOIUrl":"https://doi.org/10.3390/jsan13010002","url":null,"abstract":"Accurate localization holds paramount importance across many applications within the context of smart cities, particularly in vehicular communication systems, the Internet of Things, and Integrated Sensing and Communication (ISAC) technologies. Nonetheless, achieving precise localization remains a persistent challenge, primarily attributed to the prevalence of non-line-of-sight (NLOS) conditions and the presence of uncertainties surrounding key wireless transmission parameters. This paper presents a comprehensive framework tailored to address the intricate task of localizing multiple nodes within ISAC systems significantly impacted by pervasive NLOS conditions and the ambiguity of transmission parameters. The proposed methodology integrates received signal strength (RSS) and time-of-arrival (TOA) measurements as a strategic response to effectively overcome these substantial challenges, even in situations where the precise values of transmitting power and temporal information remain elusive. An approximation approach is judiciously employed to facilitate the inherent non-convex and NP-hard nature of the original estimation problem, resulting in a notable transformation, rendering the problem amenable to a convex optimization paradigm. The comprehensive array of simulations conducted within this study corroborates the efficacy of the proposed hybrid cooperative localization method by underscoring its superior performance relative to conventional approaches relying solely on RSS or TOA measurements. This enhancement in localization accuracy in ISAC systems holds promise in the intricate urban landscape of smart cities, offering substantial contributions to infrastructure optimization and service efficiency.","PeriodicalId":37584,"journal":{"name":"Journal of Sensor and Actuator Networks","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139146418","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}