In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-node power constraint, is the fading exponent of radio signal and n is the number of nodes randomly distributed inside a disk of unit area. This is a stronger result than the upper bound O(P (pnlogn) ) and the lower bound O(P n =(logn) ) previously shown by Negi and Rajeswaran. Our proof is simple given the prior work by Gupta and Kumar.