Pub Date : 2019-09-19DOI: 10.5220/0008191601210127
Sebastian Brunthaler, T. Waas, M. Kucera
As a result of the enormous growth in data traffic for autonomous driving, the conventional in-vehicle network is no longer sufficient and requires new types of network concepts in a vehicle. This part of the automobile is known as the next generation communication network. Since the new car-systems can be extended by various services at any time, the network must adapt dynamically to new requirements wherever possible. For example, data flow must be configured dynamically between new services. Also data rates will be much higher in the future than today. This is one of the main reasons why we need to search for new technologies for data transfer in vehicles. This is based on an in-vehicle ethernet network. The process of configuring networks automatically has been discussed several times in recent years. One of the next steps is verifying and validating the automatic configuration process during the development of the new communication network. This research paper identifies several ways to ensure the automatically generated network configuration leads to a secure system. To achieve that, other parts of the company’s enterprise IT architecture and network technologies, the conventional vehicle network and other options for verification and validation are analysed.
{"title":"On Verify and Validate a Next Generation Automotive Communication Networka","authors":"Sebastian Brunthaler, T. Waas, M. Kucera","doi":"10.5220/0008191601210127","DOIUrl":"https://doi.org/10.5220/0008191601210127","url":null,"abstract":"As a result of the enormous growth in data traffic for autonomous driving, the conventional in-vehicle network is no longer sufficient and requires new types of network concepts in a vehicle. This part of the automobile is known as the next generation communication network. Since the new car-systems can be extended by various services at any time, the network must adapt dynamically to new requirements wherever possible. For example, data flow must be configured dynamically between new services. Also data rates will be much higher in the future than today. This is one of the main reasons why we need to search for new technologies for data transfer in vehicles. This is based on an in-vehicle ethernet network. The process of configuring networks automatically has been discussed several times in recent years. One of the next steps is verifying and validating the automatic configuration process during the development of the new communication network. This research paper identifies several ways to ensure the automatically generated network configuration leads to a secure system. To achieve that, other parts of the company’s enterprise IT architecture and network technologies, the conventional vehicle network and other options for verification and validation are analysed.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371473","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 : 2019-09-19DOI: 10.5220/0008168801060112
Nisrine Ibadah, K. Minaoui, M. Rziza, M. Oumsis, C. Benavente-Peces
Mobility modeling represents a critical task in mobile wireless networks to improve the overall throughput. This paper evaluates relevant spatial-temporal stochastic properties of the most frequently used synthetic mobility models compared to a new efficient mobility model named Maze Mobility Model (Maze MM). It imitates a real-life movement according to diverse mobility features, as spatial and temporal dependencies with also geographic restrictions. To demonstrate the efficiency of this new model, various metrics were validated such as; the speed decay problem, the density wave phenomenon, the spatial node distribution, the average neighbor percentage, and mobile neighbors range. Each mobility pattern may bear from diverse mobility flaws, as shown by network simulations. So, numerous metrics are employed to describe mobility features. The current research aims to deeply understand mobility features of Maze MM with the aim to deduce a definite judgment of each mobility metric, given that further this fact affects the whole network performances. The validation results are discussed to remark the effectiveness and robustness of Maze MM according to the validated mobility metrics.
{"title":"Flaws Validation of Maze Mobility Model using Spatial-temporal Synthetic Mobility Metrics","authors":"Nisrine Ibadah, K. Minaoui, M. Rziza, M. Oumsis, C. Benavente-Peces","doi":"10.5220/0008168801060112","DOIUrl":"https://doi.org/10.5220/0008168801060112","url":null,"abstract":"Mobility modeling represents a critical task in mobile wireless networks to improve the overall throughput. This paper evaluates relevant spatial-temporal stochastic properties of the most frequently used synthetic mobility models compared to a new efficient mobility model named Maze Mobility Model (Maze MM). It imitates a real-life movement according to diverse mobility features, as spatial and temporal dependencies with also geographic restrictions. To demonstrate the efficiency of this new model, various metrics were validated such as; the speed decay problem, the density wave phenomenon, the spatial node distribution, the average neighbor percentage, and mobile neighbors range. Each mobility pattern may bear from diverse mobility flaws, as shown by network simulations. So, numerous metrics are employed to describe mobility features. The current research aims to deeply understand mobility features of Maze MM with the aim to deduce a definite judgment of each mobility metric, given that further this fact affects the whole network performances. The validation results are discussed to remark the effectiveness and robustness of Maze MM according to the validated mobility metrics.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811336","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 : 2019-09-19DOI: 10.5220/0008066500650074
T. Narumi, A. Muramatsu
In the era of the IoT (Internet of Things) and Edge computing, SoC (System on Chip) with an FPGA (Field Programmable Gate Array) is a suitable solution for embedded systems because it supports running rich operating systems on general-purpose CPUs, as well as the FPGA’s acceleration for specific computing. One problem of designing an accelerator on an FPGA is that optimization of the logic for the accelerator is not automatic and much trial and error is needed before attaining peak performance from the SoC. In this paper we propose a method to reduce the development time of the accelerator using N-body simulation as a target application. Based on the hardware resources needed for several pipelines of the accelerator and their performance estimation model, we can estimate how many pipelines can be implemented on an SoC. In addition, the amount of memory each pipeline requires for attaining maximum performance is suggested. Our model agreed with the actual calculation speed for different constraining conditions.
在物联网(IoT)和边缘计算时代，SoC (System on Chip)与FPGA (Field Programmable Gate Array)是嵌入式系统的合适解决方案，因为它支持在通用cpu上运行丰富的操作系统，以及FPGA对特定计算的加速。在FPGA上设计加速器的一个问题是，加速器的逻辑优化不是自动的，在从SoC获得峰值性能之前需要进行大量的试验和错误。本文提出了一种以n体仿真为目标应用，缩短加速器开发时间的方法。根据加速器的几个管道所需的硬件资源及其性能估计模型，我们可以估计在一个SoC上可以实现多少个管道。此外，还建议每个管道获得最大性能所需的内存量。在不同约束条件下，模型与实际计算速度吻合。
{"title":"Estimating Configuration Parameters of Pipelines for Accelerating N-Body Simulations with an FPGA using High-level Synthesis","authors":"T. Narumi, A. Muramatsu","doi":"10.5220/0008066500650074","DOIUrl":"https://doi.org/10.5220/0008066500650074","url":null,"abstract":"In the era of the IoT (Internet of Things) and Edge computing, SoC (System on Chip) with an FPGA (Field Programmable Gate Array) is a suitable solution for embedded systems because it supports running rich operating systems on general-purpose CPUs, as well as the FPGA’s acceleration for specific computing. One problem of designing an accelerator on an FPGA is that optimization of the logic for the accelerator is not automatic and much trial and error is needed before attaining peak performance from the SoC. In this paper we propose a method to reduce the development time of the accelerator using N-body simulation as a target application. Based on the hardware resources needed for several pipelines of the accelerator and their performance estimation model, we can estimate how many pipelines can be implemented on an SoC. In addition, the amount of memory each pipeline requires for attaining maximum performance is suggested. Our model agreed with the actual calculation speed for different constraining conditions.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112548","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 : 2019-09-19DOI: 10.5220/0008162800910098
Olaf Grote, A. Ahrens, C. Benavente-Peces
General security protocols use cryptographic schemes which are not prepared against quantum attacks. Asymmetric public key cryptographic schemes based on well researched methods are defined as broken, from quantum computer perspective. In contrast, symmetric cryptographic schemes and there methods are considered quantum-safe. A new effective strategy is necessary with focusing on post-quantum cryptography for evaluating and researching new quantum-safe cryptographic principles and crypto-agility to update vulnerable security protocols.
{"title":"Paradigm of Post-quantum Cryptography and Crypto-agility: Strategy Approach of Quantum-safe Techniques","authors":"Olaf Grote, A. Ahrens, C. Benavente-Peces","doi":"10.5220/0008162800910098","DOIUrl":"https://doi.org/10.5220/0008162800910098","url":null,"abstract":"General security protocols use cryptographic schemes which are not prepared against quantum attacks. Asymmetric public key cryptographic schemes based on well researched methods are defined as broken, from quantum computer perspective. In contrast, symmetric cryptographic schemes and there methods are considered quantum-safe. A new effective strategy is necessary with focusing on post-quantum cryptography for evaluating and researching new quantum-safe cryptographic principles and crypto-agility to update vulnerable security protocols.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441715","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 : 2019-09-19DOI: 10.5220/0008162300830090
Diego V. Queiroz, R. Gomes, C. Benavente-Peces, I. Fonseca, M. Alencar
The goal of this paper is analysing the use of the IEEE 802.15.4e standard MAC layer protocol Time-Slotted Channel Hopping (TSCH) mode in the context of Internet of Things (IoT) and Industrial IoT (IIoT) aimed at reducing narrow-band interferences and the multi-path fading impact on available channels by using frequency hopping, with network time synchronization to achieve low-power operation. In low disturbances environments using several channels provides the diversity benefits. However, using several channels requires channel scanning and switching leads to extra power consumption. It could be accepted in harsh environments (industrial), due to its influence on channels features, requiring more channels, and it is necessary to continuously hop seeking for the best one to achieve the best performance. Several experiments have been simulated and implemented in real testbeds the laboratory as first validation approach. The performance and energy efficiency of the entire network is analysed for different scheduling methods, packet transmission rates, number of used channels and guard time. The relevant conclusion showed in this investigation is that using all the available channels of the standard is not required to achieve the best joint-results given that, regardless the scheduling method used, considering a higher number channels requires a higher power consumption for channels quality exploration and packet reception rate decreases.
{"title":"Join Multiple Channels and IEEE 802.15.4e TSCH Protocol Use Effects on WSN Performance and Energy Efficiency","authors":"Diego V. Queiroz, R. Gomes, C. Benavente-Peces, I. Fonseca, M. Alencar","doi":"10.5220/0008162300830090","DOIUrl":"https://doi.org/10.5220/0008162300830090","url":null,"abstract":"The goal of this paper is analysing the use of the IEEE 802.15.4e standard MAC layer protocol Time-Slotted Channel Hopping (TSCH) mode in the context of Internet of Things (IoT) and Industrial IoT (IIoT) aimed at reducing narrow-band interferences and the multi-path fading impact on available channels by using frequency hopping, with network time synchronization to achieve low-power operation. In low disturbances environments using several channels provides the diversity benefits. However, using several channels requires channel scanning and switching leads to extra power consumption. It could be accepted in harsh environments (industrial), due to its influence on channels features, requiring more channels, and it is necessary to continuously hop seeking for the best one to achieve the best performance. Several experiments have been simulated and implemented in real testbeds the laboratory as first validation approach. The performance and energy efficiency of the entire network is analysed for different scheduling methods, packet transmission rates, number of used channels and guard time. The relevant conclusion showed in this investigation is that using all the available channels of the standard is not required to achieve the best joint-results given that, regardless the scheduling method used, considering a higher number channels requires a higher power consumption for channels quality exploration and packet reception rate decreases.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132379940","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 : 2019-09-19DOI: 10.5220/0008167900340045
Vu San Ha Huynh, Milena Radenkovic
Applications and services hosted in the mobile edge/fog networks today (e.g., augmented reality, self-driving, and various cognitive applications) may suffer from limited network coverage and localized congestion due to dynamic mobility of users and surge of traffic demand. Mobile opportunistic caching at the edges is expected to be an effective solution for bringing content closer and improve the quality of service for mobile users. To fully exploit the edge/fog resources, the most popular contents should be identified and cached. Emerging research has shown significant importance of predicting content traffic patterns related to users’ mobility over time and locations which is a complex question and still not well-understood. This paper tackles this challenge by proposing K-order Markov chain-based fully-distributed multi-layer complex analytics and heuristics to predict the future trends of content traffic. More specifically, we propose the multilayer real-time predictive analytics based on historical temporal information (frequency, recency, betweenness) and spatial information (dynamic clustering, similarity, tie-strength) of the contents and the mobility patterns of contents’ subscribers. This enables better responsiveness to the rising of newly high popular contents and fading out of older contents over time and locations. We extensively evaluate our proposal against benchmark (TLRU) and competitive protocols (SocialCache, OCPCP, LocationCache) across a range of metrics over two vastly different complex temporal network topologies: random networks and scale-free networks (i.e. real connectivity Infocom traces) and use Foursquare dataset as a realistic content request patterns. We show that our caching framework consistently outperforms the state-of-the-art algorithms in the face of dynamically changing topologies and content workloads as well as dynamic resource availability.
{"title":"Interdependent Multi-layer Spatial Temporal-based Caching in Heterogeneous Mobile Edge and Fog Networks","authors":"Vu San Ha Huynh, Milena Radenkovic","doi":"10.5220/0008167900340045","DOIUrl":"https://doi.org/10.5220/0008167900340045","url":null,"abstract":"Applications and services hosted in the mobile edge/fog networks today (e.g., augmented reality, self-driving, and various cognitive applications) may suffer from limited network coverage and localized congestion due to dynamic mobility of users and surge of traffic demand. Mobile opportunistic caching at the edges is expected to be an effective solution for bringing content closer and improve the quality of service for mobile users. To fully exploit the edge/fog resources, the most popular contents should be identified and cached. Emerging research has shown significant importance of predicting content traffic patterns related to users’ mobility over time and locations which is a complex question and still not well-understood. This paper tackles this challenge by proposing K-order Markov chain-based fully-distributed multi-layer complex analytics and heuristics to predict the future trends of content traffic. More specifically, we propose the multilayer real-time predictive analytics based on historical temporal information (frequency, recency, betweenness) and spatial information (dynamic clustering, similarity, tie-strength) of the contents and the mobility patterns of contents’ subscribers. This enables better responsiveness to the rising of newly high popular contents and fading out of older contents over time and locations. We extensively evaluate our proposal against benchmark (TLRU) and competitive protocols (SocialCache, OCPCP, LocationCache) across a range of metrics over two vastly different complex temporal network topologies: random networks and scale-free networks (i.e. real connectivity Infocom traces) and use Foursquare dataset as a realistic content request patterns. We show that our caching framework consistently outperforms the state-of-the-art algorithms in the face of dynamically changing topologies and content workloads as well as dynamic resource availability.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115655826","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 : 2019-09-19DOI: 10.5220/0007977600490056
A. Ahrens, O. Purvinis, Detlef Hartleb, J. Zaščerinska, D. Miceviciene
Nowadays, bursty business processes are part of our everyday life. Bursty business processes include such processes as selling and buying, too. One of the contemporary challenges business environment has to deal with is monitoring and controlling of burstiness in business processes. Monitoring and controlling of burstiness in business processes often leads to the optimization of business processes. Validation of the model for analysing buyers’ burstiness in business processes revealed the need in optimisation of the proposed model, as the elaborated model based on gap processes is complex for implementation, as well as for parameter estimation. For optimization of the model for analysing buyers’ burstiness in business process, different levels of burstiness in the process of buying are studied in this work. Different approaches to modelling buyers’ behaviours are presented and evaluated in this work, too. The novel contribution of this work is based on the estimation of burstiness. With the proposed solution the level of burstiness can be estimated by taking the mean value and the standard deviation of a gap sequence into account, which always exists for a given sequence. As a practical application, the cash register of a medium size grocery shop in Lithuania is analysed. The novelty of this paper is given by the comparison of different approaches to measuring burstiness in real process data. Directions of further research are proposed.
{"title":"Analysis of a Business Environment using Burstiness Parameter: The Case of a Grocery Shop","authors":"A. Ahrens, O. Purvinis, Detlef Hartleb, J. Zaščerinska, D. Miceviciene","doi":"10.5220/0007977600490056","DOIUrl":"https://doi.org/10.5220/0007977600490056","url":null,"abstract":"Nowadays, bursty business processes are part of our everyday life. Bursty business processes include such processes\u0000as selling and buying, too. One of the contemporary challenges business environment has to deal with\u0000is monitoring and controlling of burstiness in business processes. Monitoring and controlling of burstiness in\u0000business processes often leads to the optimization of business processes. Validation of the model for analysing\u0000buyers’ burstiness in business processes revealed the need in optimisation of the proposed model, as the elaborated\u0000model based on gap processes is complex for implementation, as well as for parameter estimation. For\u0000optimization of the model for analysing buyers’ burstiness in business process, different levels of burstiness\u0000in the process of buying are studied in this work. Different approaches to modelling buyers’ behaviours are\u0000presented and evaluated in this work, too. The novel contribution of this work is based on the estimation of\u0000burstiness. With the proposed solution the level of burstiness can be estimated by taking the mean value and\u0000the standard deviation of a gap sequence into account, which always exists for a given sequence. As a practical\u0000application, the cash register of a medium size grocery shop in Lithuania is analysed. The novelty of this paper\u0000is given by the comparison of different approaches to measuring burstiness in real process data. Directions of\u0000further research are proposed.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"425 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122635294","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 : 2019-09-19DOI: 10.5220/0008068800750082
Mohammed R. Anany, Heba Hussien, S. Aly, Nourhan Sakr
The Software developer productivity is an important indicator that has attracted the attention of the industry over the years. It has been established that improving software productivity enhances the performance of organizations. Despite its importance, a full understanding of contextual factors and how they influence productivity is not attained. One such important factor is the developer’s emotions. In this paper, we conduct an experiment on 11 participants where they attempt to solve 10 ACM-style problems as we monitor their emotions and behaviour in the background. The experiments performed achieve an accuracy of 55.4% on the test set using a random forest classifier. There is room for multiple improvements such as increasing dataset size, performing class balancing, and utilizing different aggregation methods for the data. This paper opens a different track for experimentation relating to the relationship between emotions and software productivity. Achieving a better understanding of this relationship can aid further research that would utilize it to build context aware and pervasive systems that can automatically react to developers’ emotions when going through a low productivity phase and orient them towards emotions that are correlated with positive productivity.
{"title":"Influence of Emotions on Software Developer Productivity","authors":"Mohammed R. Anany, Heba Hussien, S. Aly, Nourhan Sakr","doi":"10.5220/0008068800750082","DOIUrl":"https://doi.org/10.5220/0008068800750082","url":null,"abstract":"The Software developer productivity is an important indicator that has attracted the attention of the industry over the years. It has been established that improving software productivity enhances the performance of organizations. Despite its importance, a full understanding of contextual factors and how they influence productivity is not attained. One such important factor is the developer’s emotions. In this paper, we conduct an experiment on 11 participants where they attempt to solve 10 ACM-style problems as we monitor their emotions and behaviour in the background. The experiments performed achieve an accuracy of 55.4% on the test set using a random forest classifier. There is room for multiple improvements such as increasing dataset size, performing class balancing, and utilizing different aggregation methods for the data. This paper opens a different track for experimentation relating to the relationship between emotions and software productivity. Achieving a better understanding of this relationship can aid further research that would utilize it to build context aware and pervasive systems that can automatically react to developers’ emotions when going through a low productivity phase and orient them towards emotions that are correlated with positive productivity.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116218945","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 : 2019-09-19DOI: 10.5220/0008168700990105
D. Gasior
In this paper, two approaches to the hybrid fog and cloud computing environment are presented. The first is based on the assumption of centralized management performed by cloud, while the latter takes utilization of self-managing concept enabling distributed resource allocation carried by fogs. The appropriate mathematical models are introduced and the optimization problems are formulated. While the first concept turned out to be the mixed nonlinear programming, the second may be interpreted as the noncooperative game. The ideas of the possible solutions are briefly suggested.
{"title":"Two Approaches to Resource Allocation in Hybrid Fog and Cloud Systems","authors":"D. Gasior","doi":"10.5220/0008168700990105","DOIUrl":"https://doi.org/10.5220/0008168700990105","url":null,"abstract":"In this paper, two approaches to the hybrid fog and cloud computing environment are presented. The first is based on the assumption of centralized management performed by cloud, while the latter takes utilization of self-managing concept enabling distributed resource allocation carried by fogs. The appropriate mathematical models are introduced and the optimization problems are formulated. While the first concept turned out to be the mixed nonlinear programming, the second may be interpreted as the noncooperative game. The ideas of the possible solutions are briefly suggested.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114355420","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 : 2019-09-19DOI: 10.5220/0008165400250033
Adrian Musuroi, B. Groza, Pal-Stefan Murvay, Horatiu Gurban
In recent years, the security of in-vehicle buses and components has been extensively addressed, but only a few research works considered the security of low-end in-vehicle sensors. The main problem in addressing such components stems from the numerous constraints, both in terms of computational power, since most sensors are equipped with low-speed 8 bit controllers, and low bandwidth. In this work we use as a case study a tire-pressure sensor and a rain-light sensor. The first communicates over radio-frequency while the second uses a low-speed in-vehicle bus, both interfaces having a very low bandwidth and reduced packet size of only 64 bits. Under these constraints we discuss the design of a cryptographic security protocol based on an existing lightweight block cipher in order to assure both security and privacy objectives.
{"title":"Security for Low-end Automotive Sensors: A Tire-pressure and Rain-light Sensors Case Study","authors":"Adrian Musuroi, B. Groza, Pal-Stefan Murvay, Horatiu Gurban","doi":"10.5220/0008165400250033","DOIUrl":"https://doi.org/10.5220/0008165400250033","url":null,"abstract":"In recent years, the security of in-vehicle buses and components has been extensively addressed, but only a few research works considered the security of low-end in-vehicle sensors. The main problem in addressing such components stems from the numerous constraints, both in terms of computational power, since most sensors are equipped with low-speed 8 bit controllers, and low bandwidth. In this work we use as a case study a tire-pressure sensor and a rain-light sensor. The first communicates over radio-frequency while the second uses a low-speed in-vehicle bus, both interfaces having a very low bandwidth and reduced packet size of only 64 bits. Under these constraints we discuss the design of a cryptographic security protocol based on an existing lightweight block cipher in order to assure both security and privacy objectives.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115874882","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
扫码关注我们
求助内容：
应助结果提醒方式：