Modeling and comparison of candidate selection algorithms in opportunistic routing

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 sent along pre-determined paths, in OR an ordered set of candidates is selected...

ver descrição completa

Detalhes bibliográficos
Autores: Darehshoorzadeh, A., Cerdà-Alabern, L., Pla, Vicent|||0000-0002-0894-9494
Formato: artículo
Fecha de publicación:2011
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/53081
Acesso em linha:https://riunet.upv.es/handle/10251/53081
Access Level:acceso abierto
Palavra-chave: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
INGENIERIA TELEMATICA
id ES_0903ae2aa5dfdc213cd384108c2aec31
oai_identifier_str oai:riunet.upv.es:10251/53081
network_acronym_str ES
network_name_str España
repository_id_str
spelling Modeling and comparison of candidate selection algorithms in opportunistic routingDarehshoorzadeh, A.Cerdà-Alabern, L.Pla, Vicent|||0000-0002-0894-9494Candidate selection algorithmsMarkov chainOpportunistic routingPerformance modelingWireless networksCandidate selectionComputational costsDiscrete time Markov chainsDynamic networkMultihop wireless networkNext-hopOptimalityOrdered setPerformance GainMarkov processesAlgorithmsINGENIERIA TELEMATICAOpportunistic 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 sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently. © 2011 Elsevier B.V. All rights reserved.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 NoE EuroNF.ElsevierEscuela Técnica Superior de Ingeniería de TelecomunicaciónDepartamento de ComunicacionesMinisterio de Ciencia e InnovaciónGeneralitat de CatalunyaEuropean CommissionRepositorio Institucional de la Universitat Politècnica de València Riunet20112011-09-15journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/53081reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21378-C02-01 COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEASMinisterio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21378-C02-02 COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEASGeneralitat de Catalunya Generalitat de Catalunya 2009 SGR 1167open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/530812026-06-13T07:49:27Z
dc.title.none.fl_str_mv Modeling and comparison of candidate selection algorithms in opportunistic routing
title Modeling and comparison of candidate selection algorithms in opportunistic routing
spellingShingle Modeling and comparison of candidate selection algorithms in opportunistic routing
Darehshoorzadeh, A.
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
INGENIERIA TELEMATICA
title_short Modeling and comparison of candidate selection algorithms in opportunistic routing
title_full Modeling and comparison of candidate selection algorithms in opportunistic routing
title_fullStr Modeling and comparison of candidate selection algorithms in opportunistic routing
title_full_unstemmed Modeling and comparison of candidate selection algorithms in opportunistic routing
title_sort Modeling and comparison of candidate selection algorithms in opportunistic routing
dc.creator.none.fl_str_mv Darehshoorzadeh, A.
Cerdà-Alabern, L.
Pla, Vicent|||0000-0002-0894-9494
author Darehshoorzadeh, A.
author_facet Darehshoorzadeh, A.
Cerdà-Alabern, L.
Pla, Vicent|||0000-0002-0894-9494
author_role author
author2 Cerdà-Alabern, L.
Pla, Vicent|||0000-0002-0894-9494
author2_role author
author
dc.contributor.none.fl_str_mv Escuela Técnica Superior de Ingeniería de Telecomunicación
Departamento de Comunicaciones
Ministerio de Ciencia e Innovación
Generalitat de Catalunya
European Commission
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv 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
INGENIERIA TELEMATICA
topic 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
INGENIERIA TELEMATICA
description 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 sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently. © 2011 Elsevier B.V. All rights reserved.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-09-15
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/53081
url https://riunet.upv.es/handle/10251/53081
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21378-C02-01 COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS
Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-21378-C02-02 COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS
Generalitat de Catalunya Generalitat de Catalunya 2009 SGR 1167
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403081390686208
score 15,300719

Registos relacionados