L. Gruenwald, Md. Shiblee Sadik, Rahul Shukla, Hanqing Yang
{"title":"DEMS: a data mining based technique to handle missing data in mobile sensor network applications","authors":"L. Gruenwald, Md. Shiblee Sadik, Rahul Shukla, Hanqing Yang","doi":"10.1145/1858158.1858167","DOIUrl":"https://doi.org/10.1145/1858158.1858167","url":null,"abstract":"In Mobile Sensor Network (MSN) applications, sensors move to increase the area of coverage and/or to compensate for the failure of other sensors. In such applications, loss or corruption of sensor data, known as the missing sensor data phenomenon, occurs due to various reasons, such as power outage, network interference, and sensor mobility. A desirable way to address this issue is to develop a technique that can effectively and efficiently estimate the values of the missing sensor data in order to provide timely response to queries that need to access the missing data. There exists work that aims at achieving such a goal for applications in static sensor networks (SSNs), but little research has been done for those in MSNs, which are more complex than SSNs due to the mobility of mobile sensors. In this paper, we propose a novel data mining based technique, called Data Estimation for Mobile Sensors (DEMS), to handle missing data in MSN applications. DEMS mines the spatial and temporal relationships among mobile sensors with the help of virtual static sensors. DEMS converts mobile sensor readings into virtual static sensor readings and applies the discovered relationships on virtual static sensor readings to estimate the values of the missing sensor data. We also present the experimental results using both real life and synthetic datasets to demonstrate the efficacy of DEMS in terms of data estimation accuracy.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122445243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mo Liu, M. Ray, Elke A. Rundensteiner, Daniel J. Dougherty, Chetan Gupta, Song Wang, Ismail Ari, Abhay Mehta
{"title":"Processing nested complex sequence pattern queries over event streams","authors":"Mo Liu, M. Ray, Elke A. Rundensteiner, Daniel J. Dougherty, Chetan Gupta, Song Wang, Ismail Ari, Abhay Mehta","doi":"10.1145/1858158.1858164","DOIUrl":"https://doi.org/10.1145/1858158.1858164","url":null,"abstract":"Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These monitoring applications submit complex event queries to track sequences of events that match a given pattern. As these systems mature the need for increasingly complex nested sequence queries arises, while the state-of-the-art CEP systems mostly focus on the execution of flat sequence queries only. In this paper, we now introduce an iterative execution strategy for nested CEP queries composed of sequence, negation, AND and OR operators. Lastly we have introduced the promising direction of applying selective caching of intermediate results to optimize the execution. Our experimental study using real-world stock trades evaluates the performance of our proposed iterative execution strategy for different query types.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129390270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"What's NExT?: Sensor + Cloud!?","authors":"K. Tan","doi":"10.1145/1858158.1858160","DOIUrl":"https://doi.org/10.1145/1858158.1858160","url":null,"abstract":"Today, we are witnessing a number of interesting phenomena. First, there is an increasing adoption of sensing technologies (e.g., RFID, cameras, mobile phones) in many industries. Second, the internet has become a source of realtime information (e.g., through blogs, social networks, live forums) for events happening around us. In fact, we can consider these sources as \"sensors\". Finally, Cloud computing has emerged as an attractive solution for dealing with the \"Big Data\" revolution. By combining data obtained from sensors with that from the internet, we can potentially create a demand for resources that can be appropriately met by the cloud. This talk will discuss some application scenarios, challenges and opportunties for the communities. Our goal is to exploit these technolgies for smart living.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Provenance-based trustworthiness assessment in sensor networks","authors":"Hyo-Sang Lim, Yang-Sae Moon, E. Bertino","doi":"10.1145/1858158.1858162","DOIUrl":"https://doi.org/10.1145/1858158.1858162","url":null,"abstract":"As sensor networks are being increasingly deployed in decision-making infrastructures such as battlefield monitoring systems and SCADA (Supervisory Control and Data Acquisition) systems, making decision makers aware of the trustworthiness of the collected data is a crucial. To address this problem, we propose a systematic method for assessing the trustworthiness of data items. Our approach uses the data provenance as well as their values in computing trust scores, that is, quantitative measures of trustworthiness. To obtain trust scores, we propose a cyclic framework which well reflects the inter-dependency property: the trust score of the data affects the trust score of the network nodes that created and manipulated the data, and vice-versa. The trust scores of data items are computed from their value similarity and provenance similarity. The value similarity comes from the principle that \"the more similar values for the same event, the higher the trust scores\". The provenance similarity is based on the principle that \"the more different data provenances with similar values, the higher the trust scores\". Experimental results show that our approach provides a practical solution for trustworthiness assessment in sensor networks.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114510630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Query-driven data collection and data forwarding in intermittently connected mobile sensor networks","authors":"Wei Wu, Hock-Beng Lim, Kian-Lee Tan","doi":"10.1145/1858158.1858166","DOIUrl":"https://doi.org/10.1145/1858158.1858166","url":null,"abstract":"In sparse and intermittently connected Mobile Sensor Networks (MSNs), the base station cannot easily get the data objects acquired by the mobile sensors in the field. When users query the base station for specific data objects, the base station may not have received the necessary data objects to answer the queries. In this paper, we propose to use a Mobile Data Collector (MDC) to collect the data objects from the mobile sensors that the base station needs for answering queries. To facilitate the MDC's data collection, we design a location-based data forwarding protocol that exploits the location metadata of data objects and uses caching to improve data availability in the MSNs. Results of performance study show that our solution can reduce query response times on the base station.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126294409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Facilitating fine grained data provenance using temporal data model","authors":"M. R. Huq, A. Wombacher, P. Apers","doi":"10.1145/1858158.1858163","DOIUrl":"https://doi.org/10.1145/1858158.1858163","url":null,"abstract":"E-science applications use fine grained data provenance to maintain the reproducibility of scientific results, i.e., for each processed data tuple, the source data used to process the tuple as well as the used approach is documented. Since most of the e-science applications perform on-line processing of sensor data using overlapping time windows, the overhead of maintaining fine grained data provenance is huge especially in longer data processing chains. This is because data items are used by many time windows. In this paper, we propose an approach to reduce storage costs for achieving fine grained data provenance by maintaining data provenance on the relation level instead on the tuple level and make the content of the used database reproducible. The approach has prototypically been implemented for streaming and manually sampled data.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"387 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132375529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nikos Giatrakos, Y. Kotidis, Antonios Deligiannakis
{"title":"PAO: power-efficient attribution of outliers in wireless sensor networks","authors":"Nikos Giatrakos, Y. Kotidis, Antonios Deligiannakis","doi":"10.1145/1858158.1858168","DOIUrl":"https://doi.org/10.1145/1858158.1858168","url":null,"abstract":"Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitored quantities. Due to the commodity hardware used in the construction of sensor nodes, the readings of sensors are frequently tainted with outliers. Given the presence of outliers, decision making in sensor networks becomes much harder. In this work, we introduce PAO, a framework that can reliably and efficiently detect outliers in wireless sensor networks. PAO significantly reduces the bandwidth consumption during the outlier detection procedure, while being able to operate over multiple window types. Moreover, our framework possesses the ability to operate in either an exact mode, or an approximate one that further reduces the communication cost, thus covering a wide variety of application requirements.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132711876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Goce Trajcevski, O. Ghica, P. Scheuermann, R. Tamassia, I. Cruz
{"title":"Alternating multiple tributaries + deltas","authors":"Goce Trajcevski, O. Ghica, P. Scheuermann, R. Tamassia, I. Cruz","doi":"10.1145/1402050.1402057","DOIUrl":"https://doi.org/10.1145/1402050.1402057","url":null,"abstract":"This work addresses the problem of trading off the latency in delivering the answer to the sink at the benefit of balancing the spatial dispersion of the energy consumption among the nodes and, consequently, prolonging the lifetime in sensor networks. Typically, in response to a query that pertains to the data from some geographic region, a tree structure is constructed and, when possible, some in-network aggregation is performed. On the other hand, in order to increase the robustness and/or balance the load, multipath routing is employed. Motivated by earlier work that combined trees and multipaths [19], in this paper we explore the possibility, and the impact, of combining multiple trees and multiple multipaths for routing, when processing a query with respect to a given region of interest. We present and evaluate two approaches that enable load-balancing in terms of alternating among a collection of routing structures.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122494303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Better tree - better fruits: using dominating set trees for MAX queries","authors":"B. Malhotra, M. Nascimento, I. Nikolaidis","doi":"10.1145/1402050.1402052","DOIUrl":"https://doi.org/10.1145/1402050.1402052","url":null,"abstract":"Finding an aggregation of observed values, in particular the maximum value, is an important type of query in wireless sensor networks. Previous proposals to find the maximum value, the so-called MAX query, relied on a given underlying logical tree topology for data aggregation/forwarding, but did not pay due attention to the role of such topology. Focusing on the MAX queries we first argue that the underlying tree topology plays a very important role in the query processing cost. We then propose the use of a particular tree topology, based on Dominating Sets that is well suited to explore the network's physical topology for processing MAX queries efficiently. Experimental results obtained using real and synthetic datasets confirm that by simply replacing the tree topologies used in previous proposals with the Dominating Set-based Tree (DST) one can reduce the transmission cost of MAX queries by up to 70% and overall energy consumption by up to 53%.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134216077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"POT: an efficient top-k monitoring method for spatially correlated sensor readings","authors":"YongHyun Cho, Jihoon Son, Y. Chung","doi":"10.1145/1402050.1402053","DOIUrl":"https://doi.org/10.1145/1402050.1402053","url":null,"abstract":"In this paper, we discuss the top-k monitoring over sensor networks. Since sensor readings are usually correlated with location, top-k nodes are clustered at some areas. Motivated by such a characteristic, we propose a novel tree structure named partial ordered tree(POT) to efficiently maintain clusters of the highest readings. By using POTs, only candidate nodes which might be included in top-k result are evaluated for query processing. Through simulation experiments, we evaluate the performance of the POT method in comparison with conventional methods.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115347552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}