Applications of submodular functions
Surveys in combinatorics, 1993
Using fast matrix multiplication to find basic solutions
Theoretical Computer Science
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Introduction to Linear Optimization
Introduction to Linear Optimization
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Low-Power Wireless Sensor Networks
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
PicoRadio: Ad-Hoc Wireless Networking of Ubiquitous Low-Energy Sensor/Monitor Nodes
WVLSI '00 Proceedings of the IEEE Computer Society Annual Workshop on VLSI (WVLSI'00)
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
Optimal Base-Station Locations in Two-Tiered Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing
IEEE Transactions on Mobile Computing
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Energy Minimization for Real-Time Data Gathering in Wireless Sensor Networks
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Hi-index | 0.00 |
We consider two related data gathering problems for wireless sensor networks (WSNs). The MLDA problem is concerned with maximizing the system lifetime T so that we can perform T rounds of data gathering with in-network aggregation, given the initial available energy of the sensors. The M2EDA problem is concerned with minimizing the maximum energy consumed by any one sensor when performing T rounds of data gathering with in-network aggregation, for a given T. We provide an effective algorithm for finding an everywhere sparse integral solution to the M2EDA problem which is within a factor of α = 1+ 4n/T of the optimum, where n is the number of nodes. A solution is everywhere sparse if the number of communication links for any subset X of nodes is O(X), in our case at most 4|X|. Since often T = ω(n), we obtain the first everywhere sparse, asymptotically optimal integral solutions to the M2EDA problem. Everywhere sparse solutions are desirable since then almost all sensors have small number of incident communication links and small overhead for maintaining state. We also show that the MLDA and M2EDA problems are essentially equivalent, in the sense that we can obtain an optimal fractional solution to an instance of the MLDA problem by scaling an optimal fractional solution to a suitable instance of the M2EDA problem. As a result, our algorithm is effective at finding everywhere sparse, asymptotically optimal, integral solutions to the MLDA problem, when the initial available energy of the sensors is sufficient for supporting optimal system lifetime which is ω(n).