Throughput and energy-aware routing for 802.11 based mesh networks

In this paper we propose a novel routing algorithm for 802.11 based wireless mesh networks called Energy and Throughput-aware Routing (ETR). The design objectives of ETR are (i) to provide flows with throughput guarantees, and (ii) to minimize the overall energy consumption in the mesh network. To a...

Descripción completa

Detalles Bibliográficos
Autores: de la Oliva, Antonio, Banchs, Albert|||0000-0003-3544-8537, Serrano, Pablo
Tipo de recurso: artículo
Fecha de publicación:2012
País:España
Institución:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/1092
Acceso en línea:http://hdl.handle.net/20.500.12761/1092
https://dx.doi.org/http://dx.doi.org/10.1016/j.comcom.2012.04.004
Access Level:acceso abierto
Palabra clave:Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
802.11
Capacity region
Energy efficiency
id ES_cdd4f2f70e2b3fbc0fbe12f0e7ee9ae8
oai_identifier_str oai:dspace.networks.imdea.org:20.500.12761/1092
network_acronym_str ES
network_name_str España
repository_id_str
spelling Throughput and energy-aware routing for 802.11 based mesh networksde la Oliva, AntonioBanchs, Albert|||0000-0003-3544-8537Serrano, PabloQ Science::Q Science (General)Q Science::QA Mathematics::QA75 Electronic computers. Computer scienceT Technology::T Technology (General)T Technology::TA Engineering (General). Civil engineering (General)T Technology::TK Electrical engineering. Electronics Nuclear engineering802.11Capacity regionEnergy efficiencyIn this paper we propose a novel routing algorithm for 802.11 based wireless mesh networks called Energy and Throughput-aware Routing (ETR). The design objectives of ETR are (i) to provide flows with throughput guarantees, and (ii) to minimize the overall energy consumption in the mesh network. To achieve these objectives, we first analyze the throughput performance of the mesh network. Based on this analysis, we target obtaining the set of feasible allocations in the wireless network, i.e., the capacity region, which results in a set of complex non-linear equations that are not adequate for optimization algorithms. To overcome this computational complexity we derive a set of linear constraints (referred to as linearized capacity regions) which provides a much simpler formulation at a slightly reduced accuracy. By feeding these linear constraints into an integer programming formulation, we then propose a routing algorithm that admits as many flows as possible while satisfying their throughput guarantees. This algorithm is further extended to account for energy considerations by devising a routing algorithm that uses as few nodes as possible, which allows switching off the unused nodes and thus save energy. The proposed approach is thoroughly evaluated and shown to outperform previous approaches very substantially both in terms of throughput and energy consumption. �TRUEpubElsevier20122012-07-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articlehttp://hdl.handle.net/20.500.12761/1092https://dx.doi.org/http://dx.doi.org/10.1016/j.comcom.2012.04.004reponame:IMDEA Networks Institute Digital Repositoryinstname:IMDEA Networks InstituteInglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:dspace.networks.imdea.org:20.500.12761/10922026-06-06T12:35:51Z
dc.title.none.fl_str_mv Throughput and energy-aware routing for 802.11 based mesh networks
title Throughput and energy-aware routing for 802.11 based mesh networks
spellingShingle Throughput and energy-aware routing for 802.11 based mesh networks
de la Oliva, Antonio
Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
802.11
Capacity region
Energy efficiency
title_short Throughput and energy-aware routing for 802.11 based mesh networks
title_full Throughput and energy-aware routing for 802.11 based mesh networks
title_fullStr Throughput and energy-aware routing for 802.11 based mesh networks
title_full_unstemmed Throughput and energy-aware routing for 802.11 based mesh networks
title_sort Throughput and energy-aware routing for 802.11 based mesh networks
dc.creator.none.fl_str_mv de la Oliva, Antonio
Banchs, Albert|||0000-0003-3544-8537
Serrano, Pablo
author de la Oliva, Antonio
author_facet de la Oliva, Antonio
Banchs, Albert|||0000-0003-3544-8537
Serrano, Pablo
author_role author
author2 Banchs, Albert|||0000-0003-3544-8537
Serrano, Pablo
author2_role author
author
dc.subject.none.fl_str_mv Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
802.11
Capacity region
Energy efficiency
topic Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
802.11
Capacity region
Energy efficiency
description In this paper we propose a novel routing algorithm for 802.11 based wireless mesh networks called Energy and Throughput-aware Routing (ETR). The design objectives of ETR are (i) to provide flows with throughput guarantees, and (ii) to minimize the overall energy consumption in the mesh network. To achieve these objectives, we first analyze the throughput performance of the mesh network. Based on this analysis, we target obtaining the set of feasible allocations in the wireless network, i.e., the capacity region, which results in a set of complex non-linear equations that are not adequate for optimization algorithms. To overcome this computational complexity we derive a set of linear constraints (referred to as linearized capacity regions) which provides a much simpler formulation at a slightly reduced accuracy. By feeding these linear constraints into an integer programming formulation, we then propose a routing algorithm that admits as many flows as possible while satisfying their throughput guarantees. This algorithm is further extended to account for energy considerations by devising a routing algorithm that uses as few nodes as possible, which allows switching off the unused nodes and thus save energy. The proposed approach is thoroughly evaluated and shown to outperform previous approaches very substantially both in terms of throughput and energy consumption. �
publishDate 2012
dc.date.none.fl_str_mv 2012
2012-07-01
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 http://hdl.handle.net/20.500.12761/1092
https://dx.doi.org/http://dx.doi.org/10.1016/j.comcom.2012.04.004
url http://hdl.handle.net/20.500.12761/1092
https://dx.doi.org/http://dx.doi.org/10.1016/j.comcom.2012.04.004
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
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
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:IMDEA Networks Institute Digital Repository
instname:IMDEA Networks Institute
instname_str IMDEA Networks Institute
reponame_str IMDEA Networks Institute Digital Repository
collection IMDEA Networks Institute Digital Repository
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419890872418304
score 15.300719

Similares en LA Referencia