2014 IEEE International Conference on Distributed Computing in Sensor Systems最新文献

Context-Oriented Programming for Adaptive Wireless Sensor Network Software 面向上下文的自适应无线传感器网络软件编程

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.31

Mikhail Afanasov, L. Mottola, C. Ghezzi

{"title":"Context-Oriented Programming for Adaptive Wireless Sensor Network Software","authors":"Mikhail Afanasov, L. Mottola, C. Ghezzi","doi":"10.1109/DCOSS.2014.31","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.31","url":null,"abstract":"We present programming abstractions for implementing adaptive Wireless Sensor Network (WSN) software. The need for adaptability arises in WSNs because of unpredictable environment dynamics, changing requirements, and resource scarcity. However, after about a decade of research in WSN programming, developers are still left with no dedicated support. To address this issue, we bring concepts from Context-Oriented Programming (COP) down to WSN devices. Contexts model the situations that WSN software needs to adapt to. Using COP, programmers use a notion of layered function to implement context-dependent behavioral variations of WSN code. To this end, we provide language-independent design concepts to organize the context-dependent WSN operating modes, decoupling the abstractions from their concrete implementation in a programming language. Our own implementation, called CONESC, extends nesC with COP constructs. Based on three representative applications, we show that CONESC greatly simplifies the resulting code and yields increasingly decoupled implementations compared to nesC. For example, by model-checking every function in either implementations, we show a ~50% reduction in the number of program states that programmers need to deal with, indicating easier debugging. In our tests, this comes at the price of a maximum 2.5% (4.5%) overhead in program (data) memory.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127156676","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}

引用次数: 13

A Novel Wake-Up Receiver with Addressing Capability for Wireless Sensor Nodes 一种具有寻址能力的无线传感器节点唤醒接收器

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.9

C. Petrioli, Dora Spenza, P. Tommasino, A. Trifiletti

{"title":"A Novel Wake-Up Receiver with Addressing Capability for Wireless Sensor Nodes","authors":"C. Petrioli, Dora Spenza, P. Tommasino, A. Trifiletti","doi":"10.1109/DCOSS.2014.9","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.9","url":null,"abstract":"Emerging low-power radio triggering techniques for wireless motes are a promising approach to prolong the lifetime of Wireless Sensor Networks (WSNs). By allowing nodes to activate their main transceiver only when data need to be transmitted or received, wake-up-enabled solutions virtually eliminate the need for idle listening, thus drastically reducing the energy toll of communication. In this paper we describe the design of a novel wake-up receiver architecture based on an innovative pass-band filter bank with high selectivity capability. The proposed concept, demonstrated by a prototype implementation, combines both frequency-domain and time-domain addressing space to allow selective addressing of nodes. To take advantage of the functionalities of the proposed receiver, as well as of energy-harvesting capabilities modern sensor nodes are equipped with, we present a novel wake-up-enabled harvesting-aware communication stack that supports both interest dissemination and converge casting primitives. This stack builds on the ability of the proposed WuR to support dynamic address assignment, which is exploited to optimize system performance. Comparison against traditional WSN protocols shows that the proposed concept allows to optimize performance tradeoffs with respect to existing low-power communication stacks.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124082304","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}

引用次数: 35

Data Selection for Maximum Coverage in Sensor Networks with Cost Constraints 成本约束下传感器网络最大覆盖的数据选择

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.35

Scott T. Rager, E. Ciftcioglu, T. L. Porta, Alice Leung, William Dron, R. Ramanathan, J. P. Hancock

{"title":"Data Selection for Maximum Coverage in Sensor Networks with Cost Constraints","authors":"Scott T. Rager, E. Ciftcioglu, T. L. Porta, Alice Leung, William Dron, R. Ramanathan, J. P. Hancock","doi":"10.1109/DCOSS.2014.35","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.35","url":null,"abstract":"In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131393036","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}

引用次数: 1

Feature Extraction in Densely Sensed Environments 密集感知环境中的特征提取

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.29

M. Vahabi, Vikram Gupta, M. Albano, E. Tovar

{"title":"Feature Extraction in Densely Sensed Environments","authors":"M. Vahabi, Vikram Gupta, M. Albano, E. Tovar","doi":"10.1109/DCOSS.2014.29","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.29","url":null,"abstract":"With the reduction in size and cost of sensor nodes, dense sensor networks are becoming more popular in a wide-range of applications. Many such applications with dense deployments are geared towards finding various patterns or features such as peaks, boundaries and shapes in the spread of sensed physical quantities over an area. However, collecting all the data from individual sensor nodes can be impractical both in terms of timing requirements and the overall resource consumption. Hence, it is imperative to devise distributed information processing techniques that can help in identifying such features with a high accuracy and within certain time constraints. In this paper, we exploit the prioritized channel-access mechanism of dominance-based Medium Access Control (MAC) protocols to efficiently obtain exterma of the sensed quantities. We show how by the use of simple transforms that sensor nodes employ on local data it is also possible to efficiently extract certain features such as local extrema and boundaries of events. Using these transformations, we show through extensive evaluations that our proposed technique is fast and efficient at retrieving only sensor data point with the most constructive information, independent of the number of sensor nodes in the network.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132234005","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

Low-Power Listening Goes Multi-channel 低功耗收听多频道

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.33

Beshr Al Nahas, S. Duquennoy, V. Iyer, T. Voigt

{"title":"Low-Power Listening Goes Multi-channel","authors":"Beshr Al Nahas, S. Duquennoy, V. Iyer, T. Voigt","doi":"10.1109/DCOSS.2014.33","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.33","url":null,"abstract":"Exploiting multiple radio channels for communication has been long known as a practical way to mitigate interference in wireless settings. In Wireless Sensor Networks, however, multi-channel solutions have not reached their full potential: the MAC layers included in TinyOS or the Contiki OS for example are mostly single-channel. The literature offers a number of interesting solutions, but experimental results were often too few to build confidence. We propose a practical extension of low-power listening, MiCMAC, that performs channel hopping, operates in a distributed way, and is independent of upper layers of the protocol stack. The above properties make it easy to deploy in a variety of scenarios, without any extra configuration/scheduling/channel selection hassle. We implement our solution in Contiki and evaluate it in a 97-node~testbed while running a complete, out-of-the-box low-power IPv6 communication stack (UDP/RPL/6LoWPAN). Our experimental results demonstrate increased resilience to emulated WiFi interference (e.g., data yield kept above 90% when Contiki MAC drops in the 40% range). In noiseless environments, MiCMAC keeps the overhead low in comparison to Contiki MAC, achieving performance as high as 99% data yield along with sub-percent duty cycle and sub-second latency for a 1-minute inter-packet interval data collection.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132533023","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}

引用次数: 51

A Comparison of On-Mote Lossy Compression Algorithms for Wireless Seismic Data Acquisition 无线地震数据采集的无损压缩算法比较

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.16

Marc J. Rubin, M. Wakin, T. Camp

{"title":"A Comparison of On-Mote Lossy Compression Algorithms for Wireless Seismic Data Acquisition","authors":"Marc J. Rubin, M. Wakin, T. Camp","doi":"10.1109/DCOSS.2014.16","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.16","url":null,"abstract":"In this article, we rigorously compare compressive sampling (CS) to four state of the art, on-mote, lossy compression algorithms (K-run-length encoding (KRLE), lightweight temporal compression (LTC), wavelet quantization thresholding and run-length encoding (WQTR), and a low-pass filtered fast Fourier transform (FFT)). Specifically, we first simulate lossy compression on two real-world seismic data sets, and we then evaluate algorithm performance using implementations on real hardware. In terms of compression rates, recovered signal error, power consumption, and classification accuracy of a seismic event detection task (on decompressed signals), results show that CS performs comparable to (and in many cases better than) the other algorithms evaluated. The main benefit to users is that CS, a lightweight and non-adaptive compression technique, can guarantee a desired level of compression performance (and thus, radio usage and power consumption) without subjugating recovered signal quality. Our contribution is a novel and rigorous comparison of five state of the art, on-mote, lossy compression algorithms in simulation on real-world data sets and implemented on hardware.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133949031","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}

引用次数: 4

A Neighbour Disjoint Multipath Scheme for Fault Tolerant Wireless Sensor Networks 一种容错无线传感器网络的邻居不相交多路径方案

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.43

A. Hossain, C. Sreenan, Szymon Fedor

{"title":"A Neighbour Disjoint Multipath Scheme for Fault Tolerant Wireless Sensor Networks","authors":"A. Hossain, C. Sreenan, Szymon Fedor","doi":"10.1109/DCOSS.2014.43","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.43","url":null,"abstract":"In this paper, we propose a \"Neighbour Disjoint Multipath (NDM)\" scheme that increases resilience against node or link failures in a wireless sensor network (WSN). Our algorithm chooses the shortest path between a sensor and the sink as the primary path, thus ensuring the algorithm is energy efficient under normal circumstances. In selecting the backup paths, we utilise the disjoint property to ensure that i) when there are k paths between source and sink, no set of k node failures can result in total communication break between them, and ii) by having (k-1) spatially separated backup paths w.r.t. the primary path, the probability of simultaneous failure of the primary and backup paths is reduced in case of localised poor channel quality or node failures. Our algorithm not only ensures the node disjointedness characteristics of the constructed paths, but also tries to minimise the impact of co-located node or link failures where a localised portion of the network may be unusable. We analyse the motivation behind our idea clearly, and discuss the algorithm in detail. We also compare the NDM scheme with other common multipath techniques such as node-disjoint and edge-disjoint approaches, and point out its effectiveness through simulation.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128921595","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}

引用次数: 4

Crowd-Sensing with Polarized Sources 极化源人群传感

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.23

Md. Tanvir Al Amin, T. Abdelzaher, Dong Wang, B. Szymanski

{"title":"Crowd-Sensing with Polarized Sources","authors":"Md. Tanvir Al Amin, T. Abdelzaher, Dong Wang, B. Szymanski","doi":"10.1109/DCOSS.2014.23","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.23","url":null,"abstract":"The paper presents a new model for crowd-sensing applications, where humans are used as the sensing sources to report information regarding the physical world. In contrast to previous work on the topic, we consider a model where the sources in question are polarized. Such might be the case, for example, in political disputes and in situations involving different communities with largely dissimilar beliefs that color their interpretation and reporting of physical world events. Reconstructing accurate ground truth is more complicated when sources are polarized. The paper describes an algorithm that significantly improves the quality of reconstruction results in the presence of polarized sources. For evaluation, we recorded human observations from Twitter for four months during a recent Egyptian uprising against the former president. We then used our algorithm to reconstruct a version of events and compared it to other versions produced by state of the art algorithms. Our analysis of the data set shows the presence of two clearly defined camps in the social network that tend of propagate largely disjoint sets of claims (which is indicative of polarization), as well as third population whose claims overlap subsets of the former two. Experiments show that, in the presence of polarization, our reconstruction tends to align more closely with ground truth in the physical world than the existing algorithms.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115201808","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}

引用次数: 18

A Survey on (mobile) Wireless Sensor Network Experimentation Testbeds (移动)无线传感器网络实验试验台综述

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.41

A. Tonneau, N. Mitton, J. Vandaele

{"title":"A Survey on (mobile) Wireless Sensor Network Experimentation Testbeds","authors":"A. Tonneau, N. Mitton, J. Vandaele","doi":"10.1109/DCOSS.2014.41","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.41","url":null,"abstract":"With the development of new technologies, these last years have witnessed the emergence of a new paradigm: the Internet of Things (IoT) and of the physical world. We are now able to communicate and interact with our surrounding environment through the use of multiple tiny sensors, RFID technologies or small wireless robots. This allows a set of new applications and usages to be envisioned ranging from logistic and traceability purposes to emergency and rescue operations going through the monitoring of volcanos or forest fires. However, all this comes with several technical and scientific issues like how to ensure the reliability of wireless communications in disturbed environments, how to manage efficiently the low resources (energy, memory, etc) or how to set a safe and sustainable maintenance. All these issues are addressed by researchers all around the world but solutions designed for IoT need to face real experimentations to be validated. To ease such experimentations for IoT, several experimental test beds have been deployed offering diverse and heterogeneous services and tools. This article studies the different requirements and features such facilities should offer and survey the different experimental facilities currently available for the community, the different hardware used (as sensors and robots) and the scope of their services. We expect this survey assist a potential user to easily choose the one to use regarding his own needs. Finally, we identify existing gaps and difficulties and investigate new directions for such facilities.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257972","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}

引用次数: 47

Poster Abstract: Low-Power Wireless Channel Quality Estimation in the Presence of RF Smog 摘要:射频烟雾存在下的低功耗无线信道质量估计

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.63

Anwar Hithnawi, Hossein Shafagh, S. Duquennoy

引用次数: 4