ACM Trans. Sens. Networks最新文献_第10页

Utility-based bandwidth adaptation in mission-oriented wireless sensor networks 面向任务的无线传感器网络中基于效用的带宽自适应

ACM Trans. Sens. Networks Pub Date : 2012-03-01 DOI: 10.1145/2140522.2140530

S. Eswaran, Archan Misra, Flávio Bergamaschi, T. L. Porta

{"title":"Utility-based bandwidth adaptation in mission-oriented wireless sensor networks","authors":"S. Eswaran, Archan Misra, Flávio Bergamaschi, T. L. Porta","doi":"10.1145/2140522.2140530","DOIUrl":"https://doi.org/10.1145/2140522.2140530","url":null,"abstract":"This article develops a utility-based optimization framework for resource sharing by multiple competing missions in a mission-oriented wireless sensor network (WSN) environment. Prior work on network utility maximization (NUM) based optimization has focused on unicast flows with sender-based utilities in either wireline or wireless networks. In this work, we develop a generalized NUM model to consider three key new features observed in mission-centric WSN environments: i) the definition of the utility of an individual mission (receiver) as a joint function of data from multiple sensor sources; ii) the consumption of each sender's (sensor) data by multiple missions; and iii) the multicast-tree-based dissemination of each sensor's data flow, using link-layer broadcasts to exploit the “wireless broadcast advantage” in data forwarding. We show how a price-based, distributed protocol (WSN-NUM) can ensure optimal and proportionally fair rate allocation across multiple missions, without requiring any coordination among missions or sensors. We also discuss techniques to improve the speed of convergence of the protocol, which is essential in an environment as dynamic as the WSN. Further, we analyze the impact of various network and protocol parameters on the bandwidth utilization of the network, using a discrete-event simulation of a stationary wireless network. Finally, we corroborate our simulation-based performance results of the WSN-NUM protocol with an implementation of an 802.11b network.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131824491","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}

引用次数: 21

Spatiotemporal Models for Data-Anomaly Detection in Dynamic Environmental Monitoring Campaigns 动态环境监测活动中数据异常检测的时空模型

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993045

Ethan W. Dereszynski, Thomas G. Dietterich

{"title":"Spatiotemporal Models for Data-Anomaly Detection in Dynamic Environmental Monitoring Campaigns","authors":"Ethan W. Dereszynski, Thomas G. Dietterich","doi":"10.1145/1993042.1993045","DOIUrl":"https://doi.org/10.1145/1993042.1993045","url":null,"abstract":"The ecological sciences have benefited greatly from recent advances in wireless sensor technologies. These technologies allow researchers to deploy networks of automated sensors, which can monitor a landscape at very fine temporal and spatial scales. However, these networks are subject to harsh conditions, which lead to malfunctions in individual sensors and failures in network communications. The resulting data streams often exhibit incorrect data measurements and missing values. Identifying and correcting these is time-consuming and error-prone. We present a method for real-time automated data quality control (QC) that exploits the spatial and temporal correlations in the data to distinguish sensor failures from valid observations. The model adapts to each deployment site by learning a Bayesian network structure that captures spatial relationships between sensors, and it extends the structure to a dynamic Bayesian network to incorporate temporal correlations. This model is able to flag faulty observations and predict the true values of the missing or corrupt readings. The performance of the model is evaluated on data collected by the SensorScope Project. The results show that the spatiotemporal model demonstrates clear advantages over models that include only temporal or only spatial correlations, and that the model is capable of accurately imputing corrupted values.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134292911","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}

引用次数: 78

Multiple-Target Tracking With Binary Proximity Sensors 基于二元接近传感器的多目标跟踪

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993047

J. Singh, R. Kumar, Upamanyu Madhow, S. Suri, R. Cagley

{"title":"Multiple-Target Tracking With Binary Proximity Sensors","authors":"J. Singh, R. Kumar, Upamanyu Madhow, S. Suri, R. Cagley","doi":"10.1145/1993042.1993047","DOIUrl":"https://doi.org/10.1145/1993042.1993047","url":null,"abstract":"Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of these sensors can provide remarkably good target tracking performance. In this article, we examine the performance of such a sensor network for tracking multiple targets. We begin with geometric arguments that address the problem of counting the number of distinct targets, given a snapshot of the sensor readings. We provide necessary and sufficient criteria for an accurate target count in a one-dimensional setting, and provide a greedy algorithm that determines the minimum number of targets that is consistent with the sensor readings. While these combinatorial arguments bring out the difficulty of target counting based on sensor readings at a given time, they leave open the possibility of accurate counting and tracking by exploiting the evolution of the sensor readings over time. To this end, we develop a particle filtering algorithm based on a cost function that penalizes changes in velocity. An extensive set of simulations, as well as experiments with passive infrared sensors, are reported. We conclude that, despite the combinatorial complexity of target counting, probabilistic approaches based on fairly generic models of trajectories yield respectable tracking performance.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114425858","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}

引用次数: 39

Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks 传感器网络中多分辨率表示的分层空间八卦

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993046

Rik Sarkar, Xianjin Zhu, Jie Gao

{"title":"Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks","authors":"Rik Sarkar, Xianjin Zhu, Jie Gao","doi":"10.1145/1993042.1993046","DOIUrl":"https://doi.org/10.1145/1993042.1993046","url":null,"abstract":"In this article we propose a lightweight algorithm for constructing multiresolution data representations for sensor networks. At each sensor node u, we compute O(log n) aggregates about exponentially enlarging neighborhoods centered at u. The ith aggregate is the aggregated data from nodes approximately within 2i hops of u. We present a scheme, named the hierarchical spatial gossip algorithm, to extract and construct these aggregates, for all sensors simultaneously, with a total communication cost of O(n polylog n). The hierarchical gossip algorithm adopts atomic communication steps with each node choosing to exchange information with a node distance d away with probability ∼ 1/d3. The attractiveness of the algorithm can be attributed to its simplicity, low communication cost, distributed nature, and robustness to node failures and link failures. We show in addition that computing multiresolution aggregates precisely (i.e., each aggregate uses all and only the nodes within 2i hops) requires a communication cost of Ω(n√n), which does not scale well with network size. An approximate range in aggregate computation like that introduced by the gossip mechanism is therefore necessary in a scalable efficient algorithm. Besides the natural applications of multiresolution data summaries in data validation and information mining, we also demonstrate the application of the precomputed multiresolution data summaries in answering range queries efficiently.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129613213","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}

引用次数: 20

MCRT: Multichannel Real-Time Communications in Wireless Sensor Networks 无线传感器网络中的多通道实时通信

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993044

Xiaorui Wang, Xiaodong Wang, Xing Fu, G. Xing

{"title":"MCRT: Multichannel Real-Time Communications in Wireless Sensor Networks","authors":"Xiaorui Wang, Xiaodong Wang, Xing Fu, G. Xing","doi":"10.1145/1993042.1993044","DOIUrl":"https://doi.org/10.1145/1993042.1993044","url":null,"abstract":"As many radio chips used in today’s sensor mote hardware can work at different frequencies, several multichannel communication protocols have recently been proposed to improve network throughput and reduce packet loss for wireless sensor networks. However, existing work cannot utilize multiple channels to provide explicit guarantees for application-specified end-to-end communication delays, which are critical to many real-time applications such as surveillance and disaster response. In this article, we propose MCRT, a multichannel real-time communication protocol that features a flow-based channel allocation strategy. Because of the small number of orthogonal channels available in current mote hardware, MCRT allocates channels to network partitions formed based on many-to-one data flows. To achieve bounded end-to-end communication delay for every data flow, the channel allocation problem has been formulated as a constrained optimization problem and proven to be NP-complete. We then present the design of MCRT, which includes a channel allocation algorithm and a real-time packet forwarding strategy. Extensive simulation results based on a realistic radio model and empirical results on a real hardware testbed of Tmote nodes both demonstrate that MCRT can effectively utilize multiple channels to reduce the number of deadlines missed in end-to-end communications. Our results also show that MCRT outperforms a state-of-the-art real-time protocol and two baseline multichannel communication schemes.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724159","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}

引用次数: 12

Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey 具有移动元素的无线传感器网络中的数据收集:综述

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993049

M. D. Francesco, Sajal K. Das, G. Anastasi

引用次数: 594

Analysis of Deterministic Tracking of Multiple Objects Using a Binary Sensor Network 基于二元传感器网络的多目标确定性跟踪分析

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993050

Yann Busnel, Leonardo Querzoni, R. Baldoni, M. Bertier, Anne-Marie Kermarrec

{"title":"Analysis of Deterministic Tracking of Multiple Objects Using a Binary Sensor Network","authors":"Yann Busnel, Leonardo Querzoni, R. Baldoni, M. Bertier, Anne-Marie Kermarrec","doi":"10.1145/1993042.1993050","DOIUrl":"https://doi.org/10.1145/1993042.1993050","url":null,"abstract":"Let consider a set of anonymous moving objects to be tracked in a binary sensor network. This article studies the problem of associating deterministically a track revealed by the sensor network with the trajectory of an unique anonymous object, namely the multiple object tracking and identification (MOTI) problem. In our model, the network is represented by a sparse connected graph where each vertex represents a binary sensor and there is an edge between two sensors if an object can pass from one sensed region to another one without activating any other sensor. The difficulty of MOTI lies in the fact that the trajectories of two or more objects can be so close that the corresponding tracks on the sensor network can no longer be distinguished (track merging), thus confusing the deterministic association between an object trajectory and a track.\u0000 The article presents several results. We first show that MOTI cannot be solved on a general graph of ideal binary sensors even by an omniscient external observer if all the objects can freely move on the graph. Then we describe restrictions that can be imposed a priori either on the graph, on the object movements, or on both, to make the MOTI problem always solvable. In the absence of an omniscient observer, we show how our results can lead to the definition of distributed algorithms that are able to detect when the system is in a state where MOTI becomes unsolvable.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117036340","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}

引用次数: 15

Path Planning of Data Mules in Sensor Networks 传感器网络中数据骡子路径规划

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993043

Ryo Sugihara, Rajesh K. Gupta

{"title":"Path Planning of Data Mules in Sensor Networks","authors":"Ryo Sugihara, Rajesh K. Gupta","doi":"10.1145/1993042.1993043","DOIUrl":"https://doi.org/10.1145/1993042.1993043","url":null,"abstract":"We study the problem of planning the motion of “data mules” for collecting the data from stationary sensor nodes in wireless sensor networks. Use of data mules significantly reduces energy consumption at sensor nodes compared to commonly used multihop forwarding approaches, but has a drawback in that it increases the latency of data delivery. Optimizing the motion of data mules, including path and speed, is critical for improving the data delivery latency and making the data mule approach more useful in practice. In this article, we focus on the path selection problem: finding the optimal path of data mules so that the data delivery latency can be minimized. We formulate the path selection problem as a graph problem that is capable of expressing the benefit from larger communication range. The problem is NP-hard and we present approximation algorithms for both single-data mule case and multiple-data mules case. We further consider the case in which we have only partial knowledge of communication range, where we design semionline algorithms that improve the offline plan using online knowledge at runtime. Simulation experiments on Matlab and ns2 demonstrate that our offline and semionline algorithms produce significantly shorter path lengths and data delivery latency compared to previously proposed methods, suggesting that controlled mobility can be exploited much more effectively.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115916127","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}

引用次数: 119

PDA: Privacy-Preserving Data Aggregation for Information Collection PDA:保护隐私的信息收集数据聚合

ACM Trans. Sens. Networks Pub Date : 2011-08-01 DOI: 10.1145/1993042.1993048

Wenbo He, Xue Liu, Hoang Nguyen, K. Nahrstedt, T. Abdelzaher

引用次数: 47

Energy-efficient congestion detection and avoidance in sensor networks 传感器网络中节能拥塞检测与避免

ACM Trans. Sens. Networks Pub Date : 2011-02-01 DOI: 10.1145/1921621.1921626

Chieh-Yih Wan, S. Eisenman, A. Campbell

{"title":"Energy-efficient congestion detection and avoidance in sensor networks","authors":"Chieh-Yih Wan, S. Eisenman, A. Campbell","doi":"10.1145/1921621.1921626","DOIUrl":"https://doi.org/10.1145/1921621.1921626","url":null,"abstract":"Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the distribution and rate of packet sources in the network. It is during these periods of event impulses that the likelihood of congestion is greatest and the information in transit of most importance to users. To address this challenge we propose an energy-efficient congestion control scheme for sensor networks called CODA (COngestion Detection and Avoidance) that comprises three mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multisource regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define three important performance metrics (i.e., energy tax, fidelity penalty, and power) to evaluate the impact of CODA on the performance of sensing applications. We discuss the performance benefits and practical engineering challenges of implementing CODA in an experimental sensor network testbed based on Berkeley motes using CSMA. Simulation results indicate that CODA significantly improves the performance of data dissemination applications such as directed diffusion by mitigating hotspots, and reducing the energy tax and fidelity penalty on sensing applications. We also demonstrate that CODA is capable of responding to a number of congestion scenarios that we believe will be prevalent as the deployment of these networks accelerates.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116989488","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}

引用次数: 82