Algoritmos Heurísticos para formação de clusters em redes de sensores sem fio

• Autor(a) principal: Matos, Victor de Oliveira
• Data de Publicação: 2013
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: LOCUS Repositório Institucional da UFV
• Texto Completo: http://locus.ufv.br/handle/123456789/2663
• topic: RSSF; Clusters; Heuristicas; GRASP; WSN; Clusters; Heuristics; GRASP; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

Wireless sensor networks (WSN s) are a type of ad hoc network characterized by a large amount of sensors that have limited resources and are responsible for monitoring the enviroment and sending the collected data to a base-station. The sensors are usually small devices, inexpensive and have finite amount of energy. Thus, it is important to develop energy aware routing protocols. There are several ways to send the collected information to the base station. Routing techniques based on clusters will be the main focus of this work. Clustering consist of grouping the sensors, where some of them act as leader, known as cluster heads, which are responsible for managing the group communication. As the formation of optimal clusters in a WSN is a problem known to be NP-Hard, this paper proposes the use of the meta-heuristic GRASP to obtain efficient topologies in sensor networks based on clustering. We developed two versions of the GRASP algorithm. A version for single level topology and another version that considers multilevel topology. The algorithm for single level topology, was also tested with an intensification procedure based on the Path Relinking technique. To evaluate the performance of the algorithms, we develop a simulator that runs in cycles (or rounds). Each round determines a configuration of the network and the data transmission is made over the network. The results were compared to literature protocols, LEACH LEACH-C and EEM.