Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimized Scheduling for Data Aggregation in Wireless Sensor Networks
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Tight bounds for delay-sensitive aggregation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Communications of the ACM
Data aggregation in sensor networks: balancing communication and delay costs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Delay performance of scheduling with data aggregation in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Capacitated max -batching with interval graph compatibilities
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Online function tracking with generalized penalties
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Hi-index | 0.02 |
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.