Use este identificador para citar o ir al link de este elemento:
http://hdl.handle.net/1843/SLSC-BBKJDV
Tipo: | Tese de Doutorado |
Título: | Topological design of Wireless sensor network: Formulations and exact algorithms |
Autor(es): | Vinicius Wellington Coelho de Morais |
primer Tutor: | Geraldo Robson Mateus |
primer miembro del tribunal : | Alexandre Salles da Cunha |
Segundo miembro del tribunal: | Vinicius Fernandes dos Santos |
Tercer miembro del tribunal: | Dilson Lucas Pereira |
Cuarto miembro del tribunal: | Marcus Vinícius Soledade Poggi de Aragão |
Resumen: | The subject of this thesis is the design of Wireless Sensor Networks (WSN). Given a limited set of sensors and a single sinks, we are particularly interested in the topological WSN design problem. This problem consists in clustering the sensors and defining a communication topology to gather the sensed information throughout the network. Natural connectivity and coverage requirements are satisfied assuming an imposition on the number of clusters. Two variants of the problem are studied: p-arborescence star problem (P-ASP) and p-cycle star problem (P-CSP). P-ASP organizes the network into p clusters and defines the communication topology as rooted directed tree, i.e., an arborescence rooted at the sink. In P-CSP, mobile-sink based networks are designed replacing the core arborescence by a directed cycle. We introduce Mixed Integer Programming formulations and exact solution approaches. To validate our approaches, experiments are performed on instance sets extended from the literature. |
Abstract: | The subject of this thesis is the design of Wireless Sensor Networks (WSN). Given a limited set of sensors and a single sinks, we are particularly interested in the topological WSN design problem. This problem consists in clustering the sensors and defining a communication topology to gather the sensed information throughout the network. Natural connectivity and coverage requirements are satisfied assuming an imposition on the number of clusters. Two variants of the problem are studied: p-arborescence star problem (P-ASP) and p-cycle star problem (P-CSP). P-ASP organizes the network into p clusters and defines the communication topology as rooted directed tree, i.e., an arborescence rooted at the sink. In P-CSP, mobile-sink based networks are designed replacing the core arborescence by a directed cycle. We introduce Mixed Integer Programming formulations and exact solution approaches. To validate our approaches, experiments are performed on instance sets extended from the literature. |
Asunto: | simple directed cycles Wireless sensor networks cardinality constraints Computação backbone arborescence |
Idioma: | Português |
Editor: | Universidade Federal de Minas Gerais |
Sigla da Institución: | UFMG |
Tipo de acceso: | Acesso Aberto |
URI: | http://hdl.handle.net/1843/SLSC-BBKJDV |
Fecha del documento: | 31-ago-2018 |
Aparece en las colecciones: | Teses de Doutorado |
archivos asociados a este elemento:
archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
viniciuswellingtoncoelhodemorais.pdf | 936.02 kB | Adobe PDF | Visualizar/Abrir |
Los elementos en el repositorio están protegidos por copyright, con todos los derechos reservados, salvo cuando es indicado lo contrario.