2014 IEEE International Conference on Distributed Computing in Sensor Systems最新文献_第5页

Aggregation in Smartphone Sensor Networks 智能手机传感器网络中的聚合

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

Nimantha Thushan Baranasuriya, Seth Gilbert, Calvin C. Newport, J. Rao

{"title":"Aggregation in Smartphone Sensor Networks","authors":"Nimantha Thushan Baranasuriya, Seth Gilbert, Calvin C. Newport, J. Rao","doi":"10.1109/DCOSS.2014.25","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.25","url":null,"abstract":"The first wave of sensor network deployments from the early 2000s relied on aggregation-a strategy in which readings are combined locally using low-power radio links before they are communicated to the gateway. Aggregation reduced dependence on battery-draining, long-distance radio links, and reduced redundancy among reported data. We are now experiencing a second wave of sensor network research driven by ubiquitous smartphone usage. In this paper, we study the application of aggregation to the new smartphone sensor network setting, arguing that it can help reduce costs in contexts where existing cost-reduction strategies, such as opportunistic use of Wi-Fi and data piggybacking, do not apply. In more detail, we propose two new aggregation protocols, designed for the challenges of high mobility, that offer trade-offs in terms of bandwidth and energy savings. We then evaluate these protocols using both test bed experimentation (using a collection of 11 Samsung Galaxy Nexus smartphones running a Noise Tube-like application) and trace based simulation (using a large collection of mobility traces from taxi cabs in Singapore). Our experiments demonstrate that our aggregation protocols reduce cellular bandwidth usage by up to 95% while losing less than 5% of the data. Moreover, in many common cases, our protocols also yield significant energy savings.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"79 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":"125122723","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}

引用次数: 7

Wonder: Efficient Tag Identification for Large-Scale RFID Systems 奇迹:大规模RFID系统的高效标签识别

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

Haoxiang Liu, Kebin Liu, Wei Gong, Yunhao Liu, Lei Chen

引用次数: 1

An Emulation-Based Method for Lifetime Estimation of Wireless Sensor Networks 一种基于仿真的无线传感器网络寿命估计方法

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

Wilfried Dron, S. Duquennoy, T. Voigt, K. Hachicha, P. Garda

{"title":"An Emulation-Based Method for Lifetime Estimation of Wireless Sensor Networks","authors":"Wilfried Dron, S. Duquennoy, T. Voigt, K. Hachicha, P. Garda","doi":"10.1109/DCOSS.2014.10","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.10","url":null,"abstract":"Lifetime estimation in Wireless Sensor Networks (WSN) is crucial to ensure that the network will last long enough (low maintenance cost) while not being over-dimensioned (low initial cost). Existing solutions have at least one of the two following limitations: (1) they are based on theoretical models or high-level protocol implementations, overlooking low-level (e.g., hardware, driver, etc.) constraints which we find have a significant impact on lifetime, and (2) they use an ideal battery model which over-estimates lifetime due to its constant voltage and its inability to model the non-linear properties of real batteries. We introduce a method for WSN lifetime estimation that operates on compiled firmware images and models the complex behavior of batteries. We use the MSPSim/Cooja node emulator and network simulator to run the application in a cycle-accurate manner and log all component states. We then feed the log into our lifetime estimation framework, which models the nodes and their batteries based on both technical and experimental specifications. In a case study of a Contiki RPL/6LoWPAN application, we identify and resolve several low-level implementation issues, thereby increasing the predicted network lifetime from 134 to 484 days. We compare our battery model to the ideal battery model and to the lifetime estimation based on the radio duty cycle, and find that there is an average over-estimation of 36% and 76% respectively.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"17 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":"126092584","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}

引用次数: 30

Decentralizing and Adding Portability to an IoT Test-Bed through Smartphones 通过智能手机分散和增加物联网测试平台的可移植性

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

S. Nikoletseas, M. Rapti, Theofanis P. Raptis, Konstantinos Veroutis

引用次数: 12

Efficient Agile Sink Selection in Wireless Sensor Networks Based on Compressed Sensing 基于压缩感知的无线传感器网络高效敏捷Sink选择

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

Mohammadreza Mahmudimanesh, A. Naseri, N. Suri

