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

On the Performance of Lossy Compression Schemes for Energy Constrained Sensor Networking 能量受限传感器网络中有损压缩方案的性能研究

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

D. Zordan, Borja Martínez, I. Vilajosana, M. Rossi

{"title":"On the Performance of Lossy Compression Schemes for Energy Constrained Sensor Networking","authors":"D. Zordan, Borja Martínez, I. Vilajosana, M. Rossi","doi":"10.1145/2629660","DOIUrl":"https://doi.org/10.1145/2629660","url":null,"abstract":"Lossy temporal compression is key for energy-constrained wireless sensor networks (WSNs), where the imperfect reconstruction of the signal is often acceptable at the data collector, subject to some maximum error tolerance. In this article, we evaluate a number of selected lossy compression methods from the literature and extensively analyze their performance in terms of compression efficiency, computational complexity, and energy consumption. Specifically, we first carry out a performance evaluation of existing and new compression schemes, considering linear, autoregressive, FFT-/DCT- and wavelet-based models , by looking at their performance as a function of relevant signal statistics. Second, we obtain formulas through numerical fittings to gauge their overall energy consumption and signal representation accuracy. Third, we evaluate the benefits that lossy compression methods bring about in interference-limited multihop networks, where the channel access is a source of inefficiency due to collisions and transmission scheduling. Our results reveal that the DCT-based schemes are the best option in terms of compression efficiency but are inefficient in terms of energy consumption. Instead, linear methods lead to substantial savings in terms of energy expenditure by, at the same time, leading to satisfactory compression ratios, reduced network delay, and increased reliability performance.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"33 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":"116193437","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}

引用次数: 94

Efficient High-Rate Secret Key Extraction in Wireless Sensor Networks Using Collaboration 基于协作的无线传感器网络高效高速率密钥提取

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

S. N. Premnath, J. Croft, Neal Patwari, S. Kasera

{"title":"Efficient High-Rate Secret Key Extraction in Wireless Sensor Networks Using Collaboration","authors":"S. N. Premnath, J. Croft, Neal Patwari, S. Kasera","doi":"10.1145/2541289","DOIUrl":"https://doi.org/10.1145/2541289","url":null,"abstract":"Secret key establishment is a fundamental requirement for private communication between two entities. In this article, we propose and evaluate a new approach for secret key extraction where multiple sensors collaborate in exchanging probe packets and collecting channel measurements. Essentially, measurements from multiple channels have a substantially higher differential entropy compared to the measurements from a single channel, thereby resulting in more randomness in the information source for key extraction, and this in turn produces stronger secret keys. We also explore the fundamental trade-off between the quadratic increase in the number of measurements of the channels due to multiple nodes per group versus a linear reduction in the sampling rate and a linear increase in the time gap between bidirectional measurements. To experimentally evaluate collaborative secret key extraction in wireless sensor networks, we first build a simple yet flexible testbed with multiple TelosB sensor nodes. Next, we perform large-scale experiments with different configurations of collaboration. Our experiments show that in comparison to the 1 × 1 configuration, collaboration among sensor nodes significantly increases the secret bit extraction per second, per probe, as well as per millijoule of transmission energy. In addition, we show that the collaborating nodes can improve the performance further when they exploit both space and frequency diversities.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"128 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":"123106152","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}

引用次数: 25

Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks 太阳能无线传感器网络的分布式最优字典最大最小速率分配

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

Shusen Yang, J. Mccann

