Shiguang Wang, T. Abdelzaher, S. Gajendran, Ajith Herga, Sachin Kulkarni, Shen Li, Hengchang Liu, C. Suresh, Abhishek Sreenath, Hongwei Wang, William Dron, Alice Leung, R. Govindan, J. P. Hancock
{"title":"The Information Funnel: Exploiting Named Data for Information-Maximizing Data Collection","authors":"Shiguang Wang, T. Abdelzaher, S. Gajendran, Ajith Herga, Sachin Kulkarni, Shen Li, Hengchang Liu, C. Suresh, Abhishek Sreenath, Hongwei Wang, William Dron, Alice Leung, R. Govindan, J. P. Hancock","doi":"10.1109/DCOSS.2014.32","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.32","url":null,"abstract":"This paper describes the exploitation of hierarchical data names to achieve information-utility maximizing data collection in social sensing applications. We describe a novel transport abstraction, called the information funnel. It encapsulates a data collection protocol for social sensing that maximizes a measure of delivered information utility, that is the minimized data redundancy, by diversifying the data objects to be collected. The abstraction leverages named-data networking, a communication paradigm where data objects are named instead of hosts. We argue that this paradigm is especially suited for utility-maximizing transport in resource constrained environments, because hierarchical data names give rise to a notion of distance between named objects that is a function of only the topology of the name tree. This distance, in turn, can expose similarities between named objects that can be leveraged for minimizing redundancy among objects transmitted over bottlenecks, thereby maximizing their aggregate utility. With a proper hierarchical name space design, our protocol prioritizes transmission of data objects over bottlenecks to maximize information utility, with very weak assumptions on the utility function. This prioritization is achieved merely by comparing data name prefixes, without knowing application-level name semantics, which makes it generalizable across a wide range of applications. Evaluation results show that the information funnel improves the utility of the collected data objects compared to other lossy protocols.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"27 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":"123174219","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":"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}
{"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}
{"title":"Cooperative Modulation Diversity Applied to Heterogeneous Wireless Sensor Networks","authors":"M. P. Sousa, W. Lopes, F. Madeiro, M. Alencar","doi":"10.1109/DCOSS.2014.58","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.58","url":null,"abstract":"The technology of Wireless Sensor Networks (WSNs) has been applied to automatic monitoring systems, and used in a wide variety of environments. In this paper, the authors evaluate the performance of a cooperative technique, applied to heterogeneous WSNs. The main contribution is the analysis of the impacts between the energy factor, the channel Signal-to-Noise Ratio (SNR) and the packet loss rate. The analysis also considers the energy consumption aspect. The cooperative modulation diversity performance is evaluated for different propagation scenarios and for two values of interleaving depth (K). A large value for K, leads the network to present lower values of packet lost rate. Some limiting conditions are obtained and the retransmission algorithm is discussed.","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":"115543024","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}
Kevin Weekly, Han Zou, Lihua Xie, Q. Jia, A. Bayen
{"title":"Indoor Occupant Positioning System Using Active RFID Deployment and Particle Filters","authors":"Kevin Weekly, Han Zou, Lihua Xie, Q. Jia, A. Bayen","doi":"10.1109/DCOSS.2014.53","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.53","url":null,"abstract":"This article describes a method for indoor positioning of human-carried active Radio Frequency Identification (RFID) tags based on the Sampling Importance Resampling (SIR) particle filtering algorithm. To use particle filtering methods, it is necessary to furnish statistical state transition and observation distributions. The state transition distribution is obstacle-aware and sampled from a precomputed accessibility map. The observation distribution is empirically determined by ground truth RSS measurements while moving the RFID tags along a known trajectory. From this data, we generate estimates of the sensor measurement distributions, grouped by distance, between the tag and sensor. A grid of 24 sensors is deployed in an office environment, measuring Received Signal Strength (RSS) from the tags, and a multithreaded program is written to implement the method. We discuss the accuracy of the method using a verification data set collected during a field-operational test.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131684263","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}
Sejin Chun, Jooik Jung, Xiongnan Jin, Gunhee Cho, Kyong-Ho Lee
{"title":"Poster Abstract: Semantically Enriched Object Identification for Internet of Things","authors":"Sejin Chun, Jooik Jung, Xiongnan Jin, Gunhee Cho, Kyong-Ho Lee","doi":"10.1109/DCOSS.2014.64","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.64","url":null,"abstract":"To efficiently explore heterogeneous objects on the Internet and uniquely identify them, we propose a scalable physical-object naming system that reuses the existing ontologies and assigns URL-based semantic identifiers. We implement a prototype of the proposed system and evaluate its performance using synthetically generated data based on the W3C Semantic Sensor Network ontology.","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128903751","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}