We show that for a general class of distributed power control algorithms in wireless networks, if a feasible steady state power allocation exists, this is asymptotically stable for arbitrary gains and time varying heterogeneous delays. The analysis exploits certain contraction properties of the interference in such algorithms, and makes use of Lyapunov Razumikhin functions to address the infinite dimensional character of the problem.