{"title":"Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks","authors":"Shusen Yang, J. Mccann","doi":"10.1145/2630882","DOIUrl":"https://doi.org/10.1145/2630882","url":null,"abstract":"Understanding the optimal usage of fluctuating renewable energy in wireless sensor networks (WSNs) is complex. Lexicographic max-min (LM) rate allocation is a good solution but is nontrivial for multihop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all possible forwarding routes in the network. All current optimal approaches to this problem are centralized and offline, suffering from low scalability and large computational complexity—typically solving O(N2) linear programming problems for N-node WSNs. This article presents the first optimal distributed solution to this problem with much lower complexity. We apply it to solar-powered wireless sensor networks (SP-WSNs) to achieve both LM optimality and sustainable operation. Based on realistic models of both time-varying solar power and photovoltaic-battery hardware, we propose an optimization framework that integrates a local power management algorithm with a global distributed LM rate allocation scheme. The optimality, convergence, and efficiency of our approaches are formally proven. We also evaluate our algorithms via experiments on both solar-powered MICAz motes and extensive simulations using real solar energy data and practical power parameter settings. The results verify our theoretical analysis and demonstrate how our approach outperforms both the state-of-the-art centralized optimal and distributed heuristic solutions.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"22 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":"133851967","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}

引用次数: 25

Placing Sensors for Area Coverage in a Complex Environment by a Team of Robots 机器人团队在复杂环境中放置传感器以覆盖区域

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

Xu Li, Greg Fletcher, A. Nayak, I. Stojmenovic

{"title":"Placing Sensors for Area Coverage in a Complex Environment by a Team of Robots","authors":"Xu Li, Greg Fletcher, A. Nayak, I. Stojmenovic","doi":"10.1145/2632149","DOIUrl":"https://doi.org/10.1145/2632149","url":null,"abstract":"Existing solutions to carrier-based sensor placement by a single robot in a bounded unknown Region of Interest (ROI) do not guarantee full area coverage or termination. We propose a novel localized algorithm, named Back-Tracking Deployment (BTD). To construct a full coverage solution over the ROI, mobile robots (carriers) carry static sensors as payloads and drop them at the visited empty vertices of a virtual square, triangular, or hexagonal grid. A single robot will move in a predefined order of directional preference until a dead end is reached. Then it back-tracks to the nearest sensor adjacent to an empty vertex (an “entrance” to an unexplored/uncovered area) and resumes regular forward movement and sensor dropping from there. To save movement steps, the back-tracking is carried out along a locally identified shortcut. We extend the algorithm to support multiple robots that move independently and asynchronously. Once a robot reaches a dead end, it will back-track, giving preference to its own path. Otherwise, it will take over the back-track path of another robot by consulting with neighboring sensors. We prove that BTD terminates within finite time and produces full coverage when no (sensor or robot) failures occur. We also describe an approach to tolerate failures and an approach to balance workload among robots. We then evaluate BTD in comparison with the only competing algorithms SLD [Chang et al. 2009a] and LRV [Batalin and Sukhatme 2004] through simulation. In a specific failure-free scenario, SLD covers only 40--50% of the ROI, whereas BTD covers it in full. BTD involves significantly (80%) less robot moves and messages than LRV.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"51 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":"125346581","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}

引用次数: 23

A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor Networks 面向大规模无线传感器网络的低拉伸保证轻量级地理路由协议

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

M. Won, R. Stoleru

