The multicast capacity of large multihop wireless networks Conference Paper

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. Copyright 2007 ACM.

authors

• Shakkottai, Srinivas

author list (cited authors)

• Shakkottai, S., Liu, X., & Srikant, R.

complete list of authors

• Shakkottai, Srinivas||Liu, Xin||Srikant, R

editor list (cited editors)

• Kranakis, E., Belding, E. M., & Modiano, E.

publication date

• January 1, 2007 11:11 AM

publisher

• ACM Press  Publisher

keywords

• Ad Hoc Networks
• Asymptotic Capacity
• Multicast Flows
• Steiner Tree

Digital Object Identifier (DOI)

• 10.1145/1288107.1288141

International Standard Book Number (ISBN) 13

• 978-1-59593-684-4

start page

• 247

end page

• 255