This project is no longer active; this page is no longer updated.
Related projects: [Mobility-models]
Related keywords: [privacy], [security], [sensors], [wearable]
The MetroSense project was a broad project that explored the potential for "opportunistic crowd-sensing": crowd-sourced collection of sensor data from mobile users carrying smartphones or other sensing devices. One of our papers summarized the many challenges [kapadia:metrosec-challenges].
In our group, we developed the AnonySense system, which includes novel mechanisms for the anonymous collection of sensor data from people who volunteer their cell phones as part of a distributed sensing platform, addressing a key challenge in the important area of participatory and opportunistic urban sensing, and developed a novel interface to allow people to specify how sensor data about them might be shared with others. To evaluate this work, we measured system performance in terms of bandwidth and power consumption, conducted a user study, and used large wireless-network traces from the Dartmouth campus. [cornelius:anonysense, kapadia:anonysense, shin:anonysense].
In related work we developed a spatiotemporal blurring mechanism based on tessellation and clustering of space according to the location of access points and the relative density of users in each region [shin:anonytiles].
In related work, a student looked at linkability in activity inference data sets [fielding:thesis].
In a subproject called PLACE (Privacy in Location-Aware Computing Environments) [anthony:pervasive], we also developed a method for access control called virtual walls. By allowing users to deploy 'virtual walls', they can control the privacy of their digital footprints much in the same way they control their privacy in the physical world. We presented a policy framework and model for virtual walls with three levels of transparency that correspond to intuitive levels of privacy. We also described the results of a user study (N=23) that indicated that our model is easy to understand and use. [kapadia:walls].
We also developed DEAMON, an energy-efficient distributed algorithm for long-term sensor monitoring. Our approach assumes only that mobile nodes are tasked to report sensor data under conditions specified by a Boolean expression, and that a network of nearby sensor nodes contribute to monitoring subsets of the task's sensors. Our algorithm to select sensor nodes and to monitor the sensing condition conserves energy of all nodes by limiting sensing and communication operations. We evaluated DEAMON with a stochastic analysis and with simulation results, and show that it should significantly reduce energy consumption [shin:deamon].
Denise Anthony, Cory Cornelius, Jeffrey Fielding, Tristan Henderson, Peter Johnson, Apu Kapadia, David Kotz, Dan Peebles, Minho Shin, Nikos Triandopoulos, Patrick Tsang.
This research was funded by the Institute for Security Technology Studies (ISTS), supported by the US Department of Justice (Bureau of Justice Assistance) under grant 2005-DD-BX-1091, the US Department of Commerce (NIST) under grant 60NANB6D6130, the US Department of Homeland Security under grant 2006-CS-001-000001.
The views and conclusions contained on this site and in its documents are those of the authors and should not be interpreted as necessarily representing the official position or policies, either expressed or implied, of the sponsor(s). Any mention of specific companies or products does not imply any endorsement by the authors or by the sponsor(s).
[Also available in BibTeX]
Papers are listed in reverse-chronological order;
click an entry to pop up the abstract.
For full information and pdf, please click Details link.
Follow updates with RSS.
We propose DEAMON (Distributed Energy-Aware MONitoring), an energy-efficient distributed algorithm for long-term sensor monitoring. Our approach assumes only that mobile nodes are tasked to report sensor data under conditions specified by a Boolean expression, and that a network of nearby sensor nodes contribute to monitoring subsets of the task’s sensors. Our algorithm to select sensor nodes and to monitor the sensing condition conserves energy of all nodes by limiting sensing and communication operations. We evaluate DEAMON with a stochastic analysis and with simulation results, and show that it should significantly reduce energy consumption.
We describe AnonySense, a privacy-aware architecture for realizing pervasive applications based on collaborative, opportunistic sensing by personal mobile devices. AnonySense allows applications to submit sensing tasks that will be distributed across anonymous participating mobile devices, later receiving verified, yet anonymized, sensor data reports back from the field, thus providing the first secure implementation of this participatory sensing model. We describe our trust model, and the security properties that drove the design of the AnonySense system. We evaluate our prototype implementation through experiments that indicate the feasibility of this approach, and through two applications: a Wi-Fi rogue access point detector and a lost-object finder.
We propose SenseRight, the first architecture for high-integrity people-centric sensing. The SenseRight approach, which extends and enhances AnonySense, assures integrity of both the sensor data (through use of tamper-resistant sensor devices) and the sensor context (through a time-constrained protocol), maintaining anonymity if desired.
We propose AnonySense, a general-purpose architecture for leveraging users’ mobile devices for measuring context, while maintaining the privacy of the users. AnonySense features multiple layers of privacy protection---a framework for nodes to receive tasks anonymously, a novel blurring mechanism based on tessellation and clustering to protect users’ privacy against the system while reporting context, and k-anonymous report aggregation to improve the users’ privacy against applications receiving the context. We outline the architecture and security properties of AnonySense, and focus on evaluating our tessellation and clustering algorithm against real mobility traces.