Please use this identifier to cite or link to this item:
http://hdl.handle.net/1843/SLSC-BBKJDV
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor1 | Geraldo Robson Mateus | pt_BR |
dc.contributor.referee1 | Alexandre Salles da Cunha | pt_BR |
dc.contributor.referee2 | Vinicius Fernandes dos Santos | pt_BR |
dc.contributor.referee3 | Dilson Lucas Pereira | pt_BR |
dc.contributor.referee4 | Marcus Vinícius Soledade Poggi de Aragão | pt_BR |
dc.creator | Vinicius Wellington Coelho de Morais | pt_BR |
dc.date.accessioned | 2019-08-11T14:52:27Z | - |
dc.date.available | 2019-08-11T14:52:27Z | - |
dc.date.issued | 2018-08-31 | pt_BR |
dc.identifier.uri | http://hdl.handle.net/1843/SLSC-BBKJDV | - |
dc.description.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. | pt_BR |
dc.description.resumo | 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. | pt_BR |
dc.language | Português | pt_BR |
dc.publisher | Universidade Federal de Minas Gerais | pt_BR |
dc.publisher.initials | UFMG | pt_BR |
dc.rights | Acesso Aberto | pt_BR |
dc.subject | simple directed cycles | pt_BR |
dc.subject | wireless sensor networks | pt_BR |
dc.subject | cardinality constraints | pt_BR |
dc.subject | backbone arborescence | pt_BR |
dc.subject.other | simple directed cycles | pt_BR |
dc.subject.other | Wireless sensor networks | pt_BR |
dc.subject.other | cardinality constraints | pt_BR |
dc.subject.other | Computação | pt_BR |
dc.subject.other | backbone arborescence | pt_BR |
dc.title | Topological design of Wireless sensor network: Formulations and exact algorithms | pt_BR |
dc.type | Tese de Doutorado | pt_BR |
Appears in Collections: | Teses de Doutorado |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
viniciuswellingtoncoelhodemorais.pdf | 936.02 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.