Scaling laws for one-dimensional ad hoc wireless networks

We obtain a precise information theoretic upper bound on the rate per communication pair in a one-dimensional ad hoc wireless network. The key ingredient of our result is a uniform upper bound on the determinant of the Cauchy matrix

[1]  H. Weyl.  The Classical Groups , 1939 .

[2]  Olivier Lévêque,et al.  Scaling laws for one-dimensional ad hoc wireless networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[4]  Sanjeev R. Kulkarni,et al.  Upper bounds to transport capacity of wireless networks , 2004, IEEE Transactions on Information Theory.

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

[6]  Emre Telatar,et al.  Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks , 2005, IEEE Transactions on Information Theory.

[7]  Jack Levine,et al.  An Identity of Cayley , 1960 .

[8]  P. Viswanath,et al.  Upper bounds to transport capacity of wireless networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).