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

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

Pervasive intelligent routing in content centric delay tolerant networks

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

Mobility Study for Named Data Networking in Wireless Access Networks

Information centric networking (ICN) proposes to redesign the Internet by replacing its host-centric design with information-centric design. Communication among entities is established at the naming level, with the receiver side (referred to as the Consumer) acting as the driving force behind content delivery, by interacting with the network through Interest message transmissions. One of the proposed advantages for ICN is its support for mobility, by de-coupling applications from transport semantics. However, so far, little research has been conducted to understand the interaction between ICN and mobility of consuming and producing applications, in protocols purely based on information-centric principles, particularly in the case of NDN. In this paper, we present our findings on the mobility-based performance of Named Data Networking (NDN) in wireless access networks. Through simulations, we show that the current NDN architecture is not efficient in handling mobility and architectural enhancements needs to be done to fully support mobility of Consumers and Producers.Comment: to appear in IEEE ICC 201

Orion Routing Protocol for Delay-Tolerant Networks

In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does not necessarily exist, and on the other hand, it minimizes the routing delay and the network overhead to achieve better performance. In ORION, nodes are aware of their neighborhood by the mean of actual and statistical estimation of new contacts. ORION makes use of autoregressive moving average (ARMA) stochastic processes for best contact prediction and geographical coordinates for optimal greedy data packet forwarding. Simulation results have demonstrated that ORION outperforms other existing DTN routing protocols such as PRoPHET in terms of end-to-end delay, packet delivery ratio, hop count and first packet arrival

Evaluating Mobility Pattern Space Routing for DTNs

Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visit of nodes for each possible location. We show that the MobySpace can achieve good performance compared to that of the other algorithms we implemented, especially when we perform routing on the nodes that have a high connection time. We determine that the degree of homogeneity of mobility patterns of nodes has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.Comment: IEEE INFOCOM 2006 preprin

Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors

Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance