Connectivity properties of a packet radio network model

Thomas K. Philips, Shivendra Panwar, Asser N. Tantawi

Research output: Contribution to journalArticle

Abstract

A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if πR2D > N0, for some critical value N0. It is shown that 2.195 < N0 < 10.526.

Original languageEnglish (US)
Pages (from-to)1044-1047
Number of pages4
JournalIEEE Transactions on Information Theory
Volume35
Issue number5
DOIs
StatePublished - Sep 1989

Fingerprint

Transmitters
radio
Networks (circuits)

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Connectivity properties of a packet radio network model. / Philips, Thomas K.; Panwar, Shivendra; Tantawi, Asser N.

In: IEEE Transactions on Information Theory, Vol. 35, No. 5, 09.1989, p. 1044-1047.

Research output: Contribution to journalArticle

Philips, Thomas K. ; Panwar, Shivendra ; Tantawi, Asser N. / Connectivity properties of a packet radio network model. In: IEEE Transactions on Information Theory. 1989 ; Vol. 35, No. 5. pp. 1044-1047.
@article{14eb23b34c0349e484b35708cfc11a28,
title = "Connectivity properties of a packet radio network model",
abstract = "A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if πR2D > N0, for some critical value N0. It is shown that 2.195 < N0 < 10.526.",
author = "Philips, {Thomas K.} and Shivendra Panwar and Tantawi, {Asser N.}",
year = "1989",
month = "9",
doi = "10.1109/18.42219",
language = "English (US)",
volume = "35",
pages = "1044--1047",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Connectivity properties of a packet radio network model

AU - Philips, Thomas K.

AU - Panwar, Shivendra

AU - Tantawi, Asser N.

PY - 1989/9

Y1 - 1989/9

N2 - A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if πR2D > N0, for some critical value N0. It is shown that 2.195 < N0 < 10.526.

AB - A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if πR2D > N0, for some critical value N0. It is shown that 2.195 < N0 < 10.526.

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

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

U2 - 10.1109/18.42219

DO - 10.1109/18.42219

M3 - Article

AN - SCOPUS:0024733284

VL - 35

SP - 1044

EP - 1047

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -