In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained. Data aggregation can be used to combine data of several sensors into a single message, thus reducing sensor communication costs at the expense of message delays. Thus, the main problem of data aggregation is to balance the communication and delay costs. In this paper we study the data aggregation problem as a bicriteria optimization problem; the objectives we consider are to minimize maximum energy consumption of a sensor and a function of the maximum latency costs of a message. We consider distributed algorithms under an asynchronous time model, and under an almost synchronous time model, where sensor clocks are synchronized up to a small drift. We use competitive analysis to assess the quality of the algorithms

Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs / Peter, Korteweg; MARCHETTI SPACCAMELA, Alberto; Leen, Stougie; Vitaletti, Andrea. - 4474:(2007), pp. 139-150. (Intervento presentato al convegno Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO tenutosi a Pisa nel June, 2007) [10.1007/978-3-540-72951-8_12].

Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs

MARCHETTI SPACCAMELA, Alberto;VITALETTI, Andrea
2007

Abstract

In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained. Data aggregation can be used to combine data of several sensors into a single message, thus reducing sensor communication costs at the expense of message delays. Thus, the main problem of data aggregation is to balance the communication and delay costs. In this paper we study the data aggregation problem as a bicriteria optimization problem; the objectives we consider are to minimize maximum energy consumption of a sensor and a function of the maximum latency costs of a message. We consider distributed algorithms under an asynchronous time model, and under an almost synchronous time model, where sensor clocks are synchronized up to a small drift. We use competitive analysis to assess the quality of the algorithms
2007
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs / Peter, Korteweg; MARCHETTI SPACCAMELA, Alberto; Leen, Stougie; Vitaletti, Andrea. - 4474:(2007), pp. 139-150. (Intervento presentato al convegno Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO tenutosi a Pisa nel June, 2007) [10.1007/978-3-540-72951-8_12].
File allegati a questo prodotto
File Dimensione Formato  
VE_2007_11573-215195.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 414.78 kB
Formato Adobe PDF
414.78 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/215195
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
social impact