4,349 research outputs found
Delay Tolerant Networking over the Metropolitan Public Transportation
We discuss MDTN: a delay tolerant application platform built on top of the Public Transportation System (PTS) and able to provide service access while exploiting opportunistic connectivity. Our solution adopts a carrier-based approach where buses act as data collectors for user requests requiring Internet access. Simulations based on real maps and PTS routes with state-of-the-art routing protocols demonstrate that MDTN represents a viable solution for elastic nonreal-time service delivery. Nevertheless, performance indexes of the considered routing policies show that there is no golden rule for optimal performance and a tailored routing strategy is required for each specific case
In Vivo Evaluation of the Secure Opportunistic Schemes Middleware using a Delay Tolerant Social Network
Over the past decade, online social networks (OSNs) such as Twitter and
Facebook have thrived and experienced rapid growth to over 1 billion users. A
major evolution would be to leverage the characteristics of OSNs to evaluate
the effectiveness of the many routing schemes developed by the research
community in real-world scenarios. In this paper, we showcase the Secure
Opportunistic Schemes (SOS) middleware which allows different routing schemes
to be easily implemented relieving the burden of security and connection
establishment. The feasibility of creating a delay tolerant social network is
demonstrated by using SOS to power AlleyOop Social, a secure delay tolerant
networking research platform that serves as a real-life mobile social
networking application for iOS devices. SOS and AlleyOop Social allow users to
interact, publish messages, and discover others that share common interests in
an intermittent network using Bluetooth, peer-to-peer WiFi, and infrastructure
WiFi.Comment: 6 pages, 4 figures, accepted in ICDCS 2017. arXiv admin note: text
overlap with arXiv:1702.0565
On the Dynamics of Human Proximity for Data Diffusion in Ad-Hoc Networks
We report on a data-driven investigation aimed at understanding the dynamics
of message spreading in a real-world dynamical network of human proximity. We
use data collected by means of a proximity-sensing network of wearable sensors
that we deployed at three different social gatherings, simultaneously involving
several hundred individuals. We simulate a message spreading process over the
recorded proximity network, focusing on both the topological and the temporal
properties. We show that by using an appropriate technique to deal with the
temporal heterogeneity of proximity events, a universal statistical pattern
emerges for the delivery times of messages, robust across all the data sets.
Our results are useful to set constraints for generic processes of data
dissemination, as well as to validate established models of human mobility and
proximity that are frequently used to simulate realistic behaviors.Comment: A. Panisson et al., On the dynamics of human proximity for data
diffusion in ad-hoc networks, Ad Hoc Netw. (2011
Towards Opportunistic Data Dissemination in Mobile Phone Sensor Networks
Recently, there has been a growing interest within the research community in developing opportunistic routing protocols. Many schemes have been proposed; however, they differ greatly in assumptions and in type of network for which they are evaluated. As a result, researchers have an ambiguous understanding of how these schemes compare against each other in their specific applications. To investigate the performance of existing opportunistic routing algorithms in realistic scenarios, we propose a heterogeneous architecture including fixed infrastructure, mobile infrastructure, and mobile nodes. The proposed architecture focuses on how to utilize the available, low cost short-range radios of mobile phones for data gathering and dissemination. We also propose a new realistic mobility model and metrics. Existing opportunistic routing protocols are simulated and evaluated with the proposed heterogeneous architecture, mobility models, and transmission interfaces. Results show that some protocols suffer long time-to-live (TTL), while others suffer short TTL. We show that heterogeneous sensor network architectures need heterogeneous routing algorithms, such as a combination of Epidemic and Spray and Wait
- …