Exportação concluída — 

Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis

Detalhes bibliográficos
Ano de defesa: 2009
Autor(a) principal: Cristiano Arbex Valle
Orientador(a): Não Informado pela instituição
Banca de defesa: Não Informado pela instituição
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de Minas Gerais
Programa de Pós-Graduação: Não Informado pela instituição
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Palavras-chave em Português:
Link de acesso: https://hdl.handle.net/1843/SLSS-7WMGSD
Resumo: In this work, we introduce models and optimization algorithms to improve the Quality of Service in Wireless Sensor Networks with multiple mobile sinks. A discrete event simulator that integrates the proposed optimization methods into a realistic model of the network dynamics over the time is also implemented and tested computationaly. The main Optimization Problem considered here, that of defining routes to each mobile sink, allowing them to collect sensed information thoughout the network, is modeled as a variant of the uncapacitated Vehicle Routing Problem. In this variant, the fleet size is known beforehand, not all clients need to be visited and the goal is to minimize the length of the longest vehicle route. To model the problem, two Integer Programs are introduced. The first one is a compact formulation based on Network Flow models. A Branch-and-Bound algorithm is presented for this formulation. The second Integer Program is based in Generalized Subtour Elimination Constraints. To tackle this model, we developed a Branch-and-Cut algorithm. A third algorithm, a Local Branching that used the Branch-and-Cut as inner solver, was also proposed and implemented. Due to the difficulty found in terms of computational time in solving the problem to optimality, we also proposed several Metaheuristic based heuristics to find (hopefully) good solutions in practical times. Our simulation results indicate that the optimization algorithms allowed significantimprovements in message delay rates and other important Quality of Service parameters.
id UFMG_c8811c73a1ecd508730c61ec51ecfd2c
oai_identifier_str oai:repositorio.ufmg.br:1843/SLSS-7WMGSD
network_acronym_str UFMG
network_name_str Repositório Institucional da UFMG
repository_id_str
spelling Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveisSensores Processamento de dadosOtimização matemáticaComputaçãoSistemas de computação sem fioOtimização matemáticaSensoresSistemas de computação sem fioIn this work, we introduce models and optimization algorithms to improve the Quality of Service in Wireless Sensor Networks with multiple mobile sinks. A discrete event simulator that integrates the proposed optimization methods into a realistic model of the network dynamics over the time is also implemented and tested computationaly. The main Optimization Problem considered here, that of defining routes to each mobile sink, allowing them to collect sensed information thoughout the network, is modeled as a variant of the uncapacitated Vehicle Routing Problem. In this variant, the fleet size is known beforehand, not all clients need to be visited and the goal is to minimize the length of the longest vehicle route. To model the problem, two Integer Programs are introduced. The first one is a compact formulation based on Network Flow models. A Branch-and-Bound algorithm is presented for this formulation. The second Integer Program is based in Generalized Subtour Elimination Constraints. To tackle this model, we developed a Branch-and-Cut algorithm. A third algorithm, a Local Branching that used the Branch-and-Cut as inner solver, was also proposed and implemented. Due to the difficulty found in terms of computational time in solving the problem to optimality, we also proposed several Metaheuristic based heuristics to find (hopefully) good solutions in practical times. Our simulation results indicate that the optimization algorithms allowed significantimprovements in message delay rates and other important Quality of Service parameters.Universidade Federal de Minas Gerais2019-08-12T01:11:15Z2025-09-08T23:58:33Z2019-08-12T01:11:15Z2009-07-17info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/1843/SLSS-7WMGSDCristiano Arbex Valleinfo:eu-repo/semantics/openAccessporreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMG2025-09-09T18:47:34Zoai:repositorio.ufmg.br:1843/SLSS-7WMGSDRepositório InstitucionalPUBhttps://repositorio.ufmg.br/oairepositorio@ufmg.bropendoar:2025-09-09T18:47:34Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false
dc.title.none.fl_str_mv Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
title Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
spellingShingle Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
Cristiano Arbex Valle
Sensores Processamento de dados
Otimização matemática
Computação
Sistemas de computação sem fio
Otimização matemática
Sensores
Sistemas de computação sem fio
title_short Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
title_full Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
title_fullStr Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
title_full_unstemmed Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
title_sort Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
author Cristiano Arbex Valle
author_facet Cristiano Arbex Valle
author_role author
dc.contributor.author.fl_str_mv Cristiano Arbex Valle
dc.subject.por.fl_str_mv Sensores Processamento de dados
Otimização matemática
Computação
Sistemas de computação sem fio
Otimização matemática
Sensores
Sistemas de computação sem fio
topic Sensores Processamento de dados
Otimização matemática
Computação
Sistemas de computação sem fio
Otimização matemática
Sensores
Sistemas de computação sem fio
description In this work, we introduce models and optimization algorithms to improve the Quality of Service in Wireless Sensor Networks with multiple mobile sinks. A discrete event simulator that integrates the proposed optimization methods into a realistic model of the network dynamics over the time is also implemented and tested computationaly. The main Optimization Problem considered here, that of defining routes to each mobile sink, allowing them to collect sensed information thoughout the network, is modeled as a variant of the uncapacitated Vehicle Routing Problem. In this variant, the fleet size is known beforehand, not all clients need to be visited and the goal is to minimize the length of the longest vehicle route. To model the problem, two Integer Programs are introduced. The first one is a compact formulation based on Network Flow models. A Branch-and-Bound algorithm is presented for this formulation. The second Integer Program is based in Generalized Subtour Elimination Constraints. To tackle this model, we developed a Branch-and-Cut algorithm. A third algorithm, a Local Branching that used the Branch-and-Cut as inner solver, was also proposed and implemented. Due to the difficulty found in terms of computational time in solving the problem to optimality, we also proposed several Metaheuristic based heuristics to find (hopefully) good solutions in practical times. Our simulation results indicate that the optimization algorithms allowed significantimprovements in message delay rates and other important Quality of Service parameters.
publishDate 2009
dc.date.none.fl_str_mv 2009-07-17
2019-08-12T01:11:15Z
2019-08-12T01:11:15Z
2025-09-08T23:58:33Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/1843/SLSS-7WMGSD
url https://hdl.handle.net/1843/SLSS-7WMGSD
dc.language.iso.fl_str_mv por
language por
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 Universidade Federal de Minas Gerais
publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFMG
instname:Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG
instname_str Universidade Federal de Minas Gerais (UFMG)
instacron_str UFMG
institution UFMG
reponame_str Repositório Institucional da UFMG
collection Repositório Institucional da UFMG
repository.name.fl_str_mv Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)
repository.mail.fl_str_mv repositorio@ufmg.br
_version_ 1856413916090859520