Because of the wide field of view (FOV) to monitor vessel movements, satellite-based automatic identification system (S-AIS) has been promoted in recent years. However, synchronization is a tough work in S-AIS receiver because of the large Doppler shift and serious signal collision resulting from simultaneous transmission in the FOV of a satellite. In this paper, we propose a pipelined synchronization approach with good performance and low complexity. It consists of three parts, i.e., packet detection, windowing and timing recovery, and frequency and timing offset estimation, which can be implemented in feedforward structure with low complexity. Simulation results show that the proposed synchronization approach has significant performance gain compared with existing algorithms and provides an acceptable estimation range to cope with large Doppler shift and message collision.
{"title":"A pipelined synchronization approach for satellite-based automatic identification system","authors":"Weitao Lan, Taosheng Zhang, M. Guo, Wei Huang, Lianghui Ding, Feng Yang, Liang Qian","doi":"10.1109/ICC.2016.7511270","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511270","url":null,"abstract":"Because of the wide field of view (FOV) to monitor vessel movements, satellite-based automatic identification system (S-AIS) has been promoted in recent years. However, synchronization is a tough work in S-AIS receiver because of the large Doppler shift and serious signal collision resulting from simultaneous transmission in the FOV of a satellite. In this paper, we propose a pipelined synchronization approach with good performance and low complexity. It consists of three parts, i.e., packet detection, windowing and timing recovery, and frequency and timing offset estimation, which can be implemented in feedforward structure with low complexity. Simulation results show that the proposed synchronization approach has significant performance gain compared with existing algorithms and provides an acceptable estimation range to cope with large Doppler shift and message collision.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133729507","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 : 2016-07-14DOI: 10.1109/ICC.2016.7511454
Mohammed Amine Togou, L. Khoukhi, A. Hafid
This paper uses two Markov chains to model IEEE 802.11p EDCA throughput over service channels. A 2-D Markov chain is constructed first to describe the backoff procedure of each access category and to infer its transmission probability. Then, a 1-D discrete Markov chain is used to describe the contention phase of an access category and to derive its collision probability. Both models consider the backoff counter freezing as well as the internal and external collisions. In addition, they both take into account the transmission opportunity (TXOP) parameter, unexploited by IEEE 802.11p, to enhance the performance of infotainment applications. Using both models, we derive an accurate model of the normalized throughput for each access category. Simulation results show that our model generates higher throughput for access categories with high priority compared to IEEE 802.11p standard.
{"title":"Throughput analysis of the IEEE802.11p EDCA considering transmission opportunity for non-safety applications","authors":"Mohammed Amine Togou, L. Khoukhi, A. Hafid","doi":"10.1109/ICC.2016.7511454","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511454","url":null,"abstract":"This paper uses two Markov chains to model IEEE 802.11p EDCA throughput over service channels. A 2-D Markov chain is constructed first to describe the backoff procedure of each access category and to infer its transmission probability. Then, a 1-D discrete Markov chain is used to describe the contention phase of an access category and to derive its collision probability. Both models consider the backoff counter freezing as well as the internal and external collisions. In addition, they both take into account the transmission opportunity (TXOP) parameter, unexploited by IEEE 802.11p, to enhance the performance of infotainment applications. Using both models, we derive an accurate model of the normalized throughput for each access category. Simulation results show that our model generates higher throughput for access categories with high priority compared to IEEE 802.11p standard.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116954470","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 : 2016-07-14DOI: 10.1109/ICC.2016.7511453
M. Soleymani, B. Maham, Farid Ashtiani
Frame aggregation (FA) mechanisms improve the throughput of WLANs. In this paper, the effect of the FA mechanism on the throughput of wireless local area networks (WLANs) has been investigated. To this end, we propose an analytical model in order to analyze an IEEE 802.11n network comprised of an access point (AP) and several conventional nodes (CNs), all in the coverage area of each other. With respect to the heavier download traffic compared to the upload one, in our scenario, only the AP uses an FA mechanism and the other nodes use the basic IEEE 802.11 standard. In our proposed analytical model, the maximum downlink (DL) throughput is derived. Regarding the asymmetry among nodes, our analytical model consists of two different queueing networks: one for the AP and the other one for CNs. We verify the accuracy of our analytical results by simulations, i.e., less than 5% mismatch between the analytical and simulation results. We show that there is a tradeoff between the DL saturation throughput and performance of CNs. In other words, the FA improves the AP saturation throughput at the cost of a little degradation of the performance for CNs.
{"title":"Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN","authors":"M. Soleymani, B. Maham, Farid Ashtiani","doi":"10.1109/ICC.2016.7511453","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511453","url":null,"abstract":"Frame aggregation (FA) mechanisms improve the throughput of WLANs. In this paper, the effect of the FA mechanism on the throughput of wireless local area networks (WLANs) has been investigated. To this end, we propose an analytical model in order to analyze an IEEE 802.11n network comprised of an access point (AP) and several conventional nodes (CNs), all in the coverage area of each other. With respect to the heavier download traffic compared to the upload one, in our scenario, only the AP uses an FA mechanism and the other nodes use the basic IEEE 802.11 standard. In our proposed analytical model, the maximum downlink (DL) throughput is derived. Regarding the asymmetry among nodes, our analytical model consists of two different queueing networks: one for the AP and the other one for CNs. We verify the accuracy of our analytical results by simulations, i.e., less than 5% mismatch between the analytical and simulation results. We show that there is a tradeoff between the DL saturation throughput and performance of CNs. In other words, the FA improves the AP saturation throughput at the cost of a little degradation of the performance for CNs.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414631","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510868
F. Al-turjman, Mehmet Karakoc, M. Günay, A. Noureldin
In this paper, we propose a new architecture to read the smart meters which are commonly distributed nowadays in smart cities. In this architecture, public transportation vehicles are utilized as Data Collectors (DCs) that reads these smart meters. Moreover, we target the path planning problem for these DCs given that a limited number of vehicles with a specific storage capacity are able to participate in collecting readings from these meters. We optimize the number of DCs while maintaining their minimum travelling distances and satisfied traffic constraints. We propose a Genetic-based Routing (GR) approach for more optimized solutions. Extensive simulation results are performed to confirm the effectiveness of the proposed approach in comparison to other heuristic approaches.
{"title":"Routing mobile data couriers in smart-cities","authors":"F. Al-turjman, Mehmet Karakoc, M. Günay, A. Noureldin","doi":"10.1109/ICC.2016.7510868","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510868","url":null,"abstract":"In this paper, we propose a new architecture to read the smart meters which are commonly distributed nowadays in smart cities. In this architecture, public transportation vehicles are utilized as Data Collectors (DCs) that reads these smart meters. Moreover, we target the path planning problem for these DCs given that a limited number of vehicles with a specific storage capacity are able to participate in collecting readings from these meters. We optimize the number of DCs while maintaining their minimum travelling distances and satisfied traffic constraints. We propose a Genetic-based Routing (GR) approach for more optimized solutions. Extensive simulation results are performed to confirm the effectiveness of the proposed approach in comparison to other heuristic approaches.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115651828","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511247
Chen Ma, Carlos Colman Meixner, M. Tornatore, Yongli Zhao, Jie Zhang, B. Mukherjee
In network virtualization, when a disaster hits a physical network infrastructure, it is likely to break multiple virtual network connections. So, after a disaster occurs, the network operator has to schedule multiple teams of repairmen to fix the failed components, by considering that these elements may be geographically dispersed. An effective schedule is very important as different schedules may result in very different amounts of time needed to restore a failure. In this study, we introduce the multiple traveling repairmen problem (MTRP) for post-disaster resilience, i.e., to reduce the impact of a disaster. Re-provisioning of failed virtual links is also considered. We first formally state the problem, where our objective is to find an optimal schedule for multiple teams of repairmen to restore the failed components in physical network, maximizing the traffic in restored virtual network and with minimum damage cost. Then, we propose a greedy (GR) and a simulated annealing (SA) algorithm, and we measure the damage caused by a disaster in terms of disconnected virtual networks (DVN), failed virtual links (FVL), and failed physical links (FPL). Numerical result shows that both proposed algorithms can make good schedules for multiple repairmen teams, and SA leads to significantly lower damage in terms of DVN, FVL, and FPL than GR.
{"title":"Multiple traveling repairmen problem with virtual networks for post-disaster resilience","authors":"Chen Ma, Carlos Colman Meixner, M. Tornatore, Yongli Zhao, Jie Zhang, B. Mukherjee","doi":"10.1109/ICC.2016.7511247","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511247","url":null,"abstract":"In network virtualization, when a disaster hits a physical network infrastructure, it is likely to break multiple virtual network connections. So, after a disaster occurs, the network operator has to schedule multiple teams of repairmen to fix the failed components, by considering that these elements may be geographically dispersed. An effective schedule is very important as different schedules may result in very different amounts of time needed to restore a failure. In this study, we introduce the multiple traveling repairmen problem (MTRP) for post-disaster resilience, i.e., to reduce the impact of a disaster. Re-provisioning of failed virtual links is also considered. We first formally state the problem, where our objective is to find an optimal schedule for multiple teams of repairmen to restore the failed components in physical network, maximizing the traffic in restored virtual network and with minimum damage cost. Then, we propose a greedy (GR) and a simulated annealing (SA) algorithm, and we measure the damage caused by a disaster in terms of disconnected virtual networks (DVN), failed virtual links (FVL), and failed physical links (FPL). Numerical result shows that both proposed algorithms can make good schedules for multiple repairmen teams, and SA leads to significantly lower damage in terms of DVN, FVL, and FPL than GR.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702916","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511260
Alessandro Biason, Andrea Dittadi, M. Zorzi
In satellite networks, the design of MAC schemes which achieve high performance is an important and widely studied problem. Random access is recognized as an appealing solution for these scenarios. In the literature so far, two main research lines have been followed: diversity slotted Aloha-like protocols and spread spectrum Aloha schemes. The goal of this work is to analyze the performance of these two paradigms and introduce a hybrid algorithm which combines both packet replicas and code division to further enhance the probability of successfully decoding a packet.
{"title":"Spreading and repetitions in satellite MAC protocols","authors":"Alessandro Biason, Andrea Dittadi, M. Zorzi","doi":"10.1109/ICC.2016.7511260","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511260","url":null,"abstract":"In satellite networks, the design of MAC schemes which achieve high performance is an important and widely studied problem. Random access is recognized as an appealing solution for these scenarios. In the literature so far, two main research lines have been followed: diversity slotted Aloha-like protocols and spread spectrum Aloha schemes. The goal of this work is to analyze the performance of these two paradigms and introduce a hybrid algorithm which combines both packet replicas and code division to further enhance the probability of successfully decoding a packet.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822552","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510905
M. Mhanna, P. Duhamel, P. Piantanida
The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.
{"title":"Quantization for distributed binary detection under secrecy constraints","authors":"M. Mhanna, P. Duhamel, P. Piantanida","doi":"10.1109/ICC.2016.7510905","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510905","url":null,"abstract":"The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974410","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511002
Roghayeh Joda, M. Zorzi
In this paper, decentralized heuristic access policies are designed for two secondary users (SUs) in an underlay cognitive radio network in which the PU employs Type-I Hybrid ARQ. Exploiting the redundancy in PU retransmissions, each SU receiver applies interference cancellation (IC) to remove a successfully decoded PU message in the subsequent PU retransmissions. There is no central control unit and we consider two different scenarios. In the first scenario, each SU transmitter only knows the PU message knowledge state of its corresponding SU receiver. In the second scenario, the SU transmitters are unaware of any PU message knowledge states at the SU receivers. We design access policies in both offline and online modes, where in an online mode each SU can learn from its own local information. Using heuristic approaches for the considered scenarios, decentralized access policies are proposed to maximize the average sum throughput of SUs under a PU throughput degradation constraint. The results also show that heuristic access policies using the online mode have a performance gain close to that obtained using the offline mode, while providing increased robustness and flexibility.
{"title":"Decentralized heuristic access policy design for two cognitive secondary users under a primary Type-I HARQ process","authors":"Roghayeh Joda, M. Zorzi","doi":"10.1109/ICC.2016.7511002","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511002","url":null,"abstract":"In this paper, decentralized heuristic access policies are designed for two secondary users (SUs) in an underlay cognitive radio network in which the PU employs Type-I Hybrid ARQ. Exploiting the redundancy in PU retransmissions, each SU receiver applies interference cancellation (IC) to remove a successfully decoded PU message in the subsequent PU retransmissions. There is no central control unit and we consider two different scenarios. In the first scenario, each SU transmitter only knows the PU message knowledge state of its corresponding SU receiver. In the second scenario, the SU transmitters are unaware of any PU message knowledge states at the SU receivers. We design access policies in both offline and online modes, where in an online mode each SU can learn from its own local information. Using heuristic approaches for the considered scenarios, decentralized access policies are proposed to maximize the average sum throughput of SUs under a PU throughput degradation constraint. The results also show that heuristic access policies using the online mode have a performance gain close to that obtained using the offline mode, while providing increased robustness and flexibility.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120981385","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511621
I. Bang, S. Kim, D. Sung
In this paper, we introduce the notions of a user-scaling function and a user-scaling exponent and multiuser diversity (UEMD) pair. Our notions for the UEMD pair could be utilized as a basic tool for analyzing user-scaling laws. We derive a secure user-scaling law in terms of SNR, the number of eavesdroppers, the number of distributed antennas in distributed antenna systems, and design parameter λ. Through analytical and numerical results, we characterize the effect of the number of distributed antennas on the user-scaling behavior in terms of achievable secrecy rate. Compared with the conventional results based on a single antenna system, our results indicate that installing a small number of distributed antennas could provide a significant performance gain in terms of the achievable secrecy rate.
{"title":"Secrecy multiuser diversity for distributed antenna systems from the perspective of user-scaling law","authors":"I. Bang, S. Kim, D. Sung","doi":"10.1109/ICC.2016.7511621","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511621","url":null,"abstract":"In this paper, we introduce the notions of a user-scaling function and a user-scaling exponent and multiuser diversity (UEMD) pair. Our notions for the UEMD pair could be utilized as a basic tool for analyzing user-scaling laws. We derive a secure user-scaling law in terms of SNR, the number of eavesdroppers, the number of distributed antennas in distributed antenna systems, and design parameter λ. Through analytical and numerical results, we characterize the effect of the number of distributed antennas on the user-scaling behavior in terms of achievable secrecy rate. Compared with the conventional results based on a single antenna system, our results indicate that installing a small number of distributed antennas could provide a significant performance gain in terms of the achievable secrecy rate.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072998","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511152
S. Yiu, M. Dashti, H. Claussen, F. Pérez-Cruz
Location fingerprinting (LF) is an attractive localization technique which relies on existing infrastructures. The major drawback of LF is the requirement of having an updated fingerprint database. Gaussian Process (GP) is a non-parametric modeling technique which can be used to model the received signal strength indicator (RSSI) and create the fingerprint database based on few training data. In this paper we use a parametric pathloss model for the GP mean and a flexible non-parametric covariance function, so we can get reliable estimates with low fingerprinting effort. In our experiment, we show that with 23 fingerprint locations we perform as well as traditional fingerprinting with over 230 fingerprinted locations for an office space of 2500m2.
{"title":"Locating user equipments and access points using RSSI fingerprints: A Gaussian process approach","authors":"S. Yiu, M. Dashti, H. Claussen, F. Pérez-Cruz","doi":"10.1109/ICC.2016.7511152","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511152","url":null,"abstract":"Location fingerprinting (LF) is an attractive localization technique which relies on existing infrastructures. The major drawback of LF is the requirement of having an updated fingerprint database. Gaussian Process (GP) is a non-parametric modeling technique which can be used to model the received signal strength indicator (RSSI) and create the fingerprint database based on few training data. In this paper we use a parametric pathloss model for the GP mean and a flexible non-parametric covariance function, so we can get reliable estimates with low fingerprinting effort. In our experiment, we show that with 23 fingerprint locations we perform as well as traditional fingerprinting with over 230 fingerprinted locations for an office space of 2500m2.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121124268","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
扫码关注我们
求助内容：
应助结果提醒方式：