Probabilistic Routing in Intermittently Connected Networks Export

@inproceedings{probabilistic-epidemic, abstract = {In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.}, author = {Lindgren, Anders and Doria, Avri and Schel\'{e}n, Olov}, booktitle = {Proceedings of the First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 1-6, 2004}, citeulike-article-id = {440098}, citeulike-linkout-0 = {http://www.springerlink.com/link.asp?id=9xt3904hd05fxmjf}, citeulike-linkout-1 = {http://dx.doi.org/10.1007/b99076}, doi = {10.1007/b99076}, editor = {Dini, Petre and Lorenz, Pascal and de Souza, Jos\'{e} N.}, keywords = {disconnected-networks, history-based, sota, stochastic}, month = {August}, pages = {239--254}, posted-at = {2006-05-08 15:12:02}, priority = {0}, publisher = {Springer-Verlag GmbH}, series = {Lecture Notes in Computer Science}, title = {Probabilistic Routing in Intermittently Connected Networks}, url = {http://dx.doi.org/10.1007/b99076}, volume = {3126}, year = {2004} }

TY - CONF ID - probabilistic-epidemic L3 - citeulike-article-id:440098 N2 - In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead. SE - Lecture Notes in Computer Science EP - 254 TI - Probabilistic Routing in Intermittently Connected Networks PB - Springer-Verlag GmbH VL - 3126 T2 - Proceedings of the First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 1-6, 2004 SP - 239 KW - disconnected-networks KW - history-based KW - sota KW - stochastic AU - Lindgren, Anders AU - Doria, Avri AU - Schelén, Olov A2 - Dini, Petre A2 - Lorenz, Pascal A2 - de Souza, José PY - 2004/08// UR - http://dx.doi.org/10.1007/b99076 ER -