| dc.contributor.author | Pereira, Nuno | |
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Tovar, Eduardo | |
| dc.contributor.author | Carvalho, Paulo | |
| dc.date.accessioned | 2014-02-12T10:57:36Z | |
| dc.date.available | 2014-02-12T10:57:36Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | 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. | por |
| dc.identifier.doi | 10.1007/978-1-4020-9823-9_17 | pt_PT |
| dc.identifier.isbn | 978-1-4020-9822-2 | |
| dc.identifier.isbn | 978-1-4020-9823-9 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3846 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer | por |
| dc.relation.ispartofseries | Intelligent Technical Systems. Lecture Notes in Electrical Engineering; Vol. 38 | |
| dc.relation.publisherversion | http://link.springer.com/chapter/10.1007/978-1-4020-9823-9_17 | por |
| dc.subject | 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 | por |
| dc.subject | Data processing | por |
| dc.subject | Large-scale sensor networks | por |
| dc.subject | MAC protocol | por |
| dc.title | Efficient computation of min and max sensor values in multihop networks | por |
| dc.type | book part | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 246 | por |
| oaire.citation.startPage | 233 | por |
| oaire.citation.title | Intelligent Technical Systems. Lecture Notes in Electrical Engineering | por |
| oaire.citation.volume | 38 | por |
| person.familyName | Pereira | |
| person.familyName | Tovar | |
| person.givenName | Nuno | |
| person.givenName | Eduardo | |
| person.identifier.ciencia-id | 7818-7C77-02BA | |
| person.identifier.ciencia-id | 6017-8881-11E8 | |
| person.identifier.orcid | 0000-0001-6370-9373 | |
| person.identifier.orcid | 0000-0001-8979-3876 | |
| person.identifier.scopus-author-id | 8404645300 | |
| person.identifier.scopus-author-id | 7006312557 | |
| rcaap.rights | closedAccess | por |
| rcaap.type | bookPart | por |
| relation.isAuthorOfPublication | 33fee0a6-53b7-45d5-9be3-f48b1c7064d1 | |
| relation.isAuthorOfPublication | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
| relation.isAuthorOfPublication.latestForDiscovery | 80b63d8a-2e6d-484e-af3c-55849d0cb65e |
