Scheduling for compute and forward networks

Interference is a consequence of the broadcast nature of wireless communications. Compute and forward (CoF) leverages interfering signals to retrieve relevant information from concurrent transmissions. For a network where nodes must empty a queue in minimum time the use of CF can outperform a traditional TDMA approach. We analyze the impact of compute and forward in minimizing the time to empty a wireless network. While a Linear Programing formulation is available, the minimization problem remains NP-hard. We propose two 2-Set strategies of distinct computational complexity and performance. Our strategies are evaluated against TDMA, the optimal solution, and alternative heuristics.