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.

[1]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[2]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[3]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Ashish Agarwal,et al.  Improved capacity bounds for wireless networks , 2004, Wirel. Commun. Mob. Comput..

[5]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Rick S. Blum,et al.  Delay-limited throughput of ad hoc networks , 2004, IEEE Transactions on Communications.

[9]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Panganamala Ramana Kumar,et al.  Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.

[11]  Mathukumalli Vidyasagar,et al.  A Theory of Learning and Generalization , 1997 .