Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks.
Hongwei DuQiang YeJiaofei ZhongYuexuan WangWonjun LeeHaesun ParkPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- polynomial time approximation
- wireless sensor networks
- connected dominating set
- minimum cost
- np hard
- approximation algorithms
- dominating set
- routing algorithm
- routing scheme
- maximum lifetime
- routing protocol
- biological inspired
- error bounds
- data aggregation
- mobile nodes
- constant factor
- energy consumption
- facility location problem
- energy efficient
- sensor networks
- multi hop
- base station
- sensor nodes
- routing problem
- ad hoc networks
- evolutionary algorithm
- routing decisions
- worst case
- upper bound
- approximation guarantees
- bin packing
- mobile ad hoc networks
- shortest path