Pub Date : 2024-02-29DOI: 10.1108/ijpcc-09-2023-0250
Atefeh Hemmati, Mani Zarei, A. Rahmani
Purpose Big data challenges and opportunities on the Internet of Vehicles (IoV) have emerged as a transformative paradigm to change intelligent transportation systems. With the growth of data-driven applications and the advances in data analysis techniques, the potential for data-adaptive innovation in IoV applications becomes an outstanding development in future IoV. Therefore, this paper aims to focus on big data in IoV and to provide an analysis of the current state of research. Design/methodology/approach This review paper uses a systematic literature review methodology. It conducts a thorough search of academic databases to identify relevant scientific articles. By reviewing and analyzing the primary articles found in the big data in the IoV domain, 45 research articles from 2019 to 2023 were selected for detailed analysis. Findings This paper discovers the main applications, use cases and primary contexts considered for big data in IoV. Next, it documents challenges, opportunities, future research directions and open issues. Research limitations/implications This paper is based on academic articles published from 2019 to 2023. Therefore, scientific outputs published before 2019 are omitted. Originality/value This paper provides a thorough analysis of big data in IoV and considers distinct research questions corresponding to big data challenges and opportunities in IoV. It also provides valuable insights for researchers and practitioners in evolving this field by examining the existing fields and future directions for big data in the IoV ecosystem.
{"title":"Big data challenges and opportunities in Internet of Vehicles: a systematic review","authors":"Atefeh Hemmati, Mani Zarei, A. Rahmani","doi":"10.1108/ijpcc-09-2023-0250","DOIUrl":"https://doi.org/10.1108/ijpcc-09-2023-0250","url":null,"abstract":"\u0000Purpose\u0000Big data challenges and opportunities on the Internet of Vehicles (IoV) have emerged as a transformative paradigm to change intelligent transportation systems. With the growth of data-driven applications and the advances in data analysis techniques, the potential for data-adaptive innovation in IoV applications becomes an outstanding development in future IoV. Therefore, this paper aims to focus on big data in IoV and to provide an analysis of the current state of research.\u0000\u0000\u0000Design/methodology/approach\u0000This review paper uses a systematic literature review methodology. It conducts a thorough search of academic databases to identify relevant scientific articles. By reviewing and analyzing the primary articles found in the big data in the IoV domain, 45 research articles from 2019 to 2023 were selected for detailed analysis.\u0000\u0000\u0000Findings\u0000This paper discovers the main applications, use cases and primary contexts considered for big data in IoV. Next, it documents challenges, opportunities, future research directions and open issues.\u0000\u0000\u0000Research limitations/implications\u0000This paper is based on academic articles published from 2019 to 2023. Therefore, scientific outputs published before 2019 are omitted.\u0000\u0000\u0000Originality/value\u0000This paper provides a thorough analysis of big data in IoV and considers distinct research questions corresponding to big data challenges and opportunities in IoV. It also provides valuable insights for researchers and practitioners in evolving this field by examining the existing fields and future directions for big data in the IoV ecosystem.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140410351","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 : 2023-10-11DOI: 10.1108/ijpcc-07-2022-0256
Radha Subramanyam, Y. Adline Jancy, P. Nagabushanam
Purpose Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power. Design/methodology/approach Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol. Findings Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Research limitations/implications Other optimization techniques can be applied for WSN to analyze the performance. Practical implications Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes. Social implications Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage. Originality/value Literature survey is carried out to find the methods which give better performance.
{"title":"Cooperative optimization techniques in distributed MAC protocols – a survey","authors":"Radha Subramanyam, Y. Adline Jancy, P. Nagabushanam","doi":"10.1108/ijpcc-07-2022-0256","DOIUrl":"https://doi.org/10.1108/ijpcc-07-2022-0256","url":null,"abstract":"Purpose Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power. Design/methodology/approach Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol. Findings Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Research limitations/implications Other optimization techniques can be applied for WSN to analyze the performance. Practical implications Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes. Social implications Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage. Originality/value Literature survey is carried out to find the methods which give better performance.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136059078","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 : 2023-10-06DOI: 10.1108/ijpcc-05-2022-0179
Omotayo Farai, Nicole Metje, Carl Anthony, Ali Sadeghioon, David Chapman
Purpose Wireless sensor networks (WSN), as a solution for buried water pipe monitoring, face a new set of challenges compared to traditional application for above-ground infrastructure monitoring. One of the main challenges for underground WSN deployment is the limited range (less than 3 m) at which reliable wireless underground communication can be achieved using radio signal propagation through the soil. To overcome this challenge, the purpose of this paper is to investigate a new approach for wireless underground communication using acoustic signal propagation along a buried water pipe. Design/methodology/approach An acoustic communication system was developed based on the requirements of low cost (tens of pounds at most), low power supply capacity (in the order of 1 W-h) and miniature (centimetre scale) size for a wireless communication node. The developed system was further tested along a buried steel pipe in poorly graded SAND and a buried medium density polyethylene (MDPE) pipe in well graded SAND. Findings With predicted acoustic attenuation of 1.3 dB/m and 2.1 dB/m along the buried steel and MDPE pipes, respectively, reliable acoustic communication is possible up to 17 m for the buried steel pipe and 11 m for the buried MDPE pipe. Research limitations/implications Although an important first step, more research is needed to validate the acoustic communication system along a wider water distribution pipe network. Originality/value This paper shows the possibility of achieving reliable wireless underground communication along a buried water pipe (especially non-metallic material ones) using low-frequency acoustic propagation along the pipe wall.
{"title":"Novel communication system for buried water pipe monitoring using acoustic signal propagation along the pipe","authors":"Omotayo Farai, Nicole Metje, Carl Anthony, Ali Sadeghioon, David Chapman","doi":"10.1108/ijpcc-05-2022-0179","DOIUrl":"https://doi.org/10.1108/ijpcc-05-2022-0179","url":null,"abstract":"Purpose Wireless sensor networks (WSN), as a solution for buried water pipe monitoring, face a new set of challenges compared to traditional application for above-ground infrastructure monitoring. One of the main challenges for underground WSN deployment is the limited range (less than 3 m) at which reliable wireless underground communication can be achieved using radio signal propagation through the soil. To overcome this challenge, the purpose of this paper is to investigate a new approach for wireless underground communication using acoustic signal propagation along a buried water pipe. Design/methodology/approach An acoustic communication system was developed based on the requirements of low cost (tens of pounds at most), low power supply capacity (in the order of 1 W-h) and miniature (centimetre scale) size for a wireless communication node. The developed system was further tested along a buried steel pipe in poorly graded SAND and a buried medium density polyethylene (MDPE) pipe in well graded SAND. Findings With predicted acoustic attenuation of 1.3 dB/m and 2.1 dB/m along the buried steel and MDPE pipes, respectively, reliable acoustic communication is possible up to 17 m for the buried steel pipe and 11 m for the buried MDPE pipe. Research limitations/implications Although an important first step, more research is needed to validate the acoustic communication system along a wider water distribution pipe network. Originality/value This paper shows the possibility of achieving reliable wireless underground communication along a buried water pipe (especially non-metallic material ones) using low-frequency acoustic propagation along the pipe wall.","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304277","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 : 2023-07-03DOI: 10.1108/ijpcc-08-2022-0303
Mohammed-Alamine El Houssaini, A. Nabou, Abdelali Hadir, Souad El Houssaini, Jamal el Kafi
Purpose Ad hoc mobile networks are commonplace in every aspect of our everyday life. They become essential in many industries and have uses in logistics, science and the military. However, because they operate mostly in open spaces, they are exposed to a variety of dangers. The purpose of this study is to introduce a novel method for detecting the MAC layer misbehavior. Design/methodology/approach The proposed novel approach is based on exponential smoothing for throughput prediction to address this MAC layer misbehavior. The real and expected throughput are processed using an exponential smoothing algorithm to identify this attack, and if these metrics exhibit a trending pattern, an alarm is then sent. Findings The effect of the IEEE 802.11 MAC layer misbehavior on throughput was examined using the NS-2 network simulator, as well as the approval of our novel strategy. The authors have found that a smoothing factor value that is near to 0 provides a very accurate throughput forecast that takes into consideration the recent history of the updated values of the real value. As for the smoothing factor values that are near to 1, they are used to identify MAC layer misbehavior. Originality/value According to the authors’ modest knowledge, this new scheme has not been proposed in the state of the art for the detection of greedy behavior in mobile ad hoc networks.
{"title":"A new predictive approach for the MAC layer misbehavior in IEEE 802.11 networks","authors":"Mohammed-Alamine El Houssaini, A. Nabou, Abdelali Hadir, Souad El Houssaini, Jamal el Kafi","doi":"10.1108/ijpcc-08-2022-0303","DOIUrl":"https://doi.org/10.1108/ijpcc-08-2022-0303","url":null,"abstract":"\u0000Purpose\u0000Ad hoc mobile networks are commonplace in every aspect of our everyday life. They become essential in many industries and have uses in logistics, science and the military. However, because they operate mostly in open spaces, they are exposed to a variety of dangers. The purpose of this study is to introduce a novel method for detecting the MAC layer misbehavior.\u0000\u0000\u0000Design/methodology/approach\u0000The proposed novel approach is based on exponential smoothing for throughput prediction to address this MAC layer misbehavior. The real and expected throughput are processed using an exponential smoothing algorithm to identify this attack, and if these metrics exhibit a trending pattern, an alarm is then sent.\u0000\u0000\u0000Findings\u0000The effect of the IEEE 802.11 MAC layer misbehavior on throughput was examined using the NS-2 network simulator, as well as the approval of our novel strategy. The authors have found that a smoothing factor value that is near to 0 provides a very accurate throughput forecast that takes into consideration the recent history of the updated values of the real value. As for the smoothing factor values that are near to 1, they are used to identify MAC layer misbehavior.\u0000\u0000\u0000Originality/value\u0000According to the authors’ modest knowledge, this new scheme has not been proposed in the state of the art for the detection of greedy behavior in mobile ad hoc networks.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46858289","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 : 2023-05-22DOI: 10.1108/ijpcc-01-2023-0022
H. N., A. Lathigara, Dr Rajanikanth Aluvalu, U. V.
Purpose Cloud computing (CC) refers to the usage of virtualization technology to share computing resources through the internet. Task scheduling (TS) is used to assign computational resources to requests that have a high volume of pending processing. CC relies on load balancing to ensure that resources like servers and virtual machines (VMs) running on real servers share the same amount of load. VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. Design/methodology/approach VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. With a large number of VM or jobs, this method has a long makespan and is very difficult. A new idea to cloud loads without decreasing implementation time or resource consumption is therefore encouraged. Equilibrium optimization is used to cluster the VM into underloaded and overloaded VMs initially in this research. Underloading VMs is used to improve load balance and resource utilization in the second stage. The hybrid algorithm of BAT and the artificial bee colony (ABC) helps with TS using a multi-objective-based system. The VM manager performs VM migration decisions to provide load balance among physical machines (PMs). When a PM is overburdened and another PM is underburdened, the decision to migrate VMs is made based on the appropriate conditions. Balanced load and reduced energy usage in PMs are achieved in the former case. Manta ray foraging (MRF) is used to migrate VMs, and its decisions are based on a variety of factors. Findings The proposed approach provides the best possible scheduling for both VMs and PMs. To complete the task, improved whale optimization algorithm for Cloud TS has 42 s of completion time, enhanced multi-verse optimizer has 48 s, hybrid electro search with a genetic algorithm has 50 s, adaptive benefit factor-based symbiotic organisms search has 38 s and, finally, the proposed model has 30 s, which shows better performance of the proposed model. Originality/value User’s request or data transmission in a cloud data centre may cause the VMs to be under or overloaded with data. To identify the load on VM, initially EQ algorithm is used for clustering process. To figure out how well the proposed method works when the system is very busy by implementing hybrid algorithm called BAT–ABC. After the TS process, VM migration is occurred at the final stage, where optimal VM is identified by using MRF algorithm. The experimental analysis is carried out by using various metrics such as execution time, transmission time, makespan for various
{"title":"Clustering based EO with MRF technique for effective load balancing in cloud computing","authors":"H. N., A. Lathigara, Dr Rajanikanth Aluvalu, U. V.","doi":"10.1108/ijpcc-01-2023-0022","DOIUrl":"https://doi.org/10.1108/ijpcc-01-2023-0022","url":null,"abstract":"\u0000Purpose\u0000Cloud computing (CC) refers to the usage of virtualization technology to share computing resources through the internet. Task scheduling (TS) is used to assign computational resources to requests that have a high volume of pending processing. CC relies on load balancing to ensure that resources like servers and virtual machines (VMs) running on real servers share the same amount of load. VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data.\u0000\u0000\u0000Design/methodology/approach\u0000VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. With a large number of VM or jobs, this method has a long makespan and is very difficult. A new idea to cloud loads without decreasing implementation time or resource consumption is therefore encouraged. Equilibrium optimization is used to cluster the VM into underloaded and overloaded VMs initially in this research. Underloading VMs is used to improve load balance and resource utilization in the second stage. The hybrid algorithm of BAT and the artificial bee colony (ABC) helps with TS using a multi-objective-based system. The VM manager performs VM migration decisions to provide load balance among physical machines (PMs). When a PM is overburdened and another PM is underburdened, the decision to migrate VMs is made based on the appropriate conditions. Balanced load and reduced energy usage in PMs are achieved in the former case. Manta ray foraging (MRF) is used to migrate VMs, and its decisions are based on a variety of factors.\u0000\u0000\u0000Findings\u0000The proposed approach provides the best possible scheduling for both VMs and PMs. To complete the task, improved whale optimization algorithm for Cloud TS has 42 s of completion time, enhanced multi-verse optimizer has 48 s, hybrid electro search with a genetic algorithm has 50 s, adaptive benefit factor-based symbiotic organisms search has 38 s and, finally, the proposed model has 30 s, which shows better performance of the proposed model.\u0000\u0000\u0000Originality/value\u0000User’s request or data transmission in a cloud data centre may cause the VMs to be under or overloaded with data. To identify the load on VM, initially EQ algorithm is used for clustering process. To figure out how well the proposed method works when the system is very busy by implementing hybrid algorithm called BAT–ABC. After the TS process, VM migration is occurred at the final stage, where optimal VM is identified by using MRF algorithm. The experimental analysis is carried out by using various metrics such as execution time, transmission time, makespan for various","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49058611","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 : 2023-05-17DOI: 10.1108/ijpcc-08-2022-0305
Ishita Seth, Kalpna Guleria, S. Panda
Purpose The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead. Design/methodology/approach The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV. Findings The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks. Originality/value The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.
{"title":"A lane-based advanced forwarding protocol for internet of vehicles","authors":"Ishita Seth, Kalpna Guleria, S. Panda","doi":"10.1108/ijpcc-08-2022-0305","DOIUrl":"https://doi.org/10.1108/ijpcc-08-2022-0305","url":null,"abstract":"\u0000Purpose\u0000The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.\u0000\u0000\u0000Design/methodology/approach\u0000The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.\u0000\u0000\u0000Findings\u0000The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.\u0000\u0000\u0000Originality/value\u0000The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44325377","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 : 2023-03-07DOI: 10.1108/ijpcc-06-2022-0248
Preeti Godabole, G. Bhole
Purpose The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques. Design/methodology/approach The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives. Findings Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used. Research limitations/implications The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments. Practical implications The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques. Originality/value This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.
{"title":"Utilization and criticality based fault-tolerant scheduling in multicore mixed critical systems","authors":"Preeti Godabole, G. Bhole","doi":"10.1108/ijpcc-06-2022-0248","DOIUrl":"https://doi.org/10.1108/ijpcc-06-2022-0248","url":null,"abstract":"\u0000Purpose\u0000The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\u0000\u0000\u0000Design/methodology/approach\u0000The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.\u0000\u0000\u0000Findings\u0000Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.\u0000\u0000\u0000Research limitations/implications\u0000The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.\u0000\u0000\u0000Practical implications\u0000The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\u0000\u0000\u0000Originality/value\u0000This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46465511","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 : 2023-02-28DOI: 10.1108/ijpcc-09-2022-0327
T. P. Fowdur, M.A.N. Shaikh Abdoolla, Lokeshwar Doobur
Purpose The purpose of this paper is to perform a comparative analysis of the delay associated in running two real-time machine learning-based applications, namely, a video quality assessment (VQA) and a phishing detection application by using the edge, fog and cloud computing paradigms. Design/methodology/approach The VQA algorithm was developed using Android Studio and run on a mobile phone for the edge paradigm. For the fog paradigm, it was hosted on a Java server and for the cloud paradigm on the IBM and Firebase clouds. The phishing detection algorithm was embedded into a browser extension for the edge paradigm. For the fog paradigm, it was hosted on a Node.js server and for the cloud paradigm on Firebase. Findings For the VQA algorithm, the edge paradigm had the highest response time while the cloud paradigm had the lowest, as the algorithm was computationally intensive. For the phishing detection algorithm, the edge paradigm had the lowest response time, and the cloud paradigm had the highest, as the algorithm had a low computational complexity. Since the determining factor for the response time was the latency, the edge paradigm provided the smallest delay as all processing were local. Research limitations/implications The main limitation of this work is that the experiments were performed on a small scale due to time and budget constraints. Originality/value A detailed analysis with real applications has been provided to show how the complexity of an application can determine the best computing paradigm on which it can be deployed.
{"title":"Performance analysis of edge, fog and cloud computing paradigms for real-time video quality assessment and phishing detection","authors":"T. P. Fowdur, M.A.N. Shaikh Abdoolla, Lokeshwar Doobur","doi":"10.1108/ijpcc-09-2022-0327","DOIUrl":"https://doi.org/10.1108/ijpcc-09-2022-0327","url":null,"abstract":"\u0000Purpose\u0000The purpose of this paper is to perform a comparative analysis of the delay associated in running two real-time machine learning-based applications, namely, a video quality assessment (VQA) and a phishing detection application by using the edge, fog and cloud computing paradigms.\u0000\u0000\u0000Design/methodology/approach\u0000The VQA algorithm was developed using Android Studio and run on a mobile phone for the edge paradigm. For the fog paradigm, it was hosted on a Java server and for the cloud paradigm on the IBM and Firebase clouds. The phishing detection algorithm was embedded into a browser extension for the edge paradigm. For the fog paradigm, it was hosted on a Node.js server and for the cloud paradigm on Firebase.\u0000\u0000\u0000Findings\u0000For the VQA algorithm, the edge paradigm had the highest response time while the cloud paradigm had the lowest, as the algorithm was computationally intensive. For the phishing detection algorithm, the edge paradigm had the lowest response time, and the cloud paradigm had the highest, as the algorithm had a low computational complexity. Since the determining factor for the response time was the latency, the edge paradigm provided the smallest delay as all processing were local.\u0000\u0000\u0000Research limitations/implications\u0000The main limitation of this work is that the experiments were performed on a small scale due to time and budget constraints.\u0000\u0000\u0000Originality/value\u0000A detailed analysis with real applications has been provided to show how the complexity of an application can determine the best computing paradigm on which it can be deployed.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48160098","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 : 2023-01-16DOI: 10.1108/ijpcc-04-2022-0164
F. Lone, H. Verma, K. Sharma
Purpose The purpose of this study is to extensively explore the vehicular network paradigm, challenges faced by them and provide a reasonable solution for securing these vulnerable networks. Vehicle-to-everything (V2X) communication has brought the long-anticipated goal of safe, convenient and sustainable transportation closer to reality. The connected vehicle (CV) paradigm is critical to the intelligent transportation systems vision. It imagines a society free of a troublesome transportation system burdened by gridlock, fatal accidents and a polluted environment. The authors cannot overstate the importance of CVs in solving long-standing mobility issues and making travel safer and more convenient. It is high time to explore vehicular networks in detail to suggest solutions to the challenges encountered by these highly dynamic networks. Design/methodology/approach This paper compiles research on various V2X topics, from a comprehensive overview of V2X networks to their unique characteristics and challenges. In doing so, the authors identify multiple issues encountered by V2X communication networks due to their open communication nature and high mobility, especially from a security perspective. Thus, this paper proposes a trust-based model to secure vehicular networks. The proposed approach uses the communicating nodes’ behavior to establish trustworthy relationships. The proposed model only allows trusted nodes to communicate among themselves while isolating malicious nodes to achieve secure communication. Findings Despite the benefits offered by V2X networks, they have associated challenges. As the number of CVs on the roads increase, so does the attack surface. Connected cars provide numerous safety-critical applications that, if compromised, can result in fatal consequences. While cryptographic mechanisms effectively prevent external attacks, various studies propose trust-based models to complement cryptographic solutions for dealing with internal attacks. While numerous trust-based models have been proposed, there is room for improvement in malicious node detection and complexity. Optimizing the number of nodes considered in trust calculation can reduce the complexity of state-of-the-art solutions. The theoretical analysis of the proposed model exhibits an improvement in trust calculation, better malicious node detection and fewer computations. Originality/value The proposed model is the first to add another dimension to trust calculation by incorporating opinions about recommender nodes. The added dimension improves the trust calculation resulting in better performance in thwarting attacks and enhancing security while also reducing the trust calculation complexity.
{"title":"A systematic study on the challenges, characteristics and security issues in vehicular networks","authors":"F. Lone, H. Verma, K. Sharma","doi":"10.1108/ijpcc-04-2022-0164","DOIUrl":"https://doi.org/10.1108/ijpcc-04-2022-0164","url":null,"abstract":"\u0000Purpose\u0000The purpose of this study is to extensively explore the vehicular network paradigm, challenges faced by them and provide a reasonable solution for securing these vulnerable networks. Vehicle-to-everything (V2X) communication has brought the long-anticipated goal of safe, convenient and sustainable transportation closer to reality. The connected vehicle (CV) paradigm is critical to the intelligent transportation systems vision. It imagines a society free of a troublesome transportation system burdened by gridlock, fatal accidents and a polluted environment. The authors cannot overstate the importance of CVs in solving long-standing mobility issues and making travel safer and more convenient. It is high time to explore vehicular networks in detail to suggest solutions to the challenges encountered by these highly dynamic networks.\u0000\u0000\u0000Design/methodology/approach\u0000This paper compiles research on various V2X topics, from a comprehensive overview of V2X networks to their unique characteristics and challenges. In doing so, the authors identify multiple issues encountered by V2X communication networks due to their open communication nature and high mobility, especially from a security perspective. Thus, this paper proposes a trust-based model to secure vehicular networks. The proposed approach uses the communicating nodes’ behavior to establish trustworthy relationships. The proposed model only allows trusted nodes to communicate among themselves while isolating malicious nodes to achieve secure communication.\u0000\u0000\u0000Findings\u0000Despite the benefits offered by V2X networks, they have associated challenges. As the number of CVs on the roads increase, so does the attack surface. Connected cars provide numerous safety-critical applications that, if compromised, can result in fatal consequences. While cryptographic mechanisms effectively prevent external attacks, various studies propose trust-based models to complement cryptographic solutions for dealing with internal attacks. While numerous trust-based models have been proposed, there is room for improvement in malicious node detection and complexity. Optimizing the number of nodes considered in trust calculation can reduce the complexity of state-of-the-art solutions. The theoretical analysis of the proposed model exhibits an improvement in trust calculation, better malicious node detection and fewer computations.\u0000\u0000\u0000Originality/value\u0000The proposed model is the first to add another dimension to trust calculation by incorporating opinions about recommender nodes. The added dimension improves the trust calculation resulting in better performance in thwarting attacks and enhancing security while also reducing the trust calculation complexity.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46843343","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 : 2023-01-04DOI: 10.1108/ijpcc-07-2022-0271
S. Sonawani, Kailas Patil
Purpose Indoor air quality monitoring is extremely important in urban, industrial areas. Considering the devastating effect of declining quality of air in major part of the countries like India and China, it is highly recommended to monitor the quality of air which can help people with respiratory diseases, children and elderly people to take necessary precautions and stay safe at their homes. The purpose of this study is to detect air quality and perform predictions which could be part of smart home automation with the use of newer technology. Design/methodology/approach This study proposes an Internet-of-Things (IoT)-based air quality measurement, warning and prediction system for ambient assisted living. The proposed ambient assisted living system consists of low-cost air quality sensors and ESP32 controller with new generation embedded system architecture. It can detect Indoor Air Quality parameters like CO, PM2.5, NO2, O3, NH3, temperature, pressure, humidity, etc. The low cost sensor data are calibrated using machine learning techniques for performance improvement. The system has a novel prediction model, multiheaded convolutional neural networks-gated recurrent unit which can detect next hour pollution concentration. The model uses a transfer learning (TL) approach for prediction when the system is new and less data available for prediction. Any neighboring site data can be used to transfer knowledge for early predictions for the new system. It can have a mobile-based application which can send warning notifications to users if the Indoor Air Quality parameters exceed the specified threshold values. This is all required to take necessary measures against bad air quality. Findings The IoT-based system has implemented the TL framework, and the results of this study showed that the system works efficiently with performance improvement of 55.42% in RMSE scores for prediction at new target system with insufficient data. Originality/value This study demonstrates the implementation of an IoT system which uses low-cost sensors and deep learning model for predicting pollution concentration. The system is tackling the issues of the low-cost sensors for better performance. The novel approach of pretrained models and TL work very well at the new system having data insufficiency issues. This study contributes significantly with the usage of low-cost sensors, open-source advanced technology and performance improvement in prediction ability at new systems. Experimental results and findings are disclosed in this study. This will help install multiple new cost-effective monitoring stations in smart city for pollution forecasting.
{"title":"Air quality measurement, prediction and warning using transfer learning based IOT system for ambient assisted living","authors":"S. Sonawani, Kailas Patil","doi":"10.1108/ijpcc-07-2022-0271","DOIUrl":"https://doi.org/10.1108/ijpcc-07-2022-0271","url":null,"abstract":"\u0000Purpose\u0000Indoor air quality monitoring is extremely important in urban, industrial areas. Considering the devastating effect of declining quality of air in major part of the countries like India and China, it is highly recommended to monitor the quality of air which can help people with respiratory diseases, children and elderly people to take necessary precautions and stay safe at their homes. The purpose of this study is to detect air quality and perform predictions which could be part of smart home automation with the use of newer technology.\u0000\u0000\u0000Design/methodology/approach\u0000This study proposes an Internet-of-Things (IoT)-based air quality measurement, warning and prediction system for ambient assisted living. The proposed ambient assisted living system consists of low-cost air quality sensors and ESP32 controller with new generation embedded system architecture. It can detect Indoor Air Quality parameters like CO, PM2.5, NO2, O3, NH3, temperature, pressure, humidity, etc. The low cost sensor data are calibrated using machine learning techniques for performance improvement. The system has a novel prediction model, multiheaded convolutional neural networks-gated recurrent unit which can detect next hour pollution concentration. The model uses a transfer learning (TL) approach for prediction when the system is new and less data available for prediction. Any neighboring site data can be used to transfer knowledge for early predictions for the new system. It can have a mobile-based application which can send warning notifications to users if the Indoor Air Quality parameters exceed the specified threshold values. This is all required to take necessary measures against bad air quality.\u0000\u0000\u0000Findings\u0000The IoT-based system has implemented the TL framework, and the results of this study showed that the system works efficiently with performance improvement of 55.42% in RMSE scores for prediction at new target system with insufficient data.\u0000\u0000\u0000Originality/value\u0000This study demonstrates the implementation of an IoT system which uses low-cost sensors and deep learning model for predicting pollution concentration. The system is tackling the issues of the low-cost sensors for better performance. The novel approach of pretrained models and TL work very well at the new system having data insufficiency issues. This study contributes significantly with the usage of low-cost sensors, open-source advanced technology and performance improvement in prediction ability at new systems. Experimental results and findings are disclosed in this study. This will help install multiple new cost-effective monitoring stations in smart city for pollution forecasting.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2023-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47275874","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
扫码关注我们
求助内容：
应助结果提醒方式：