Capacity of large hybrid erasure networks with random node distribution

Won-Yong Shin, Cheol Jeong

Research output: Contribution to journalArticle

Abstract

The Gupta–Kumar’s nearest-neighbor multihop routing with/without infrastructure support achieves the optimal capacity scaling in a large erasure network in which n wireless nodes and m relay stations are regularly placed. In this paper, a capacity scaling law is completely characterized for an infrastructure-supported erasure network where n wireless nodes are randomly distributed, which is a more feasible scenario. We use two fundamental path-loss attenuation models (i.e., exponential and polynomial power-laws) to suitably model an erasure probability. To show our achievability result, the multihop routing via percolation highway is used and the corresponding lower bounds on the total capacity scaling are derived. Cut-set upper bounds on the capacity scaling are also derived. Our result indicates that, under the random erasure network model with infrastructure support, the achievable scheme based on the percolation highway routing is order-optimal within a polylogarithmic factor of n for all values of m.

Original languageEnglish
Pages (from-to)2275-2285
Number of pages11
JournalWireless Networks
Volume22
Issue number7
DOIs
Publication statusPublished - 2016 Oct 1

Fingerprint

Scaling laws
Polynomials

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{560d886682a64e5e8762e9aa672c58b2,
title = "Capacity of large hybrid erasure networks with random node distribution",
abstract = "The Gupta–Kumar’s nearest-neighbor multihop routing with/without infrastructure support achieves the optimal capacity scaling in a large erasure network in which n wireless nodes and m relay stations are regularly placed. In this paper, a capacity scaling law is completely characterized for an infrastructure-supported erasure network where n wireless nodes are randomly distributed, which is a more feasible scenario. We use two fundamental path-loss attenuation models (i.e., exponential and polynomial power-laws) to suitably model an erasure probability. To show our achievability result, the multihop routing via percolation highway is used and the corresponding lower bounds on the total capacity scaling are derived. Cut-set upper bounds on the capacity scaling are also derived. Our result indicates that, under the random erasure network model with infrastructure support, the achievable scheme based on the percolation highway routing is order-optimal within a polylogarithmic factor of n for all values of m.",
author = "Won-Yong Shin and Cheol Jeong",
year = "2016",
month = "10",
day = "1",
doi = "10.1007/s11276-015-1100-3",
language = "English",
volume = "22",
pages = "2275--2285",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "7",

}

Capacity of large hybrid erasure networks with random node distribution. / Shin, Won-Yong; Jeong, Cheol.

In: Wireless Networks, Vol. 22, No. 7, 01.10.2016, p. 2275-2285.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Capacity of large hybrid erasure networks with random node distribution

AU - Shin, Won-Yong

AU - Jeong, Cheol

PY - 2016/10/1

Y1 - 2016/10/1

N2 - The Gupta–Kumar’s nearest-neighbor multihop routing with/without infrastructure support achieves the optimal capacity scaling in a large erasure network in which n wireless nodes and m relay stations are regularly placed. In this paper, a capacity scaling law is completely characterized for an infrastructure-supported erasure network where n wireless nodes are randomly distributed, which is a more feasible scenario. We use two fundamental path-loss attenuation models (i.e., exponential and polynomial power-laws) to suitably model an erasure probability. To show our achievability result, the multihop routing via percolation highway is used and the corresponding lower bounds on the total capacity scaling are derived. Cut-set upper bounds on the capacity scaling are also derived. Our result indicates that, under the random erasure network model with infrastructure support, the achievable scheme based on the percolation highway routing is order-optimal within a polylogarithmic factor of n for all values of m.

AB - The Gupta–Kumar’s nearest-neighbor multihop routing with/without infrastructure support achieves the optimal capacity scaling in a large erasure network in which n wireless nodes and m relay stations are regularly placed. In this paper, a capacity scaling law is completely characterized for an infrastructure-supported erasure network where n wireless nodes are randomly distributed, which is a more feasible scenario. We use two fundamental path-loss attenuation models (i.e., exponential and polynomial power-laws) to suitably model an erasure probability. To show our achievability result, the multihop routing via percolation highway is used and the corresponding lower bounds on the total capacity scaling are derived. Cut-set upper bounds on the capacity scaling are also derived. Our result indicates that, under the random erasure network model with infrastructure support, the achievable scheme based on the percolation highway routing is order-optimal within a polylogarithmic factor of n for all values of m.

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

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

U2 - 10.1007/s11276-015-1100-3

DO - 10.1007/s11276-015-1100-3

M3 - Article

AN - SCOPUS:84944916667

VL - 22

SP - 2275

EP - 2285

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 7

ER -