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

Aurélie C. Lozano, Sanjeev R. Kulkarni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages2119-2123
Number of pages5
DOIs
StatePublished - Dec 1 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2005
ISSN (Print)2157-8099

Other

Other2005 IEEE International Symposium on Information Theory, ISIT 05
CountryAustralia
CityAdelaide
Period9/4/059/9/05

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A wireless network can achieve maximum throughput without each node meeting all others'. Together they form a unique fingerprint.

Cite this