Roteamento em redes em malha sem fio com balanceamento de carga e caminhos mais curtos

Detalhes bibliográficos
Ano de defesa: 2014
Autor(a) principal: Mello, Micael Oliveira Massula Carvalho de lattes
Orientador(a): Mello, Micael Oliveira Massula Carvalho de lattes
Banca de defesa: Cardoso, Kleber Vieira, Pinto, Leizer de Lima, Rezende, José Ferreira de, Borges, Vinicius da Cunha Martins
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de Goiás
Programa de Pós-Graduação: Programa de Pós-graduação em Ciência da Computação (INF)
Departamento: Instituto de Informática - INF (RG)
País: Brasil
Palavras-chave em Português:
Palavras-chave em Inglês:
Área do conhecimento CNPq:
Link de acesso: http://repositorio.bc.ufg.br/tede/handle/tede/4250
Resumo: Wireless Mesh Networks (WMNs) are infrastructures with autonomic properties, such as self-organization and self-recovery, which can be developed with widely available technologies and low cost solutions. Besides their current applications, such as community networks and broad-band Internet access, WMNs can offer contributions in the context of the Internet of Things and help to build robust infrastructures to smart energy networks, among other uses. However, WMNs usually have performance issues due to overload in certain parts of the network and interference in wireless links. In this context, it is important that solutions are used to promote load-balancing and to mitigate interference between wireless links. Research in this area shows that one of the most promising approaches are in the subject of the joint routing and channel assignment. However, most of the previous works depends on the knowledge of the network traffic and handle flows with low granularity. In this thesis, we handle the performance problem in WMNs, in particular those having multiple radios and multiple available channels, using a joint approach, but without the mentioned restrictions. Our proposal is a joint heuristic, whose main contribution is the routing, which pursues the compromise between load-balancing and the path length of the network flows. We have developed our proposal in the Network Simulator 3 (ns-3) and have compared it with other works in literature. We found that our heuristic provides throughput improvements in most of the analyzed scenarios, besides promote greater justice between the flows that compete for resources.