The multicast capacity of large multihop wireless networks

Srinivas Shakkottai, Xin Liu, R. Srikant

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

Abstract

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)
Title of host publicationMobiHoc'07
Subtitle of host publicationProceedings of the Eighth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Pages247-255
Number of pages9
DOIs
StatePublished - 2007
EventMobiHoc'07: 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Montreal, QC, Canada
Duration: Sep 9 2007Sep 14 2007

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Other

OtherMobiHoc'07: 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing
Country/TerritoryCanada
CityMontreal, QC
Period9/9/079/14/07

Keywords

  • Ad hoc networks
  • Asymptotic capacity
  • Multicast flows
  • Steiner tree

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

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

Cite this