Keoma Brun-Laguna, C. Oroza, Ziran Zhang, Sami A. Malek, T. Watteyne, S. Glaser
Next-generation hydrologic science and monitoring requires real-time, spatially distributed measurements of key variables including: soil moisture, air/soil temperature, snow depth, and air relative humidity. The SierraNet project provides these measurements by deploying low-power mesh networks across the California Sierra Nevada. This demo presents a replica of the end-to-end SierraNet monitoring system deployed in the Southern Sierra. This system is a highly reliable, low-power turn-key solution for environmental monitoring.
{"title":"SierraNet: monitoring the snowpack in the Sierra Nevada: demo","authors":"Keoma Brun-Laguna, C. Oroza, Ziran Zhang, Sami A. Malek, T. Watteyne, S. Glaser","doi":"10.1145/2979683.2979698","DOIUrl":"https://doi.org/10.1145/2979683.2979698","url":null,"abstract":"Next-generation hydrologic science and monitoring requires real-time, spatially distributed measurements of key variables including: soil moisture, air/soil temperature, snow depth, and air relative humidity. The SierraNet project provides these measurements by deploying low-power mesh networks across the California Sierra Nevada. This demo presents a replica of the end-to-end SierraNet monitoring system deployed in the Southern Sierra. This system is a highly reliable, low-power turn-key solution for environmental monitoring.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131666223","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}
Information centric networking (ICN) is a proposal for a future internetworking architecture that is more efficient and scalable. While several ICN architectures have been evaluated for networks carrying web and video traffic, the benefits and challenges it poses for Internet of Things (IoT) networks are relatively unexplored. In our work, we evaluate the performance implications for typical IoT network scenarios in the ICN paradigm. We study the behavior of in-network caching, introduce a way to make caching more efficient for periodic sensor data, and evaluate the impact of presence and location of lossy wireless links in IoT networks. In this paper, we present and discuss the results of our evaluations on IoT networks performed through emulations using a specific ICN architecture, namely, content centric networking (CCN). For example, we show that the newly proposed UTS-LRU cache replacement strategy for improved caching performance of time series content streams reduces the number of messages transmitted by up to 16%. Our findings indicate that the performance of IoT networks using ICN are influenced by the content model and the nature of its links, and motivates further studies to understand the performance implications in more varied IoT scenarios.
{"title":"Performance implications for IoT over information centric networks","authors":"A. Rao, O. Schelén, Anders Lindgren","doi":"10.1145/2979683.2979686","DOIUrl":"https://doi.org/10.1145/2979683.2979686","url":null,"abstract":"Information centric networking (ICN) is a proposal for a future internetworking architecture that is more efficient and scalable. While several ICN architectures have been evaluated for networks carrying web and video traffic, the benefits and challenges it poses for Internet of Things (IoT) networks are relatively unexplored. In our work, we evaluate the performance implications for typical IoT network scenarios in the ICN paradigm. We study the behavior of in-network caching, introduce a way to make caching more efficient for periodic sensor data, and evaluate the impact of presence and location of lossy wireless links in IoT networks. In this paper, we present and discuss the results of our evaluations on IoT networks performed through emulations using a specific ICN architecture, namely, content centric networking (CCN). For example, we show that the newly proposed UTS-LRU cache replacement strategy for improved caching performance of time series content streams reduces the number of messages transmitted by up to 16%. Our findings indicate that the performance of IoT networks using ICN are influenced by the content model and the nature of its links, and motivates further studies to understand the performance implications in more varied IoT scenarios.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131826627","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}
Keoma Brun-Laguna, A. Diedrichs, Diego Dujovne, R. Léone, Xavier Vilajosana, T. Watteyne
A 21-node low-power wireless mesh network is deployed in a peach orchard. The network serves as a frost event prediction system. On top of sensor values, devices also report network statistics. In 3 months of operations, the network has produced over 4 million temperature values, and over 350,000 network statistics. This paper presents an in-depth analysis of the statistics, in order to precisely understand the performance of the network. Nodes in the network exhibit an expected lifetime between 4 and 16 years, with an end-to-end reliability of 100%. We show how -- contrary to popular belief -- wireless links are symmetric. Thanks to the use of Time Slotted Channel Hopping (TSCH), the network topology is very stable, with ≤5 link changes per day in the entire network.
{"title":"(Not so) intuitive results from a smart agriculture low-power wireless mesh deployment","authors":"Keoma Brun-Laguna, A. Diedrichs, Diego Dujovne, R. Léone, Xavier Vilajosana, T. Watteyne","doi":"10.1145/2979683.2979696","DOIUrl":"https://doi.org/10.1145/2979683.2979696","url":null,"abstract":"A 21-node low-power wireless mesh network is deployed in a peach orchard. The network serves as a frost event prediction system. On top of sensor values, devices also report network statistics. In 3 months of operations, the network has produced over 4 million temperature values, and over 350,000 network statistics. This paper presents an in-depth analysis of the statistics, in order to precisely understand the performance of the network. Nodes in the network exhibit an expected lifetime between 4 and 16 years, with an end-to-end reliability of 100%. We show how -- contrary to popular belief -- wireless links are symmetric. Thanks to the use of Time Slotted Channel Hopping (TSCH), the network topology is very stable, with ≤5 link changes per day in the entire network.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261489","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}
Teemu Kärkkäinen, P. Houghton, L. Valerio, A. Passarella, J. Ott
Many of today's popular online social networks are disconnected from their users' immediate social and physical context, which makes them poorly suited for supporting transient, on-purpose social communities of co-located users. We introduce the idea of a local dataspace that can mediate social interactions via freely user modifiable shared content. We demonstrate this concept via an opportunistic experience sharing application Here&Now.
{"title":"Here&now: data-centric local social interactions through opportunistic networks: demo","authors":"Teemu Kärkkäinen, P. Houghton, L. Valerio, A. Passarella, J. Ott","doi":"10.1145/2979683.2979700","DOIUrl":"https://doi.org/10.1145/2979683.2979700","url":null,"abstract":"Many of today's popular online social networks are disconnected from their users' immediate social and physical context, which makes them poorly suited for supporting transient, on-purpose social communities of co-located users. We introduce the idea of a local dataspace that can mediate social interactions via freely user modifiable shared content. We demonstrate this concept via an opportunistic experience sharing application Here&Now.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096832","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}
Sahar Hoteit, Guangshuo Chen, A. C. Viana, M. Fiore
Call Detail Records (CDRs) have been widely used in the last decades for studying different aspects of human mobility. The accuracy of CDRs strongly depends on the user-network interaction frequency: hence, the temporal and spatial sparsity that typically characterize CDR can introduce a bias in the mobility analysis. In this paper, we evaluate the bias induced by the use of CDRs for inferring important locations of mobile subscribers, as well as their complete trajectories. Besides, we propose a novel technique for estimating real human trajectories from sparse CDRs. Compared to previous solutions in the literature, our proposed technique reduces the error between real and estimated human trajectories and at the same time shortens the temporal period where users' locations remain undefined.
{"title":"Filling the gaps: on the completion of sparse call detail records for mobility analysis","authors":"Sahar Hoteit, Guangshuo Chen, A. C. Viana, M. Fiore","doi":"10.1145/2979683.2979685","DOIUrl":"https://doi.org/10.1145/2979683.2979685","url":null,"abstract":"Call Detail Records (CDRs) have been widely used in the last decades for studying different aspects of human mobility. The accuracy of CDRs strongly depends on the user-network interaction frequency: hence, the temporal and spatial sparsity that typically characterize CDR can introduce a bias in the mobility analysis. In this paper, we evaluate the bias induced by the use of CDRs for inferring important locations of mobile subscribers, as well as their complete trajectories. Besides, we propose a novel technique for estimating real human trajectories from sparse CDRs. Compared to previous solutions in the literature, our proposed technique reduces the error between real and estimated human trajectories and at the same time shortens the temporal period where users' locations remain undefined.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121054526","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}
Precision livestock farming and other agricultural applications are considered to have great potential to utilise the many benefits of IoT technology. It is however important to maintain low cost and energy consumption to make it feasible in a very competitive market, making opportunistic and D2D communication interesting options. The demo will show a prototype of a system for monitoring grazing cattle in large free-range areas. We will demonstrate the mobile devices collecting data about the animals and their encounters with each other as well as the cloud platform that allows the farmer to access the data for more efficient operation of the farm.
{"title":"Opportunistic iot for monitoring of grazing cattle: demo","authors":"Anders Lindgren, A. Zaitov, Belin Siderov Mitkov","doi":"10.1145/2979683.2979697","DOIUrl":"https://doi.org/10.1145/2979683.2979697","url":null,"abstract":"Precision livestock farming and other agricultural applications are considered to have great potential to utilise the many benefits of IoT technology. It is however important to maintain low cost and energy consumption to make it feasible in a very competitive market, making opportunistic and D2D communication interesting options. The demo will show a prototype of a system for monitoring grazing cattle in large free-range areas. We will demonstrate the mobile devices collecting data about the animals and their encounters with each other as well as the cloud platform that allows the farmer to access the data for more efficient operation of the farm.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114063328","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}
This paper is motivated by the fact that modern cities are surprisingly vulnerable to large-scale emergencies, such as the recent terrorist attacks on Paris that resulted in the death of 130 people. Disaster shelters are one of the most effective methods to handle large-scale emergencies. Hence, this paper establishes disaster shelters with bounded costs. The objective is to minimize the total establishment costs of disaster shelters under three constraints. The first constraint is a distance constraint, which requires that people must be assigned to disaster shelters within a certain range. The second constraint is a capacity constraint, which requires that disaster shelters must have the capacity to hold incoming people. The third constraint is a connection constraint, which requires that disaster shelters should be connected to avoid being isolated. Two bounded algorithms are proposed to efficiently establish disaster shelters. Real data-driven experiments are conducted to demonstrate the efficiency and effectiveness of the proposed algorithms.
{"title":"Connected placement of disaster shelters in modern cities","authors":"Huanyang Zheng, Jie Wu","doi":"10.1145/2979683.2979690","DOIUrl":"https://doi.org/10.1145/2979683.2979690","url":null,"abstract":"This paper is motivated by the fact that modern cities are surprisingly vulnerable to large-scale emergencies, such as the recent terrorist attacks on Paris that resulted in the death of 130 people. Disaster shelters are one of the most effective methods to handle large-scale emergencies. Hence, this paper establishes disaster shelters with bounded costs. The objective is to minimize the total establishment costs of disaster shelters under three constraints. The first constraint is a distance constraint, which requires that people must be assigned to disaster shelters within a certain range. The second constraint is a capacity constraint, which requires that disaster shelters must have the capacity to hold incoming people. The third constraint is a connection constraint, which requires that disaster shelters should be connected to avoid being isolated. Two bounded algorithms are proposed to efficiently establish disaster shelters. Real data-driven experiments are conducted to demonstrate the efficiency and effectiveness of the proposed algorithms.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669881","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}
In IoT environments, a significant fraction of services can be expected to be relevant and contextualised to the physical area where data is generated. This is due to the typical strong bond between IoT devices and the physical environment where they are located. Moreover, communication patterns may be largely content-centric rather than device-centric, as interest would be in getting the data, irrespective of where they are generated or stored. In this paper we propose MobCCN, a content-centric network protocol to support data delivery in presence of tiny IoT devices (such as sensors) and users' personal mobile devices (such as smartphones). MobCCN joins together opportunistic networking techniques (to support contextualised, proximity-based communications) and Information Centric Networking (ICN) to support content-centric communication patterns. MobCCN defines a new CCN-like routing and forwarding algorithm, which dynamically builds a gradient-based content-dissemination graph using estimates of the contact rates between nodes, and between nodes and the data that is produced and stored in the network. While preserving compatibility with the standard CCN mechanisms, the MobCCN algorithm makes CCN routing and forwarding suitable for opportunistic networking environments. We have implemented MobCCN in CCN-lite, a de-facto standard lightweight implementation of CCN, which is suitable for resource-constrained devices. Simulation results confirm the feasibility of the proposed approach both in terms of scalability and efficiency.
{"title":"MobCCN: a CCN-compliant protocol for data collection with opportunistic contacts in IoT environments","authors":"E. Borgia, R. Bruno, A. Passarella","doi":"10.1145/2979683.2979695","DOIUrl":"https://doi.org/10.1145/2979683.2979695","url":null,"abstract":"In IoT environments, a significant fraction of services can be expected to be relevant and contextualised to the physical area where data is generated. This is due to the typical strong bond between IoT devices and the physical environment where they are located. Moreover, communication patterns may be largely content-centric rather than device-centric, as interest would be in getting the data, irrespective of where they are generated or stored. In this paper we propose MobCCN, a content-centric network protocol to support data delivery in presence of tiny IoT devices (such as sensors) and users' personal mobile devices (such as smartphones). MobCCN joins together opportunistic networking techniques (to support contextualised, proximity-based communications) and Information Centric Networking (ICN) to support content-centric communication patterns. MobCCN defines a new CCN-like routing and forwarding algorithm, which dynamically builds a gradient-based content-dissemination graph using estimates of the contact rates between nodes, and between nodes and the data that is produced and stored in the network. While preserving compatibility with the standard CCN mechanisms, the MobCCN algorithm makes CCN routing and forwarding suitable for opportunistic networking environments. We have implemented MobCCN in CCN-lite, a de-facto standard lightweight implementation of CCN, which is suitable for resource-constrained devices. Simulation results confirm the feasibility of the proposed approach both in terms of scalability and efficiency.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125673646","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}
Network densification via small cells is considered as a key step to cope with the data tsunami. Caching data at small cells or even user devices is also considered as a promising way to alleviate the backhaul congestion this densification might cause. However, the former suffers from high deployment and maintenance costs, and the latter from limited resources and privacy issues with user devices. We argue that an architecture with (public or private) vehicles acting as mobile caches and communication relays might be a promising middle ground. In this paper, we assume such a vehicular cloud is in place to provide video streaming to users, and that the operator can decide which content to store in the vehicle caches. Users can then greedily fill their playout buffer with video pieces of the streamed content from encountered vehicles, and turn to the infrastructure immediately when the playout buffer is empty, to ensure uninterrupted streaming. Our main contribution is to model the playout buffer in the user device with a queuing approach, and to provide a mathematical formulation for the idle periods of this buffer, which relate to the bytes downloaded from the cellular infrastructure. We also solve the resulting content allocation problem, and perform trace-based simulations to finally show that up to 50% of the original traffic could be offloaded from the main infrastructure.
{"title":"Streaming content from a vehicular cloud","authors":"Luigi Vigneri, T. Spyropoulos, C. Barakat","doi":"10.1145/2979683.2979684","DOIUrl":"https://doi.org/10.1145/2979683.2979684","url":null,"abstract":"Network densification via small cells is considered as a key step to cope with the data tsunami. Caching data at small cells or even user devices is also considered as a promising way to alleviate the backhaul congestion this densification might cause. However, the former suffers from high deployment and maintenance costs, and the latter from limited resources and privacy issues with user devices. We argue that an architecture with (public or private) vehicles acting as mobile caches and communication relays might be a promising middle ground. In this paper, we assume such a vehicular cloud is in place to provide video streaming to users, and that the operator can decide which content to store in the vehicle caches. Users can then greedily fill their playout buffer with video pieces of the streamed content from encountered vehicles, and turn to the infrastructure immediately when the playout buffer is empty, to ensure uninterrupted streaming. Our main contribution is to model the playout buffer in the user device with a queuing approach, and to provide a mathematical formulation for the idle periods of this buffer, which relate to the bytes downloaded from the cellular infrastructure. We also solve the resulting content allocation problem, and perform trace-based simulations to finally show that up to 50% of the original traffic could be offloaded from the main infrastructure.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121211633","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}
The increasing trend on wireless-connected devices makes opportunistic networking a promising alternative to existing infrastructure-based networks. However, these networks offer no guarantees about connection availability or network topology. The development of opportunistic applications, i.e., applications running over opportunistic networks, is still in early stages. One of the reasons is a lack of tools to support this process. Indeed, many tools have been introduced to study and characterize opportunistic networks but none of them is focused on helping developers to conceive opportunistic applications. In this paper, we argue that the gap between opportunistic applications development and network characterization can be filled with network emulation. As proof of concept, we propose and describe HINT, a realtime event-driven emulator that allows developers to early test their opportunistic applications prior to deployment. We introduce the architecture and corresponding implementation of our proposal, and conduct a preliminary validation by assessing its scalability.
{"title":"HINT: from network characterization to opportunistic applications","authors":"G. Baudic, A. Auger, Victor Ramiro, E. Lochin","doi":"10.1145/2979683.2979694","DOIUrl":"https://doi.org/10.1145/2979683.2979694","url":null,"abstract":"The increasing trend on wireless-connected devices makes opportunistic networking a promising alternative to existing infrastructure-based networks. However, these networks offer no guarantees about connection availability or network topology. The development of opportunistic applications, i.e., applications running over opportunistic networks, is still in early stages. One of the reasons is a lack of tools to support this process. Indeed, many tools have been introduced to study and characterize opportunistic networks but none of them is focused on helping developers to conceive opportunistic applications. In this paper, we argue that the gap between opportunistic applications development and network characterization can be filled with network emulation. As proof of concept, we propose and describe HINT, a realtime event-driven emulator that allows developers to early test their opportunistic applications prior to deployment. We introduce the architecture and corresponding implementation of our proposal, and conduct a preliminary validation by assessing its scalability.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321747","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
扫码关注我们
求助内容：
应助结果提醒方式：