Please use this identifier to cite or link to this item:
metadata.artigo.dc.title: An algorithm to coordinate missions in wireless sensor networks
metadata.artigo.dc.creator: Sá, Alex Guimarães Cardoso de
Heimfarth, Tales
Oliveira, Hewerton Enes de
Freitas, Edison Pignaton de
metadata.artigo.dc.subject: Algorithm
Wireless sensor network (WSN)
metadata.artigo.dc.publisher: Institute of Electrical and Electronics Engineers (IEEE) 19-Apr-2012
metadata.artigo.dc.identifier.citation: SÁ, A. G. C. de et al. An algorithm to coordinate missions in wireless sensor networks. IEEE Latin America Transactions, [S.l.], v. 10, n. 2, p. 1595-1602, Apr. 2012. DOI: 10.1109/TLA.2012.6187604.
metadata.artigo.dc.description.abstract: This paper presents an algorithm to allocate suitable nodes of a Wireless Sensor Network (WSN) to accomplish a given task (called mission). This algorithm is part of the Grubmi middleware. A mission is inserted in an arbitrary point of the network, being disseminated to all nodes by the middleware. Then, a suitable set of nodes should be selected to execute the jobs described by the mission. The network is heterogeneous, therefore, the nodes' characteristics must match the mission's requirements. Since a centralized algorithm with global information about the network is prohibitive due to the costs, we proposed in this paper a probabilistic approach to solve this problem. Two versions of the heuristic are described: the basic and the extended one. For a scenario with mixed placement of different nodes, both variants, in average, presented results which were 87% of the optimal one. For scenarios with regions of nodes with similar characteristics, the basic heuristic had lower performance whereas the extended one could maintain the same behavior.
metadata.artigo.dc.language: en_US
Appears in Collections:DCC - Artigos publicados em periódicos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.