TACO-DTN is a Delay-Tolerant Network message dissemination mechanism I developed as part of my masters thesis project. This page is under construction, but my intention is to add how-to and the simulations code.
This research work was developed at University College London together with Dr Cecilia Mascolo and Dr Mirco Musolesi, then at Department of Computer Science. A paper detailing the research behind the algorithm was accepted and presented at the 2007 International MobiSys workshop on Mobile opportunistic networking.
You can download the paper here.
This is the relevant BiBTeX:
@inproceedings{1247711,
author = {Sollazzo, Giuseppe and Musolesi, Mirco and Mascolo, Cecilia},
title = {TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks},
booktitle = {MobiOpp '07: Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking},
year = {2007},
isbn = {978-1-59593-688-2},
pages = {83--90},
location = {San Juan, Puerto Rico},
doi = {http://doi.acm.org/10.1145/1247694.1247711},
publisher = {ACM},
address = {New York, NY, USA},
}
ABSTRACT:
Content dissemination applications are becoming more and more popular on fixed infrastructure: in this paper we introduce TACO-DTN, a content dissemination system which, by virtue of being time-aware in terms of subscriptions and events, is appropriate for delay tolerant networks, where a number of nodes act as infostations, enjoying some form of connectivity to the backbone, and other nodes are mobile devices, reachable sometimes only through intermittent connectivity of carriers. Examples of applications benefiting from such a system could be travel information dissemination systems in large cities (exploiting infostations at bus stops) or on highways, advertisements dissemination at specific times, and information dissemination to remote villages. The approach is based on a novel concept of temporal utility of subscriptions and events. The temporal utility is used to govern the routing of the events to the right infostation (i.e., the one reached by the interested subscribers at the right time), avoiding unnecessary information transfer on slow links and the buffer management, in case buffer limitations are an issue. We give a description of our protocol and discuss its validation through simulation.