Scheduling for data gathering networks with data compression
Data gathering networks with data compression are studied. The scheduling problem is to transfer all data in given time at the minimum cost. The decision version of the problem is proved to be NP-complete. Polynomial-time heuristics are proposed and tested experimentally.
scheduling data gathering networks data compression