Abstract
The focus of this paper is on presenting new results on throughput capacity of wireless ad hoc networks with multicast traffic. In seminal works, Gupta and Kumar introduced a new line of research. It is about the asymptotic throughput capacity of dense wireless ad hoc networks as a function of the number of nodes in the network. In this paper, we present an upper bound on the throughput capacity of an ad hoc network with multicast traffic using a hierarchical routing strategy. We start first by generating the upper bound and the strategy gain for the 2-level hierarchical strategy. Then, we generalize the result for multi-level hierarchical routing by giving the recurrence expression of the multicast gain. Finally, we apply the basic result to a broadcast traffic in the network
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
