On the capacity of ad hoc networks with clustering

We obtain an upper bound on the throughput of an ad hoc network which contains a square-shaped cluster with n nodes acting as sources communicating with another square-shaped cluster with n destination nodes. We consider the cases where the two clusters have no overlap, partial overlap, and complete overlap. We also investigate the achievability of the upper bound in the no overlap case and show that it can be achieved up to a typically small additive term.