Multi-K: Um protocolo de roteamento para redes de sensores sem fio usando árvores de espalhamento parcias

• Ano de defesa: 2007
• Autor(a) principal: Gonçalves, Rodrigo Trindade
• Orientador(a): Goulart, Carlos de Castro
• Banca de defesa: Oliveira, Alcione de Paiva , Loureiro, Antônio Alfredo Ferreira
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Viçosa
• Programa de Pós-Graduação: Mestrado em Ciência da Computação
• Departamento: Metodologias e técnicas da Computação; Sistemas de Computação
• País: BR
• Palavras-chave em Português: Redes de computadores; Redes de sensores sem fio; Protocolos de comunicação
• Palavras-chave em Inglês: Computer networks; Wireless sensor networks; Communication protocol
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: http://locus.ufv.br/handle/123456789/2687

This work presents Multi-K, a modified version of Multi which is a data dissemination protocol for wireless sensor networks. A WSN is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions. The Multi protocol is a hybrid adaptive protocol, that can either use a reactive behavior when the frequency of events is low or can use a proactive behavior when the frequency of events is high. In the proactive behavior, Multi generates a spanning tree for the network that must periodically be refreshed. The Multi-K protocol uses an approach of branching, starting from the sink node, a tree of k hops, to each source node (node that is transmitting data). The distance d (hops) from a single source node to the sink node is defined as the shortest path. When two or more nodes are transmitting data, the number of hops k, for building the tree, is determined by the longest value of d. In this way, if the frequency of events were concentrated in the area near the sink node, it would have a lower number of control messages to build and keep the partial spanning tree. The proposed modification was simulated using simulator NS-2 (Network Simulator 2) and the results were compared with those obtained by the original version of the protocol. The simulation scenarios considered two distinct situations. In the first one, the nodes were uniformly distributed and the events also happened with uniform distribution. In this situation, the results showed that the proposed approach in Multi-K is scalable, can keep the data delivery rate and provides a small reduction in the energy consumption when compared Multi. In the second situation, in which the simulation scenarios considered non-uniform distribution of the nodes, and with the nodes concentrated in regions near the sink node, the Multi-K protocol presented a very interesting solution, since it provided a signficant reduction in the energy consumption, in comparison the Multi protocol. This last set of simulation represents real applications where the events are concentrated in areas near to the sink node.