On delay constrained multicast capacity of large-scale mobile ad-hoc networks

Shan Zhou, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingConference contribution

57 Citations (Scopus)

Abstract

This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of n 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 (nsp))√D/n s.1 We then propose a joint coding/scheduling algorithm achieving a throughput of Θ (min {1,√D/ns}). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
DOIs
StatePublished - 2010
Externally publishedYes
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

Fingerprint

Mobile ad hoc networks
Scaling laws
Scheduling algorithms
Throughput

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

On delay constrained multicast capacity of large-scale mobile ad-hoc networks. / Zhou, Shan; Ying, Lei.

Proceedings - IEEE INFOCOM. 2010. 5462257.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhou, S & Ying, L 2010, On delay constrained multicast capacity of large-scale mobile ad-hoc networks. in Proceedings - IEEE INFOCOM., 5462257, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462257
@inproceedings{1a56b836e2604d55b873b399e1b81d70,
title = "On delay constrained multicast capacity of large-scale mobile ad-hoc networks",
abstract = "This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of n 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 (nsp))√D/n s.1 We then propose a joint coding/scheduling algorithm achieving a throughput of Θ (min {1,√D/ns}). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.",
author = "Shan Zhou and Lei Ying",
year = "2010",
doi = "10.1109/INFCOM.2010.5462257",
language = "English (US)",
isbn = "9781424458363",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - On delay constrained multicast capacity of large-scale mobile ad-hoc networks

AU - Zhou, Shan

AU - Ying, Lei

PY - 2010

Y1 - 2010

N2 - This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of n 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 (nsp))√D/n s.1 We then propose a joint coding/scheduling algorithm achieving a throughput of Θ (min {1,√D/ns}). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.

AB - This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of n 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 (nsp))√D/n s.1 We then propose a joint coding/scheduling algorithm achieving a throughput of Θ (min {1,√D/ns}). Our simulation results suggest that the same scaling law also holds under random walk and random waypoint models.

UR - http://www.scopus.com/inward/record.url?scp=77953300309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953300309&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2010.5462257

DO - 10.1109/INFCOM.2010.5462257

M3 - Conference contribution

SN - 9781424458363

BT - Proceedings - IEEE INFOCOM

ER -