2012 3rd IEEE International Conference on the Internet of Things最新文献

RSS-based self-adaptive localization in dynamic environments 动态环境下基于rss的自适应定位

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-24 DOI: 10.1109/IOT.2012.6402304

B. Dil, P. Havinga

{"title":"RSS-based self-adaptive localization in dynamic environments","authors":"B. Dil, P. Havinga","doi":"10.1109/IOT.2012.6402304","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402304","url":null,"abstract":"This paper focuses on optimal and automatic calibration of the propagation model of Received Signal Strength (RSS) based localization algorithms. Conventional RSS-based localization algorithms assume that optimal calibration is static and identical for all nodes, which limits its use to static environments. However realistic environments are dynamic, where each node should estimate its own optimal propagation model settings dependent on the node's hardware and location. We call this process Self-Adaptive Localization (SAL). SAL algorithms estimate the parameter settings from available localization measurements. We show that existing SAL algorithms significantly decrease the localization accuracy and stability. Our main contribution is that we determine the conditions under which SAL algorithms provide optimal results, that are shown to be constraints on the localization surface. Since the antenna orientation has a significant impact on RSS and thus optimal propagation model settings, we evaluated SAL in an environment with unknown and thus dynamic antenna orientations. Our measurements and simulations show that these constraints increase the accuracy by ~ 45% and the stability by ~ 70% in static and dynamic environments.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131960794","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}

引用次数: 16

Actinium: A RESTful runtime container for scriptable Internet of Things applications Actinium:一个RESTful的运行时容器，用于可脚本化的物联网应用程序

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-24 DOI: 10.1109/IOT.2012.6402315

Matthias Kovatsch, Martin Lanter, S. Duquennoy

{"title":"Actinium: A RESTful runtime container for scriptable Internet of Things applications","authors":"Matthias Kovatsch, Martin Lanter, S. Duquennoy","doi":"10.1109/IOT.2012.6402315","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402315","url":null,"abstract":"Programming Internet of Things (IoT) applications is challenging because developers have to be knowledgeable in various technical domains, from low-power networking, over embedded operating systems, to distributed algorithms. Hence, it will be challenging to find enough experts to provide software for the vast number of expected devices, which must also be scalable and particularly safe due to the connection to the physical world. To remedy this situation, we propose an architecture that provides Web-like scripting for low-end devices through Cloud-based application servers and a consistent, RESTful programming model. Our novel runtime container Actinium (Ac) exposes scripts, their configuration, and their lifecycle management through a fully RESTful programming interface using the Constrained Application Protocol (CoAP). We endow the JavaScript language with an API for direct interaction with mote-class IoT devices, the CoapRequest object, and means to export script data as Web resources. With Actinium, applications can be created by simply mashing up resources provided by CoAP servers on devices, other scripts, and classic Web services. We also discuss security considerations and show the suitability of this architecture in terms of performance with our publicly available implementation.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125064213","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}

引用次数: 113

Decreasing false-positive RFID tag reads by improved portal antenna setups 通过改进门户天线设置来减少RFID标签的误报

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-24 DOI: 10.1109/IOT.2012.6402310

T. Keller, Frédéric Thiesse, A. Ilic, E. Fleisch

引用次数: 19

Unified routing for data dissemination in smart city networks 面向智慧城市网络数据传播的统一路由

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-24 DOI: 10.1109/IOT.2012.6402320

Viet-Duc Le, H. Scholten, P. Havinga

{"title":"Unified routing for data dissemination in smart city networks","authors":"Viet-Duc Le, H. Scholten, P. Havinga","doi":"10.1109/IOT.2012.6402320","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402320","url":null,"abstract":"The Internet of Things continues to expand from traditional homogeneous technologies with low resources to increasingly heterogeneous and resource rich technologies. An emerging domain in this respect is the use of mobile phones to monitor and process events. Moreover, there is increasing interest in expanding the application domains, such as to smart cities. Existing routing algorithms for such technologies and application domains are still designed for homogeneous technologies, such as mobile phones, vehicles, and Road Side Units. In this paper, we propose a new routing scheme for a heterogeneous architecture that is composed of a heterogeneous set of nodes. Our proposed routing algorithm uses two parameters, namely the Delivery Capability and Number of Copies, to control the dissemination area and connection priority. By optimally choosing these two parameters according to characteristics of nodes, the proposed algorithm works well with various types of sensor node. In addition, a heterogeneous network architecture and several mobility models are introduced to obtain a realistic simulation scenario. The simulation results show that our proposed approach outperforms all other compared algorithms in terms of delivery ratio and latency.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133332032","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

Self-powered water meter for direct feedback 自供电水表直接反馈

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-24 DOI: 10.1109/IOT.2012.6402300

Vojkan Tasic, T. Staake, T. Stiefmeier, Verena Tiefenbeck, E. Fleisch, G. Tröster

引用次数: 15

IoT mashups with the WoTKit

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-22 DOI: 10.1109/IOT.2012.6402318

Michael Blackstock, R. Lea

引用次数: 117

Fuzzy-based sensor search in the Web of Things 物联网中基于模糊的传感器搜索

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-01 DOI: 10.1109/IOT.2012.6402314

C. Truong, K. Römer, Kai Chen

引用次数: 47

XML-less EXI with code generation for integration of embedded devices in web based systems 带有代码生成的无xml EXI，用于在基于web的系统中集成嵌入式设备

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-01 DOI: 10.1109/IOT.2012.6402307

Yusuke Doi, Yumiko Sato, M. Ishiyama, Y. Ohba, K. Teramoto

{"title":"XML-less EXI with code generation for integration of embedded devices in web based systems","authors":"Yusuke Doi, Yumiko Sato, M. Ishiyama, Y. Ohba, K. Teramoto","doi":"10.1109/IOT.2012.6402307","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402307","url":null,"abstract":"XML is a widely used as message serialization format in web-based open and heterogeneous systems because of its flexible data model. Internet-of-Things (IoT), or network with constrained nodes, is expected to be heterogeneous, and flexibility and expressiveness of XML are also good for IoT. However, RAM and bandwidth constraints on such nodes make handling of XML difficult. The authors are developing XML-less EXI to solve the problem. Our approach adopts Efficient XML Interchange (EXI) as alternative serialization form of XML. It solves the bandwidth problem of XML. At the same time, the authors apply code generation techniques to encode/decode EXI stream without XML data models on constrained nodes. Static state machines from a schema-informed EXI grammar enable constrained nodes to convert EXI data directly from/to its internal data. The authors show that XML-less EXI is highly efficient in RAM usage regardless of the size of an EXI stream and more compact in ROM size than other implementations. The authors also provide code size estimations for a set of schema-informed EXI grammars and insights on how to make the grammars compact.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114129393","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}

引用次数: 14

Optimizing the storage of massive electronic pedigrees in HDFS 优化HDFS中海量电子系谱的存储

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-01 DOI: 10.1109/IOT.2012.6402306

Yin Zhang, Weili Han, Wei Wang, Chang Lei

{"title":"Optimizing the storage of massive electronic pedigrees in HDFS","authors":"Yin Zhang, Weili Han, Wei Wang, Chang Lei","doi":"10.1109/IOT.2012.6402306","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402306","url":null,"abstract":"Benefiting from trustworthily tracking of the processes in the production, processing, storage, transportation and sale phases, an electronic pedigree system becomes an important technology of the Internet of Things. In an electronic pedigree system, small-sized but huge volume of electronic pedigrees in the XML format will be generated, stored, and retrieved. Unfortunately, study of these massive electronic pedigrees' storage in an electronic pedigree system, which is in the form of small XML files, is rarely concerned. We, therefore, try to leverage Hadoop to solve the storage problem of massive electronic pedigrees, by the optimization of storing and accessing massive small XML files in HDFS. First, all correlated small XML files of the same envelope are merged into a larger file to reduce the metadata occupation at NameNode. Second, a prefetching mechanism and a remerging mechanism are used to improve the efficiency of accessing small XML files. Finally, we implement a prototype to evaluate the effectiveness and efficiency comparing with the origin HDFS. The results show that the optimized approach is able to reduce the memory consumption of NameNodes by up to 50%, improve performance of storing by up to 91%, and accelerate accessing by up to 88% in Hadoop.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133611425","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

The stateless point to point routing protocol based on shortcut tree routing algorithm for IP-WSN 基于快捷树路由算法的IP-WSN无状态点到点路由协议

2012 3rd IEEE International Conference on the Internet of Things Pub Date : 2012-10-01 DOI: 10.1109/IOT.2012.6402319

Kiwoong Kwon, Minkeun Ha, Taehong Kim, S. Kim, Daeyoung Kim

{"title":"The stateless point to point routing protocol based on shortcut tree routing algorithm for IP-WSN","authors":"Kiwoong Kwon, Minkeun Ha, Taehong Kim, S. Kim, Daeyoung Kim","doi":"10.1109/IOT.2012.6402319","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402319","url":null,"abstract":"IP-based Wireless Sensor Network (IP-WSN) is one of the essential elements enabling Internet of Things (IoT). However, IP-WSN imposes great challenges due to low processing resources and strict energy constraints of sensors. Various routing protocols for IP-WSN have been proposed considering low-cost communication with resource-constraint and typical traffic patterns like multipoint-to-point, but most of routing protocols causes problems incurring inefficient route or/and consuming many processing resources. Especially, as far as point-to-point (P2P) traffic is concerned, those routing protocols incur triangular detour routes and require many processing resources at intermediate nodes where P2P traffic is an important traffic pattern. To address these challenges, we propose the Stateless P2P Routing protocol (SPR) based on shortcut tree routing algorithm which is our previous study. SPR can deliver a packet to the node having the smallest remaining hop count among neighbors without additional control overhead, instead of always delivering a packet to a parent or children along tree routes. SPR also provides a nearly stateless routing in that SPR determines a route through hierarchical address structure and one hop neighbor information without having to store global routing state. We implement SPR in our IP-WSN platform named SNAIL and conduct a simulation and a measurement to verify the performance of SPR. The simulation results show SPR provides improved hop count compared to HiLow and RPL. It also provides reduced memory usage and the number of control packets compared to RPL. Additionally, the measurement results show SPR provides decreased round trip time and increased packet delivery ratio compared to HiLow and RPL.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133840142","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}

引用次数: 16