Pub Date : 2017-09-04DOI: 10.1109/ISCC.2017.8024625
A. Mavromatis, Georgios Z. Papadopoulos, Xenofon Fafoutis, A. Goulianos, G. Oikonomou, P. Chatzimisios, T. Tryfonas
Advance clustering techniques have been widely used in Wireless Sensor Networks (WSNs) since they can potentially reduce latency, improve scheduling, decrease end-to-end delay and optimise energy consumption within a dense network topology. In this paper, we present a novel clustering algorithm for high density IEEE 802.15.4-2015 Time-Slotted Channel Hopping (TSCH). In particular, the proposed methodology merges a variety of solutions into an integrated clustering design. Assuming an homogeneous network distribution, the proposed configuration deploys a hierarchical down-top approach of equally numbered sub-groups, in which the formation of the separate sub-groups is adapted to the network density and the node selection metric is based on the link quality indicator. The presented algorithm is implemented in Contiki Operating System (OS) and several test vectors have been designed in order to evaluate the performance of the proposed algorithm in a COOJA simulation environment. Performance results demonstrate the capability of the clustering structure since compared to the default scheme it significantly improves the energy efficiency up to 35%, packet drops more than 40% as well the packet retransmission rate. Last but not least, the outcome of this study indicates a major increase in the network lifetime, i.e., up to 50%.
{"title":"Link quality and path based clustering in IEEE 802.15.4-2015 TSCH networks","authors":"A. Mavromatis, Georgios Z. Papadopoulos, Xenofon Fafoutis, A. Goulianos, G. Oikonomou, P. Chatzimisios, T. Tryfonas","doi":"10.1109/ISCC.2017.8024625","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024625","url":null,"abstract":"Advance clustering techniques have been widely used in Wireless Sensor Networks (WSNs) since they can potentially reduce latency, improve scheduling, decrease end-to-end delay and optimise energy consumption within a dense network topology. In this paper, we present a novel clustering algorithm for high density IEEE 802.15.4-2015 Time-Slotted Channel Hopping (TSCH). In particular, the proposed methodology merges a variety of solutions into an integrated clustering design. Assuming an homogeneous network distribution, the proposed configuration deploys a hierarchical down-top approach of equally numbered sub-groups, in which the formation of the separate sub-groups is adapted to the network density and the node selection metric is based on the link quality indicator. The presented algorithm is implemented in Contiki Operating System (OS) and several test vectors have been designed in order to evaluate the performance of the proposed algorithm in a COOJA simulation environment. Performance results demonstrate the capability of the clustering structure since compared to the default scheme it significantly improves the energy efficiency up to 35%, packet drops more than 40% as well the packet retransmission rate. Last but not least, the outcome of this study indicates a major increase in the network lifetime, i.e., up to 50%.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679422","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 : 2017-09-04DOI: 10.1109/ISCC.2017.8024536
Saemundur O. Haraldsson, Ragnheidur D. Brynjolfsdottir, J. Woodward, K. Siggeirsdottir, V. Gudnason
With the expanding load on healthcare and consequent strain on budget, the demand for tools to increase efficiency in treatments is rising. The use of prediction models throughout the treatment to identify risk factors might be a solution. In this paper we present a novel implementation of a prediction tool and the first use of a dynamic predictor in vocational rehabilitation practice. The tool is periodically updated and improved with Genetic Improvement of software. The predictor has been in use for 10 months and is evaluated on predictions made during that time by comparing them with actual treatment outcome. The results show that the predictions have been consistently accurate throughout the patients' treatment. After approximately 3 week learning phase, the predictor classified patients with 100% accuracy and precision on previously unseen data. The predictor is currently being successfully used in a complex live system where specialists have used it to make informed decisions.
{"title":"The use of predictive models in dynamic treatment planning","authors":"Saemundur O. Haraldsson, Ragnheidur D. Brynjolfsdottir, J. Woodward, K. Siggeirsdottir, V. Gudnason","doi":"10.1109/ISCC.2017.8024536","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024536","url":null,"abstract":"With the expanding load on healthcare and consequent strain on budget, the demand for tools to increase efficiency in treatments is rising. The use of prediction models throughout the treatment to identify risk factors might be a solution. In this paper we present a novel implementation of a prediction tool and the first use of a dynamic predictor in vocational rehabilitation practice. The tool is periodically updated and improved with Genetic Improvement of software. The predictor has been in use for 10 months and is evaluated on predictions made during that time by comparing them with actual treatment outcome. The results show that the predictions have been consistently accurate throughout the patients' treatment. After approximately 3 week learning phase, the predictor classified patients with 100% accuracy and precision on previously unseen data. The predictor is currently being successfully used in a complex live system where specialists have used it to make informed decisions.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129473129","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 : 2017-09-04DOI: 10.1109/ISCC.2017.8024701
Kostas Kolomvatsos, C. Anagnostopoulos, Angelos K. Marnerides, Q. Ni, S. Hadjiefthymiades, D. Pezaros
Software Defined Networking (SDN) is the key technology for combining networking and Cloud solutions to provide novel applications. SDN offers a number of advantages as the existing resources can be virtualized and orchestrated to provide new services to the end users. Such a technology should be accompanied by powerful mechanisms that ensure the end-to-end quality of service at high levels, thus, enabling support for complex applications that satisfy end users needs. In this paper, we propose an intelligent mechanism that agglomerates the benefits of SDNs with real-time “Big Data” forecasting analytics. The proposed mechanism, as part of the SDN controller, supports predictive intelligence by monitoring a set of network performance parameters, forecasting their future values, and deriving indications on potential service quality violations. By treating the performance measurements as time-series, our mechanism employs a novel ensemble forecasting methodology to estimate their future values. Such predictions are fed to a Type-2 Fuzzy Logic system to deliver, in real-time, decisions related to service quality violations. Such decisions proactively assist the SDN controller for providing the best possible orchestration of the virtualized resources. We evaluate the proposed mechanism w.r.t. precision and recall metrics over synthetic data.
{"title":"Uncertainty-driven ensemble forecasting of QoS in Software Defined Networks","authors":"Kostas Kolomvatsos, C. Anagnostopoulos, Angelos K. Marnerides, Q. Ni, S. Hadjiefthymiades, D. Pezaros","doi":"10.1109/ISCC.2017.8024701","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024701","url":null,"abstract":"Software Defined Networking (SDN) is the key technology for combining networking and Cloud solutions to provide novel applications. SDN offers a number of advantages as the existing resources can be virtualized and orchestrated to provide new services to the end users. Such a technology should be accompanied by powerful mechanisms that ensure the end-to-end quality of service at high levels, thus, enabling support for complex applications that satisfy end users needs. In this paper, we propose an intelligent mechanism that agglomerates the benefits of SDNs with real-time “Big Data” forecasting analytics. The proposed mechanism, as part of the SDN controller, supports predictive intelligence by monitoring a set of network performance parameters, forecasting their future values, and deriving indications on potential service quality violations. By treating the performance measurements as time-series, our mechanism employs a novel ensemble forecasting methodology to estimate their future values. Such predictions are fed to a Type-2 Fuzzy Logic system to deliver, in real-time, decisions related to service quality violations. Such decisions proactively assist the SDN controller for providing the best possible orchestration of the virtualized resources. We evaluate the proposed mechanism w.r.t. precision and recall metrics over synthetic data.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123519487","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 : 2017-09-04DOI: 10.1109/ISCC.2017.8024604
Konstantinos Fysarakis, N. Petroulakis, Andreas Roos, Khawar Abbasi, P. Vizarreta, George P. Petropoulos, Ermin Sakic, G. Spanoudakis, Ioannis G. Askoxylakis
The innovative application of 5G core technologies, namely Software Defined Networking (SDN) and Network Function Virtualization (NFV), can help reduce capital and operational expenditures in industrial networks. Nevertheless, SDN expands the attack surface of the communication infrastructure, thus necessitating the introduction of additional security mechanisms. A wind park is a good example of an industrial application relying on a network with strict performance, security, and reliability requirements, and was chosen as a representative example of industrial systems. This work highlights the benefit of leveraging the flexibility of SDN/NFV-enabled networks to deploy enhanced, reactive security mechanisms for the protection of the industrial network, via the use of Service Function Chaining. Moreover, a proof of concept implementation of the reactive security framework for an industrial-grade wind park network is presented. The framework is equipped with SDN and Supervisory Control and Data Acquisition (SCADA) honeypots, modelled on (and deployable to) an actual, operating wind park, allowing continuous monitoring of the industrial network and detailed analysis of potential attacks, thus isolating attackers and enabling the assessment of their level of sophistication.
{"title":"A Reactive Security Framework for operational wind parks using Service Function Chaining","authors":"Konstantinos Fysarakis, N. Petroulakis, Andreas Roos, Khawar Abbasi, P. Vizarreta, George P. Petropoulos, Ermin Sakic, G. Spanoudakis, Ioannis G. Askoxylakis","doi":"10.1109/ISCC.2017.8024604","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024604","url":null,"abstract":"The innovative application of 5G core technologies, namely Software Defined Networking (SDN) and Network Function Virtualization (NFV), can help reduce capital and operational expenditures in industrial networks. Nevertheless, SDN expands the attack surface of the communication infrastructure, thus necessitating the introduction of additional security mechanisms. A wind park is a good example of an industrial application relying on a network with strict performance, security, and reliability requirements, and was chosen as a representative example of industrial systems. This work highlights the benefit of leveraging the flexibility of SDN/NFV-enabled networks to deploy enhanced, reactive security mechanisms for the protection of the industrial network, via the use of Service Function Chaining. Moreover, a proof of concept implementation of the reactive security framework for an industrial-grade wind park network is presented. The framework is equipped with SDN and Supervisory Control and Data Acquisition (SCADA) honeypots, modelled on (and deployable to) an actual, operating wind park, allowing continuous monitoring of the industrial network and detailed analysis of potential attacks, thus isolating attackers and enabling the assessment of their level of sophistication.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527765","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 : 2017-09-01DOI: 10.1109/ISCC.2017.8024544
A. Bokov, Laura S. Manuel, Alfredo Tirado-Ramos, Jon A. Gelfond, S. Pletcher
In designing scientific experiments, power analysis is too often given a superficial treatment— choice of sample size is often made based on idealized distributions and simplistic tests that do not reflect the real-world constraints under which the actual data will be collected. We have developed a general Monte Carlo framework for two-group comparisons which samples points from a two-dimensional parameter space and at each point generates simulated datasets which are compared to simulated datasets for a “control group” at a fixed point in the parameter space. Rather than uniformly sampling this parameter space, our algorithm rapidly converges on a contour corresponding to the smallest detectable difference for the sample size of interest.
{"title":"Biologically relevant simulations for validating risk models under small-sample conditions","authors":"A. Bokov, Laura S. Manuel, Alfredo Tirado-Ramos, Jon A. Gelfond, S. Pletcher","doi":"10.1109/ISCC.2017.8024544","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024544","url":null,"abstract":"In designing scientific experiments, power analysis is too often given a superficial treatment— choice of sample size is often made based on idealized distributions and simplistic tests that do not reflect the real-world constraints under which the actual data will be collected. We have developed a general Monte Carlo framework for two-group comparisons which samples points from a two-dimensional parameter space and at each point generates simulated datasets which are compared to simulated datasets for a “control group” at a fixed point in the parameter space. Rather than uniformly sampling this parameter space, our algorithm rapidly converges on a contour corresponding to the smallest detectable difference for the sample size of interest.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130349622","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 : 2017-09-01DOI: 10.1109/ISCC.2017.8024697
Mohamed S. Abdalzaher, Karim G. Seddik, O. Muta
Wireless Sensor Networks (WSNs) security plays an intrinsic role to guarantee efficient data transmission, stable network topologies, and robust routing algorithms. In this paper, we propose a modified Stackelberg game of a previous work for high assurance of data trustworthiness in a Power Grid Network (PGN). The proposed approach is presented to mitigate a more severe attack scenario compared to that considered in the previous work; this attack scenario frequently manipulates sets of the deployed nodes in the PGN, which cannot be treated using the previously proposed approach. Our proposed scheme reduces the required number of nodes to be protected to achieve the desired data trustworthiness. Simulation results prove efficient detection for corrupted transmitted data based on limited number of nodes as compared to the previously proposed approach.
{"title":"An effective Stackelberg game for high-assurance of data trustworthiness in WSNs","authors":"Mohamed S. Abdalzaher, Karim G. Seddik, O. Muta","doi":"10.1109/ISCC.2017.8024697","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024697","url":null,"abstract":"Wireless Sensor Networks (WSNs) security plays an intrinsic role to guarantee efficient data transmission, stable network topologies, and robust routing algorithms. In this paper, we propose a modified Stackelberg game of a previous work for high assurance of data trustworthiness in a Power Grid Network (PGN). The proposed approach is presented to mitigate a more severe attack scenario compared to that considered in the previous work; this attack scenario frequently manipulates sets of the deployed nodes in the PGN, which cannot be treated using the previously proposed approach. Our proposed scheme reduces the required number of nodes to be protected to achieve the desired data trustworthiness. Simulation results prove efficient detection for corrupted transmitted data based on limited number of nodes as compared to the previously proposed approach.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130011769","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 : 2017-09-01DOI: 10.1109/ISCC.2017.8024586
Mohamed S. Abdalzaher, Karim G. Seddik, O. Muta
Due to the fast boom of security threats in wireless sensor networks (WSNs) sensitive applications, we propose a game-theoretic protection approach for sensor nodes in a clustered WSN based on a repeated game. The proposed game model is developed for detecting malicious sensor nodes that drop the high priority packets (HPPs) aiming at maximizing the high priority data trustworthiness (HPT). Simulation results indicate the improved HPT of the proposed protection model which attains the Pareto optimal HPT as compared to a non-cooperative defense mechanism.
{"title":"Using repeated game for maximizing high priority data trustworthiness in Wireless Sensor Networks","authors":"Mohamed S. Abdalzaher, Karim G. Seddik, O. Muta","doi":"10.1109/ISCC.2017.8024586","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024586","url":null,"abstract":"Due to the fast boom of security threats in wireless sensor networks (WSNs) sensitive applications, we propose a game-theoretic protection approach for sensor nodes in a clustered WSN based on a repeated game. The proposed game model is developed for detecting malicious sensor nodes that drop the high priority packets (HPPs) aiming at maximizing the high priority data trustworthiness (HPT). Simulation results indicate the improved HPT of the proposed protection model which attains the Pareto optimal HPT as compared to a non-cooperative defense mechanism.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093353","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 : 2017-07-04DOI: 10.1109/ISCC.2017.8024591
Pradeep Bangera, Syed Hasan, Sergey Gorinsky
Faced with the unrelenting traffic growth and rising costs, access ISPs (Internet Service Providers) realize that their traditional revenue model of flat subscription fees is unsustainable. Regulatory concerns, e.g., about content-specific charging, constrain the ISPs' search for new revenue sources. This paper analyzes a revenue model where an access ISP acts as a publisher of ads to users who explicitly opt for an ad-sponsored access plan of the ISP. First, we conduct a survey showing a substantial interest of users in ad-sponsored Internet access. Then, we mathematically characterize the advertising revenue model and asses its economic feasibility based on real data from two access ISPs and an ad publisher. While the ad revenues are tangible, they do not completely cover the costs of the access ISPs. Even in relative terms, a larger access ISP benefits more from the advertising, with the ad revenues covering up to 50% of the ISP's capital expenditure. Complementing the subscription fees, the access ISPs can leverage the ad revenues to meaningfully incentivize the users with better Internet connectivity, such as 6–9 Mbps in extra data rates or 12–20 GB in extra data caps for the two considered ISPs.
{"title":"An advertising revenue model for access ISPs","authors":"Pradeep Bangera, Syed Hasan, Sergey Gorinsky","doi":"10.1109/ISCC.2017.8024591","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024591","url":null,"abstract":"Faced with the unrelenting traffic growth and rising costs, access ISPs (Internet Service Providers) realize that their traditional revenue model of flat subscription fees is unsustainable. Regulatory concerns, e.g., about content-specific charging, constrain the ISPs' search for new revenue sources. This paper analyzes a revenue model where an access ISP acts as a publisher of ads to users who explicitly opt for an ad-sponsored access plan of the ISP. First, we conduct a survey showing a substantial interest of users in ad-sponsored Internet access. Then, we mathematically characterize the advertising revenue model and asses its economic feasibility based on real data from two access ISPs and an ad publisher. While the ad revenues are tangible, they do not completely cover the costs of the access ISPs. Even in relative terms, a larger access ISP benefits more from the advertising, with the ad revenues covering up to 50% of the ISP's capital expenditure. Complementing the subscription fees, the access ISPs can leverage the ad revenues to meaningfully incentivize the users with better Internet connectivity, such as 6–9 Mbps in extra data rates or 12–20 GB in extra data caps for the two considered ISPs.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947669","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 : 2017-07-03DOI: 10.1109/ISCC.2017.8024513
C. Lubamba, A. Bagula
The HL7 standard was initially designed to enable interoperability of healthcare information within large hospitals. HL7's focus has recently been extended to regional healthcare cloud infrastructures but not yet reached the lightweight fog infrastructures emerging from niche healthcare areas such as body area networks (BANs) and the massive flow of personal medical records resulting from off-the-shelf e-health devices and networks. This paper addresses the issue of interoperability between fog and cloud computing platforms by i) proposing a framework for a standardized exchange of information between healthcare entities ii) designing and implementing a software tool to be integrated into medical data dissemination protocols to ensure interoperability and iii) evaluating the impact of the software tool on the transport of data when exchanging healthcare information using “in-band” and “out-band” transport over the IEEE802.15.4/ZigBee and WiFi protocols. Our results reveal that, for the lightweight devices used by fog infrastructures, “out-band” transport over WiFi with edge data translation into HL7 records is a better option than “in-band” transport.
{"title":"Cyber-healthcare cloud computing interoperability using the HL7-CDA standard","authors":"C. Lubamba, A. Bagula","doi":"10.1109/ISCC.2017.8024513","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024513","url":null,"abstract":"The HL7 standard was initially designed to enable interoperability of healthcare information within large hospitals. HL7's focus has recently been extended to regional healthcare cloud infrastructures but not yet reached the lightweight fog infrastructures emerging from niche healthcare areas such as body area networks (BANs) and the massive flow of personal medical records resulting from off-the-shelf e-health devices and networks. This paper addresses the issue of interoperability between fog and cloud computing platforms by i) proposing a framework for a standardized exchange of information between healthcare entities ii) designing and implementing a software tool to be integrated into medical data dissemination protocols to ensure interoperability and iii) evaluating the impact of the software tool on the transport of data when exchanging healthcare information using “in-band” and “out-band” transport over the IEEE802.15.4/ZigBee and WiFi protocols. Our results reveal that, for the lightweight devices used by fog infrastructures, “out-band” transport over WiFi with edge data translation into HL7 records is a better option than “in-band” transport.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117045812","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 : 2017-07-03DOI: 10.1109/ISCC.2017.8024608
Giorgia V. Rossi, K. Leung
Vehicular ad-hoc networks (VANETs) that enable communication among vehicles have recently attracted significant interest from researchers, due to the range of practical applications they can facilitate, particularly related to road safety. Despite the stringent performance requirements for such applications, the IEEE 802.11p standard still uses the carrier sensing medium access/collision avoidance (CSMA/CA) protocol. The latter when used in broadcast fashion employs a randomly selected backoff period from a fixed contention window (CW) range, which can cause performance degradation as a result of vehicular density changes. Concerns regarding the robustness and adaptiveness of protocols to support time-critical applications have been raised, which motivate this work. This paper investigates how the maximum CW size can be optimised to enhance performance based on vehicular density. A stochastic model is developed to obtain the optimal maximum CW that can be integrated in an amended CSMA/CA protocol to maximise the single-hop throughput among adjacent vehicles. Simulations confirm our optimised protocol can greatly improve the channel throughput and transmission delay performance, when compared to the standardised CSMA/CA, to support safety application in VANETs.
{"title":"Optimised CSMA/CA protocol for safety messages in vehicular ad-hoc networks","authors":"Giorgia V. Rossi, K. Leung","doi":"10.1109/ISCC.2017.8024608","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024608","url":null,"abstract":"Vehicular ad-hoc networks (VANETs) that enable communication among vehicles have recently attracted significant interest from researchers, due to the range of practical applications they can facilitate, particularly related to road safety. Despite the stringent performance requirements for such applications, the IEEE 802.11p standard still uses the carrier sensing medium access/collision avoidance (CSMA/CA) protocol. The latter when used in broadcast fashion employs a randomly selected backoff period from a fixed contention window (CW) range, which can cause performance degradation as a result of vehicular density changes. Concerns regarding the robustness and adaptiveness of protocols to support time-critical applications have been raised, which motivate this work. This paper investigates how the maximum CW size can be optimised to enhance performance based on vehicular density. A stochastic model is developed to obtain the optimal maximum CW that can be integrated in an amended CSMA/CA protocol to maximise the single-hop throughput among adjacent vehicles. Simulations confirm our optimised protocol can greatly improve the channel throughput and transmission delay performance, when compared to the standardised CSMA/CA, to support safety application in VANETs.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124049231","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
扫码关注我们
求助内容：
应助结果提醒方式：