The Multicast Capacity of Large Multihop Wireless Networks Academic Article

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. 1993-2012 IEEE.

authors

• Shakkottai, Srinivas

published proceedings

• IEEE-ACM TRANSACTIONS ON NETWORKING

author list (cited authors)

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

citation count

• 48

publication date

• December 2010

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

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

Digital Object Identifier (DOI)

• 10.1109/TNET.2010.2050901

start page

• 1691

end page

• 1700

volume

• 18

issue

• 6

URL

• http://dx.doi.org/10.1109/tnet.2010.2050901