The multicast capacity of large multihop wireless networks

Srinivas Shakkottai, Xin Liu, R. Srikant

Research output: Contribution to journalArticlepeer-review


We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicast sessions may coexist. We first calculate an upper bound on the achievable transmission rate per multicast flow as a function of the number of multicast sources in such a network. We then propose a simple comb-based architecture for multicast routing, which achieves the upper bound in an order sense under certain constraints. Compared to the approach of constructing a Steiner tree to decide multicast paths, our construction achieves the same order-optimal results while requiring little location information and no computational overhead.

Original languageEnglish (US)
Article number5481977
Pages (from-to)1691-1700
Number of pages10
JournalIEEE/ACM Transactions on Networking
Issue number6
StatePublished - 2010


  • Ad hoc wireless networks
  • Steiner tree
  • asymptotic capacity
  • multicast flows

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'The multicast capacity of large multihop wireless networks'. Together they form a unique fingerprint.

Cite this