Bounds on the minimum energy-per-bit for bursty traffic in diamond networks

Ilan Shomorony, Raúl Etkin, Farzad Parvaresh, A. Salman Avestimehr

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

Abstract

When data traffic in a wireless network is bursty, small amounts of data sporadically become available for transmission, and the energy cost associated with synchronizing the network nodes prior to each communication block is not negligible. Therefore, designing energy-efficient communication schemes for such asynchronous scenarios is of particular importance. In this paper, we show that, for symmetric diamond networks, by performing the tasks of synchronization and communication separately, it is possible to achieve the minimum energy-per-bit to within a factor that ranges from 2 in the synchronous case to 1 in the highly asynchronous regime.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages801-805
Number of pages5
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period7/1/127/6/12

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Bounds on the minimum energy-per-bit for bursty traffic in diamond networks'. Together they form a unique fingerprint.

Cite this