Pub Date : 2012-10-24DOI: 10.1109/IOT.2012.6402304
B. Dil, P. Havinga
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.
{"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":null,"pages":null},"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}
Pub Date : 2012-10-24DOI: 10.1109/IOT.2012.6402315
Matthias Kovatsch, Martin Lanter, S. Duquennoy
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.
{"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":null,"pages":null},"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}
Pub Date : 2012-10-24DOI: 10.1109/IOT.2012.6402310
T. Keller, Frédéric Thiesse, A. Ilic, E. Fleisch
The problem of false-positive RFID tag reads i.e., tags that have been read unintentionally by a reader, is crucial for the actual implementation of RFID solutions in the real world. Prior research has shown that the use of the low-level reader data is suitable to approach this problem and it is the scope of this paper to evaluate the use of alternative RFID reader antenna setups to support this idea. We collected a large number of data in a productive RFID enabled distribution center, derived additional knowledge from our findings and used it to train a machine learning algorithm for the detection of such false-positive reads. It will be shown that the proposed solutions significantly improve the previously in the literature presented classification algorithms.
{"title":"Decreasing false-positive RFID tag reads by improved portal antenna setups","authors":"T. Keller, Frédéric Thiesse, A. Ilic, E. Fleisch","doi":"10.1109/IOT.2012.6402310","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402310","url":null,"abstract":"The problem of false-positive RFID tag reads i.e., tags that have been read unintentionally by a reader, is crucial for the actual implementation of RFID solutions in the real world. Prior research has shown that the use of the low-level reader data is suitable to approach this problem and it is the scope of this paper to evaluate the use of alternative RFID reader antenna setups to support this idea. We collected a large number of data in a productive RFID enabled distribution center, derived additional knowledge from our findings and used it to train a machine learning algorithm for the detection of such false-positive reads. It will be shown that the proposed solutions significantly improve the previously in the literature presented classification algorithms.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130139637","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}
Pub Date : 2012-10-24DOI: 10.1109/IOT.2012.6402320
Viet-Duc Le, H. Scholten, P. Havinga
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.
{"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":null,"pages":null},"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}
Pub Date : 2012-10-24DOI: 10.1109/IOT.2012.6402300
Vojkan Tasic, T. Staake, T. Stiefmeier, Verena Tiefenbeck, E. Fleisch, G. Tröster
Hot water usage accounts for 16% of household demand for energy, much more than lighting and cooking (5% each) and is comparable to electricity usage for appliances (21%). As a means of helping consumers to save hot water, we present a novel self-powered water consumption sensor that enables direct consumption feedback. We equipped 91 Swiss households with the sensors and recorded 3,164 individual showers during the period of three months. The presence of feedback during a shower resulted in the reduction of average shower water consumption from 79 l to 61 l (-22.2%) per day and household. In addition to savings attributable to already installed flow restrictors, an average household could conserve 6,400 l of drinking water and 210 kWh of heat energy (projected to one year). Furthermore, we show that the effects of direct feedback on water consumption did not decline over the course of the study.
{"title":"Self-powered water meter for direct feedback","authors":"Vojkan Tasic, T. Staake, T. Stiefmeier, Verena Tiefenbeck, E. Fleisch, G. Tröster","doi":"10.1109/IOT.2012.6402300","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402300","url":null,"abstract":"Hot water usage accounts for 16% of household demand for energy, much more than lighting and cooking (5% each) and is comparable to electricity usage for appliances (21%). As a means of helping consumers to save hot water, we present a novel self-powered water consumption sensor that enables direct consumption feedback. We equipped 91 Swiss households with the sensors and recorded 3,164 individual showers during the period of three months. The presence of feedback during a shower resulted in the reduction of average shower water consumption from 79 l to 61 l (-22.2%) per day and household. In addition to savings attributable to already installed flow restrictors, an average household could conserve 6,400 l of drinking water and 210 kWh of heat energy (projected to one year). Furthermore, we show that the effects of direct feedback on water consumption did not decline over the course of the study.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133735230","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}
Pub Date : 2012-10-22DOI: 10.1109/IOT.2012.6402318
Michael Blackstock, R. Lea
Toward reducing barriers for developing applications for the Internet of Things, researchers have connected things to the web enabling the development of IoT mashups. While establishing a Web of Things for mashup development has been an important step forward, we believe that web-centric IoT toolkits have the potential to increase the use of Internet-enabled things further by increasing the pool of developers and applications that can take advantage of the connected physical world. In this paper we derive several key requirements for IoT mashup toolkits based on existing systems, past research and our experience with an IoT mashup toolkit called the Web of Things Toolkit (WoTKit). Unlike other systems, the WoTKit aims to address key requirements for IoT mashup developers in one system. From this experience we derive key lessons learned for the community toward improving toolkits for developing IoT mashups.
{"title":"IoT mashups with the WoTKit","authors":"Michael Blackstock, R. Lea","doi":"10.1109/IOT.2012.6402318","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402318","url":null,"abstract":"Toward reducing barriers for developing applications for the Internet of Things, researchers have connected things to the web enabling the development of IoT mashups. While establishing a Web of Things for mashup development has been an important step forward, we believe that web-centric IoT toolkits have the potential to increase the use of Internet-enabled things further by increasing the pool of developers and applications that can take advantage of the connected physical world. In this paper we derive several key requirements for IoT mashup toolkits based on existing systems, past research and our experience with an IoT mashup toolkit called the Web of Things Toolkit (WoTKit). Unlike other systems, the WoTKit aims to address key requirements for IoT mashup developers in one system. From this experience we derive key lessons learned for the community toward improving toolkits for developing IoT mashups.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123527199","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}
Pub Date : 2012-10-01DOI: 10.1109/IOT.2012.6402314
C. Truong, K. Römer, Kai Chen
An increasing number of sensors is being connected to the Internet and their output is published on the Web, resulting in the formation of a Web of Things (WoT) that will soon connect tens of Billions of devices. As in the traditional web, search will be a key service also in the WoT to enable users to find sensors with certain properties. We propose sensor similarity search, where given a sensor, other sensors on the WoT are found that produced similar output in the past. At the heart of our approach is an algorithm that exploits fuzzy sets for efficiently computing a similarity score for a pair of sensors that is used to obtain a ranked list of matching sensors. Using sensor data sets from real deployments, we find that this approach results in a high accuracy.
{"title":"Fuzzy-based sensor search in the Web of Things","authors":"C. Truong, K. Römer, Kai Chen","doi":"10.1109/IOT.2012.6402314","DOIUrl":"https://doi.org/10.1109/IOT.2012.6402314","url":null,"abstract":"An increasing number of sensors is being connected to the Internet and their output is published on the Web, resulting in the formation of a Web of Things (WoT) that will soon connect tens of Billions of devices. As in the traditional web, search will be a key service also in the WoT to enable users to find sensors with certain properties. We propose sensor similarity search, where given a sensor, other sensors on the WoT are found that produced similar output in the past. At the heart of our approach is an algorithm that exploits fuzzy sets for efficiently computing a similarity score for a pair of sensors that is used to obtain a ranked list of matching sensors. Using sensor data sets from real deployments, we find that this approach results in a high accuracy.","PeriodicalId":142810,"journal":{"name":"2012 3rd IEEE International Conference on the Internet of Things","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115329685","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}
Pub Date : 2012-10-01DOI: 10.1109/IOT.2012.6402307
Yusuke Doi, Yumiko Sato, M. Ishiyama, Y. Ohba, K. Teramoto
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.
XML由于其灵活的数据模型，在基于web的开放异构系统中被广泛用作消息序列化格式。物联网(Internet-of-Things，简称IoT)或具有约束节点的网络被认为是异构的，XML的灵活性和表达性也有利于IoT。然而，这些节点上的RAM和带宽限制使得处理XML变得困难。作者正在开发无xml的EXI来解决这个问题。我们的方法采用高效XML交换(Efficient XML Interchange, EXI)作为XML的备选序列化形式。它解决了XML的带宽问题。同时，作者应用代码生成技术对约束节点上没有XML数据模型的EXI流进行编码/解码。基于模式的EXI语法的静态状态机使受约束的节点能够直接将EXI数据从/转换为其内部数据。作者表明，无论EXI流的大小如何，少xml的EXI在RAM使用方面都是高效的，并且在ROM大小方面比其他实现更紧凑。作者还提供了一组基于模式的EXI语法的代码大小估计，以及关于如何使语法更紧凑的见解。
{"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":null,"pages":null},"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}
Pub Date : 2012-10-01DOI: 10.1109/IOT.2012.6402306
Yin Zhang, Weili Han, Wei Wang, Chang Lei
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.
{"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":null,"pages":null},"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}
Pub Date : 2012-10-01DOI: 10.1109/IOT.2012.6402319
Kiwoong Kwon, Minkeun Ha, Taehong Kim, S. Kim, Daeyoung Kim
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.
{"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：