Bluetooth Low Energy (BLE) was designed as a low power alternative to classic Bluetooth. However, the use of BLE in dense, Internet of Things (IoT) deployments results in high collision rates and wasted energy. In response, we present an in-depth evaluation of the effects of having a high density of both transmitting tags and scanning devices in IoT environments. Based on our evaluation, we introduce Beacon Train Mode, an additional mode targeting dense IoT deployments with large numbers of both tags and scanning devices. Our results show that although active scanning breaks down when there are 5 or more scanning devices, beacon trains scale to any number of scanning devices.
{"title":"Beacon trains: blazing a trail through dense BLE environments","authors":"R. Kravets, A. Harris, R. Want","doi":"10.1145/2979683.2979687","DOIUrl":"https://doi.org/10.1145/2979683.2979687","url":null,"abstract":"Bluetooth Low Energy (BLE) was designed as a low power alternative to classic Bluetooth. However, the use of BLE in dense, Internet of Things (IoT) deployments results in high collision rates and wasted energy. In response, we present an in-depth evaluation of the effects of having a high density of both transmitting tags and scanning devices in IoT environments. Based on our evaluation, we introduce Beacon Train Mode, an additional mode targeting dense IoT deployments with large numbers of both tags and scanning devices. Our results show that although active scanning breaks down when there are 5 or more scanning devices, beacon trains scale to any number of scanning devices.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"3 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":"127095310","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, Mika Välimaa, Esa Hyytiä, J. Ott
Many of the existing opportunistic networking systems have been designed assuming a small number links per node and have trouble scaling to large numbers of potential concurrent communication partners. In the real world we often find wireless local area networks with large numbers of connected users -- in particular in open Wi-Fi networks provided by cities, airports, conferences and other venues. In this paper we build a 50 client opportunistic network in a single Wi-Fi access point and use it to uncover scaling problems and to suggest mechanisms to improve the performance. The ability to scale to high density network segments creates new, realistic use cases for opportunistic networking applications.
{"title":"Opportunistic content dissemination performance in dense network segments","authors":"Teemu Kärkkäinen, Mika Välimaa, Esa Hyytiä, J. Ott","doi":"10.1145/2979683.2979692","DOIUrl":"https://doi.org/10.1145/2979683.2979692","url":null,"abstract":"Many of the existing opportunistic networking systems have been designed assuming a small number links per node and have trouble scaling to large numbers of potential concurrent communication partners. In the real world we often find wireless local area networks with large numbers of connected users -- in particular in open Wi-Fi networks provided by cities, airports, conferences and other venues. In this paper we build a 50 client opportunistic network in a single Wi-Fi access point and use it to uncover scaling problems and to suggest mechanisms to improve the performance. The ability to scale to high density network segments creates new, realistic use cases for opportunistic networking applications.","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":"126569954","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}
Over the years, challenged networks have evolved from niche solution for extremely hostile scenarios (such as disaster relief or connectivity provision in rural and remote areas) to important component of everyday networks. In their second life, challenged networks have entered mobile cloud/mobile edge computing, IoT, mobile data offloading, and SDN. It is exactly these new directions of challenged networking that are the focus of this 2016 edition of CHANTS. While keeping an eye on the future, we also wanted to tackle a years-old affliction: how to move from theory to practice when dealing with challenged networks. For this reason, we also have a lineup spanning DTN software and testbeds that will speed up the jump from the research lab to marketable products.
{"title":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","authors":"C. Boldrini, M. Amorim","doi":"10.1145/2979683","DOIUrl":"https://doi.org/10.1145/2979683","url":null,"abstract":"Over the years, challenged networks have evolved from niche solution for extremely hostile scenarios (such as disaster relief or connectivity provision in rural and remote areas) to important component of everyday networks. In their second life, challenged networks have entered mobile cloud/mobile edge computing, IoT, mobile data offloading, and SDN. It is exactly these new directions of challenged networking that are the focus of this 2016 edition of CHANTS. While keeping an eye on the future, we also wanted to tackle a years-old affliction: how to move from theory to practice when dealing with challenged networks. For this reason, we also have a lineup spanning DTN software and testbeds that will speed up the jump from the research lab to marketable products.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"1 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":"130703566","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}
Opportunistic sensor networks typically rely on node mobility to monitor an area by collecting samples at different locations. In this paper we show how the mobility in combination with the periodic sampling of nodes causes large differences in the sensor coverage. We address this issue by leveraging simple heuristics based on local knowledge, employing an adaptive sampling scheme. The main insight is that areas where over-sampling is prevalent exhibit a high correlation with node contacts. Results obtained from both synthetic and real-world traces show that a dramatic decrease in oversampling of affected areas is achievable alongside a smaller increase of samples in more sparse areas.
{"title":"Towards even coverage monitoring with opportunistic sensor networks","authors":"H. Wennerström, C. Rohner","doi":"10.1145/2979683.2979691","DOIUrl":"https://doi.org/10.1145/2979683.2979691","url":null,"abstract":"Opportunistic sensor networks typically rely on node mobility to monitor an area by collecting samples at different locations. In this paper we show how the mobility in combination with the periodic sampling of nodes causes large differences in the sensor coverage. We address this issue by leveraging simple heuristics based on local knowledge, employing an adaptive sampling scheme. The main insight is that areas where over-sampling is prevalent exhibit a high correlation with node contacts. Results obtained from both synthetic and real-world traces show that a dramatic decrease in oversampling of affected areas is achievable alongside a smaller increase of samples in more sparse areas.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"20 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":"120973311","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 Stream Control Transmission Protocol (SCTP) offers several distinct features which can be leveraged for Disruption or Delay Tolerant Networking (DTN). SCTP is able to handle an arbitrary number of independent streams in one connection---termed an association---and it also supports using multiple networking devices in one association at the same time (multi-homing). With the latter, either switching between network devices, e. g., for fail-over, or even Concurrent Multipath Transfer (CMT) is possible during a transfer. In this paper, we present SCTPCL, a Convergence Layer protocol for the Bundle Protocol, which brings these benefits to DTN implementations. We leverage the multi-streaming capability to handle priorities, such as those of the Bundle Protocol, as well as a separate control stream in parallel. Multi-homing not only enables an increased reliability, but is also especially useful for energy-aware wireless systems where a transfer may be initiated using a low-power device while for larger data it can be switched to a high bandwidth link.
{"title":"SCTPCL: an SCTP convergence layer protocol for DTN","authors":"M. Wegner, S. Rottmann, L. Wolf","doi":"10.1145/2979683.2979693","DOIUrl":"https://doi.org/10.1145/2979683.2979693","url":null,"abstract":"The Stream Control Transmission Protocol (SCTP) offers several distinct features which can be leveraged for Disruption or Delay Tolerant Networking (DTN). SCTP is able to handle an arbitrary number of independent streams in one connection---termed an association---and it also supports using multiple networking devices in one association at the same time (multi-homing). With the latter, either switching between network devices, e. g., for fail-over, or even Concurrent Multipath Transfer (CMT) is possible during a transfer. In this paper, we present SCTPCL, a Convergence Layer protocol for the Bundle Protocol, which brings these benefits to DTN implementations. We leverage the multi-streaming capability to handle priorities, such as those of the Bundle Protocol, as well as a separate control stream in parallel. Multi-homing not only enables an increased reliability, but is also especially useful for energy-aware wireless systems where a transfer may be initiated using a low-power device while for larger data it can be switched to a high bandwidth link.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"1 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":"130180126","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}
Dominik Meißner, Benjamin Erb, R. V. D. Heijden, Kristin Lange, F. Kargl
In large-scale disaster scenarios, efficient triage management is a major challenge for emergency services. Rescue forces traditionally respond to such incidents with a paper-based triage system, but technical solutions can potentially achieve improved usability and data availability. We develop a triage management system based on commodity hardware and software components to verify this claim. We use a single-hop, ad-hoc network architecture with multi-master replication, a tablet-based device setup, and a mobile application for emergency services. We study our system in cooperation with regional emergency services and report on experiences from a field exercise. We show that state-of-the-art commodity technology provides the means necessary to implement a triage management system compatible with existing emergency service procedures, while introducing additional benefits. This work highlights that powerful real-world ad-hoc networking applications do not require unreasonable development effort, as existing tools from distributed systems, such as replicating NoSQL databases, can be used successfully.
{"title":"Mobile triage management in disaster area networks using decentralized replication","authors":"Dominik Meißner, Benjamin Erb, R. V. D. Heijden, Kristin Lange, F. Kargl","doi":"10.1145/2979683.2979689","DOIUrl":"https://doi.org/10.1145/2979683.2979689","url":null,"abstract":"In large-scale disaster scenarios, efficient triage management is a major challenge for emergency services. Rescue forces traditionally respond to such incidents with a paper-based triage system, but technical solutions can potentially achieve improved usability and data availability. We develop a triage management system based on commodity hardware and software components to verify this claim. We use a single-hop, ad-hoc network architecture with multi-master replication, a tablet-based device setup, and a mobile application for emergency services. We study our system in cooperation with regional emergency services and report on experiences from a field exercise. We show that state-of-the-art commodity technology provides the means necessary to implement a triage management system compatible with existing emergency service procedures, while introducing additional benefits. This work highlights that powerful real-world ad-hoc networking applications do not require unreasonable development effort, as existing tools from distributed systems, such as replicating NoSQL databases, can be used successfully.","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":"127749583","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 this work, we show how to use HINT, a real-time event-driven network emulator, to support the development process of opportunistic applications. In this demo, we use this emulator in conjunction with an example Android chat application to demonstrate its features.
{"title":"Using the HINT network emulator to develop opportunistic applications: demo","authors":"A. Auger, G. Baudic, Victor Ramiro, E. Lochin","doi":"10.1145/2979683.2979699","DOIUrl":"https://doi.org/10.1145/2979683.2979699","url":null,"abstract":"In this work, we show how to use HINT, a real-time event-driven network emulator, to support the development process of opportunistic applications. In this demo, we use this emulator in conjunction with an example Android chat application to demonstrate its features.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"387 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132544836","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}
Caching popular content at the edge of future mobile networks has been widely considered in order to alleviate the impact of the data tsunami on both the access and backhaul networks. A number of interesting techniques have been proposed, including femto-caching and "delayed" or opportunistic cache access. Nevertheless, the majority of these approaches suffer from the rather limited storage capacity of the edge caches, compared to the tremendous and rapidly increasing size of the Internet content catalog. We propose to depart from the assumption of hard cache misses, common in most existing works, and consider "soft" cache misses, where if the original content is not available, an alternative content that is locally cached can be recommended. Given that Internet content consumption is increasingly entertainment-oriented, we believe that a related content could often lead to complete or at least partial user satisfaction, without the need to retrieve the original content over expensive links. In this paper, we formulate the problem of optimal edge caching with soft cache hits, in the context of delayed access, and analyze the expected gains. We then show using synthetic and real datasets of related video contents that promising caching gains could be achieved in practice.
{"title":"Soft cache hits and the impact of alternative content recommendations on mobile edge caching","authors":"T. Spyropoulos, Pavlos Sermpezis","doi":"10.1145/2979683.2979688","DOIUrl":"https://doi.org/10.1145/2979683.2979688","url":null,"abstract":"Caching popular content at the edge of future mobile networks has been widely considered in order to alleviate the impact of the data tsunami on both the access and backhaul networks. A number of interesting techniques have been proposed, including femto-caching and \"delayed\" or opportunistic cache access. Nevertheless, the majority of these approaches suffer from the rather limited storage capacity of the edge caches, compared to the tremendous and rapidly increasing size of the Internet content catalog. We propose to depart from the assumption of hard cache misses, common in most existing works, and consider \"soft\" cache misses, where if the original content is not available, an alternative content that is locally cached can be recommended. Given that Internet content consumption is increasingly entertainment-oriented, we believe that a related content could often lead to complete or at least partial user satisfaction, without the need to retrieve the original content over expensive links. In this paper, we formulate the problem of optimal edge caching with soft cache hits, in the context of delayed access, and analyze the expected gains. We then show using synthetic and real datasets of related video contents that promising caching gains could be achieved in practice.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125499232","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
扫码关注我们
求助内容：
应助结果提醒方式：