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

Aman Jain, Sanjeev R. Kulkarni, Sergio Verdu

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

In this paper, we consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studieddense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption. We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting in arbitrary wireless networks when the channel state information is not available at the transmitters. Upper bounds are 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 regular networks, and differs by a poly-logarithmic factor for extended random networks. Furthermore, we show that the proposed upper and lower bounds for random networks hold almost surely in the node locations as the number of nodes approaches infinity.

Original languageEnglish (US)
Article number5673782
Pages (from-to)14-32
Number of pages19
JournalIEEE Transactions on Information Theory
Volume57
Issue number1
DOIs
StatePublished - Jan 1 2011

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Cooperative communication
  • minimum energy per bit
  • multicasting
  • wideband communication
  • wireless networks

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

  • Cite this