KLI

A Low Cost Decentralized Future Contacts Prediction Model Using Wi-Fi Traces

Metadata Downloads
Alternative Title
A Low Cost Decentralized Future Contacts Prediction Model Using Wi-Fi Traces
Abstract
The ability to accurately predict human encounters can inspire a variety of promising applications, ranging from epidemiology to data forwarding in opportunistic networks. This work aims at designing a low cost, highly accurate human encounter prediction model based on Wi-Fi datasets. By leveraging the temporal dependency of human mobility, we propose the distributed human encounter prediction (DHEP) model, which uses the Wi-Fi access history and inferred contact information of only the person of interest to estimate future encounters of that person. We implement the proposed DHEP model using a recurrent neural network and a feed-forward neural network. An embedding model that learns the low-dimensional representation of a person's location is proposed to reduce the number of training parameters. The experimental results on two large Wi-Fi datasets show the proposed RNN-based DHEP model outperforms existing models, and achieves 87 to 91 percent accuracy based on University at Buffalo (UB) traces. We also compare DHEP with the centralized human encounter prediction (CHEP) model, which gathers the contact history of all people for predicting future encounters. Despite a slightly lower performance than CHEP, DHEP has a low overhead and can protect data privacy.
Author(s)
Thi-Nga DaoTan-Quan NgoCong-Binh NguyenSeokhoon YoonJangyoung KimChunming Qiao
Issued Date
2022
Type
Article
Keyword
Encounter predictionrecurrent neural networksWi-Fi traceslarge-scale networksembedding model
DOI
10.1109/TMC.2021.3065026
URI
https://oak.ulsan.ac.kr/handle/2021.oak/14643
Publisher
IEEE TRANSACTIONS ON MOBILE COMPUTING
Language
영어
ISSN
1536-1233
Citation Volume
21
Citation Number
11
Citation Start Page
3807
Citation End Page
3821
Appears in Collections:
Medicine > Nursing
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

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