{"title":"Efficient Agile Sink Selection in Wireless Sensor Networks Based on Compressed Sensing","authors":"Mohammadreza Mahmudimanesh, A. Naseri, N. Suri","doi":"10.1109/DCOSS.2014.21","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.21","url":null,"abstract":"Collection of the sensed data in a wireless sensor network at one or more sink (s) is a well studied problem and there are a lot of efficient solutions for a variety of wireless sensor network configurations and application requirements. These methods are often optimized towards collection of the sensed data at a predetermined base station or sink. This inherently reduces the agility of the wireless sensor network as the flow of information is not easily changeable after the establishment of the routing and data collection algorithms. This paper presents an efficient data dissemination method based on the compressed sensing theory that allows each sensor node to take the role of a sink. Agile sink selection is especially advantageous in scenarios where the sink or the end user of the wireless sensor network is mobile. The proposed method allows availing the global state of the environment by fetching a small set of data from any arbitrary node. Our evaluations prove the better performance of our technique over existing methods. Also a comparison with an oracle-based approach gives sufficient experimental evidences of a nearly optimal performance of our method.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"115 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":"123993334","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

Real-Time Distributed Visual Feature Extraction from Video in Sensor Networks 传感器网络视频实时分布式视觉特征提取

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

Emil Eriksson, G. Dán, V. Fodor

{"title":"Real-Time Distributed Visual Feature Extraction from Video in Sensor Networks","authors":"Emil Eriksson, G. Dán, V. Fodor","doi":"10.1109/DCOSS.2014.30","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.30","url":null,"abstract":"Enabling visual sensor networks to perform visual analysis tasks in real-time is challenging due to the computational complexity of detecting and extracting visual features. A promising approach to address this challenge is to distribute the detection and the extraction of local features among the sensor nodes, in which case the time to complete the visual analysis of an image is a function of the number of features found and of the distribution of the features in the image. In this paper we formulate the minimization of the time needed to complete the distributed visual analysis for a video sequence subject to a mean average precision requirement as a stochastic optimization problem. We propose a solution based on two composite predictors that reconstruct randomly missing data, and use a quantile-based linear approximation of the feature distribution and time series analysis methods. The composite predictors allow us to compute an approximate optimal solution through linear programming. We use two surveillance videos to evaluate the proposed algorithms, and show that prediction is essential for controlling the completion time. The results show that the last value predictor together with regular quantile-based distribution approximation provide a low complexity solution with very good performance.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"115 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":"116707170","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}

引用次数: 22

Security Access Protocols in IoT Networks with Heterogenous Non-IP Terminals 异构非ip终端物联网网络中的安全接入协议

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

R. Giuliano, F. Mazzenga, A. Neri, A. Vegni

{"title":"Security Access Protocols in IoT Networks with Heterogenous Non-IP Terminals","authors":"R. Giuliano, F. Mazzenga, A. Neri, A. Vegni","doi":"10.1109/DCOSS.2014.50","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.50","url":null,"abstract":"To provide advanced services to citizens, Smart City services are enabled by a massive use of Internet of Things (IoT) technologies. The envisaged huge amount of sensors, and terminals with a great variety of typologies and applications, do not allow having a unique way to manage them, requiring for example minimal packaging and presentation overhead for many of them. In general in a network providing Smart City services, both IP and non-IP devices are present. In this paper, we tackle the security issue for non-IP devices able to connect by a short-range with a mediator gateway, forming a capillary access network, which can be seen as a short range extension of conventional access network in order to efficiently capture the IoT traffic. In particular, we propose security algorithms both for uni- and bi-directional terminals, depending on the terminal capabilities. The security algorithms are based on a local key renewal (without any exchange in air), performed just considering the local clock time. Performance are obtained respect to the maximum number of terminals that can be managed by one mediator gateway and the maximum packet delay as a function of the number of terminals in the area.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"88 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":"126203415","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

Cyber Security for Personal Medical Devices Internet of Things 个人医疗设备物联网的网络安全

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

A. Mohan

引用次数: 40

PhyTraces: Simulating New RF Environments with Physical Layer Traces PhyTraces:用物理层迹线模拟新的射频环境

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

Jiakang Lu, K. Whitehouse

{"title":"PhyTraces: Simulating New RF Environments with Physical Layer Traces","authors":"Jiakang Lu, K. Whitehouse","doi":"10.1109/DCOSS.2014.37","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.37","url":null,"abstract":"Wireless systems are deployed in environments like buildings, bridges and forests - each of which has very different wireless properties. In this paper, we propose a technique to customize simulation for a new RF environment, before a physical layer model has been created for it. Our approach is to create physical layer traces or PhyTraces that capture the RF environment of a single node. These PhyTraces can then be composed in multiple ways to simulate protocol-layer performance in the target environment. This approach offers an alternative to conventional trace-based network simulation that is very realistic, but does not permit protocol-level changes after the traces are collected. We show that PhyTraces can be collected very quickly and can be used in simulation with low computational overhead to model networks of various sizes and densities. To evaluate this approach, we collect PhyTraces in 3 different physical environments using 2 different low-power radios at 4 different transmission power levels. Our analysis indicates that the PhyTraces can predict the performance of neighbor discovery algorithms, distance vector routing algorithms, and flooding algorithms in real deployments, including some effects of complex dynamics due to packet loss and wireless collisions.","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":"129799995","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}

引用次数: 0

A Survey of Technologies in Internet of Things 物联网技术综述

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

Jasper Tan, Simon G. M. Koo

引用次数: 42