Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3846
Título: Efficient computation of min and max sensor values in multihop networks
Autor: Pereira, Nuno
Andersson, Björn
Tovar, Eduardo
Carvalho, Paulo
Palavras-chave: Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter
Data processing
Large-scale sensor networks
MAC protocol
Data: 2009
Editora: Springer
Relatório da Série N.º: Intelligent Technical Systems. Lecture Notes in Electrical Engineering; Vol. 38
Resumo: Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3846
ISBN: 978-1-4020-9822-2
978-1-4020-9823-9
Versão do Editor: http://link.springer.com/chapter/10.1007/978-1-4020-9823-9_17
Aparece nas colecções:ISEP – CISTER – Livro, parte de livro, ou capítulo de livro

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
CAPL_NunoPereira_2009_CISTER.pdf95,84 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.