- -

Modeling and comparison of candidate selection algorithms in opportunistic routing

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

Modeling and comparison of candidate selection algorithms in opportunistic routing

Mostrar el registro completo del ítem

Darehshoorzadeh, A.; Cerdà-Alabern, L.; Pla, V. (2011). Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks. 55(13):2886-2898. doi:10.1016/j.comnet.2011.06.009

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/53081

Ficheros en el ítem

Metadatos del ítem

Título: Modeling and comparison of candidate selection algorithms in opportunistic routing
Autor:
Entidad UPV: Universitat Politècnica de València. Departamento de Comunicaciones - Departament de Comunicacions
Fecha difusión:
Resumen:
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is ...[+]
Palabras clave: Candidate selection algorithms , Markov chain , Opportunistic routing , Performance modeling , Wireless networks , Candidate selection , Computational costs , Discrete time Markov chains , Dynamic network , Multihop wireless network , Next-hop , Optimality , Ordered set , Performance Gain , Markov processes , Algorithms
Derechos de uso: Reserva de todos los derechos
Fuente:
Computer Networks. (issn: 1389-1286 ) (eissn: 1872-7069 )
DOI: 10.1016/j.comnet.2011.06.009
Editorial:
Elsevier
Versión del editor: http://dx.doi.org/10.1016/j.comnet.2011.06.009
Agradecimientos:
This work was supported by the Spanish government through projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02, by the Generalitat de Catalunya through project 2009-SGR-1167, and by the European Commission through the ...[+]
Tipo: Artículo

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem