Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850010
Amin Norollah, Z. Kazemi, Danesh Derafshi, H. Beitollahi, M. Fazeli
Single-core platforms have been widely used for Many security-critical real-time systems. However, the ever-increasing high-performance requirements demanded by various industries and the advent of serious bottlenecks again increasing the performance of single-core platforms have necessitated the employment of many-core platforms in the design of such systems. This design shift from single to many-core platforms has been accompanied by security issues and has produced emerging security challenges. Fault injection attacks are one of the primary attacks that are used to infiltrate the tasks to reduce the system performance or cause system failures. In this paper, an online security-aware real-time hardware scheduler is proposed and used to avoid fault attacks using the task replication method. In the proposed real-time system, critical tasks and their replicas are scheduled with Least Slack Time first (LST) algorithm independently in the hardware under real-time constraints. Our synthesis and simulation results using Xilinx Vivado 2018.2 indicates that the proposed scheduler guarantees that all critical tasks and their replicas meet their deadlines. The results also show that our scheduler reduces the chance of a successful Fault attack and loss of the final result in critical tasks.
{"title":"Protecting Security-Critical Real-Time Systems against Fault Attacks in Many-Core Platforms","authors":"Amin Norollah, Z. Kazemi, Danesh Derafshi, H. Beitollahi, M. Fazeli","doi":"10.1109/rtest56034.2022.9850010","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850010","url":null,"abstract":"Single-core platforms have been widely used for Many security-critical real-time systems. However, the ever-increasing high-performance requirements demanded by various industries and the advent of serious bottlenecks again increasing the performance of single-core platforms have necessitated the employment of many-core platforms in the design of such systems. This design shift from single to many-core platforms has been accompanied by security issues and has produced emerging security challenges. Fault injection attacks are one of the primary attacks that are used to infiltrate the tasks to reduce the system performance or cause system failures. In this paper, an online security-aware real-time hardware scheduler is proposed and used to avoid fault attacks using the task replication method. In the proposed real-time system, critical tasks and their replicas are scheduled with Least Slack Time first (LST) algorithm independently in the hardware under real-time constraints. Our synthesis and simulation results using Xilinx Vivado 2018.2 indicates that the proposed scheduler guarantees that all critical tasks and their replicas meet their deadlines. The results also show that our scheduler reduces the chance of a successful Fault attack and loss of the final result in critical tasks.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"115 1","pages":"1-6"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79604041","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850101
Ch. Naga Sai Kalyan, M. Kumar, B. S. Goud, Hossein Shahinzadeh, Ch. Rami Reddy, M. Kiran Kumar
In this paper, a three degree-of-freedom PID (3DOFPID) fine-tuned using a seagull optimization algorithm (SOA) is presented as a secondary regulator for a multi-area hybrid source (MAHS) interconnected power system. Area-1 of MAHS is subjugated with a perturbation of 10% step load. Moreover, the superiority of the presented SOA tuned 3DOFPID controller is demonstrated with performances of other control techniques that have been reported in recent literature. To further enhance the dynamical behaviour of MAHS during perturbed conditions, energy storage devices (ESDs) such as redox flow batteries (RFBs) and superconducting magnetic energy storage (SMES) devices are placed in each area of the MAHS power system one after the other. Simulation results reveal the dominancy of SMES in handling the deviations in MAHS power system performance compared to RFBs.
{"title":"Frequency Regulation of Multi Area Hybrid Source Power System with Energy Storage Devices","authors":"Ch. Naga Sai Kalyan, M. Kumar, B. S. Goud, Hossein Shahinzadeh, Ch. Rami Reddy, M. Kiran Kumar","doi":"10.1109/rtest56034.2022.9850101","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850101","url":null,"abstract":"In this paper, a three degree-of-freedom PID (3DOFPID) fine-tuned using a seagull optimization algorithm (SOA) is presented as a secondary regulator for a multi-area hybrid source (MAHS) interconnected power system. Area-1 of MAHS is subjugated with a perturbation of 10% step load. Moreover, the superiority of the presented SOA tuned 3DOFPID controller is demonstrated with performances of other control techniques that have been reported in recent literature. To further enhance the dynamical behaviour of MAHS during perturbed conditions, energy storage devices (ESDs) such as redox flow batteries (RFBs) and superconducting magnetic energy storage (SMES) devices are placed in each area of the MAHS power system one after the other. Simulation results reveal the dominancy of SMES in handling the deviations in MAHS power system performance compared to RFBs.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"197 1","pages":"1-5"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76057501","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9849859
Mohammad Amin Moloudi, Amin Foshati, Hossein Kalantari, A. Ejlali
Vehicles are getting more and more complicated while at the same time they are safety-critical systems which mean their failures can lead to catastrophic consequences. This implies that more sophisticated diagnostic techniques are required for vehicles that also cannot be expensive as they must be widely available to serve the general public’s safety. To this end, this paper shows how a process called Failure Mode and Effect Analysis (FMEA) and a technology called Digital Twinning (DT) can be combined in a novel way to provide an inexpensive and yet effective online diagnosis for vehicles. The approach can be implemented by Commercial-Of-The-Shelf (COTS) embedded computing devices which explains why it is not expensive. It is also online, which means it is active and operational while the vehicle is in operation and motion. In order to quantitatively evaluate vehicle diagnostic approaches, this paper provides definitions for two metrics that measure the impact of the diagnosis on the ease of repair process. As an experimental case study, the proposed approach was implemented for an Electronic Throttle Control (ETC) usually used in modern vehicles. The observations indicate that the proposed approach can improve the accuracy of diagnosis above two times compared with a classic Hardware-in-the-Loop (HiL) technique. It must be emphasized that such accuracy is achieved along with online and real-time operation and low-cost implementation.
{"title":"A Combination of FMEA and Digital Twinning for Rapid, Accurate, and Online Diagnosis in Vehicles Using COTS Embedded Computing Devices","authors":"Mohammad Amin Moloudi, Amin Foshati, Hossein Kalantari, A. Ejlali","doi":"10.1109/rtest56034.2022.9849859","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9849859","url":null,"abstract":"Vehicles are getting more and more complicated while at the same time they are safety-critical systems which mean their failures can lead to catastrophic consequences. This implies that more sophisticated diagnostic techniques are required for vehicles that also cannot be expensive as they must be widely available to serve the general public’s safety. To this end, this paper shows how a process called Failure Mode and Effect Analysis (FMEA) and a technology called Digital Twinning (DT) can be combined in a novel way to provide an inexpensive and yet effective online diagnosis for vehicles. The approach can be implemented by Commercial-Of-The-Shelf (COTS) embedded computing devices which explains why it is not expensive. It is also online, which means it is active and operational while the vehicle is in operation and motion. In order to quantitatively evaluate vehicle diagnostic approaches, this paper provides definitions for two metrics that measure the impact of the diagnosis on the ease of repair process. As an experimental case study, the proposed approach was implemented for an Electronic Throttle Control (ETC) usually used in modern vehicles. The observations indicate that the proposed approach can improve the accuracy of diagnosis above two times compared with a classic Hardware-in-the-Loop (HiL) technique. It must be emphasized that such accuracy is achieved along with online and real-time operation and low-cost implementation.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"33 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81023940","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9849884
Hassan Motallebi
In order to fight against the state space explosion problem in highly populated discrete event systems, some relaxation techniques are commonly used. In these approximation (fluidization) techniques discrete state variables are modeled as real variables. Here in this paper, we focus on the fluidization of discrete Petri nets as hybrid Petri nets. In several situations in this systems, cconflicts may arise among transitions and in many cases choosing the appropriate conflict resolution scheme for each conflict situation is challenging. In order to address this issue, in this paper, for each conflict situation we give examples of interacting producer/consumer processes with different buffering configurations and explain the rationality behind each of these conflict resolution schemes. We try to give insight into how the appropriate conflict resolution scheme in fluidized model can be determined according to how the conflict is resolved in real system or discrete model.
{"title":"Conflict Resolution and Fluidization in Cyber-Physical Systems","authors":"Hassan Motallebi","doi":"10.1109/rtest56034.2022.9849884","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9849884","url":null,"abstract":"In order to fight against the state space explosion problem in highly populated discrete event systems, some relaxation techniques are commonly used. In these approximation (fluidization) techniques discrete state variables are modeled as real variables. Here in this paper, we focus on the fluidization of discrete Petri nets as hybrid Petri nets. In several situations in this systems, cconflicts may arise among transitions and in many cases choosing the appropriate conflict resolution scheme for each conflict situation is challenging. In order to address this issue, in this paper, for each conflict situation we give examples of interacting producer/consumer processes with different buffering configurations and explain the rationality behind each of these conflict resolution schemes. We try to give insight into how the appropriate conflict resolution scheme in fluidized model can be determined according to how the conflict is resolved in real system or discrete model.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"47 1","pages":"1-5"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75182830","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850011
Ferdous Sharifi, S. Hessabi, Ali Rasaii
In the age of Internet of Things (IoT), an immense amount of data is generated from distributed devices. Fog computing is a promising solution for managing the large volume of time-sensitive data that is being generated by IoT devices. This new computing paradigm faces new challenges. Among these challenges, computation offloading is introduced as the most important one. In this paper, the effect of computation offloading on the energy consumption of fog nodes in a multi-layer fog architecture is investigated. Energy consumption of computational nodes for four different offloading scenarios is evaluated and shown that the effectiveness of an offloading scenario highly depends on the processing power of computational nodes and the number of requests that are generated from IoT devices.
{"title":"The Effect of Fog Offloading on the Energy Consumption of Computational Nodes","authors":"Ferdous Sharifi, S. Hessabi, Ali Rasaii","doi":"10.1109/rtest56034.2022.9850011","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850011","url":null,"abstract":"In the age of Internet of Things (IoT), an immense amount of data is generated from distributed devices. Fog computing is a promising solution for managing the large volume of time-sensitive data that is being generated by IoT devices. This new computing paradigm faces new challenges. Among these challenges, computation offloading is introduced as the most important one. In this paper, the effect of computation offloading on the energy consumption of fog nodes in a multi-layer fog architecture is investigated. Energy consumption of computational nodes for four different offloading scenarios is evaluated and shown that the effectiveness of an offloading scenario highly depends on the processing power of computational nodes and the number of requests that are generated from IoT devices.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"76 1","pages":"1-6"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90432779","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850176
Farimah Poursafaei, Sepideh Safari, Mohsen Ansari, Amir Yeganeh-Khaksar, M. Salehi, A. Ejlali
Safety-critical systems should satisfy a required level of reliability. To meet a desired reliability target, task replication can be realized with exploiting multicore platforms. However, inattentive task replication might lead to significant power, energy, and time overhead. In this paper, we demonstrate that when we use task replication technique, the required number of replicas for each task and the energy consumption of the system are significantly dependent on the accuracy of the fault detection. At design time, we propose a method that determines the level of replication along with the voltage and frequency setting for each task to satisfy a desired reliability target such that the energy consumption is minimized. At run time, the proposed method controls cancelling the task replicas in the fault-free scenarios. The proposed method can be applied on both dynamic- and static-priority applications. We evaluated the effectiveness of our method through extensive simulations. The evaluation results show that our proposed method provides up to 43.5% (on average 26.2%) energy saving without reliability degradation.
{"title":"Energy- and Reliability-Aware Task Replication in Safety-Critical Embedded Systems","authors":"Farimah Poursafaei, Sepideh Safari, Mohsen Ansari, Amir Yeganeh-Khaksar, M. Salehi, A. Ejlali","doi":"10.1109/rtest56034.2022.9850176","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850176","url":null,"abstract":"Safety-critical systems should satisfy a required level of reliability. To meet a desired reliability target, task replication can be realized with exploiting multicore platforms. However, inattentive task replication might lead to significant power, energy, and time overhead. In this paper, we demonstrate that when we use task replication technique, the required number of replicas for each task and the energy consumption of the system are significantly dependent on the accuracy of the fault detection. At design time, we propose a method that determines the level of replication along with the voltage and frequency setting for each task to satisfy a desired reliability target such that the energy consumption is minimized. At run time, the proposed method controls cancelling the task replicas in the fault-free scenarios. The proposed method can be applied on both dynamic- and static-priority applications. We evaluated the effectiveness of our method through extensive simulations. The evaluation results show that our proposed method provides up to 43.5% (on average 26.2%) energy saving without reliability degradation.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"28 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85980224","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9849916
Rojin Naseri, A. Asadi, Mohammad Abdollahi Azgomi
Task offloading is a solution to compensate for resource constraints on the Internet of Things (IoT). Deciding on the location of offloading is very important. The IoT systems provide a three-tier (IoT-fog-cloud) architecture and use the locations of cloud and fog for task offloading. Fog is a more suitable location for task offloading than cloud in terms of energy consumption and response time, and this paper aims to optimize these criteria in IoT systems. In this paper, fog is modeled by queuing theory, and the minimum number of its servers is determined based on its availability by the binary search algorithm and reinforcement learning policy iteration algorithm. Different scenarios are considered for evaluating the impact of different parameters on the cost of the fog. The proposed dispatch policy improves the results by 31% compared to the policies of Slowest Server First, Fastest Server First, and Randomly Chosen Server.
{"title":"A Model for Power-Performance Optimization in Fog-Cloud Environment by Task Off-Loading of IoT Applications","authors":"Rojin Naseri, A. Asadi, Mohammad Abdollahi Azgomi","doi":"10.1109/rtest56034.2022.9849916","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9849916","url":null,"abstract":"Task offloading is a solution to compensate for resource constraints on the Internet of Things (IoT). Deciding on the location of offloading is very important. The IoT systems provide a three-tier (IoT-fog-cloud) architecture and use the locations of cloud and fog for task offloading. Fog is a more suitable location for task offloading than cloud in terms of energy consumption and response time, and this paper aims to optimize these criteria in IoT systems. In this paper, fog is modeled by queuing theory, and the minimum number of its servers is determined based on its availability by the binary search algorithm and reinforcement learning policy iteration algorithm. Different scenarios are considered for evaluating the impact of different parameters on the cost of the fog. The proposed dispatch policy improves the results by 31% compared to the policies of Slowest Server First, Fastest Server First, and Randomly Chosen Server.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"28 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84861958","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850096
Hussien Al-haj Ahmad, Yasser Sedaghat
The recent trend in processor manufacturing technologies has significantly increased the susceptibility of safety-critical systems against soft errors in harsh environments. Such errors result in control-flow errors (CFEs) that can disturb systems' execution and cause severe financial, human, or environmental disasters. Therefore, there is a severe need for efficient techniques to detect CFEs and keep the systems fault-tolerant. Although numerous control-flow error detection techniques have been proposed, they impose considerable overheads, making them inappropriate for today's safety-critical systems with restricted resources. Several techniques attempt to insert fewer control-flow checking instructions to reduce overheads. However, they limit fault coverage. This paper proposes a software-based technique for ARM processors to detect CFEs. The technique leverages the Hardware Performance Counters (HPCs), which exist in most modern processors, to count micro-architecture events and generate HPC-based signatures. Based on these signatures that capture the correct control flow of the program, the proposed technique can detect CFEs once the correct control flow is violated. We evaluate the detection capability of the proposed technique by performing many fault injection experiments applied on different benchmark programs. Moreover, we compare the proposed technique with common signature-based CFE detection techniques with respect to fault coverage and imposed overheads. The results demonstrate that the proposed technique on average can achieve ~99% fault coverage which is 23.57% higher than that offered by the employed signature-based techniques. Moreover, the memory overhead imposed by the proposed technique is 4.85% lower, and the performance overhead is ~19% lower than that of the studied signature-based techniques.
{"title":"Software-based Control-Flow Error Detection with Hardware Performance Counters in ARM Processors","authors":"Hussien Al-haj Ahmad, Yasser Sedaghat","doi":"10.1109/rtest56034.2022.9850096","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850096","url":null,"abstract":"The recent trend in processor manufacturing technologies has significantly increased the susceptibility of safety-critical systems against soft errors in harsh environments. Such errors result in control-flow errors (CFEs) that can disturb systems' execution and cause severe financial, human, or environmental disasters. Therefore, there is a severe need for efficient techniques to detect CFEs and keep the systems fault-tolerant. Although numerous control-flow error detection techniques have been proposed, they impose considerable overheads, making them inappropriate for today's safety-critical systems with restricted resources. Several techniques attempt to insert fewer control-flow checking instructions to reduce overheads. However, they limit fault coverage. This paper proposes a software-based technique for ARM processors to detect CFEs. The technique leverages the Hardware Performance Counters (HPCs), which exist in most modern processors, to count micro-architecture events and generate HPC-based signatures. Based on these signatures that capture the correct control flow of the program, the proposed technique can detect CFEs once the correct control flow is violated. We evaluate the detection capability of the proposed technique by performing many fault injection experiments applied on different benchmark programs. Moreover, we compare the proposed technique with common signature-based CFE detection techniques with respect to fault coverage and imposed overheads. The results demonstrate that the proposed technique on average can achieve ~99% fault coverage which is 23.57% higher than that offered by the employed signature-based techniques. Moreover, the memory overhead imposed by the proposed technique is 4.85% lower, and the performance overhead is ~19% lower than that of the studied signature-based techniques.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"40 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86613395","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9850158
Amirhosein Imani, M. Eslami, J. Haghighat
Wireless sensor networks (WSNs) have attracted a lot of attention in recent years because they have a vital role in Internet of Things (IoT). In WSNs, it is often very important to maintain the desired amount of coverage with the least energy consumption. In this paper, the coverage and energy efficiency of randomly deployed wireless sensor networks are investigated. We use stochastic geometry to analyze the probability of coverage considering fading and random location of the nodes. Furthermore, It is shown that the probability of coverage without fading is a special case of the probability of coverage with fading. In addition, we define and analyze energy efficiency as the ratio of coverage to average energy consumption. This is a new definition of energy efficiency that seeks to determine the coverage level acquired per unit energy consumption. The simulation results in terms of coverage and energy efficiency are presented for randomly located nodes with and without fading. For maximum energy efficiency, the optimal sensing radius of the sensors are determined with the help of simulation results.
{"title":"Coverage and Energy Efficiency Analysis of Wireless Sensor Networks for Internet of Things","authors":"Amirhosein Imani, M. Eslami, J. Haghighat","doi":"10.1109/rtest56034.2022.9850158","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9850158","url":null,"abstract":"Wireless sensor networks (WSNs) have attracted a lot of attention in recent years because they have a vital role in Internet of Things (IoT). In WSNs, it is often very important to maintain the desired amount of coverage with the least energy consumption. In this paper, the coverage and energy efficiency of randomly deployed wireless sensor networks are investigated. We use stochastic geometry to analyze the probability of coverage considering fading and random location of the nodes. Furthermore, It is shown that the probability of coverage without fading is a special case of the probability of coverage with fading. In addition, we define and analyze energy efficiency as the ratio of coverage to average energy consumption. This is a new definition of energy efficiency that seeks to determine the coverage level acquired per unit energy consumption. The simulation results in terms of coverage and energy efficiency are presented for randomly located nodes with and without fading. For maximum energy efficiency, the optimal sensing radius of the sensors are determined with the help of simulation results.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"5 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83420754","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}
Pub Date : 2022-05-30DOI: 10.1109/rtest56034.2022.9849993
{"title":"RTEST 2022 Cover Page","authors":"","doi":"10.1109/rtest56034.2022.9849993","DOIUrl":"https://doi.org/10.1109/rtest56034.2022.9849993","url":null,"abstract":"","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"38 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88292110","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：