Reality-Check for DTN Routing Algorithms Export

@inproceedings{islam:dtn, abstract = {Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism. To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs.}, address = {Los Alamitos, CA, USA}, author = {Islam, Arshad and Waldvogel, Marcel}, booktitle = {2008 28th International Conference on Distributed Computing Systems Workshops (ICDCS Workshops)}, citeulike-article-id = {5687443}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.Workshops.2008.57}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/ICDCS.Workshops.2008.57}, doi = {10.1109/ICDCS.Workshops.2008.57}, issn = {1545-0678}, journal = {Distributed Computing Systems Workshops, International Conference on}, keywords = {delay-tolerant-networking, delay-tolerant-networks, dtn, simulation, social-network-analysis, social-network-anaylsis, social-networking, socialnetworks}, location = {Beijing, China}, month = {June}, pages = {204--209}, posted-at = {2009-11-13 11:06:34}, priority = {2}, publisher = {IEEE}, title = {Reality-Check for {DTN} Routing Algorithms}, url = {http://dx.doi.org/10.1109/ICDCS.Workshops.2008.57}, volume = {0}, year = {2008} }

TY - CONF ID - islam:dtn L3 - citeulike-article-id:5687443 N2 - Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism. To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs. CY - Beijing, China JF - Distributed Computing Systems Workshops, International Conference on SN - 1545-0678 AD - Los Alamitos, CA, USA EP - 209 TI - Reality-Check for {DTN} Routing Algorithms PB - IEEE VL - 0 T2 - 2008 28th International Conference on Distributed Computing Systems Workshops (ICDCS Workshops) SP - 204 KW - delay-tolerant-networking KW - delay-tolerant-networks KW - dtn KW - simulation KW - social-network-analysis KW - social-network-anaylsis KW - social-networking KW - socialnetworks AU - Islam, Arshad AU - Waldvogel, Marcel PY - 2008/June// UR - http://dx.doi.org/10.1109/ICDCS.Workshops.2008.57 ER -