Capacity scaling of infrastructure-supported erasure networks

Won-Yong Shin, Ajung Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The benefits of infrastructure support are shown by analyzing a capacity scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling an erasure probability under the network, we first derive a cut-set upper bound on the total throughput. Our result indicates that the upper bound depends on the number of RSs but not on the erasure probability. We then show our achievability based on two existing multi-hop transmissions with and without help of RSs. It is shown under the RS-supported erasure network that the achievable scheme is order-optimal for all the network conditions.

Original languageEnglish
Article number5740502
Pages (from-to)485-487
Number of pages3
JournalIEEE Communications Letters
Volume15
Issue number5
DOIs
Publication statusPublished - 2011 May 1

Fingerprint

Relay
Infrastructure
Scaling
Scaling laws
Throughput
Upper bound
Cutset
Multi-hop
Scaling Laws
Modeling

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{4d9f8fadd1ba45f1bc6ba903f82e892f,
title = "Capacity scaling of infrastructure-supported erasure networks",
abstract = "The benefits of infrastructure support are shown by analyzing a capacity scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling an erasure probability under the network, we first derive a cut-set upper bound on the total throughput. Our result indicates that the upper bound depends on the number of RSs but not on the erasure probability. We then show our achievability based on two existing multi-hop transmissions with and without help of RSs. It is shown under the RS-supported erasure network that the achievable scheme is order-optimal for all the network conditions.",
author = "Won-Yong Shin and Ajung Kim",
year = "2011",
month = "5",
day = "1",
doi = "10.1109/LCOMM.2011.032111.102421",
language = "English",
volume = "15",
pages = "485--487",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Capacity scaling of infrastructure-supported erasure networks. / Shin, Won-Yong; Kim, Ajung.

In: IEEE Communications Letters, Vol. 15, No. 5, 5740502, 01.05.2011, p. 485-487.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Capacity scaling of infrastructure-supported erasure networks

AU - Shin, Won-Yong

AU - Kim, Ajung

PY - 2011/5/1

Y1 - 2011/5/1

N2 - The benefits of infrastructure support are shown by analyzing a capacity scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling an erasure probability under the network, we first derive a cut-set upper bound on the total throughput. Our result indicates that the upper bound depends on the number of RSs but not on the erasure probability. We then show our achievability based on two existing multi-hop transmissions with and without help of RSs. It is shown under the RS-supported erasure network that the achievable scheme is order-optimal for all the network conditions.

AB - The benefits of infrastructure support are shown by analyzing a capacity scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling an erasure probability under the network, we first derive a cut-set upper bound on the total throughput. Our result indicates that the upper bound depends on the number of RSs but not on the erasure probability. We then show our achievability based on two existing multi-hop transmissions with and without help of RSs. It is shown under the RS-supported erasure network that the achievable scheme is order-optimal for all the network conditions.

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

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

U2 - 10.1109/LCOMM.2011.032111.102421

DO - 10.1109/LCOMM.2011.032111.102421

M3 - Article

AN - SCOPUS:79956210315

VL - 15

SP - 485

EP - 487

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 5

M1 - 5740502

ER -