A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets.
Samir BalbalSalim BouamamaChristian BlumPublished in: Algorithms (2021)
Keyphrases
- greedy heuristic
- wireless sensor networks
- energy consumption
- data gathering
- np hard
- greedy algorithm
- maximum lifetime
- network lifetime
- knapsack problem
- energy efficient
- sensor networks
- cluster head
- minimum weight
- base station
- data aggregation
- multi hop
- routing protocol
- worst case analysis
- optimal solution
- lower bound
- environmental monitoring
- data collection
- data sets
- routing algorithm
- energy efficiency
- wireless communication
- bipartite graph matching
- set cover
- residual energy
- biological inspired
- learning algorithm
- topology control
- disjoint sets
- energy aware
- definite clause
- data streams
- special case
- sensor nodes