Improving path duration in high mobility vehicular ad hoc networks
Main Author: | |
---|---|
Publication Date: | 2013 |
Other Authors: | , , , , |
Format: | Article |
Language: | eng |
Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
Download full: | http://hdl.handle.net/11144/3727 |
Summary: | In this paper, we consider a high-speed highway mobility scenario, where the available knowledge about the network’s topology is used to improve the routing path duration. The improvement is mainly due to the use of a topology control algorithm, which increases the path duration by decreasing the probability of path breaks. For network regions having an enough density of vehicles, the packets are preferentially routed over the oldest links created by the vehicles moving in the same direction. For smaller values of vehicles’ density, the routing preferentially uses the most recent links created in both moving directions. This choice is shown to increase the routing path duration. The topology control scheme here proposed can be easily integrated in the existing routing protocols: we describe how to integrate it in the Optimized Link-State Routing Protocol (OLSR).1 We compare the performance of our approach with other routing protocols for different values of vehicles’ density. The comparison includes end-to-end path delay, path availability and path length (in number of hops). Finally, we evaluate the path duration achieved with our approach, concluding that it exhibits a significant improvement over the most relevant topology and position-based routing protocols. |
id |
RCAP_f7c35d9565c335658e0da10c77a53fa2 |
---|---|
oai_identifier_str |
oai:repositorio.ual.pt:11144/3727 |
network_acronym_str |
RCAP |
network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository_id_str |
https://opendoar.ac.uk/repository/7160 |
spelling |
Improving path duration in high mobility vehicular ad hoc networksTopology controlRouting protocolsVehicular ad hoc networksIn this paper, we consider a high-speed highway mobility scenario, where the available knowledge about the network’s topology is used to improve the routing path duration. The improvement is mainly due to the use of a topology control algorithm, which increases the path duration by decreasing the probability of path breaks. For network regions having an enough density of vehicles, the packets are preferentially routed over the oldest links created by the vehicles moving in the same direction. For smaller values of vehicles’ density, the routing preferentially uses the most recent links created in both moving directions. This choice is shown to increase the routing path duration. The topology control scheme here proposed can be easily integrated in the existing routing protocols: we describe how to integrate it in the Optimized Link-State Routing Protocol (OLSR).1 We compare the performance of our approach with other routing protocols for different values of vehicles’ density. The comparison includes end-to-end path delay, path availability and path length (in number of hops). Finally, we evaluate the path duration achieved with our approach, concluding that it exhibits a significant improvement over the most relevant topology and position-based routing protocols.ELSEVIER2018-04-13T15:01:11Z2013-01-01T00:00:00Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/11144/3727eng1570-870510.1016/j.adhoc.2012.04.009Dinis, RuiOliveira, RodolfoLuis, MiguelFurtado, AntónioBernardo, LuisPinto, Pauloinfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-08-01T02:11:46Zoai:repositorio.ual.pt:11144/3727Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T18:45:51.987892Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
dc.title.none.fl_str_mv |
Improving path duration in high mobility vehicular ad hoc networks |
title |
Improving path duration in high mobility vehicular ad hoc networks |
spellingShingle |
Improving path duration in high mobility vehicular ad hoc networks Dinis, Rui Topology control Routing protocols Vehicular ad hoc networks |
title_short |
Improving path duration in high mobility vehicular ad hoc networks |
title_full |
Improving path duration in high mobility vehicular ad hoc networks |
title_fullStr |
Improving path duration in high mobility vehicular ad hoc networks |
title_full_unstemmed |
Improving path duration in high mobility vehicular ad hoc networks |
title_sort |
Improving path duration in high mobility vehicular ad hoc networks |
author |
Dinis, Rui |
author_facet |
Dinis, Rui Oliveira, Rodolfo Luis, Miguel Furtado, António Bernardo, Luis Pinto, Paulo |
author_role |
author |
author2 |
Oliveira, Rodolfo Luis, Miguel Furtado, António Bernardo, Luis Pinto, Paulo |
author2_role |
author author author author author |
dc.contributor.author.fl_str_mv |
Dinis, Rui Oliveira, Rodolfo Luis, Miguel Furtado, António Bernardo, Luis Pinto, Paulo |
dc.subject.por.fl_str_mv |
Topology control Routing protocols Vehicular ad hoc networks |
topic |
Topology control Routing protocols Vehicular ad hoc networks |
description |
In this paper, we consider a high-speed highway mobility scenario, where the available knowledge about the network’s topology is used to improve the routing path duration. The improvement is mainly due to the use of a topology control algorithm, which increases the path duration by decreasing the probability of path breaks. For network regions having an enough density of vehicles, the packets are preferentially routed over the oldest links created by the vehicles moving in the same direction. For smaller values of vehicles’ density, the routing preferentially uses the most recent links created in both moving directions. This choice is shown to increase the routing path duration. The topology control scheme here proposed can be easily integrated in the existing routing protocols: we describe how to integrate it in the Optimized Link-State Routing Protocol (OLSR).1 We compare the performance of our approach with other routing protocols for different values of vehicles’ density. The comparison includes end-to-end path delay, path availability and path length (in number of hops). Finally, we evaluate the path duration achieved with our approach, concluding that it exhibits a significant improvement over the most relevant topology and position-based routing protocols. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-01-01T00:00:00Z 2013 2018-04-13T15:01:11Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11144/3727 |
url |
http://hdl.handle.net/11144/3727 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1570-8705 10.1016/j.adhoc.2012.04.009 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
ELSEVIER |
publisher.none.fl_str_mv |
ELSEVIER |
dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
repository.mail.fl_str_mv |
info@rcaap.pt |
_version_ |
1833597648468180992 |