{"title":"A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor Networks","authors":"M. Won, R. Stoleru","doi":"10.1145/2629659","DOIUrl":"https://doi.org/10.1145/2629659","url":null,"abstract":"Geographic routing is well suited for large-scale wireless sensor networks (WSNs) because it is nearly stateless. One important challenge is that network holes may arbitrarily increase the routing path length. Fortunately, recent studies have shown that constant path stretch is achievable using nonlocal information. The constant stretch, however, is possible at the cost of high communication and storage overhead: a source node must complete a “path-setup” process prior to data transmission by exchanging a message with a destination node using a default geographic routing (e.g., GPSR). In this article, we propose the first geographic routing protocol (LVGR) that provably achieves worst-case stretch of Θ (D/γ) (where D is the diameter of the network and γ is the communication range of nodes) with low communication and storage overhead. LVGR represents a hole as a convex hull, the internal structure of which is represented as a local visibility graph. Based on the convex hulls and local visibility graphs, LVGR generates paths with guaranteed stretch. Through theoretical analysis and extensive simulations, we prove the worst-case stretch of LVGR and demonstrate that LVGR reduces communication overhead by up to 97% and storage overhead by up to 60%, compared with the state of the art.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"12 4 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":"116732523","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

Advanced Principal Component-Based Compression Schemes for Wireless Sensor Networks 无线传感器网络中基于主成分的高级压缩方案

ACM Trans. Sens. Networks Pub Date : 2014-07-28 DOI: 10.1145/2629330

C. Anagnostopoulos, S. Hadjiefthymiades

引用次数: 26

Analysis of a prioritized contention model for multimedia wireless sensor networks 多媒体无线传感器网络的优先竞争模型分析

ACM Trans. Sens. Networks Pub Date : 2014-01-31 DOI: 10.1145/2530527

M. Y. Donmez, Sinan Isik, Cem Ersoy

引用次数: 10

Multicamera video summarization and anomaly detection from activity motifs 基于活动主题的多摄像机视频摘要与异常检测

ACM Trans. Sens. Networks Pub Date : 2014-01-31 DOI: 10.1145/2530285

C. D. Leo, B. S. Manjunath

{"title":"Multicamera video summarization and anomaly detection from activity motifs","authors":"C. D. Leo, B. S. Manjunath","doi":"10.1145/2530285","DOIUrl":"https://doi.org/10.1145/2530285","url":null,"abstract":"Camera network systems generate large volumes of potentially useful data, but extracting value from multiple, related videos can be a daunting task for a human reviewer. Multicamera video summarization seeks to make this task more tractable by generating a reduced set of output summary videos that concisely capture important portions of the input set. We present a system that approaches summarization at the level of detected activity motifs and shortens the input videos by compacting the representation of individual activities. Additionally, redundancy is removed across camera views by omitting from the summary activity occurrences that can be predicted by other occurrences. The system also detects anomalous events within a unified framework and can highlight them in the summary. Our contributions are a method for selecting useful parts of an activity to present to a viewer using activity motifs and a novel framework to score the importance of activity occurrences and allow transfer of importance between temporally related activities without solving the correspondence problem. We provide summarization results for a two camera network, an eleven camera network, and data from PETS 2001. We also include results from Amazon Mechanical Turk human experiments to evaluate how our visualization decisions affect task performance.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121664436","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}

引用次数: 26

Adaptive k-coverage contour evaluation and deployment in wireless sensor networks 无线传感器网络中的自适应k-覆盖等高线评估与部署

ACM Trans. Sens. Networks Pub Date : 2013-07-23 DOI: 10.1145/2489253.2489257

J. Sheu, Guey-Yun Chang, Shan-Hung Wu, Yen-Ting Chen

引用次数: 8

Managing software evolution in large-scale wireless sensor and actuator networks 管理大规模无线传感器和执行器网络中的软件进化

ACM Trans. Sens. Networks Pub Date : 2013-07-01 DOI: 10.1145/2489253.2489271

Barry Porter, G. Coulson, U. Roedig

{"title":"Managing software evolution in large-scale wireless sensor and actuator networks","authors":"Barry Porter, G. Coulson, U. Roedig","doi":"10.1145/2489253.2489271","DOIUrl":"https://doi.org/10.1145/2489253.2489271","url":null,"abstract":"Wireless sensor and actuator networks (WSANs) will increasingly require support for managed software evolution: that is, systematic, ongoing, efficient and nondisruptive means of updating the software running on the nodes of a WSAN. While aspects of this requirement have been examined in the literature, the big picture remains largely untouched, resulting in the generally static WSAN deployments we see today. In this article, we propose a comprehensive approach to managed software evolution. Our approach has the following key features: (i) it supports divergent evolution of the WSAN's software, such that different nodes can evolve along different lines (e.g., to meet the needs of different stakeholders, or to address localized adaptations) and (ii) it supports both instructed and autonomous evolution such that nodes can be instructed to change their software configuration or can evolve their own configuration (e.g., to manage rapidly-changing environmental conditions where remote micromanagement would be infeasible due to the high latency of the WSAN environment). We present the four intra-WSAN protocols that comprise our solution, along with an accompanying server-side infrastructure, and evaluate our approach at scale.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115222331","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}

引用次数: 2