On upper bounds on communication rates in ad-hoc networks with non-uniform traffic pattern

Traffic demands in networks play a vital role in determining the transmission rate that a network can support between communicating users. We derive information theoretic upper bounds on the rate per communicating source-destination pair in ad-hoc wireless networks with a non-uniform traffic pattern. The upper bounds are tight and closely follow the achievability bounds recently given by Tabet and Knopp. Furthermore, we show that in the case of large signal attenuation, the bounds hold even when the cooperation among the users is limited to certain region of the network domain