On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks

Autores
Fraire, Juan Andres; Madoery, Pablo Gustavo; Finochietto, Jorge Manuel
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Delay-tolerant networks (DTNs) have become a promising architecture for wireless sensor systems in challenged communication environments where traditional solutions based on persistent connectivity either fail or show serious weaknesses. As a result, different routing schemes have been investigated that take into account the time-evolving nature of the network topology. Among them, contact graph routing has been proposed for space environments with predictable connectivity. In order to evaluate routing decisions, DTN nodes need to know the contact plan in advance, which comprises all communication links among nodes that will be available in the future. Since not all potential contacts can belong to the contact plan, its design requires analyzing conflicting contacts in order to select those that meet an overall goal. In this paper, we consider the design of contact plans that can maximize fairness requirements while still maximizing the overall capacity as well. To this end, we propose to formalize the problem by means of an optimization model and evaluate its performance in terms of different fairness metrics. Since this model can be computationally intractable for a large number of contacts, we also propose to tackle it as a matching problem, resulting in algorithms of polynomial complexity, and compare these results with those of the original model. We show that fairness can be properly modeled to design contact plans and that efficient algorithms do exist to compute these plans quite accurately while also improving overall network routing metrics for a proposed case study.
Fil: Fraire, Juan Andres. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Madoery, Pablo Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Finochietto, Jorge Manuel. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Delay Tolerant Network
Topology Design
Link Assignment
Resource Allocation
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/34648
Acceder
id CONICETDig_1d211a67a2b5ee309df30f918e514019
oai_identifier_str oai:ri.conicet.gov.ar:11336/34648
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant NetworksFraire, Juan AndresMadoery, Pablo GustavoFinochietto, Jorge ManuelDelay Tolerant NetworkTopology DesignLink AssignmentResource Allocationhttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2Delay-tolerant networks (DTNs) have become a promising architecture for wireless sensor systems in challenged communication environments where traditional solutions based on persistent connectivity either fail or show serious weaknesses. As a result, different routing schemes have been investigated that take into account the time-evolving nature of the network topology. Among them, contact graph routing has been proposed for space environments with predictable connectivity. In order to evaluate routing decisions, DTN nodes need to know the contact plan in advance, which comprises all communication links among nodes that will be available in the future. Since not all potential contacts can belong to the contact plan, its design requires analyzing conflicting contacts in order to select those that meet an overall goal. In this paper, we consider the design of contact plans that can maximize fairness requirements while still maximizing the overall capacity as well. To this end, we propose to formalize the problem by means of an optimization model and evaluate its performance in terms of different fairness metrics. Since this model can be computationally intractable for a large number of contacts, we also propose to tackle it as a matching problem, resulting in algorithms of polynomial complexity, and compare these results with those of the original model. We show that fairness can be properly modeled to design contact plans and that efficient algorithms do exist to compute these plans quite accurately while also improving overall network routing metrics for a proposed case study.Fil: Fraire, Juan Andres. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Madoery, Pablo Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Finochietto, Jorge Manuel. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaInstitute of Electrical and Electronics Engineers2014-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/34648Fraire, Juan Andres; Madoery, Pablo Gustavo; Finochietto, Jorge Manuel; On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks; Institute of Electrical and Electronics Engineers; IEEE Sensors Journal; 14; 11; 11-2014; 3874-38821530-437XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1109/JSEN.2014.2348917info:eu-repo/semantics/altIdentifier/url/http://ieeexplore.ieee.org/document/6879454/info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T12:07:06Zoai:ri.conicet.gov.ar:11336/34648instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 12:07:06.988CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
title On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
spellingShingle On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
Fraire, Juan Andres
Delay Tolerant Network
Topology Design
Link Assignment
Resource Allocation
title_short On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
title_full On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
title_fullStr On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
title_full_unstemmed On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
title_sort On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks
dc.creator.none.fl_str_mv Fraire, Juan Andres
Madoery, Pablo Gustavo
Finochietto, Jorge Manuel
author Fraire, Juan Andres
author_facet Fraire, Juan Andres
Madoery, Pablo Gustavo
Finochietto, Jorge Manuel
author_role author
author2 Madoery, Pablo Gustavo
Finochietto, Jorge Manuel
author2_role author
author
dc.subject.none.fl_str_mv Delay Tolerant Network
Topology Design
Link Assignment
Resource Allocation
topic Delay Tolerant Network
Topology Design
Link Assignment
Resource Allocation
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv Delay-tolerant networks (DTNs) have become a promising architecture for wireless sensor systems in challenged communication environments where traditional solutions based on persistent connectivity either fail or show serious weaknesses. As a result, different routing schemes have been investigated that take into account the time-evolving nature of the network topology. Among them, contact graph routing has been proposed for space environments with predictable connectivity. In order to evaluate routing decisions, DTN nodes need to know the contact plan in advance, which comprises all communication links among nodes that will be available in the future. Since not all potential contacts can belong to the contact plan, its design requires analyzing conflicting contacts in order to select those that meet an overall goal. In this paper, we consider the design of contact plans that can maximize fairness requirements while still maximizing the overall capacity as well. To this end, we propose to formalize the problem by means of an optimization model and evaluate its performance in terms of different fairness metrics. Since this model can be computationally intractable for a large number of contacts, we also propose to tackle it as a matching problem, resulting in algorithms of polynomial complexity, and compare these results with those of the original model. We show that fairness can be properly modeled to design contact plans and that efficient algorithms do exist to compute these plans quite accurately while also improving overall network routing metrics for a proposed case study.
Fil: Fraire, Juan Andres. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Madoery, Pablo Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Finochietto, Jorge Manuel. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description Delay-tolerant networks (DTNs) have become a promising architecture for wireless sensor systems in challenged communication environments where traditional solutions based on persistent connectivity either fail or show serious weaknesses. As a result, different routing schemes have been investigated that take into account the time-evolving nature of the network topology. Among them, contact graph routing has been proposed for space environments with predictable connectivity. In order to evaluate routing decisions, DTN nodes need to know the contact plan in advance, which comprises all communication links among nodes that will be available in the future. Since not all potential contacts can belong to the contact plan, its design requires analyzing conflicting contacts in order to select those that meet an overall goal. In this paper, we consider the design of contact plans that can maximize fairness requirements while still maximizing the overall capacity as well. To this end, we propose to formalize the problem by means of an optimization model and evaluate its performance in terms of different fairness metrics. Since this model can be computationally intractable for a large number of contacts, we also propose to tackle it as a matching problem, resulting in algorithms of polynomial complexity, and compare these results with those of the original model. We show that fairness can be properly modeled to design contact plans and that efficient algorithms do exist to compute these plans quite accurately while also improving overall network routing metrics for a proposed case study.
publishDate 2014
dc.date.none.fl_str_mv 2014-11
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/34648
Fraire, Juan Andres; Madoery, Pablo Gustavo; Finochietto, Jorge Manuel; On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks; Institute of Electrical and Electronics Engineers; IEEE Sensors Journal; 14; 11; 11-2014; 3874-3882
1530-437X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/34648
identifier_str_mv Fraire, Juan Andres; Madoery, Pablo Gustavo; Finochietto, Jorge Manuel; On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks; Institute of Electrical and Electronics Engineers; IEEE Sensors Journal; 14; 11; 11-2014; 3874-3882
1530-437X
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1109/JSEN.2014.2348917
info:eu-repo/semantics/altIdentifier/url/http://ieeexplore.ieee.org/document/6879454/
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846782432896876544
score 12.982451

Publicaciones similares