On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad Hoc Networks

Shan Zhou, Lei Ying

Research output: Contribution to journalArticle

8 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 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 languageEnglish (US)
Article number7165678
Pages (from-to)5643-5655
Number of pages13
JournalIEEE Transactions on Information Theory
Volume61
Issue number10
DOIs
StatePublished - Oct 1 2015

Fingerprint

Mobile ad hoc networks
Scaling laws
Scheduling algorithms
scaling
scheduling
coding
Throughput
simulation
Law
time

Keywords

  • delay throughput trade-off
  • Mobile ad hoc networks
  • multicast
  • scaling law

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad Hoc Networks. / Zhou, Shan; Ying, Lei.

In: IEEE Transactions on Information Theory, Vol. 61, No. 10, 7165678, 01.10.2015, p. 5643-5655.

Research output: Contribution to journalArticle

@article{ba73898afbd048ea8897cce181955506,
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 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.",
keywords = "delay throughput trade-off, Mobile ad hoc networks, multicast, scaling law",
author = "Shan Zhou and Lei Ying",
year = "2015",
month = "10",
day = "1",
doi = "10.1109/TIT.2015.2460235",
language = "English (US)",
volume = "61",
pages = "5643--5655",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad Hoc Networks

AU - Zhou, Shan

AU - Ying, Lei

PY - 2015/10/1

Y1 - 2015/10/1

N2 - 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.

AB - 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.

KW - delay throughput trade-off

KW - Mobile ad hoc networks

KW - multicast

KW - scaling law

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

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

U2 - 10.1109/TIT.2015.2460235

DO - 10.1109/TIT.2015.2460235

M3 - Article

VL - 61

SP - 5643

EP - 5655

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

M1 - 7165678

ER -