Paper Info
Title
Computational Complexity Upper Bounds For Fingerprint-Based Point-Of-Interest Recognition Algorithms
Abstract
Thanks to the great proliferation of mobile devices within the Internet of Things (IoT) paradigm, Smart Buildings and Smart Cities are becoming hot topics. In such smart environments, user localization plays a central role. More specifically, Point-of-Interest (POI) recognition is one of the most attractive Location-Based-Service (LBS) applications. This paper provides computational complexity upper bounds for fingerprint-based POI recognition algorithms. We have considered five algorithms reported in a former work: LRACI and its extended variant ELRACI, BeaconPrint, PlaceSense, SensLoc and SAPFI. For each of them a close-form of their computational complexity has been derived, both for the training and the recognition phase. The results obtained in this works allow a comprehensive and fair comparison of some of the most well-known POI recognition algorithms.
Year
DOI
Venue
2019
10.1109/CCCS.2019.8888142
2019 4th International Conference on Computing, Communications and Security (ICCCS)
Keywords
Field
DocType
Computational complexity,Close-form,POI recognition,WiFi,Internet of Things,Upper-bound
Smart environment,Upper and lower bounds,Computer science,Fingerprint,Mobile device,Building automation,Point of interest,Pound (mass),Computer engineering,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
978-1-7281-0876-6
0
0.34
References 
Authors
9
4
Name
Order
Citations
PageRank
Igor Bisio139543.23
Fabio Lavagetto221635.19
Chiara Garibotto324.08
Andrea Sciarrone410016.60