A reactive role assignment for data routing in event-based wireless sensor networks

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorNakamura, Eduardo Freire-
Autor(es): dc.creatorRamos Filho, Heitor Soares-
Autor(es): dc.creatorVillas, Leandro Aparecido-
Autor(es): dc.creatorOliveira, Horácio Antônio Braga Fernandes de-
Autor(es): dc.creatorAquino, André Luiz Lins de-
Autor(es): dc.creatorLoureiro, Antônio Alfredo Ferreira-
Data de aceite: dc.date.accessioned2019-11-06T13:24:20Z-
Data de disponibilização: dc.date.available2019-11-06T13:24:20Z-
Data de envio: dc.date.issued2012-07-12-
Data de envio: dc.date.issued2012-07-12-
Data de envio: dc.date.issued2009-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/123456789/1100-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/554689-
Descrição: dc.descriptionIn this work, we show how we can design a routing protocol for wireless sensor networks (WSNs) to support an information-fusion application. Regarding the application, we consider that WSNs apply information fusion techniques to detect events in the sensor field. Particularly, in event-driven scenarios there might be long intervals of inactivity. However, at a given instant, multiple sensor nodes might detect one or more events, resulting in high traffic. To save energy, the network should be able to remain in a latent state until an event occurs, then the network should organize itself to properly detect and notify the event. Based on the premise that we have an information-fusion application for event detection, we propose a role assignment algorithm, called Information-Fusion-based Role Assignment(InFRA), to organize the network by assigning roles to nodes only when events are detected. The InFRA algorithm is a distributed heuristic to the minimal Steiner tree, and it is suitable for networks with severe resource constraints, such as WSNs. Theoretical anal ysis shows that, in some cases, our algorithm has aOð1 Þ-approximation ratio. Simulation results show that the InFRA algorithm can use only 70% of the communication resources spent by a reactive version of the Centered-at-Nearest-Source algorithm.-
Idioma: dc.languageen-
Direitos: dc.rightsO Periódico Computer Networks concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3292420173293.-
Palavras-chave: dc.subjectInformation fusion-
Palavras-chave: dc.subjectRole assignment-
Palavras-chave: dc.subjectWireless sensor networks-
Palavras-chave: dc.subjectData routing-
Palavras-chave: dc.subjectIn-network aggregation-
Título: dc.titleA reactive role assignment for data routing in event-based wireless sensor networks-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.