. Furthermore, for large- scale multihop networks, distributed algorithms for routing, linkscheduling, and power control are necessary to ensure thescalability of computing complexity. For routing, . (6) and (9).As long as λlis large enough, upon convergence, Pl(i)(k) for each l becomes nonzero for some (at least one) of k=1, 2, , K, and zero for the rest of k = 1, 2, , K.Thenforeach. with moderate power allo-cations to an infeasible data rate with infinite power allocations isvery sharp for each of K<8.uled to be on for only one slot and off for all other slots. Wesee that...