1,687 research outputs found

    Performance modelling of opportunistic forwarding with exact knowledge

    Get PDF
    The Delay Tolerant Networking paradigm aims to enable communications in disconnected environments where traditional protocols would fail. Opportunistic networks are delay tolerant networks whose nodes are typically the users\u27 personal mobile devices. Communications in an opportunistic network rely on the mobility of users: each message is forwarded from node to node, according to a hop-by-hop decision process that selects the node that is better suited for bringing the message closer to its destination. Despite the variety of forwarding protocols that have been proposed in the recent years, there is no reference framework for the performance modelling of opportunistic forwarding. In this paper we start to fill this gap by proposing an analytical model for the expected delay and the expected number of hops experienced by messages when delivered in an opportunistic fashion. This model seamlessly integrates both social-aware and social-oblivious single-copy forwarding protocols, as well as different hypotheses for user contact dynamics. The proposed framework is used to derive bounds on the expected delay under homogeneous and heterogeneous contact patterns. We found that, in heterogeneous settings, finite expected delay can be guaranteed not only when nodes\u27 inter-meeting times follow an exponential or power law with exponential cut-off distribution, but also when they are power law distributed, as long as weaker conditions than those derived by Chaintreau et al. [1] for the homogeneous scenario are satisfied

    Faster Information Propagation on Highways: a Virtual MIMO Approach

    Full text link
    In vehicular communications, traffic-related information should be spread over the network as quickly as possible to maintain a safe and reliable transportation system. This motivates us to develop more efficient information propagation schemes. In this paper, we propose a novel cluster-based cooperative information forwarding scheme, in which the vehicles opportunistically form virtual antenna arrays to boost one-hop transmission range and therefore accelerate information propagation along the highway. Both closed-form results of the transmission range gain and the improved Information Propagation Speed (IPS) are derived and verified by simulations. It is observed that the proposed scheme demonstrates the most significant IPS gain in moderate traffic scenarios, whereas too dense or too sparse vehicle density results in less gain. Moreover, it is also shown that increased mobility offers more contact opportunities and thus facilitates information propagation.Comment: IEEE 2014 Global Telecommunications Conference (GLOBECOM 2014) - Communication Theory Symposiu

    Plausible Mobility: Inferring Movement from Contacts

    Full text link
    We address the difficult question of inferring plausible node mobility based only on information from wireless contact traces. Working with mobility information allows richer protocol simulations, particularly in dense networks, but requires complex set-ups to measure, whereas contact information is easier to measure but only allows for simplistic simulation models. In a contact trace a lot of node movement information is irretrievably lost so the original positions and velocities are in general out of reach. We propose a fast heuristic algorithm, inspired by dynamic force-based graph drawing, capable of inferring a plausible movement from any contact trace, and evaluate it on both synthetic and real-life contact traces. Our results reveal that (i) the quality of the inferred mobility is directly linked to the precision of the measured contact trace, and (ii) the simple addition of appropriate anticipation forces between nodes leads to an accurate inferred mobility.Comment: 8 pages, 8 figures, 1 tabl

    On the Dynamics of Human Proximity for Data Diffusion in Ad-Hoc Networks

    Full text link
    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
    • …
    corecore