Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Randomized algorithms
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Embedding the Internet: introduction
Communications of the ACM
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
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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)
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The Cougar Project: a work-in-progress report
ACM SIGMOD Record
Power efficient gathering of correlated data: optimization, NP-completeness and heuristics
ACM SIGMOBILE Mobile Computing and Communications Review
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Fundamental limits of networked sensing: the flow optimization framework
Wireless sensor networks
All-norm approximation algorithms
Journal of Algorithms
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Energy efficient routing with adaptive data fusion in sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Scale-free aggregation in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
On the optimal density for real-time data gathering of spatio-temporal processes in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Lossy network correlated data gathering with high-resolution coding
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Lossy network correlated data gathering with high-resolution coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
ACM Transactions on Sensor Networks (TOSN)
Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks
IEEE Transactions on Computers
On optimal communication cost for gathering correlated data through wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Scalable data aggregation for dynamic events in sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
ACM Transactions on Sensor Networks (TOSN)
Modeling spatially correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Collaborative broadcasting and compression in cluster-based wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Latency constrained aggregation in sensor networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Joint Routing and 2D Transform Optimization for Irregular Sensor Network Grids Using Wavelet Lifting
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Designing routes for source coding with explicit side information in sensor networks
IEEE/ACM Transactions on Networking (TON)
Efficient aggregation using first hop selection in WSNs
International Journal of Sensor Networks
The impact of spatial correlation on routing with compression in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks
International Journal of Distributed Sensor Networks - Selected Papers in Innovations and Real-Time Applications of Distributed Sensor Networks
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimizing Many-to-Many Data Aggregation in Wireless Sensor Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Prediction Based Mobile Data Aggregation in Wireless Sensor Network
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms (TALG)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Delay performance of scheduling with data aggregation in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Information quality aware routing in event-driven sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy-efficient cooperative data aggregation for wireless sensor networks
Journal of Parallel and Distributed Computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Constructing maximum-lifetime data gathering forests in sensor networks
IEEE/ACM Transactions on Networking (TON)
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Routing explicit side information for data compression in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Multi-query optimization for sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Distributed data gathering in multi-sink sensor networks with correlated sources
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
The filter-placement problem and its application to minimizing information multiplicity
Proceedings of the VLDB Endowment
Resource optimization algorithm for sparse time-driven sensor networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Minimum cost source location problems with flow requirements
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Aggregate node placement for maximizing network lifetime in sensor networks
Wireless Communications & Mobile Computing
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Active node determination for correlated data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tight analysis of shortest path convergecast in wireless sensor networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
International Journal of Ad Hoc and Ubiquitous Computing
Tight analysis of shortest path convergecast in wireless sensor networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Energy-efficient tree-based cooperative data aggregation for wireless sensor networks
International Journal of Sensor Networks
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in the tree. Specifically, we assume that if information from j sources is traveling over a link, the total information that needs to be transmitted is f(j). One natural and important (though not necessarily comprehensive) class of functions is those which are concave, non-decreasing, and satisfy f(0) = 0. Our goal is to find a tree which is a good approximation simultaneously to the optimum trees for all such functions. This problem is motivated by aggregation in sensor networks, as well as by buy-at-bulk network design.We present a randomized tree construction algorithm that guarantees E[maxfCf/C*(f)] 1 + log k, where Cf is a random variable denoting the cost of the tree for function f and C* (f) is the cost of the optimum tree for function f. To the best of our knowledge, this is the first result regarding simultaneous optimization for concave costs. We also show how to derandomize this result to obtain a deterministic algorithm that guarantees maxf/C*(f) = O(log k). Both these results are much stronger than merely obtaining a guarantee on maxfE[Cf/C* (f)]. A guarantee on maxfE[Cf/C* (f)] can be obtained using existing techniques, but this does not capture simultaneous optimization since no one tree is guaranteed to be a good approximation for all f simultaneously.While our analysis is quite involved, the algorithm itself is very simple and may well find practical use. We also hope that our techniques will prove useful for other problems where one needs simultaneous optimization for concave costs.