-
2
-
-
20344383943
-
Probabilistic routing in intermittently connected networks
-
ACM, New York, NY, USA, jul.
-
LINDGREN, A.; DORIA, A.; SCHELEN, O. Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev., ACM, New York, NY, USA, v. 7, n. 3, p. 19-20, jul. 2003.
-
(2003)
SIGMOBILE Mob. Comput. Commun. Rev.
, vol.7
, Issue.3
, pp. 19-20
-
-
Lindgren, A.1
Doria, A.2
Schelen, O.3
-
3
-
-
29244491141
-
Spray and wait: An efcient routing scheme for intermittently connected mobile networks
-
New York, NY, USA: ACM, (WDTN 05)
-
SPYROPOULOS, T.; PSOUNIS, K.; RAGHAVENDRA, C. S. Spray and wait: an efcient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. New York, NY, USA: ACM, 2005. (WDTN 05), p. 252-259.
-
(2005)
Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking
, pp. 252-259
-
-
Spyropoulos, T.1
Psounis, K.2
Raghavendra, C.S.3
-
4
-
-
39049118503
-
MaxProp: Routing for vehicle-based disruption-tolerant networks
-
BURGESS, J.; GALLAGHER, B.; JENSEN, D.; LEVINE, B. N. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proceedings of IEEE INFOCOM, pages 1-11, 2006.
-
(2006)
Proceedings of IEEE INFOCOM
, pp. 1-11
-
-
Burgess, J.1
Gallagher, B.2
Jensen, D.3
Levine, B.N.4
-
5
-
-
72949103692
-
Nectar: A DTN routing protocol based on neighborhood contact history
-
New York, NY, USA: ACM, (SAC '09)
-
OLIVEIRA, E. C. R. de; ALBUQUERQUE, C. V. N. de. Nectar: a DTN routing protocol based on neighborhood contact history. In: Proceedings of the 2009 ACM symposium on Applied Computing. New York, NY, USA: ACM, 2009. (SAC '09), p. 40-46.
-
(2009)
Proceedings of the 2009 ACM Symposium on Applied Computing
, pp. 40-46
-
-
De Oliveira, E.C.R.1
De Albuquerque, C.V.N.2
-
6
-
-
33745603240
-
Locating mobile nodes with ease: Learning efficient routes from encounter histories alone
-
IEEE Press, Piscataway, NJ, USA, jun.
-
GROSSGLAUSER, M.; VETTERLI, M. Locating mobile nodes with ease: learning efficient routes from encounter histories alone. IEEE/ACM Trans. Netw., IEEE Press, Piscataway, NJ, USA, v. 14, n. 3, p. 457-469, jun. 2006
-
(2006)
IEEE/ACM Trans. Netw.
, vol.14
, Issue.3
, pp. 457-469
-
-
Grossglauser, M.1
Vetterli, M.2
-
7
-
-
84881453006
-
-
Tese (Doutorado)-Universidade Federal Fluminense, Programa de Pos-Graduaç -ao em Computaç -ao, Niterói, RJ, Brasil
-
OLIVEIRA, E. C. R. de. Roteamento Adaptativo a Contextos para Redes Tolerantes a Atrasos e Desconex-oes. Tese (Doutorado) - Universidade Federal Fluminense, Programa de Pos-Graduaç -ao em Computaç -ao, Niterói, RJ, Brasil, 2008.
-
(2008)
Roteamento Adaptativo A Contextos Para Redes Tolerantes A Atrasos e Desconex-oes
-
-
De Oliveira, E.C.R.1
-
8
-
-
84922954336
-
The ONE simulator for DTN protocol evaluation
-
New York, NY, USA: ICST
-
KERA? NEN, A., OTT, J. The ONE Simulator for DTN Protocol Evaluation, In: SIMUTools '09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques. New York, NY, USA: ICST, 2009.
-
(2009)
SIMU Tools '09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques
-
-
Keränen, A.1
Ott, J.2
|