Routing in Accumulative Multi-Hop Networks

This paper investigates the problem of finding optimal paths in single-source single-destination accumulative multi-hop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all th...

Descripción completa

Detalles Bibliográficos
Autor: Gomez-Vilardebo J.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2017
País:España
Institución:Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
Repositorio:r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
OAI Identifier:oai:cttc.fundanetsuite.com:p3392
Acceso en línea:https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=3392
Access Level:acceso abierto
Palabra clave:Accumulative multi-hop
energy accumulation
minimum energy
graph theory
id ES_70ffa8df64efa4d0c2275faf1ff4d913
oai_identifier_str oai:cttc.fundanetsuite.com:p3392
network_acronym_str ES
network_name_str España
repository_id_str
spelling Routing in Accumulative Multi-Hop NetworksGomez-Vilardebo J.Accumulative multi-hopenergy accumulationminimum energygraph theoryThis paper investigates the problem of finding optimal paths in single-source single-destination accumulative multi-hop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it after processing/decoding and mixing it with the signals received in previous hops. That is, we consider that terminals make use of advanced energy accumulation transmission/reception techniques, such as maximal ratio combining reception of repetition codes, or information accumulation with rateless codes. Accumulative techniques increase communication reliability, reduce energy consumption, and decrease latency. We investigate the properties that a routing metric must satisfy in these accumulative networks to guarantee that optimal paths can be computed with Dijkstra's algorithm. We model the problem of routing in accumulative multi-hop networks, as the problem of routing in a hypergraph. We show that optimality properties in a traditional multi-hop network (monotonicity and isotonicity) are no longer useful and derive a new set of sufficient conditions for optimality. We illustrate these results by studying the minimum energy routing problem in static accumulative multi-hop networks for different forwarding strategies at relays.Institute of Electrical and Electronics Engineers Inc.2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttps://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=3392IEEE-ACM TRANSACTIONS ON NETWORKINGISSN: 10636692ISSNe: 15582566reponame:r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)instname:Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)Inglésinfo:eu-repo/semantics/openAccessoai:cttc.fundanetsuite.com:p33922026-06-17T11:44:47Z
dc.title.none.fl_str_mv Routing in Accumulative Multi-Hop Networks
title Routing in Accumulative Multi-Hop Networks
spellingShingle Routing in Accumulative Multi-Hop Networks
Gomez-Vilardebo J.
Accumulative multi-hop
energy accumulation
minimum energy
graph theory
title_short Routing in Accumulative Multi-Hop Networks
title_full Routing in Accumulative Multi-Hop Networks
title_fullStr Routing in Accumulative Multi-Hop Networks
title_full_unstemmed Routing in Accumulative Multi-Hop Networks
title_sort Routing in Accumulative Multi-Hop Networks
dc.creator.none.fl_str_mv Gomez-Vilardebo J.
author Gomez-Vilardebo J.
author_facet Gomez-Vilardebo J.
author_role author
dc.subject.none.fl_str_mv Accumulative multi-hop
energy accumulation
minimum energy
graph theory
topic Accumulative multi-hop
energy accumulation
minimum energy
graph theory
description This paper investigates the problem of finding optimal paths in single-source single-destination accumulative multi-hop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it after processing/decoding and mixing it with the signals received in previous hops. That is, we consider that terminals make use of advanced energy accumulation transmission/reception techniques, such as maximal ratio combining reception of repetition codes, or information accumulation with rateless codes. Accumulative techniques increase communication reliability, reduce energy consumption, and decrease latency. We investigate the properties that a routing metric must satisfy in these accumulative networks to guarantee that optimal paths can be computed with Dijkstra's algorithm. We model the problem of routing in accumulative multi-hop networks, as the problem of routing in a hypergraph. We show that optimality properties in a traditional multi-hop network (monotonicity and isotonicity) are no longer useful and derive a new set of sufficient conditions for optimality. We illustrate these results by studying the minimum energy routing problem in static accumulative multi-hop networks for different forwarding strategies at relays.
publishDate 2017
dc.date.none.fl_str_mv 2017
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=3392
url https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=3392
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers Inc.
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers Inc.
dc.source.none.fl_str_mv IEEE-ACM TRANSACTIONS ON NETWORKING
ISSN: 10636692
ISSNe: 15582566
reponame:r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
instname:Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
instname_str Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
reponame_str r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
collection r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869410621176414208
score 15,811543

Similares en LA Referencia