B. Walker, M. Tsuru, A. Caro, A. Keränen, J. Ott, Teemu Kärkkäinen, S. Yamamura, Akira Nagata
The most common definition of a challenged network, or Delay-Tolerant Network, is one in which there is no guarantee of a contemporaneous end-to-end path from source to destination. Because of the breadth of of the field, a wide variety of evaluation techniques have been developed and utilized. The goal of this panel is to showcase and discuss an interesting and current selection of evaluation efforts. In this year’s CHANTS submissions over a third used the ONE simulator from Aalto University [1, 2]. Keeping in mind that not all papers were based on simulation, it is fair to say that the ONE is becoming the de-facto simulation tool for certain types of DTN research. This is beneficial in that it facilitates comparisons between routing protocols, and allows researchers to focus their efforts on a single accessible tool. However the growing body of work that compares protocols that exist only in simulation may indicate an over-reliance on simulation and could lead to overlooking important practical technical challenges in the field. Another approach to evaluation is to deploy trial nodes in a real environment. Masato Tsuru has been involved in such field tests in collaboration with Japan’s NIICT and will be able to discuss their reasons for carrying out their experiments and the challenges involved. In addition the DARPA DTN project involved a considerable amount of field testing, and BBN’s Armando Caro will be able to give his perspective on the value and importance of their tests.
{"title":"The state of DTN evaluation","authors":"B. Walker, M. Tsuru, A. Caro, A. Keränen, J. Ott, Teemu Kärkkäinen, S. Yamamura, Akira Nagata","doi":"10.1145/1859934.1859941","DOIUrl":"https://doi.org/10.1145/1859934.1859941","url":null,"abstract":"The most common definition of a challenged network, or Delay-Tolerant Network, is one in which there is no guarantee of a contemporaneous end-to-end path from source to destination. Because of the breadth of of the field, a wide variety of evaluation techniques have been developed and utilized. The goal of this panel is to showcase and discuss an interesting and current selection of evaluation efforts. In this year’s CHANTS submissions over a third used the ONE simulator from Aalto University [1, 2]. Keeping in mind that not all papers were based on simulation, it is fair to say that the ONE is becoming the de-facto simulation tool for certain types of DTN research. This is beneficial in that it facilitates comparisons between routing protocols, and allows researchers to focus their efforts on a single accessible tool. However the growing body of work that compares protocols that exist only in simulation may indicate an over-reliance on simulation and could lead to overlooking important practical technical challenges in the field. Another approach to evaluation is to deploy trial nodes in a real environment. Masato Tsuru has been involved in such field tests in collaboration with Japan’s NIICT and will be able to discuss their reasons for carrying out their experiments and the challenges involved. In addition the DARPA DTN project involved a considerable amount of field testing, and BBN’s Armando Caro will be able to give his perspective on the value and importance of their tests.","PeriodicalId":404958,"journal":{"name":"CHANTS '10","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116696438","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}
Effectively utilizing groups in delay tolerant networks (DTNs) can both improve the throughput of unicast routing protocols and open the door for a wide range of paradigms, such as anycast and multicast. Unfortunately, in DTN environments, there is no centralized entity that can quickly and reliably transmit group membership lists, and hence group information must be disseminated through unreliable and potentially malicious nodes. In this paper, we propose a local and robust group information dissemination and consolidation protocol, called MembersOnly, that both quickly and accurately transmits group membership information to all nodes in the network, even if multiple malicious nodes attempt to disrupt the process. We show via analysis and simulations that MembersOnly is able to withstand multiple types of attacks, with only very limited periods of vulnerability that disappear relatively quickly. This is in contrast to current techniques that cannot withstand many of these attacks, resulting in quick and thorough corruption of group membership lists. In addition, we show via simulation that even the most basic routing protocols can gain a performance advantage when using MembersOnly.
{"title":"For members only: local and robust group management in DTNS","authors":"S. Nelson, R. Kravets","doi":"10.1145/1859934.1859937","DOIUrl":"https://doi.org/10.1145/1859934.1859937","url":null,"abstract":"Effectively utilizing groups in delay tolerant networks (DTNs) can both improve the throughput of unicast routing protocols and open the door for a wide range of paradigms, such as anycast and multicast. Unfortunately, in DTN environments, there is no centralized entity that can quickly and reliably transmit group membership lists, and hence group information must be disseminated through unreliable and potentially malicious nodes. In this paper, we propose a local and robust group information dissemination and consolidation protocol, called MembersOnly, that both quickly and accurately transmits group membership information to all nodes in the network, even if multiple malicious nodes attempt to disrupt the process. We show via analysis and simulations that MembersOnly is able to withstand multiple types of attacks, with only very limited periods of vulnerability that disappear relatively quickly. This is in contrast to current techniques that cannot withstand many of these attacks, resulting in quick and thorough corruption of group membership lists. In addition, we show via simulation that even the most basic routing protocols can gain a performance advantage when using MembersOnly.","PeriodicalId":404958,"journal":{"name":"CHANTS '10","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130099043","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 talk, I will discuss a promising solution to the "last mile" problem of providing Internet connectivity in underserved rural areas of developing countries. The solution leverages existing road and vehicle infrastructure to create a digital wireless network by installing custom WiFi access points on vehicles already travelling between rural areas lacking Internet connectivity and urban areas where Internet connectivity is present. We will review how this technology was implemented in rural areas of five developing countries, citing technical results and challenges. While the technology seemed to have solved the last mile problem by reducing the connectivity cost per capita to a few cents, it failed to address what I refer to as the "last inch" problem: the need to identify the data and interface that users are willing to pay for in order to sustain the connectivity infrastructure without donations and grants. I will explain how we adapted to address this last inch problem by migrating to a new mobile infrastructure with a more specific market focus. I will explore what lessons can be learned from our experiences as well as highlight areas for further research. "Technology is easy, humans are hard. - John Gage, Former Chief Researcher at Sun Microsystems
{"title":"The last inch of the last mile challenge","authors":"A. Hasson","doi":"10.1145/1859934.1859935","DOIUrl":"https://doi.org/10.1145/1859934.1859935","url":null,"abstract":"In this talk, I will discuss a promising solution to the \"last mile\" problem of providing Internet connectivity in underserved rural areas of developing countries. The solution leverages existing road and vehicle infrastructure to create a digital wireless network by installing custom WiFi access points on vehicles already travelling between rural areas lacking Internet connectivity and urban areas where Internet connectivity is present. We will review how this technology was implemented in rural areas of five developing countries, citing technical results and challenges. While the technology seemed to have solved the last mile problem by reducing the connectivity cost per capita to a few cents, it failed to address what I refer to as the \"last inch\" problem: the need to identify the data and interface that users are willing to pay for in order to sustain the connectivity infrastructure without donations and grants. I will explain how we adapted to address this last inch problem by migrating to a new mobile infrastructure with a more specific market focus. I will explore what lessons can be learned from our experiences as well as highlight areas for further research.\u0000 \"Technology is easy, humans are hard. - John Gage, Former Chief Researcher at Sun Microsystems","PeriodicalId":404958,"journal":{"name":"CHANTS '10","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131295187","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}
Dongwoon Hahn, Ginnah Lee, Youngil Kim, B. Walker, Matthew Beecher, P. Mundur
MeshTest is a laboratory-based mobile wireless testbed. The system offers more realism than simulation or network-level emulation because it uses real implementation running on real devices, communicating using real wireless hardware over an emulated RF environment. However it also provides repeatability, control, and convenience not possible in field experiments. The original MeshTest system could only accommodate 8-16 nodes in an experiment. The Virtual MeshTest (VMT) system expands the capacity of the system, using virtualization and live migration to facilitate much larger Delay-Tolerant Network (DTN) experiments.
{"title":"DTN experiments on the virtual meshtest testbed","authors":"Dongwoon Hahn, Ginnah Lee, Youngil Kim, B. Walker, Matthew Beecher, P. Mundur","doi":"10.1145/1859934.1859952","DOIUrl":"https://doi.org/10.1145/1859934.1859952","url":null,"abstract":"MeshTest is a laboratory-based mobile wireless testbed. The system offers more realism than simulation or network-level emulation because it uses real implementation running on real devices, communicating using real wireless hardware over an emulated RF environment. However it also provides repeatability, control, and convenience not possible in field experiments. The original MeshTest system could only accommodate 8-16 nodes in an experiment. The Virtual MeshTest (VMT) system expands the capacity of the system, using virtualization and live migration to facilitate much larger Delay-Tolerant Network (DTN) experiments.","PeriodicalId":404958,"journal":{"name":"CHANTS '10","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130925832","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
扫码关注我们
求助内容：
应助结果提醒方式：