Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/9851
Title: Large-Scale Contact Tracing, Hotspot Detection, and Safe Route Recommendation
Authors: Maurya, Chandresh Kumar
Jain, Seemandhar
Thakre, Vishal
Keywords: Trees (mathematics)|Assisted GPS|Clusterings|Contact tracing|COVID-19|GPS Coordinates|GPS location|Hotspot detections|M-way like tree|Safest routes|Tunable parameter|Viruses
Issue Date: 2021
Publisher: Springer Science and Business Media Deutschland GmbH
Citation: Maurya, C. K., Jain, S., & Thakre, V. (2021). Large-scale contact tracing, hotspot detection, and safe route recommendation doi:10.1007/978-3-030-93620-4_13 Retrieved from www.scopus.com
Abstract: Recently, the COVID-19 pandemic created a worldwide emergency as it is estimated that such a large number of infections are due to humanto-human transmission of the COVID-19. As a necessity, there is a need to track users who came in contact with users having travel history, asymptomatic and not yet symptomatic, but they can be in the future. To solve this problem, the present work proposes a solution for contact tracing based on assisted GPS and cloud computing technologies. An application is developed to collect each user’s assisted GPS coordinates once all the users install this application. This application periodically sends assisted GPS data (coordinates) to the cloud. To determine which devices are within the permissible limit of 5 m (tunable parameter), we perform clustering over assisted GPS coordinates and track the clusters for about t mins (tunable parameter) to allow the measure of spread. We assume that it takes around 3–5 mins to get the virus from an infected object. For clustering, the proposed M-way like tree data structure stores the assisted GPS coordinates in degree, minute, and second (DMS) format. Thus, every user is mapped to a leaf node of the tree. The crux of the solution lies at the leaf node. We split the “seconds” part of the assisted GPS location into m equal parts (a tunable parameter), which amount to d meter in latitude/longitude. Hence, two users who are within d meter range will map to the same leaf node. Thus, by mapping assisted GPS locations every t mins (usually t = 2:5 mins), we can find out how many users came in contact with a particular user for at least t mins. Our work’s salient feature is that it runs in linear time O(n) for n users in the static case, i.e., when users are not moving. We also propose a variant of our solution to handle the dynamic case, that is, when users are moving. Besides, the proposed solution offers potential hotspot detection and safe-route recommendation as an additional feature, and proof-of-concept is presented through experiments on simulated data of 2/4/6/8/10M users. © 2021, Springer Nature Switzerland AG.
URI: https://dspace.iiti.ac.in/handle/123456789/9851
https://doi.org/10.1007/978-3-030-93620-4_13
ISBN: 978-3030936198
ISSN: 0302-9743
Type of Material: Conference Paper
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: