Spaceprint: a Mobility-based Fingerprinting Scheme for Public Spaces

In this paper, we address the problem of how automated situation-awareness can be achieved by learning real-world situations from ubiquitously generated mobility data. Without semantic input about the time and space where situations take place, this turns out to be a fundamental challenging problem. Uncertainties also introduce technical challenges when data is generated in irregular time intervals, being mixed with noise, and errors. Purely relying on temporal patterns observable in mobility data, in this paper, we propose Spaceprint, a fully automated algorithm for finding the repetitive pattern of similar situations in spaces. We evaluate this technique by showing how the latent variables describing the category, and the actual identity of a space can be discovered from the extracted situation patterns. Doing so, we use different real-world mobility datasets with data about the presence of mobile entities in a variety of spaces. We also evaluate the performance of this technique by showing its robustness against uncertainties

Towards a Versatile Problem Diagnosis Infrastructure for LargeWireless Sensor Networks

In this position paper, we address the issue of durable maintenance of a wireless sensor network, which will be crucial if the vision of large, long-lived sensornets is to become reality. Durable maintenance requires tools for diagnosing and fixing occurring problems, which can range from internode connectivity losses, to time synchronization problems, to software bugs. While there are solutions for fixing problems, an appropriate diagnostic infrastructure is essentially still lacking. We argue that diagnosing a sensornet application requires the ability to dynamically and temporarily extend the application on a selected group of nodes with virtually any functionality. We motivate this claim based on deployment experiences to date and propose a highly nonintrusive solution to dynamically extending a running application on a resource-constrained sensor node

Simplified Distributed Programming with Micro Objects

Developing large-scale distributed applications can be a daunting task. object-based environments have attempted to alleviate problems by providing distributed objects that look like local objects. We advocate that this approach has actually only made matters worse, as the developer needs to be aware of many intricate internal details in order to adequately handle partial failures. The result is an increase of application complexity. We present an alternative in which distribution transparency is lessened in favor of clearer semantics. In particular, we argue that a developer should always be offered the unambiguous semantics of local objects, and that distribution comes from copying those objects to where they are needed. We claim that it is often sufficient to provide only small, immutable objects, along with facilities to group objects into clusters.Comment: In Proceedings FOCLASA 2010, arXiv:1007.499

The Globe Infrastructure Directory Service

To implement adaptive replication strategies for Web documents, we have developed a wide area resource management system. This system allows servers to be managed on a local and global level. On a local level the system manages information about the resources and services provided by the servers, while on a global level the system allows servers to be searched for, added to, and removed from the system. As part of the system, and also in order to implement adaptive replication strategies, we introduce a hierarchical location representation for network elements such as servers, objects, and clients. This location representation allows us to easily and efficiently find and group network elements based on their location in a worldwide network. Our resource management system can be implemented using standard Internet technologies and has a broader range of applications besides making adaptive replication strategies possible for Web documents

Scalable Detection of Crowd Motion Patterns

Studying the movements of crowds is important for understanding and predicting the behavior of large groups of people. When analyzing crowds, one is often interested in the long-term macro-level motions of the crowd as a whole, as opposed to the micro-level short-term movements of individuals. A high-level representation of these motions is thus desirable. In this work, we present a scalable method for detection of crowd motion patterns, i.e., spatial areas describing the dominant motions within crowds. For measuring crowd movements, we propose a fast, scalable, and low-cost method based on proximity graphs. For analyzing crowd movements, we utilize a three-stage pipeline: (1) represents the behavior of each person at each moment in time as a low-dimensional data point, (2) cluster these data points based on spatial relations, and (3) concatenate these clusters based on temporal relations. Experiments on synthetic datasets reveals our method can handle various scenarios including curved lanes and diverging flows. Evaluation on real-world datasets shows our method is able to extract useful motion patterns which could not be properly detected by existing methods. Overall, we see our work as an initial step towards rich pattern recognition.</p

Filters for Wi-Fi Generated Crowd Movement Data

Cities represent large groups of people that share a common infrastructure, common social groups and/or common interests. With the development of new technologies current cities aim to become what is known as smart cities, in which all the small details of these large constructs are controlled to better improve the quality of life of its inhabitants. One of the important gears that powers a city is given by traffic, be it vehicular or pedestrian. As such traffic is closely related to all other activities that take place inside of a city. Understanding traffic is still a difficult process as we have to be able to not only measure it in the sense of how many people are using a particular path but also in analyzing where people are going and when, while still maintaining individual privacy. And all this has to be done at a scale that would cover most if not all individuals in a city. With the high increase in smartphones adoption we can reliably assume that a large part of the population in cities are carrying with them, at all times, at least one Wi-Fi enabled device. Because Wi-Fi devices are regularly transmitting signals we can rely on these devices to detect individual's movements unobtrusively without identifying or tracking any particular individual. Special sensors that monitor Wi-Fi frequencies can be placed around a city to gather data that can later be used to identify patterns in the traffic flows. We present a set of filters that can be used to minimize the amount of data needed for processing and without negatively impacting the result or the information that can be extracted from this data. Part of the filters we present can be deployed at the sensor level, making the entire system more scalable, while a different part can be executed before data processing thus enabling real time information extraction and a broader temporal and spatial range for data analysis. Some of these filters are particular to Wi-Fi but some of them can be applied to any detection system

Proximity Graphs for Crowd Movement Sensors

Sensors are now common, they span over different applications, different purposes and some over large geospatial areas. Most data produced by these sensors needs to be linked to the physical location of the sensor itself. By using the location of a sensor we can construct (mathematically) proximity graphs that have the sensors as nodes. These graphs have a wide variety of applications including visualization, packet routing, and spatial data analysis. We consider a sensor network that measures detections of WiFi packets transmitted by devices, such as smartphones. One important feature of sensors is given by the range in which they can gather data. Algorithms that build proximity graphs do not take this radius into account. We present an approach to building proximity graph that takes sensor position and radius as input. Our goal is to construct a graph that contains edges between pairs of sensors that are correlated to crowd movements, reflecting paths that individuals are likely to take. Because we are considering crowd movement, it gives us the unique opportunity to construct graphs that show the connections between sensors using consecutive detections of the same device. We show that our approach is better than ones that are based on the positioning of sensors only