... not depend on n. On the other hand, clearly,E(d) = Edi=h1√A, (59)where the number h1depends only on the shape of the regioncontaining the network but not on the number of nodes ... (55)Using the identity n=√ρAn in the above equation and re-calling the definition of F, we arrive at the statement of the theorem.3. UPPER BOUND ON THROUGHPUTIn this section, we use the upper ... Negi and A. Rajeswaran, “Capacity of power constrained ad- hoc networks, ” in Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM ’04), vol. 1, pp.443–453, Hong Kong,...