Abstract
We study the benefits of multicast routing in the performance of wireless ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O ( n ) , when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. Hence, we show that the aggregate multicast capacity of wireless ad hoc networks is O ( n ) larger than the unicast capacity, when the group size n is small compared to the total number of nodes in the network. We discuss how these information theoretic results can be taken into consideration in the operation of a multicast protocol for wireless mesh networks using Multicast Overlay Spanning Trees (MOST). We perform simulations of the MOST protocol to compare with the theoretical results, and we present a fully working implementation for real network environments.
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.
