Latency Constrained Aggregation in Sensor Networks

摘要: A sensor network consists of sensing devices which may exchange data through wireless communication; networks are highly energy constrained since they usually battery operated. Data aggregation is a possible way to save consumption: nodes delay in order aggregate them into single packet before forwarding towards some central node (sink). However, many applications impose constraints on freshness; this translates latency for arriving at the sink. We study problem minimize maximum consumption under sensed delivery and we assume unique transmission paths that form tree rooted sink. We prove off-line strongly NP-hard design 2- approximation algorithm. The latter uses novel rounding technique. Almost all real life managed on-line by simple distributed algorithms nodes. In context consider both case synchronized or not. use competitive analysis assess their performance.