Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
From MaRDI portal
Publication:1398906
DOI10.1016/S1389-1286(03)00212-3zbMath1059.68523OpenAlexW2176466527MaRDI QIDQ1398906
Koustuv Dasgupta, Konstantinos Kalpakis, Parag Namjoshi
Publication date: 7 August 2003
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1389-1286(03)00212-3
Maximum flowLifetimeData aggregationData gatheringEnergy-efficient protocolsMinimum cutSensor networks
Related Items (17)
Spanning trees with minimum weighted degrees ⋮ Optimal multi-TDMA scheduling in ring topology networks ⋮ Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks ⋮ An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems ⋮ Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint ⋮ Optimal energy allocation in heterogeneous wireless sensor networks for lifetime maximization ⋮ Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks ⋮ Energy-efficient cooperative data aggregation for wireless sensor networks ⋮ Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks ⋮ Energy efficient ant colony algorithms for data aggregation in wireless sensor networks ⋮ Fast algorithm for multicast and data gathering in wireless networks ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Improved approximation algorithms for maximum lifetime problems in wireless networks ⋮ A Lagrangean-based heuristics for the target covering problem in wireless sensor network ⋮ Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding ⋮ Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks ⋮ Exact and approximate balanced data gathering in energy-constrained sensor networks
This page was built for publication: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
