Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs (2010)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1007/s11276-008-0158-6
- Assunto: WIRELESS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Wireless Networks
- ISSN: 1022-0038
- Volume/Número/Paginação/Ano: v. 16, n. 3, p. 627-640, 2010
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
- Licença: other-oa
-
ABNT
FERREIRA, Afonso Galvão e GOLDMAN, Alfredo e MONTEIRO, Julian. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, v. 16, n. 3, p. 627-640, 2010Tradução . . Disponível em: https://doi.org/10.1007/s11276-008-0158-6. Acesso em: 24 abr. 2024. -
APA
Ferreira, A. G., Goldman, A., & Monteiro, J. (2010). Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16( 3), 627-640. doi:10.1007/s11276-008-0158-6 -
NLM
Ferreira AG, Goldman A, Monteiro J. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs [Internet]. Wireless Networks. 2010 ; 16( 3): 627-640.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/s11276-008-0158-6 -
Vancouver
Ferreira AG, Goldman A, Monteiro J. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs [Internet]. Wireless Networks. 2010 ; 16( 3): 627-640.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/s11276-008-0158-6 - A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- A model for parallel job scheduling on dynamic computer grids
- 1-optimality of static BSP computations: scheduling independent chains as a case study
- 17o. Wperformance Workshop em desempenho de sistemas computacionais e de comunicação. [Apresentação]
Informações sobre o DOI: 10.1007/s11276-008-0158-6 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
