Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases

摘要

We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general. However the complexity status of the problem remained open in the case when the aggregation tree was given. We have proved that in this case, the problem is also NP-hard. Additionally, we proposed several new approximate suboptimal solutions in the special cases of the problem on the grid graphs.