Abstract
This paper studies the delay constrained multicast capacity of large-scale mobile ad hoc networks (MANETs). We consider a MANET that consists of ns 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 2-D independently and identically distributed mobility model, we first prove that the capacity per multicast session is O(min {1, (log p)(log (nsp)) (D/ns)1/2).1 We then propose a joint coding/scheduling algorithm achieving a throughput of Θ (min {1,(D/ns)1/2). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.
Original language | English (US) |
---|---|
Article number | 7165678 |
Pages (from-to) | 5643-5655 |
Number of pages | 13 |
Journal | IEEE Transactions on Information Theory |
Volume | 61 |
Issue number | 10 |
DOIs | |
State | Published - Oct 2015 |
Keywords
- Mobile ad hoc networks
- delay throughput trade-off
- multicast
- scaling law
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences