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

Road-RFSense: A Practical RF Sensing--Based Road Traffic Estimation System for Developing Regions Road- rfsense:一种实用的基于射频传感的发展中地区道路交通估计系统

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2560189

Rijurekha Sen, Abhinav K. Maurya, B. Raman, Rupesh Mehta, R. Kalyanaraman, Amarjeet Singh

{"title":"Road-RFSense: A Practical RF Sensing--Based Road Traffic Estimation System for Developing Regions","authors":"Rijurekha Sen, Abhinav K. Maurya, B. Raman, Rupesh Mehta, R. Kalyanaraman, Amarjeet Singh","doi":"10.1145/2560189","DOIUrl":"https://doi.org/10.1145/2560189","url":null,"abstract":"An unprecedented rate of growth in the number of vehicles has resulted in acute road congestion problems worldwide, especially in many developing countries. In this article, we present Road-RFSense, a practical RF sensing--based road traffic estimation system for developing regions. Our first contribution is a new mechanism to sense road occupancy, based on variation in RF link characteristics, when line of sight between a transmitter-receiver pair is obstructed. We design algorithms to classify traffic states into two classes, free-flow versus congested, at timescales of 20 seconds with greater than 90% accuracy.\u0000 We also present a traffic queue length measurement system, where a network of RF sensors can correlate the traffic state classification decisions of individual sensors and detect traffic queue length in real time. Deployment of our system on a Mumbai road gives correct estimates, validated against 9 hours of image-based ground truth. Our third contribution is a large-scale data-driven study, in collaboration with city traffic authorities, to answer questions regarding road-specific classification model training. Finally, we explore multilevel classification into seven different traffic states using a larger set of RF-based features and careful choice of classification algorithms.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124385648","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}

引用次数: 6

Theory and Algorithm of Estimating Energy Consumption Breakdowns using ON/OFF State Sensing 基于开/关状态感知的能耗击穿估计理论与算法

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2630880

Deokwoo Jung, A. Savvides

{"title":"Theory and Algorithm of Estimating Energy Consumption Breakdowns using ON/OFF State Sensing","authors":"Deokwoo Jung, A. Savvides","doi":"10.1145/2630880","DOIUrl":"https://doi.org/10.1145/2630880","url":null,"abstract":"This article considers a problem of periodically estimating energy consumption breakdowns for main appliances inside building using a single power meter and the knowledge of the ON/OFF states of individual appliances. In the first part of this article, we formulate the problem as a constrained convex optimization problem with tunable parameters. Then we propose an online algorithm that adaptively determines the optimization parameters to robustly estimate the breakdown information. The proposed solution is evaluated by experiment using a scaled-down proof-of-concept prototype with real measurements. In the second part, we provide detailed analysis to understand the performance of our proposed algorithm. We first develop a stochastic model to describe evolution of appliances’ ON/OFF states using continuous-time Markov chain. Then we derive analytical bounds of estimation error and the probability of a rank-deficient binary matrix. Those analytical bounds are verified by extensive simulations. Finally, we study the effect of collinearity of binary data matrix on estimation performance. Simulation results suggest that our algorithm is robust against the collinearity of binary dataset.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257166","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}

引用次数: 3

Energy-Balanced Scheduling for Target Tracking in Wireless Sensor Networks 无线传感器网络中目标跟踪的能量平衡调度

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2629596

Xiaoqing Hu, Y. Hu, Bugong Xu

{"title":"Energy-Balanced Scheduling for Target Tracking in Wireless Sensor Networks","authors":"Xiaoqing Hu, Y. Hu, Bugong Xu","doi":"10.1145/2629596","DOIUrl":"https://doi.org/10.1145/2629596","url":null,"abstract":"A novel energy-balanced task-scheduling method is proposed that extends the lifespan of wireless sensor networks (WSNs) for collaborative target tracking using an unscented Kalman filter (UKF) algorithm. It is shown that the tracking accuracy is approximately proportional to the number of active sensor nodes participating in collaborative tracking. Excessive sensor nodes thus may be put to sleep mode to conserve energy provided there are a sufficient number of active sensor nodes. It is then shown that the lifespan of a WSN is dictated by the distribution of residue energy of sensor nodes. Specifically, we have shown that an energy-balanced WSN is likely to maximize its lifespan. As such, at each step of the tracking task, the head node must judiciously select active nodes from all sensors within the sensing range to minimize residue energy variations (energy balanced) while achieving desired tracking accuracy. This is formulated as a subset selection problem, which is shown to have a complexity that is NP-hard. Several energy-balanced scheduling for tracking (EBaST) heuristic algorithms are proposed to solve this problem with polynomial execution complexities. Extensive simulations have been conducted to compare EBaST against some state-of-the-art scheduling algorithms. It is observed that EBaST is more capable of significantly extending the WSNs lifespan than competing algorithms while delivering comparable or better tracking accuracy.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128465571","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}

引用次数: 29

A Novel Algorithm for Distributed Localization in Wireless Sensor Networks 一种新的无线传感器网络分布式定位算法

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2632150

M. Naraghi-Pour, Gustavo Chacon Rojas

{"title":"A Novel Algorithm for Distributed Localization in Wireless Sensor Networks","authors":"M. Naraghi-Pour, Gustavo Chacon Rojas","doi":"10.1145/2632150","DOIUrl":"https://doi.org/10.1145/2632150","url":null,"abstract":"We present a novel algorithm for localization of Wireless Sensor Networks (WSNs) called Distributed Randomized Gradient Descent (DRGD) and prove that in the case of noise-free distance measurements, the algorithm converges and provides the true location of the nodes. For noisy distance measurements, the convergence properties of DRGD are discussed and an error bound on the location estimation error is obtained. In contrast to several recently proposed methods, DRGD does not require that the blind nodes be contained in the convex hull of the anchor nodes, and it can accurately localize the network with only a few anchors. Performance of DRGD is evaluated through extensive simulations and compared with three other algorithms, namely, the relaxation-based Second-Order Cone Programming (SOCP), the Simulated Annealing (SA), and the Semi-Definite Programing (SDP). Similar to DRGD, SOCP and SA are distributed algorithms, whereas SDP is centralized. The results show that DRGD successfully localizes the nodes in all the cases, whereas in many cases SOCP and SA fail. Finally, we present a modification of DRGD for mobile WSNs and demonstrate the efficacy of DRGD for localization of mobile networks with several simulation results.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124751867","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}

引用次数: 48

A Learning-Based Approach to Confident Event Detection in Heterogeneous Sensor Networks 基于学习的异构传感器网络自信事件检测方法

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2575788

Matthew Keally, Gang Zhou, G. Xing, David T. Nguyen, Xin Qi

{"title":"A Learning-Based Approach to Confident Event Detection in Heterogeneous Sensor Networks","authors":"Matthew Keally, Gang Zhou, G. Xing, David T. Nguyen, Xin Qi","doi":"10.1145/2575788","DOIUrl":"https://doi.org/10.1145/2575788","url":null,"abstract":"Wireless sensor network applications, such as those for natural disaster warning, vehicular traffic monitoring, and surveillance, have stringent accuracy requirements for detecting or classifying events and demand long system lifetimes. Through quantitative study, we show that existing event detection approaches are challenged to explore the sensing capability of a deployed system and choose the right sensors to meet user-specified accuracy. Event detection systems are also challenged to provide a generic system that efficiently adapts to environmental dynamics and works easily with a range of applications, machine learning approaches, and sensor modalities. Consequently, we propose Watchdog, a modality-agnostic event detection framework that clusters the right sensors to meet user-specified detection accuracy during runtime while significantly reducing energy consumption. Watchdog can use different machine learning techniques to learn the sensing capability of a heterogeneous sensor deployment and meet accuracy requirements. To address environmental dynamics and ensure energy savings, Watchdog wakes up and puts to sleep sensors as needed to meet user-specified accuracy. Through evaluation with real vehicle detection trace data and a building traffic monitoring testbed of IRIS motes, we demonstrate the superior performance of Watchdog over existing solutions in terms of meeting user-specified detection accuracy, energy savings, and environmental adaptability.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"66 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126395994","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}

引用次数: 9

Perpetual Data Collection with Energy-Harvesting Sensor Networks 能量收集传感器网络的永久数据收集

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2566675

C. Renner, Stefan Unterschütz, V. Turau, K. Römer

引用次数: 47

Building Maximum Lifetime Shortest Path Data Aggregation Trees in Wireless Sensor Networks 无线传感器网络中最大生存期最短路径数据聚合树的构建

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2629662

M. Shan, Guihai Chen, Dijun Luo, Xiaojun Zhu, Xiaobing Wu

引用次数: 66

Distributed Separate Coding for Continuous Data Collection in Wireless Sensor Networks 无线传感器网络中用于连续数据收集的分布式分离编码

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2629658

Xiucai Ye, Jie Li, Li Xu

{"title":"Distributed Separate Coding for Continuous Data Collection in Wireless Sensor Networks","authors":"Xiucai Ye, Jie Li, Li Xu","doi":"10.1145/2629658","DOIUrl":"https://doi.org/10.1145/2629658","url":null,"abstract":"In this article, we present a novel distributed separate coding (DSC) scheme for continuous data collection in wireless sensor networks with a mobile base station (mBS). By separately encoding a certain number of data segments in a combined segment and doing decoding-free data replacement in the buffers of each sensor node, the DSC scheme is shown as an efficient method for continuously collecting data segments with a high success ratio. The proposed DSC scheme has a salient feature: with a minimum buffer size 2 in each sensor node, by querying any m−1 sensor nodes, the mBS can reconstruct the m latest data segments with high probability, where m is the number of latest data segments in a time interval t in which n(t) (m≤ n(t)) data segments are generated. The necessary storage space in each sensor node can be adjusted by changing the number of sensor nodes queried by the mBS. Furthermore, the transmission cost for data submission to the mBS can be reduced with some additional storage space in each sensor node. The comprehensive performance evaluation has been conducted through computer simulation. It is shown that the proposed DSC scheme outperforms the existing scheme significantly.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695279","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}

引用次数: 14

Smart Blueprints: How Simple Sensors Can Collaboratively Map Out Their Own Locations in the Home 智能蓝图:简单的传感器如何协同绘制自己在家中的位置

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2629441

Jiakang Lu, Yamina Taskin Shams, K. Whitehouse

{"title":"Smart Blueprints: How Simple Sensors Can Collaboratively Map Out Their Own Locations in the Home","authors":"Jiakang Lu, Yamina Taskin Shams, K. Whitehouse","doi":"10.1145/2629441","DOIUrl":"https://doi.org/10.1145/2629441","url":null,"abstract":"Off-the-shelf home automation technology is making it easier than ever for people to convert their own homes into smart homes. However, manual configuration is tedious and error-prone. In this article, we present and compare a family of solutions that automatically generate a map of the home and the devices within it using data from the smart home sensors themselves (e.g., light and motion sensors). These solutions can be used to automatically configure home automation systems or to automatically produce an intuitive map-like interface for visualizing sensor data and interacting with controllers. We call our approach Smart Blueprints because it automatically maps out the unique configuration of each smart home. We demonstrate the Smart Blueprints using a variety of sensor combinations, including light sensors, motion sensors, and magnetometers deployed on the doors and/or windows of the home. For evaluation of each combination on sensor-map generation, we deployed more than 200 sensors in seven different houses at different locations and compared the ability to use a variety of techniques to map out the configuration. We show that, in almost all houses, our system can automatically narrow the configuration down to 1--5 candidates per home using only one week of collected data.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134201259","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}

引用次数: 5

Barrier Coverage by Sensors with Adjustable Ranges 可调范围传感器的屏障覆盖

ACM Trans. Sens. Networks Pub Date : 2014-11-07 DOI: 10.1145/2629518

Haosheng Fan, Minming Li, Xianwei Sun, P. Wan, Yingchao Zhao

{"title":"Barrier Coverage by Sensors with Adjustable Ranges","authors":"Haosheng Fan, Minming Li, Xianwei Sun, P. Wan, Yingchao Zhao","doi":"10.1145/2629518","DOIUrl":"https://doi.org/10.1145/2629518","url":null,"abstract":"One of the most fundamental tasks of wireless sensor networks is to provide coverage of the deployment region. We study the coverage of a line interval with a set of wireless sensors with adjustable coverage ranges. Each coverage range of a sensor is an interval centered at that sensor whose length is decided by the power the sensor chooses. The objective is to find a range assignment with the minimum cost. There are two variants of the optimization problem. In the discrete variant, each sensor can only choose from a finite set of powers, whereas in the continuous variant, each sensor can choose power from a given interval. For the discrete variant of the problem, a polynomial-time exact algorithm is designed. For the continuous variant of the problem, NP-hardness of the problem is proved and followed by an ILP formulation. Then, constant-approximation algorithms are designed when the cost for all sensors is proportional to rκ for some constant κ ≥ 1, where r is the covering radius corresponding to the chosen power. Specifically, if κ = 1, we give a 1.25-approximation algorithm and a fully polynomial-time approximation scheme; if κ > 1, we give a 2-approximation algorithm. We also show that the approximation analyses are tight.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131474173","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}

引用次数: 36