{"title":"Trade-off between energy efficiency and report validity for mobile sensor networks","authors":"Huai-Lei Fu, P. Lin, Yuguang Fang, Ting-Yu Wang","doi":"10.1145/2489253.2489266","DOIUrl":"https://doi.org/10.1145/2489253.2489266","url":null,"abstract":"Mobile sensor networks (MSNs) have been widely deployed to provide a ubiquitous solution to real-time monitoring applications such as traffic data collection in vehicular ad-hoc networks (VANETs), ocean data collection in underwater sensor networks (UWSNs), and biodata collection in wireless body area networks (WBANs). One major issue for designing MSNs is the energy-validity trade-off, that is, the trade-off between the energy efficiency for mobile sensors (MSs) and the validity of sensing reports. In this article, we propose a novel mechanism, Energy-Efficient Distributedly Controlled Reporting (E2DCR), to mitigate the energy consumption for MSs in real-time monitoring applications while keeping the sensing report valid. In this mechanism, we design dynamic sleeping adjustment (DSA) algorithms to adjust an MS's sleeping period using a heuristic method to reduce energy consumption. We provide analytical models to evaluate the performance of E2DCR in terms of the power savings and report validity. It has been shown that with E2DCR, MSs can report with less energy consumption while satisfying delay constraints for real-time monitoring applications.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"5 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":"130769281","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":"Capacity- and energy-aware activation of sensor nodes for area phenomenon reproduction using wireless network transport","authors":"Xiaolong Huang, I. Rubin","doi":"10.1145/2489253.2489269","DOIUrl":"https://doi.org/10.1145/2489253.2489269","url":null,"abstract":"We consider a sensor network involving sensors placed in specific locations. An area phenomenon is detected and tracked by activated sensors. The area phenomenon is modeled to consist of K spatially distributed point phenomena. The activated sensors collect data samples characterizing the parameters of the involved point phenomena. They compress observed data readings and transport them to a processing center. The center processes the received data to derive estimates of the point phenomena's parameters. Our sensing stochastic process models account for distance-dependent observation noise perturbations as well as noise correlations. At the processing center, sample mean calculations are used to derive the estimates of the underlying area phenomenon's parameters. We develop computationally efficient algorithms to determine the specific set of sensors for activation under capacity and energy resource constraints so that a sufficiently low reproduction distortion level is attained. We derive lower bounds on the realizable levels of the distortion measure. Using illustrative cases, we demonstrate one of our algorithms to yield distortion levels that are very close to the lower bound, while other lower-complexity schemes often yield distortion levels relatively close to the lower bound.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"43 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":"130139784","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}
C. Alippi, R. Camplani, C. Galperti, A. Marullo, M. Roveri
{"title":"A high-frequency sampling monitoring system for environmental and structural applications","authors":"C. Alippi, R. Camplani, C. Galperti, A. Marullo, M. Roveri","doi":"10.1145/2489253.2489258","DOIUrl":"https://doi.org/10.1145/2489253.2489258","url":null,"abstract":"High-frequency sampling is not only a prerogative of high-energy physics or machinery diagnostic monitoring: critical environmental and structural health monitoring applications also have such a challenging constraint. Moreover, such unique design constraints are often coupled with the requirement of high synchronism among the distributed acquisition units, minimal energy consumption, and large communication bandwidth. Such severe constraints have led scholars to suggest wired centralized monitoring solutions, which have only recently been complemented with wireless technologies. This article suggests a hybrid wireless-wired monitoring system combining the advantages of wireless and wired technologies within a distributed high-frequency-sampling framework. The suggested architecture satisfies the mentioned constraints, thanks to an ad-hoc design of the hardware, the availability of efficient energy management policies, and up-to-date harvesting mechanisms. At the same time, the architecture supports adaptation capabilities by relying on the remote reprogrammability of key application parameters. The proposed architecture has been successfully deployed in the Swiss-Italian Alps to monitor the collapse of rock faces in three geographical areas.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"11 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":"129350658","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":"Coverage algorithms for visual sensor networks","authors":"Vikram P. Munishwar, N. Abu-Ghazaleh","doi":"10.1145/2489253.2489262","DOIUrl":"https://doi.org/10.1145/2489253.2489262","url":null,"abstract":"Visual sensor networks (VSNs) are becoming increasingly popular in a number of application domains. A distinguishing characteristic of VSNs is to self-configure to minimize the need for operator control and to improve scalability. One of the areas of self-configuration is camera coverage control that is, how should cameras adjust their field-of-views to cover maximum targets? This is an NP-hard problem. We show that the existing heuristics have a number of weaknesses that influence both coverage and overhead. Therefore, we first propose a computationally efficient centralized heuristic that provides near-optimal coverage for small-scale networks. However, it requires significant communication and computation overhead, making it unsuitable for large-scale networks. Thus, we develop a distributed algorithm that outperforms the existing distributed algorithm with lower communication overhead, at the cost of coverage accuracy. We show that the proposed heuristics guarantee to cover at least half of the targets covered by the optimal solution. Finally, to gain benefits of both centralized and distributed algorithms, we propose a hierarchical algorithm where cameras are decomposed into neighborhoods that coordinate their coverage using an elected local coordinator. We observe that the hierarchical algorithm provides scalable near-optimal coverage with networking cost significantly less than that of centralized and distributed solutions.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"111 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":"115738572","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":"Cell-based snapshot and continuous data collection in wireless sensor networks","authors":"S. Ji, Jing He, A. Uluagac, R. Beyah, Yingshu Li","doi":"10.1145/2489253.2489264","DOIUrl":"https://doi.org/10.1145/2489253.2489264","url":null,"abstract":"Data collection is a common operation of wireless sensor networks (WSNs). The performance of data collection can be measured by its achievable network capacity. However, most existing works focus on the network capacity of unicast, multicast or/and broadcast. In this article, we study the snapshot/continuous data collection (SDC/CDC) problem under the physical interference model for randomly deployed dense WSNs. For SDC, we propose a Cell-Based Path Scheduling (CBPS) algorithm based on network partitioning. Theoretical analysis shows that its achievable network capacity is order-optimal. For CDC, a novel Segment-Based Pipeline Scheduling (SBPS) algorithm is proposed which combines the pipeline technique and the compressive data gathering technique. Theoretical analysis shows that SBPS significantly speeds up the CDC process and achieves a high network capacity.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"2016 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":"133864824","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":"Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks","authors":"Kanthakumar Pongaliur, Li Xiao","doi":"10.1145/2489253.2489267","DOIUrl":"https://doi.org/10.1145/2489253.2489267","url":null,"abstract":"Securing a sensor network poses a variety of problems. Of those, an important one is of providing privacy to the event-detecting sensor node and integrity to the data gathered by the node. Compromised source privacy can inadvertently leak event location. Safeguarding the privacy of the source node is important, as sensor networks hold critical roles in military application, tracking endangered species, etc. Existing techniques in sensor networks use either random walk path or generate fake event packets to make it hard for an adversary to trace back to the source, since encryption alone may not help prevent a traffic analysis attack. In this work, without using traditional overhead-intensive methods, we present a scheme for hiding source information using cryptographic techniques incurring lower overhead. The packet is modified en route by dynamically selected nodes to make it difficult for a malicious entity to trace back the packet to a source node and also to prevent packet spoofing. This is important because the adversary model considers a super-local eavesdropper having the ability to compromise sensor nodes. Additionally, we provide a method for the base station to recover corrupted packets and identify the location of the compromised node. We analyze the ability of our proposed scheme to withstand different attacks and demonstrate its efficiency in terms of overhead and functionality when compared to existing work.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"16 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":"121466001","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}
V. Sundaram, P. Eugster, X. Zhang, Vamsidhar Addanki
{"title":"Diagnostic tracing for wireless sensor networks","authors":"V. Sundaram, P. Eugster, X. Zhang, Vamsidhar Addanki","doi":"10.1145/2489253.2489255","DOIUrl":"https://doi.org/10.1145/2489253.2489255","url":null,"abstract":"Wireless sensor networks are typically deployed in harsh environments, thus post-deployment failures are not infrequent. An execution trace containing events in their order of execution could play a crucial role in postmortem diagnosis of these failures. Obtaining such a trace however is challenging due to stringent resource constraints. We propose an efficient approach to intraprocedural and interprocedural control-flow tracing that generates traces of all interleaving concurrent events and of the control-flow paths taken inside those events. We demonstrate the effectiveness of our approach with the help of case studies and illustrate its low overhead through measurements and simulations.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"222 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":"122401207","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":"A game theory distributed approach for energy optimization in WSNs","authors":"A. Abrardo, Lapo Balucanti, A. Mecocci","doi":"10.1145/2489253.2489261","DOIUrl":"https://doi.org/10.1145/2489253.2489261","url":null,"abstract":"One of the major sources of energy waste in wireless sensor networks (WSNs) is idle listening, that is, the cost of actively listening for potential packets. This article focuses on reducing idle-listening time via a dynamic duty-cycling technique which aims at optimizing the sleep interval between consecutive wake-ups. We considered a receiver-initiated MAC method for WSNs in which the sender waits for a beacon signal from the receiver before starting to transmit. Since each sender receives beacon signals from several nodes, the data are routed on multiple paths in a data collection network. In this context, we propose an optimization framework for minimizing the energy waste of the most power-hungry node of the network. To this aim, we first derive an analytic model that predicts nodes' energy consumption. Then, we use the model to derive a distributed optimization technique. Simulation results via NS-2 simulator are included to illustrate the accuracy of the model, and numerical results assess the validity of the proposed scheme.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"107 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":"125016480","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":"Distributed lifetime-maximized target coverage game","authors":"Li-Hsing Yen, Che-Ming Lin, Victor C. M. Leung","doi":"10.1145/2489253.2489263","DOIUrl":"https://doi.org/10.1145/2489253.2489263","url":null,"abstract":"Wireless sensor nodes are usually densely deployed to completely cover (monitor) a set of targets. Consequently, redundant sensor nodes that are not currently needed in the covering task can be powered off to conserve energy. These sensors can take over the covering task later to prolong network lifetime. The coverage problem, concerns picking up a set of working sensors that collectively meet the coverage requirements. The problem is complicated by the possibility that targets may have different coverage requirements while sensor nodes may have different amounts of energy. This article proposes a game-theoretic approach to the coverage problem, where each sensor autonomously decides its state with a simple rule based on local information. We give rigorous proofs to show stability, correctness, and efficiency of the proposed game. Implementation variants of the game consider specific issues, such as game convergence time and different amounts of sensor energy. Simulation results show significant improvement in network lifetime by the proposed approach when compared with representative alternatives.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"43 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":"126038788","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}
Artemis C. Voulkidis, M. Anastasopoulos, P. Cottis
{"title":"Energy efficiency in wireless sensor networks: A game-theoretic approach based on coalition formation","authors":"Artemis C. Voulkidis, M. Anastasopoulos, P. Cottis","doi":"10.1145/2489253.2489260","DOIUrl":"https://doi.org/10.1145/2489253.2489260","url":null,"abstract":"A coalitional game theoretic scheme is proposed that aims at maximizing wireless sensor network lifetime under specified QoS. Employing a small number of nodes of increased computing power and lifetime called representatives, an adaptive clustering scheme is proposed where neighboring nodes form coalitions in order to increase energy efficiency at the cost of controllable data-accuracy reduction. The coalition formation is globally optimized by the representatives. The spatial correlation of the sensed phenomenon measurements is exploited to formulate a cooperation scheme that reduces drastically the number of node transmissions. The specifications regarding the accuracy of the collected data determine the extent of coalition formation. The efficiency and stability of the proposed coalitional scheme are studied through simulations.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"9 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":"131065289","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}