{"title":"Workflow support for wireless sensor and actor networks: a position paper","authors":"P. Guerrero, D. Jacobi, A. Buchmann","doi":"10.1145/1286380.1286389","DOIUrl":"https://doi.org/10.1145/1286380.1286389","url":null,"abstract":"As initial challenges of wireless sensor and actor networks (WSANs) are overcome, their application possibilities evolve. For these applications to move mainstream, efficient programming methods are required which can be used by domain experts. So far, the question of how can WSANs be efficiently programmed remains unanswered. In this paper we examine proposed middleware approaches, and show that they have focused on data extraction rather than in-network actuation. We thus propose the usage of workflows as a means to define the logic that orchestrates the network activity, and introduce a language to express WSAN interactions. At this time, a concrete system is not given, but the paper discusses the relevant aspects towards one, and poses many questions for future research.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128690805","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":"Processing proximity queries in sensor networks","authors":"Y. Kotidis","doi":"10.1145/1315903.1315905","DOIUrl":"https://doi.org/10.1145/1315903.1315905","url":null,"abstract":"Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we introduce the concept of proximity queries that allow us to report interesting events that are observed by nodes in the network that are within certain distance of each other. An event is triggered when a user-programmable predicate is satisfied on a sensor node. We study the problem of computing proximity queries in sensor networks using existing communication protocols and then propose an efficient algorithm that can process multiple proximity queries, involving several different event types. Our solution utilizes a distributed routing index, maintained by the nodes in the network that is dynamically updated as new observations are obtained by the nodes. We present an extensive experimental study to show the benefits of our techniques under different scenarios. Our results demonstrate that our algorithms scale better and require orders of magnitude fewer messages compared to a straightforward computation of the queries.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"99 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132573101","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":"Transactional issues in sensor data management","authors":"L. Gürgen, C. Roncancio, C. Labbé, V. Olive","doi":"10.1145/1315903.1315910","DOIUrl":"https://doi.org/10.1145/1315903.1315910","url":null,"abstract":"This paper presents a novel research direction in the field of sensor data management. It concerns transactional support in heterogeneous large scale sensor systems. Besides well-known continuous queries on sensor data, system management queries should be supported in these systems. Indeed, with increasing capacity and diversity of sensors, new applications which require complex read-only and update queries are likely to appear. Those applications will require challenging properties such as ACID properties. This paper discusses the relevance of ACID properties in sensor data management context. It then focuses on the isolation property and proposes a concurrency control mechanism to support concurrent execution of continuous queries and update transactions on sensor properties.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125514009","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":"MeT: a real world oriented metadata management system for semantic sensor networks","authors":"H. Kawashima, Y. Hirota, S. Satake, M. Imai","doi":"10.1145/1315903.1315907","DOIUrl":"https://doi.org/10.1145/1315903.1315907","url":null,"abstract":"A semantic sensor network describes the physical world using the metadata obtained from a sensor network. In this paper, we present our design and implementation of MeT, a real world oriented metadata management system for semantic sensor networks. MeT generates metadata either statically based on the application semantics, or dynamically using inference rules. It then constructs relationships between physical objects through these metadata. The sensor devices in MeT include RFID tags, position sensors and Motes. The users can query MeT about physical objects through either a Graphic User Interace, or Robovie, a communication robot. We give several concrete examples of querying physical objects in MeT to demonstrate the functionality of our system.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"50 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130911770","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}
Andreea Berfield, Panos K. Chrysanthis, Alexandros Labrinidis
{"title":"Efficient handling of sensor failures","authors":"Andreea Berfield, Panos K. Chrysanthis, Alexandros Labrinidis","doi":"10.1145/1315903.1315911","DOIUrl":"https://doi.org/10.1145/1315903.1315911","url":null,"abstract":"Sensors provide unprecedented access to a wealth of information from the physical environment in real-time. However, they suffer from a variety of resource limitations, most importantly power consumption and communication bandwidth. Additionally, environmental conditions can contribute to sensor failures, disrupting the flow of query results. In this paper, we propose new techniques to deal with sensor failures based on the principles of partition and single path redundancy. Our experimental results confirm the efficiency of our techniques with respect to different performance metrics in general, and, in particular, high quality of data.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128926344","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}
Jimeng Sun, E. Hoke, J. Strunk, G. Ganger, C. Faloutsos
{"title":"Intelligent system monitoring on large clusters","authors":"Jimeng Sun, E. Hoke, J. Strunk, G. Ganger, C. Faloutsos","doi":"10.1145/1315903.1315914","DOIUrl":"https://doi.org/10.1145/1315903.1315914","url":null,"abstract":"Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype monitoring and mining system for data centers. It uses the SNMP protocol to monitor a new data center at Carnegie Mellon. It stores the monitoring data in a MySQL database, allowing visualization of the time-series data using a JSP web-based frontend interface for system administrators. What sets InteMon apart from other cluster monitoring systems is its ability to automatically analyze correlations in the monitoring data in real time and alert administrators of potential anomalies. It uses efficient, state of the art stream mining methods to report broken correlations among input streams. It also uses these methods to intelligently compress historical data and avoid the need for administrators to configure threshold-based monitoring bands.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127150762","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":"Impact of multi-query optimization in sensor networks","authors":"Shili Xiang, H. Lim, K. Tan","doi":"10.1145/1315903.1315906","DOIUrl":"https://doi.org/10.1145/1315903.1315906","url":null,"abstract":"In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multi-query optimization at the base station level to minimize the number of radio messages in the sensor network. We adopt a cost-based approach, and develop a cost model to study the benefit of exploiting common subexpressions in queries. We also propose several optimization algorithms for both data acquisition queries and aggregation queries that intelligently rewrite multiple sensor data queries (at the base station) into \"synthetic\" queries to eliminate redundancy among them before they are injected into the wireless sensor network. The set of running synthetic queries is dynamically updated by the arrival of new queries as well as the termination of existing queries. We validate the effectiveness of our cost model and our experimental results indicate that our multi-query optimization strategy can provide significant performance improvements.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128946548","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":"Quality of service in stateful information filters","authors":"Peter M. Fischer, Donald Kossmann","doi":"10.1145/1315903.1315913","DOIUrl":"https://doi.org/10.1145/1315903.1315913","url":null,"abstract":"Information Filters play an important role in processing streams of events, both for filtering as well as routing events based on their content. Stateful information filters like AGILE [15], Cayuga [13] and SASE [24] have gained a significant amount of attention recently. Such filters not only consider the data of a single event, but also additional state such as a sequence of previous events or a context state. Applications for Wireless Sensors and RFID data are particularly prominent examples for the need for stateful information filtering, with use cases like event correlation or sensor data affecting the routing of other events. While quality of service has been researched fairly thoroughly for networking systems and general data stream management systems, no comprehensive work exists for information filters. The goal of this work is to present QoS criteria for stateful information filters and to examine how QoS control methods established in other areas can be applied to information filters.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126576827","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":"Network scheduling for data archiving applications in sensor networks","authors":"Yong Yao, S. Alam, J. Gehrke, S. Servetto","doi":"10.1145/1315903.1315909","DOIUrl":"https://doi.org/10.1145/1315903.1315909","url":null,"abstract":"Since data archiving in sensor networks is a communication intensive application, a careful power management of communication is of critical importance for such networks. An example is FPS, an adaptive power scheduling algorithm that combines slotted scheduling with a CSMA MAC [7]. In this paper, we first propose a new global power scheduling protocol called Multi-Flow Power Scheduling (MPS) that delivers more data and consumes less energy than existing power scheduling protocols. MPS sets up a transmission schedule through standard data aggregation and dissemination operations, however since it creates a global schedule it does not scale to large networks. We then present a new power scheduling protocol called Hybrid Power Scheduling (HPS) that retains the scalability of FPS while maintaining the energy efficiency and high data delivery rate of MPS. In a thorough simulation study, we compare HPS and MPS, and our results show the efficacy of HPS.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"9 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131608488","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":"Quantifying eavesdropping vulnerability in sensor networks","authors":"M. Anand, Z. Ives, Insup Lee","doi":"10.1145/1080885.1080887","DOIUrl":"https://doi.org/10.1145/1080885.1080887","url":null,"abstract":"With respect to security, sensor networks have a number of considerations that separate them from traditional distributed systems. First, sensor devices are typically vulnerable to physical compromise. Second, they have significant power and processing constraints. Third, the most critical security issue is protecting the (statistically derived) aggregate output of the system, even if individual nodes may be compromised. We suggest that these considerations merit a rethinking of traditional security techniques: rather than depending on the resilience of cryptographic techniques, in this paper we develop new techniques to tolerate compromised nodes and to even mislead an adversary. We present our initial work on probabilistically quantifying the security of sensor network protocols, with respect to sensor data distributions and network topologies. Beginning with a taxonomy of attacks based on an adversary's goals, we focus on how to evaluate the vulnerability of sensor network protocols to eavesdropping. Different topologies and aggregation functions provide different probabilistic guarantees about system security, and make different trade-offs in power and accuracy.","PeriodicalId":281465,"journal":{"name":"Data Management for Sensor Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121697458","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}