s multicast sessions. Each multicast session has one source and p destinations. Each source sends identical information to the p destinations in its multicast session, and the information is required to be delivered to all the p destinations within D time-slots. Assuming the wireless mobiles move according to a two-dimensional i.i.d. mobility model, we first prove that the capacity per multicast session is O(min{1, (log p)(log (n_sp)) ¿(D/n_s)}). We then propose a joint coding/scheduling algorithm achieving a throughput of ¿ (min {1, ¿(D/n_s)}). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.">

On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.