28 research outputs found

    SenseWorld: Towards Cyber-Physical Social Networks

    Full text link
    Web-based social networks such as LinkedIn, FaceBook and MySpace have gained wide popularity in recent years. With the advent of ubiquitous sensing, future social net-works will be cyber-physical, combining measured ele

    Efficient orchestration of Node-RED IoT workflows using a vector symbolic architecture

    Get PDF
    Numerous workflow systems span multiple scientific domains and environments, and for the Internet of Things (IoT), Node-RED offers an attractive Web based user interface to execute IoT service-based workflows. However, like most workflow systems, it coordinates the workflow centrally, and cannot run within more transient environments where nodes are mobile. To address this gap, we show how Node-RED workflows can be migrated into a decentralized execution environment for operation on mobile ad-hoc networks, and we demonstrate this by converting a Node-RED based traffic congestion detection workflow to operate in a decentralized environment. The approach uses a Vector Symbolic Architecture (VSA) to dynamically convert Node-Red applications into a compact semantic vector representation that encodes the service interfaces and the workflow in which they are embedded. By extending existing services interfaces, with a simple cognitive layer that can interpret and exchange the vectors, we show how the required services can be dynamically discovered and interconnected into the required workflow in a completely decentralized manner. The resulting system provides a convenient environment where the Node-RED front-end graphical composition tool can be used to orchestrate decentralized workflows. In this paper, we further extend this work by introducing a new dynamic VSA vector compression scheme that compresses vectors for on-the-wire communication, thereby reducing communication bandwidth while maintaining the semantic information content. This algorithm utilizes the holographic properties of the symbolic vectors to perform compression taking into consideration the number of combined vectors along with similarity bounds that determine conflict with other encoded vectors used in the same context. The resulting savings make this approach extremely efficient for discovery in service-based decentralized workflows

    Beyond Spatial Auto-Regressive Models: Predicting Housing Prices with Satellite Imagery

    Full text link
    When modeling geo-spatial data, it is critical to capture spatial correlations for achieving high accuracy. Spatial Auto-Regression (SAR) is a common tool used to model such data, where the spatial contiguity matrix (W) encodes the spatial correlations. However, the efficacy of SAR is limited by two factors. First, it depends on the choice of contiguity matrix, which is typically not learnt from data, but instead, is assumed to be known apriori. Second, it assumes that the observations can be explained by linear models. In this paper, we propose a Convolutional Neural Network (CNN) framework to model geo-spatial data (specifi- cally housing prices), to learn the spatial correlations automatically. We show that neighborhood information embedded in satellite imagery can be leveraged to achieve the desired spatial smoothing. An additional upside of our framework is the relaxation of linear assumption on the data. Specific challenges we tackle while implementing our framework include, (i) how much of the neighborhood is relevant while estimating housing prices? (ii) what is the right approach to capture multiple resolutions of satellite imagery? and (iii) what other data-sources can help improve the estimation of spatial correlations? We demonstrate a marked improvement of 57% on top of the SAR baseline through the use of features from deep neural networks for the cities of London, Birmingham and Liverpool.Comment: 10 pages, 5 figure

    Dynamic distributed orchestration of Node-RED IOT workflows using a vector symbolic architecture

    Get PDF
    There are a large number of workflow systems designed to work in various scientific domains, including support for the Internet of Things (IoT). One such workflow system is Node-RED, which is designed to bring workflow-based programming to IoT. However, the majority of scientific workflow systems, and specifically systems like Node-RED, are designed to operate in a fixed networked environment, which rely on a central point of coordination in order to manage the workflow. The main focus of the work described in this paper is to investigate means whereby we can migrate Node-RED workflows into a decentralized execution environment, so that such workflows can run on Edge networks, where nodes are extremely transient in nature. In this work, we demonstrate the feasibility of such an approach by showing how we can migrate a Node-RED based traffic congestion workflow into a decentralized environment. The traffic congestion algorithm is implemented as a set of Web services within Node-RED and we have architected and implemented a system that proxies the centralized Node-RED services using cognitively-aware wrapper services, designed to operate in a decentralized environment. Our cognitive services use a Vector Symbolic Architecture to semantically represent service descriptions and workflows in a way that can be unraveled on the fly without any central point of control. The VSA-based system is capable of parsing Node-RED workflows and migrating them to a decentralized environment for execution; providing a way to use Node-RED as a front-end graphical composition tool for decentralized workflow

    Experiences with GreenGPS – Fuel-Efficient Navigation using Participatory Sensing

    Get PDF
    Participatory sensing services based on mobile phones constitute an important growing area of mobile computing. Most services start small and hence are initially sparsely deployed. Unless a mobile service adds value while sparsely deployed, it may not survive conditions of sparse deployment. The paper offers a generic solution to this problem and illustrates this solution in the context of GreenGPS; a navigation service that allows drivers to find the most fuel-efficient routes customized for their vehicles between arbitrary end-points. Specifically, when the participatory sensing service is sparsely deployed, we demonstrate a general framework for generalization from sparse collected data to produce models extending beyond the current data coverage. This generalization allows the mobile service to offer value under broader conditions. GreenGPS uses our developed participatory sensing infrastructure and generalization algorithms to perform inexpensive data collection, aggregation, and modeling in an end-to-end automated fashion. The models are subsequently used by our backend engine to predict customized fuel-efficient routes for both members and non-members of the service. GreenGPS is offered as a mobile phone application and can be easily deployed and used by individuals. A preliminary study of our green navigation idea was performed in [1], however, the effort was focused on a proof-of-concept implementation that involved substantial offline and manual processing. In contrast, the results and conclusions in the current paper are based on a more advanced and accurate model and extensive data from a real-world phone-based implementation and deployment, which enables reliable and automatic end-to-end data collection and route recommendation. The system further benefits from lower cost and easier deployment. To evaluate the green navigation service efficiency, we conducted a user subject study consisting of 22 users driving different vehicles over the course of several months in Urbana-Champaign, IL. The experimental results using the collected data suggest that fuel savings of 21.5% over the fastest, 11.2% over the shortest, and 8.4% over the Garmin eco routes can be achieved by following GreenGPS green routes. The study confirms that our navigation service can survive conditions of sparse deployment and at the same time achieve accurate fuel predictions and lead to significant fuel savings.This research was sponsored in part by IBM Research and NSF Grants CNS 10-59294, CNS 10-40380 and CNS 13-45266.Ope

    SocialTrove: A Self-summarizing Storage Service for Social Sensing

    Get PDF
    The increasing availability of smartphones, cameras, and wearables with instant data sharing capabilities, and the exploitation of social networks for information broadcast, heralds a future of real-time information overload. With the growing excess of worldwide streaming data, such as images, geotags, text annotations, and sensory measurements, an increasingly common service will become one of data summarization. The objective of such a service will be to obtain a representative sampling of large data streams at a configurable granularity, in real-time, for subsequent consumption by a range of data-centric applications. This paper describes a general-purpose self-summarizing storage service, called SocialTrove, for social sensing applications. The service summarizes data streams from human sources, or sensors in their possession, by hierarchically clustering received information in accordance with an application-specific distance metric. It then serves a sampling of produced clusters at a configurable granularity in response to application queries. While SocialTrove is a general service, we illustrate its functionality and evaluate it in the specific context of workloads collected from Twitter. Results show that SocialTrove supports a high query throughput, while maintaining a low access latency to the produced real-time application-specific data summaries. As a specific application case-study, we implement a fact-finding service on top of SocialTrove.Army Research Laboratory, Cooperative Agreement W911NF-09-2-0053DTRA grant HDTRA1-10-1-0120NSF grants CNS 13-29886, CNS 09-58314, CNS 10-35736Ope

    PoolView: Towards a people centric sensing world

    Get PDF
    The availability of a wide variety of networked sensing devices in the form of everyday devices such as smartphones, music players, smart residential power meters, sensor embedded gaming systems, and in- vehicle sensing devices will result in the evolution of an embedded Internet. In this scenario, the main role of the Internet and its applications will shift gradually from offering a mere communication medium between end-points to offering information distillation services bridging the gap between the varied data feeds from the sensing devices and human decision needs. In this thesis, we take a step towards the development of an architecture and a data analysis toolset for realizing the above vision of the future Internet. In particular, we focus on a category of sensing, called people centric sensing, where the sensing devices are owned by individuals. We present various novel generic data analysis tools that are necessary to enable people centric sensing applications. We take a systems approach and exemplify these tools by developing and implement- ing prototypes of several people centric sensing applications. We also provide extensive data collection and evaluation for each of the exemplified applications, which show the utility of our architecture

    Benefits of Inter-Tree Optimizations for Content based Publish Subscribe in Sensor Networks

    Get PDF
    Sensor networks pose the challenge of distribution of content generated within the network to the origins of requests for this content in an efficient and timely manner. In this paper, we formulate this multiple-source multiple-sink data dissemination problem as a content-based publish-subscribe problem. While previous research concentrated on optimizing each flow independently for energy consumption, we propose inter-flow optimizations for networkwide energy savings. We propose a methodology to construct multiple multicast trees, one for each publisher, so as to increase the extent of aggregation across multicast trees at intermediate nodes. We describe how inter-tree optimization, through aggregation of multiple publisher-subscriber flows at intermediate nodes, can be performed. Further, in the presence of application specified delay constraints, we extend our scheme to maximize aggregation while ensuring that the delay constraints are met

    Contents

    No full text
    corecore