538 research outputs found

    Pervasive intelligent routing in content centric delay tolerant networks

    Get PDF
    This paper introduces a Swarm-Intelligence based Routing protocol (SIR) that aims to efficiently route information in content centric Delay Tolerant Networks (CCDTN) also dubbed pocket switched networks. First, this paper formalizes the notion of optimal path in CCDTN and introduces an original and efficient algorithm to process these paths in dynamic graphs. The properties and some invariant features of these optimal paths are analyzed and derived from several real traces. Then, this paper shows how optimal path in CCDTN can be found and used from a fully distributed swarm-intelligence based approach of which the global intelligent behavior (i.e. shortest path discovery and use) emerges from simple peer to peer interactions applied during opportunistic contacts. This leads to the definition of the SIR routing protocol of which the consistency, efficiency and performances are demonstrated from intensive representative simulations

    Routing in a many-to-one communication scenario in a realistic VDTN

    Get PDF
    In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft

    Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks

    Get PDF
    This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN

    Routing in Delay Tolerant Networks

    Get PDF
    Delay-tolerant networks (DTNs) have the great potential to connecting devices and regions of the world that are presently under-served by current networks. A vital challenge for Delay Tolerant Networks is to determine the routes through the network without ever having an end to end path, or knowing which routers will be connected at any given instant of time. The problem has an added constraint of limited size of buffers at each node. This situation limits the applicability of traditional routing techniques which categorize lack of path as failure of nodes and try to seek for existing end-to-end path. Approaches have been proposed which focus either on epidemic message replication or on previously known information about the connectivity schedule. The epidemic approach, which is basically a flooding technique, of replicating messages to all nodes has a very high overhead and does not perform well with increasing load. It can, however, operate without any prior information on the network configuration. On the other hand, the alternatives, i.e., having a prior knowledge about the connectivity, seems to be infeasible for a self-configuring network. In this project we try to maximize the message delivery rate without compromising on the amount of message discarded. The amount of message discarded has a direct relation to the bandwidth used and the battery consumed. The more the message discarded more is the bandwidth used and battery consumed by every node in transmitting the message. At the same time, with the increase in the number of messages discarded, the cost for processing every message increases and this adversely affects the nodes. Therefore, we have proposed an algorithm where the messages are disseminated faster into the network with lesser number of replication of individual messages. The history of encounter of a node with other nodes gives noisy but valuable information about the network topology. Using this history, we try to route the packets from one node to another using an algorithm that depends on each node’s present available neighbours/contact and the nodes which it has encountered in the recent past. We have also focused on passing the messages to those nodes which are on the move away from the source/forwarder node, as the nodes moving away have a greater probability of disseminating the messages throughout the network and hence increases chances of delivering the message to the destination

    Improvement of messages delivery time on vehicular delay-tolerant networks

    Get PDF
    “Copyright © [2009] IEEE. Reprinted from International Conference on Parallel Processing Workshops ICPPW '09.ISSN:1530-2016. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Networks (VDTNs) are an application of the Delay-Tolerant Network (DTN) concept, where the movement of vehicles and their message relaying service is used to enable network connectivity under unreliable conditions. To address the problem of intermittent connectivity, long-term message storage is combined with routing schemes that replicate messages at transfer opportunities. However, these strategies can be inefficient in terms of network resource usage. Therefore, efficient scheduling and dropping policies are necessary to improve the overall network performance. This work presents a performance analysis, based on simulation, of the impact of different scheduling and dropping policies enforced on Epidemic and Spray and Wait routing schemes. This paper evaluates these policies from the perspective of their efficiency in reducing the message’s end-to-end delay. In our scenario, it is shown that when these policies are based on the message’s lifetime criteria, the message average delay decreases significantly and the overall message delivery probability also increases for both routing protocols. Further simulations show that these results outperform the MaxProp and PRoPHET routing protocols that have their own scheduling and dropping mechanisms.Part of this work has been supported by Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the VDTN@Lab Project, and by the Euro-NF Network of Excellence from the Seventh Framework Programme of EU

    Evaluating the impact of storage capacity constraints on vehicular delay-tolerant networks

    Get PDF
    “Copyright © [2009] IEEE. Reprinted from Second International Conference on Communication Theory Reliability, and Quality of Service, 2009. CTRQ'09. ISBN:978-1-4244-4423-6. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Network (VDTN) was proposed as a particular application of a mobile Delay-Tolerant Network (DTN), where vehicles act as the communication infrastructure for the network, relaying messages between the network nodes. In this paper, we consider the use of a VDTN to provide low-cost asynchronous communication between sparse populations spread over a remote vast region. We analyze the influence of the VDTN network node’s storage capacity (buffer size), on the efficiency of four DTN routing protocols, in terms of message delivery probability. Our scenarios show that the routing protocols message replication strategies react differently to the increase of buffer size in specific network nodes. Epidemic and MaxProp protocols benefit from the increase of the storage capacity on all network nodes. Spray and Wait protocol only takes advantage on the increase of the vehicle’s buffer capacity. We expect that this paper will provide a deep understanding of the implications of storage constraints over the performance of a VDTN, leading to insights for future routing algorithm and buffer management theoretic studies and protocol design.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of Seven Framework Programme of EU

    Improving vehicular delay-tolerant network performance with relay nodes

    Get PDF
    “Copyright © [2009] IEEE. Reprinted from Next Generation Internet Network. NGI '09). ISBN:978-1-4244-4244-7. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Networking (VDTN) is an extension of the Delay-Tolerant Network (DTN) architecture concept to transit networks. VDTN architecture handles non-real time applications, exploiting vehicles to enable connectivity under unreliable scenarios with unstable links and where an end-to-end path may not exist. Intuitively, the use of stationary store-and-forward devices (relay nodes) located at crossroads where vehicles meet them and should improve the message delivery probability. In this paper, we analyze the influence of the number of relay nodes, in urban scenarios with different numbers of vehicles. It was shown that relay nodes significantly improve the message delivery probability on studied DTN routing protocols.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of Seven Framework Programme of EU

    Fibonary Spray and Wait Routing in Delay Tolerant Networks

    Get PDF
    Although there has been a tremendous rise in places being connected through the Internet or any other network protocol, there still lie areas, which remain out of reach due to various reasons. For all such places the answer is a Delay Tolerant Network (DTN). A DTN is such a network where there is no fixed or predefined route for messages and no such guarantee whatsoever of all messages being correctly routed. DTN can be considered as a superset of networks wherein other networks such as adhoc, mobile, vehicular etc. form the subset. Therefore routing in DTN is a very chancy affair where one has to maximize on the present network scenarios to get any fruitful result other than depending on past information. Also protocols here need to be less complex and not increase the already high nodal overhead. In this paper we propose a new approach, the Fibonary Spray and Wait, which does exactly this. It forwards copies of a message in a modified Binary Spray and Wait manner so that it performs well even in non independent and identically distributed node structure. We have supported our statements with mathematical as well as simulation analysis
    corecore