A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network.
Deqian FuLihua HanZifen YangSeong Tae JhangPublished in: Int. J. Distributed Sens. Networks (2016)
Keyphrases
- greedy algorithm
- wireless networks
- connected dominating set
- dominating set
- wireless communication
- greedy algorithms
- facility location problem
- base station
- worst case
- mobile computing
- ad hoc networks
- wireless networking
- influence maximization
- multi hop
- objective function
- dynamic programming
- mobile networks
- access points
- set cover
- greedy heuristic
- network infrastructure
- wifi
- knapsack problem
- wireless local area network
- link layer
- greedy strategy
- computational complexity
- wireless mesh networks
- influence spread