A sensor network consists of sensing devices which may exchange data through wireless communication; sensor networks are highly energy constrained since they are usually battery operated. Data aggregation is a possible way to save energy consumption: nodes may delay data in order to aggregate them into a single packet before forwarding them towards some central node (sink). However, many applications impose constraints on data freshness; this translates into latency constraints for data arriving at the sink. We study the problem of data aggregation to minimize maximum energy consumption under latency constraints on sensed data delivery and we assume unique transmission paths that form a tree rooted at the sink. We prove that the off-line problem is strongly NP-hard and we design a 2-approximation algorithm. The latter uses a novel rounding technique. Almost all real life sensor networks are managed on-line by simple distributed algorithms in the nodes. In this context we consider both the case in which sensor nodes are synchronized or not. We consider distributed on-line algorithms and use competitive analysis to assess their performance.
Latency constrained aggregation in sensor networks / Becchetti, Luca; P., Korteweg; MARCHETTI SPACCAMELA, Alberto; M., Skutella; L., Stougie; Vitaletti, Andrea. - 4168(2006), pp. 88-99. [10.1007/11841036_11]
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Latency constrained aggregation in sensor networks|
|Data di pubblicazione:||2006|
|Citazione:||Latency constrained aggregation in sensor networks / Becchetti, Luca; P., Korteweg; MARCHETTI SPACCAMELA, Alberto; M., Skutella; L., Stougie; Vitaletti, Andrea. - 4168(2006), pp. 88-99. [10.1007/11841036_11]|
|Appartiene alla tipologia:||04b Atto di convegno in volume|