TY - GEN

T1 - A wireless network can achieve maximum throughput without each node meeting all others

AU - Lozano, Aurélie C.

AU - Kulkarni, Sanjeev R.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We study throughput scaling of an ad-hoc network where the nodes are restricted to move on vertical or horizontal lines on a square. A constant throughput is asymptotically achievable by the proposed scheduling algorithm, using in certain cases more than two hops strategies, without requiring each node to become the nearest neighbor of every other node. Hence the throughput result for one-dimensional mobility obtained by Diggavi et al. in Proc. IEEE ISIT, 2002 still holds under stricter mobility constraints.

AB - We study throughput scaling of an ad-hoc network where the nodes are restricted to move on vertical or horizontal lines on a square. A constant throughput is asymptotically achievable by the proposed scheduling algorithm, using in certain cases more than two hops strategies, without requiring each node to become the nearest neighbor of every other node. Hence the throughput result for one-dimensional mobility obtained by Diggavi et al. in Proc. IEEE ISIT, 2002 still holds under stricter mobility constraints.

UR - http://www.scopus.com/inward/record.url?scp=33749445802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749445802&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523720

DO - 10.1109/ISIT.2005.1523720

M3 - Conference contribution

AN - SCOPUS:33749445802

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2119

EP - 2123

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -