Multicasting in large random wireless networks: Bounds on the minimum energy per bit

Aman Jain, Sanjeev R. Kulkarni, Sergio Verdú

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

2 Scopus citations

Abstract

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a random wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied dense random networks and constant density (extended) random networks. We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting that holds for arbitrary wireless networks when the channel state information is not available at the transmitters. These lower bounds are then evaluated for two cases of random networks. Upper bounds are also obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes. The gap between the upper and lower bounds is only a constant factor for dense random networks and differs by a poly-logarithmic factor for extended random networks. Furthermore, the proposed upper and lower bounds hold almost surely in the node locations as the number of nodes approaches infinity.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2627-2631
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

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

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Multicasting in large random wireless networks: Bounds on the minimum energy per bit'. Together they form a unique fingerprint.

  • Cite this

    Jain, A., Kulkarni, S. R., & Verdú, S. (2009). Multicasting in large random wireless networks: Bounds on the minimum energy per bit. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2627-2631). [5205947] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205947