Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
STEPS - an approach for human mobility modeling
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
How disorder impacts routing in human-centric disruption tolerant networks
Proceedings of the 2013 ACM SIGCOMM workshop on Future human-centric multimedia networking
| Hi-index | 0.00 |
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.