Pub Date : 2018-02-26DOI: 10.1109/NTMS.2018.8328698
Giulia De Santis, Abdelkader Lahmadi, J. François, O. Festor
Internet-wide scanners are heavily used for malicious activities. This work models, from the scanned system point of view, spatial and temporal movements of Network Scanning Activities (NSAs), related to the difference of successive scanned IP addresses and timestamps, respectively. Based on real logs of incoming IP packets collected from a darknet, Hidden Markov Models (HMMs) are used to assess what scanning tool is operating. The proposed methodology, using only one of the aforementioned features of the scanning tool, is able to fingerprint what network scanner originated the perceived darknet traffic.
{"title":"Internet-Wide Scanners Classification using Gaussian Mixture and Hidden Markov Models","authors":"Giulia De Santis, Abdelkader Lahmadi, J. François, O. Festor","doi":"10.1109/NTMS.2018.8328698","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328698","url":null,"abstract":"Internet-wide scanners are heavily used for malicious activities. This work models, from the scanned system point of view, spatial and temporal movements of Network Scanning Activities (NSAs), related to the difference of successive scanned IP addresses and timestamps, respectively. Based on real logs of incoming IP packets collected from a darknet, Hidden Markov Models (HMMs) are used to assess what scanning tool is operating. The proposed methodology, using only one of the aforementioned features of the scanning tool, is able to fingerprint what network scanner originated the perceived darknet traffic.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418555","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 : 2018-02-26DOI: 10.1109/NTMS.2018.8328693
Cyrielle Feron, Vianney Lapôtre, Loïc Lagadec
When evaluating Homomorphic Encryption (HE) schemes, only one set of input parameters is usually considered. Evaluation reports HE scheme time execution and memory consumption since these are the main challenges of HE. The original version of PAnTHErS enables to evaluate HE schemes without executing the scheme, hence with a very low processing time (< 10 sec). Results are provided in terms of computational complexity and memory cost. This allows to evaluate a scheme for numerous sets of input parameters. In this paper, PAnTHErS is improved by a calibration phase, and four HE schemes based on Ring-LWE are analyzed and compared using the proposed tool. Experimentation results show the approach allows analyses of HE scheme with an average of 6% error for a given implementation with a speedup up to 15× compared to actual scheme executions.
{"title":"Fast Evaluation of Homomorphic Encryption Schemes Based on Ring-LWE","authors":"Cyrielle Feron, Vianney Lapôtre, Loïc Lagadec","doi":"10.1109/NTMS.2018.8328693","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328693","url":null,"abstract":"When evaluating Homomorphic Encryption (HE) schemes, only one set of input parameters is usually considered. Evaluation reports HE scheme time execution and memory consumption since these are the main challenges of HE. The original version of PAnTHErS enables to evaluate HE schemes without executing the scheme, hence with a very low processing time (< 10 sec). Results are provided in terms of computational complexity and memory cost. This allows to evaluate a scheme for numerous sets of input parameters. In this paper, PAnTHErS is improved by a calibration phase, and four HE schemes based on Ring-LWE are analyzed and compared using the proposed tool. Experimentation results show the approach allows analyses of HE scheme with an average of 6% error for a given implementation with a speedup up to 15× compared to actual scheme executions.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124002790","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 : 2018-02-26DOI: 10.1109/NTMS.2018.8328701
E. D. Ayele, N. Meratnia, P. Havinga
In this paper, we introduce dual radio based IoT network architecture for wildlife monitoring system (WMS). This solution will facilitate an IoT devices to be deployed for sustainable wildlife monitoring applications. In addition we present MANER, a managed data dissemination scheme for WMS. In MANER, data forwarding is optimized with a replication function to control and prioritize data dissemination. In WMS scenario wild animals show a sparsely con- specific mobility, which often results in a sporadic wireless link among nodes. Unlike existing opportunistic algorithms, MANER optimally makes forwarding decisions by leveraging locally available information. Hence, the proposed algorithm adopts to dynamic network topology due to the inherent intermittent connectivity among mobile herd of animals. We evaluated the performance of MANER by considering standard and real-life mobility models. Experimental results indicated that MANER decreases the average latency by up-to 65%, when compared to benchmark opportunistic algorithms. In addition MANER readily increased the network delivery ratio for various data traffic rates.
{"title":"MANER: Managed Data Dissemination Scheme for LoRa IoT Enabled Wildlife Monitoring System (WMS)","authors":"E. D. Ayele, N. Meratnia, P. Havinga","doi":"10.1109/NTMS.2018.8328701","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328701","url":null,"abstract":"In this paper, we introduce dual radio based IoT network architecture for wildlife monitoring system (WMS). This solution will facilitate an IoT devices to be deployed for sustainable wildlife monitoring applications. In addition we present MANER, a managed data dissemination scheme for WMS. In MANER, data forwarding is optimized with a replication function to control and prioritize data dissemination. In WMS scenario wild animals show a sparsely con- specific mobility, which often results in a sporadic wireless link among nodes. Unlike existing opportunistic algorithms, MANER optimally makes forwarding decisions by leveraging locally available information. Hence, the proposed algorithm adopts to dynamic network topology due to the inherent intermittent connectivity among mobile herd of animals. We evaluated the performance of MANER by considering standard and real-life mobility models. Experimental results indicated that MANER decreases the average latency by up-to 65%, when compared to benchmark opportunistic algorithms. In addition MANER readily increased the network delivery ratio for various data traffic rates.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"43 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132639811","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328689
Guangyu Li, L. Boukhatem, Lin Zhao, Jinsong Wu
In order to alleviate power overloads of electric grid systems and decrease cost of corresponding infrastructure deployments, a direct vehicle-to-vehicle (V2V) energy-exchange strategy for moving electric vehicles (EVs) has become an emerging research. The main challenges involving the direct V2V charging scheme are 1) to design an effective and economical communication framework for real-time charging information transmissions, and 2) to minimize charging cost and improve charging efficiency. In this paper, we propose an efficient V2V charging strategy for mobile EVs to cope with the above problems. In particular, we first design a VANETs-based (Vehicular Ad-Hoc Networks) communication framework to enable data transmissions between the parking service center(PSC) and mobile EVs in a real-time manner. Then, we propose a globally optimal V2V charging scheme on the basis of the deduced models of travel energy cost and charging pleasure degree. The experiment results implemented in realistic simulation scenarios are presented to indicate that our proposed V2V charging strategy outperforms the benchmark algorithm.
{"title":"Direct Vehicle-to-Vehicle Charging Strategy in Vehicular Ad-Hoc Networks","authors":"Guangyu Li, L. Boukhatem, Lin Zhao, Jinsong Wu","doi":"10.1109/NTMS.2018.8328689","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328689","url":null,"abstract":"In order to alleviate power overloads of electric grid systems and decrease cost of corresponding infrastructure deployments, a direct vehicle-to-vehicle (V2V) energy-exchange strategy for moving electric vehicles (EVs) has become an emerging research. The main challenges involving the direct V2V charging scheme are 1) to design an effective and economical communication framework for real-time charging information transmissions, and 2) to minimize charging cost and improve charging efficiency. In this paper, we propose an efficient V2V charging strategy for mobile EVs to cope with the above problems. In particular, we first design a VANETs-based (Vehicular Ad-Hoc Networks) communication framework to enable data transmissions between the parking service center(PSC) and mobile EVs in a real-time manner. Then, we propose a globally optimal V2V charging scheme on the basis of the deduced models of travel energy cost and charging pleasure degree. The experiment results implemented in realistic simulation scenarios are presented to indicate that our proposed V2V charging strategy outperforms the benchmark algorithm.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125358341","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328692
A. Brokalakis, I. Chondroulis, I. Papaefstathiou
In typical Wireless Sensor Network (WSN) applications, the sensor nodes deployed are constrained both in computational and energy resources. For this reason, simple communication protocols are usually employed along with shortrange multi-hop topologies. In this paper, we challenge this notion and propose a structure that employs more robust(and naturally more complex) forward-error correction schemes in multi-hop extended star topologies. We demonstrate using simulation and real-world data based on popular WSN platforms that this approach can actually reduce the overall energy consumption of the nodes by significant margins (from 40 to 70%) compared to traditional WSN schemes that do not support sophisticated communication mechanisms and it is feasible to implement it economically without relying on expensive hardware.
{"title":"Extending the Forward Error Correction Paradigm for Multi-Hop Wireless Sensor Networks","authors":"A. Brokalakis, I. Chondroulis, I. Papaefstathiou","doi":"10.1109/NTMS.2018.8328692","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328692","url":null,"abstract":"In typical Wireless Sensor Network (WSN) applications, the sensor nodes deployed are constrained both in computational and energy resources. For this reason, simple communication protocols are usually employed along with shortrange multi-hop topologies. In this paper, we challenge this notion and propose a structure that employs more robust(and naturally more complex) forward-error correction schemes in multi-hop extended star topologies. We demonstrate using simulation and real-world data based on popular WSN platforms that this approach can actually reduce the overall energy consumption of the nodes by significant margins (from 40 to 70%) compared to traditional WSN schemes that do not support sophisticated communication mechanisms and it is feasible to implement it economically without relying on expensive hardware.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114207440","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328680
E. Pencheva, I. Atanasov
Multi-access Edge Computing (MEC) converges telecommunications and cloud technology at the Radio Access Network (RAN). Taking the advantages of telecom cloud MEC allows rapid content processing at the very edge of the mobile network, delivering real-time services. Third party applications located in RAN may access virtualized network functions through RESTful Application Programming Interfaces (APIs). Radio Network Information APIs provide radio network related information to mobile edge applications and to mobile edge platforms. The paper proposes an extension of Radio Network Information APIs for access to information about terminal activity in a cell. The proposed APIs are described by information flows, data models and actual API definition. Aspects related to mobile edge application that use the proposed extension are discussed.
{"title":"An Extension of Radio Network Information Interfaces for Terminal Activity in a Cell","authors":"E. Pencheva, I. Atanasov","doi":"10.1109/NTMS.2018.8328680","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328680","url":null,"abstract":"Multi-access Edge Computing (MEC) converges telecommunications and cloud technology at the Radio Access Network (RAN). Taking the advantages of telecom cloud MEC allows rapid content processing at the very edge of the mobile network, delivering real-time services. Third party applications located in RAN may access virtualized network functions through RESTful Application Programming Interfaces (APIs). Radio Network Information APIs provide radio network related information to mobile edge applications and to mobile edge platforms. The paper proposes an extension of Radio Network Information APIs for access to information about terminal activity in a cell. The proposed APIs are described by information flows, data models and actual API definition. Aspects related to mobile edge application that use the proposed extension are discussed.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502720","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328685
F. A. Cruz-Pérez, Jose Serrano-Chavez, S. L. Castellanos-Lopez, G. Hernández-Valdez
In this paper, the impact of the service time probability distribution of both primary and secondary users on the performance of Cognitive Radio Networks (CRNs) is investigated. In particular, negative exponential, log-normal, and hyper-exponential probability distributions are considered for the service time of primary and/or secondary users. The performance metrics of the considered CRNs are obtained for both different ratios of time-scales between PUs and SUs and different combinations of values of the coefficient of variation of the service times. Furthermore, two evaluation scenarios have been considered: with and without resources for exclusive use of SUs. Numerical results show that system performance is more sensitive to the service time distribution of SUs than to that of PUs. Additionally, it is observed that to achieve the quasi-stationary regime, greater difference of the time scales at which events of PUs and SUs occur is required as the value of the CoV of service times increases.
{"title":"Comparison of the Performance Sensitivity to the Primary and Secondary Service Time Distribution in Cognitive Radio Networks","authors":"F. A. Cruz-Pérez, Jose Serrano-Chavez, S. L. Castellanos-Lopez, G. Hernández-Valdez","doi":"10.1109/NTMS.2018.8328685","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328685","url":null,"abstract":"In this paper, the impact of the service time probability distribution of both primary and secondary users on the performance of Cognitive Radio Networks (CRNs) is investigated. In particular, negative exponential, log-normal, and hyper-exponential probability distributions are considered for the service time of primary and/or secondary users. The performance metrics of the considered CRNs are obtained for both different ratios of time-scales between PUs and SUs and different combinations of values of the coefficient of variation of the service times. Furthermore, two evaluation scenarios have been considered: with and without resources for exclusive use of SUs. Numerical results show that system performance is more sensitive to the service time distribution of SUs than to that of PUs. Additionally, it is observed that to achieve the quasi-stationary regime, greater difference of the time scales at which events of PUs and SUs occur is required as the value of the CoV of service times increases.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"29 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979084","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328703
G. Baldini, Raimondo Giuliani, C. Gentile, G. Steri
Radio Frequency (RF) wireless devices can be identified by the RF emissions they produce when transmitting. The reason is that such emissions contain intrinsic features originating from the physical structure and the materials used to build the wireless device itself. These features are usually called RF fingerprints in the literature, and they can be used to uniquely identify a wireless device through a process called radiometric identification. RF fingerprinting can support multifactor authentication of wireless devices in security applications. One of the main unresolved issues in radiometric identification is the lack of portability of the RF fingerprints. The RF emissions are collected by a RF receiver converting them into digital format, from which the fingerprints are extracted. The lack of portability issue is due to the fact that each RF receiver introduces a bias, which degrades the RF fingerprints of the emitting device. As a consequence, RF emissions of the same wireless device collected by different RF receivers will generate different fingerprints for the same wireless device. This issue strongly limits the applicability of RF fingerprinting for security purposes, since we are not afforded to use different RF receivers to perform identification, and the fingerprints are not portable from one receiver to another. In this paper, we propose a novel approach that helps mitigating this portability issue. Our approach is based on the removal of the bias introduced by RF receivers in the frequency domain through the use of one golden reference. The golden reference is used to generate a calibration function, which is then applied to the RF emissions collected by different RF receivers from any other wireless device. The specific approach is empirically validated against a set of ten Internet of Things (IoT) wireless devices (plus the golden reference), and three RF receivers. Our experimental evidence demostrates that our method is able to alleviate the portability issue at the cost of a minor degradation in identification accuracy.
{"title":"Measures to Address the Lack of Portability of the RF Fingerprints for Radiometric Identification","authors":"G. Baldini, Raimondo Giuliani, C. Gentile, G. Steri","doi":"10.1109/NTMS.2018.8328703","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328703","url":null,"abstract":"Radio Frequency (RF) wireless devices can be identified by the RF emissions they produce when transmitting. The reason is that such emissions contain intrinsic features originating from the physical structure and the materials used to build the wireless device itself. These features are usually called RF fingerprints in the literature, and they can be used to uniquely identify a wireless device through a process called radiometric identification. RF fingerprinting can support multifactor authentication of wireless devices in security applications. One of the main unresolved issues in radiometric identification is the lack of portability of the RF fingerprints. The RF emissions are collected by a RF receiver converting them into digital format, from which the fingerprints are extracted. The lack of portability issue is due to the fact that each RF receiver introduces a bias, which degrades the RF fingerprints of the emitting device. As a consequence, RF emissions of the same wireless device collected by different RF receivers will generate different fingerprints for the same wireless device. This issue strongly limits the applicability of RF fingerprinting for security purposes, since we are not afforded to use different RF receivers to perform identification, and the fingerprints are not portable from one receiver to another. In this paper, we propose a novel approach that helps mitigating this portability issue. Our approach is based on the removal of the bias introduced by RF receivers in the frequency domain through the use of one golden reference. The golden reference is used to generate a calibration function, which is then applied to the RF emissions collected by different RF receivers from any other wireless device. The specific approach is empirically validated against a set of ten Internet of Things (IoT) wireless devices (plus the golden reference), and three RF receivers. Our experimental evidence demostrates that our method is able to alleviate the portability issue at the cost of a minor degradation in identification accuracy.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122012880","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328742
Beltran Borja Fiz Pontiveros, Robert Norvill, R. State
In this work we propose a compression method for smart contracts deployed in the Ethereum blockchain. By taking advantage of the repetition of sections of bytecode among multiple smart contracts previously deployed in the Ethereum blockchain we propose a new pseudo opcode that acts as a pointer that will allow smart contracts to reuse previously deployed code. We show that our proposed algorithm achieves space savings of up to 75% in a dataset of deployed Ethereum smart contracts bytecode, on par with other state of the art compression algorithms while remaining compatible with other methods currently in use for space reduction.
{"title":"Recycling Smart Contracts: Compression of the Ethereum Blockchain","authors":"Beltran Borja Fiz Pontiveros, Robert Norvill, R. State","doi":"10.1109/NTMS.2018.8328742","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328742","url":null,"abstract":"In this work we propose a compression method for smart contracts deployed in the Ethereum blockchain. By taking advantage of the repetition of sections of bytecode among multiple smart contracts previously deployed in the Ethereum blockchain we propose a new pseudo opcode that acts as a pointer that will allow smart contracts to reuse previously deployed code. We show that our proposed algorithm achieves space savings of up to 75% in a dataset of deployed Ethereum smart contracts bytecode, on par with other state of the art compression algorithms while remaining compatible with other methods currently in use for space reduction.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470744","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328699
D. Alshamaa, F. Mourad, P. Honeine
Indoor localization has become an important issue for wireless sensor networks. This paper presents a zoning-based localization technique that works efficiently in indoor environments. The targeted area is composed of several zones, the objective being to determine the zone of the sensor using an observation model. The observation model is constructed based on fingerprints collected as WiFi signals strengths received from surrounding Access Points. The method creates a belief functions framework that uses all available information to assign evidence to each zone. A hierarchical clustering technique is then applied to create a two-level hierarchy composed of clusters and of original zones in each cluster. At each level of the hierarchy, an Access Point selection approach is proposed to choose the best subset of Access Points in terms of discriminative capacity and redundancy. Real experiments demonstrate the effectiveness of this approach and its competence compared to state-of-the-art methods.
{"title":"Localization of Sensors in Indoor Wireless Networks: An Observation Model Using WiFi RSS","authors":"D. Alshamaa, F. Mourad, P. Honeine","doi":"10.1109/NTMS.2018.8328699","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328699","url":null,"abstract":"Indoor localization has become an important issue for wireless sensor networks. This paper presents a zoning-based localization technique that works efficiently in indoor environments. The targeted area is composed of several zones, the objective being to determine the zone of the sensor using an observation model. The observation model is constructed based on fingerprints collected as WiFi signals strengths received from surrounding Access Points. The method creates a belief functions framework that uses all available information to assign evidence to each zone. A hierarchical clustering technique is then applied to create a two-level hierarchy composed of clusters and of original zones in each cluster. At each level of the hierarchy, an Access Point selection approach is proposed to choose the best subset of Access Points in terms of discriminative capacity and redundancy. Real experiments demonstrate the effectiveness of this approach and its competence compared to state-of-the-art methods.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129132993","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
扫码关注我们
求助内容：
应助结果提醒方式：