Modelo e algoritmos para a definição da densidade, cobertura e conectividade em uma rede de sensores sem fio

• Ano de defesa: 2004
• Autor(a) principal: Gutavo Campos Menezes
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Minas Gerais; UFMG
• Palavras-chave em Português: Ciência da Computação; Sensores Processamento de dados; Redes de computadores Protocolos; Redes ATM; Análise de redes (Planejamento); Computação; Redes de computadores
• Link de acesso: http://hdl.handle.net/1843/BUBD-9K9MK5

The Wireless Sensor Networks have being carrying great challenges. One of them is the coverage problem which consists in assuring the monitoring quality for a specific area or environment. Another challenge, is to control the density of sensors. That is, from a set of sensors deployed in an area of monitoring, determine the less number of sensors that must be activated in order to guarantee the coverage and connectivity in the network. This paper presents a mixed integer linear programming model which aims to solve these problems. Besides the optimization model, it is also proposed a heuristic based on Lagrangean Relaxation and sub-gradient methods. The computational results show that the heuristic used is able to provide optimal solutions to a large range of instances. Moreover, a significant reduction in computational effort is achieved, as compared to optimization packages such as CPLEX.