SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
Zeinalipour-Yazdi, Constantinos D.
SourceProceedings - International Conference on Data Engineering
2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
Google Scholar check
MetadataShow full item record
In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participating users. Our framework, exploits opportunistic and participatory sensing in order to quickly answer queries of the form: Report objects (i.e., trajectories) that follow a similar spatio-temporal motion to Q, where Q is some query trajectory. SmartTrace, relies on an in-situ data storage model, where geo-location data is recorded locally on smartphones for both performance and privacy reasons. SmartTrace then deploys an efficient top-K query processing algorithm that exploits distributed trajectory similarity measures, resilient to spatial and temporal noise, in order to derive the most relevant answers to Q quickly and efficiently. Our demonstration shows how the SmartTrace algorithmics are ported on a network of Android-based smartphone devices with impressive query response times. To demonstrate the capabilities of SmartTrace during the conference, we will allow the attendees to query local smartphone networks in the following two modes: i) Interactive Mode, where devices will be handed out to participants aiming to identify who is moving similar to the querying nodeand ii) Trace-driven Mode, where a large-scale deployment can be launched in order to show how the K most similar trajectories can be identified quickly and efficiently. The conference attendees will be able to appreciate how interesting spatio-temporal search applications can be implemented efficiently (for performance reasons) and without disclosing the complete user traces to the query processor (for privacy reasons)1. For instance, an attendee might be able to determine other attendees that have participated in common sessions, in order to initiate new discussions and collaborations, without knowing their trajectory or revealing his/her own trajectory either. © 2011 IEEE.
Showing items related by title, author, creator and subject.
Optimized query routing trees for wireless sensor networks Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Pamboris, Andreas; Chrysanthis, Panos K.; Samaras, George S. (2011)In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
The threshold join algorithm for top-k queries in distributed sensor networks Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Gunopulos, Dimitrios; Kalogeraki, Vana; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2005)In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query is to find the k highest ranked answers ...
KSpot: Effectively monitoring the k most important events in a wireless sensor network Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Vassiliadou, M.; Chrysanthis, Panos K.; Samaras, George S. (2009)This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. KSpot deploys state-of-the-art distributed ...