Connectivity Properties of a Packet Radio Network Model

Thomas K. Philips; Shivendra S. Panwar; Asser N. Tantawi

doi:10.1109/18.42219

Connectivity Properties of a Packet Radio Network Model

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

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

A model of a packet radio network in which transmitters with range R are distributed according to a twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, 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. We show that 2.195 < N0 < 10.526.

Original language	English (US)
Pages (from-to)	1044-1047
Number of pages	4
Journal	IEEE Transactions on Information Theory
Volume	35
Issue number	5
DOIs	https://doi.org/10.1109/18.42219
State	Published - Sep 1989

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.42219

Cite this

@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 twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, 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. We show that 2.195 < N0 < 10.526.",

author = "Philips, {Thomas K.} and Panwar, {Shivendra S.} and Tantawi, {Asser N.}",

note = "Funding Information: Manuscript received November 6, 1987; revised November 1988. This work was supported in part by the Center for Advanced Technology in Telecommunications, Polytechnic University, Brooklyn, NY. This work was presented at IEEE Milcom {\textquoteright}88, San Diego, CA, October 1988.",

year = "1989",

month = sep,

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

AU - Tantawi, Asser N.

N1 - Funding Information: Manuscript received November 6, 1987; revised November 1988. This work was supported in part by the Center for Advanced Technology in Telecommunications, Polytechnic University, Brooklyn, NY. This work was presented at IEEE Milcom ’88, San Diego, CA, October 1988.

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 twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, 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. We show 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 twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, 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. We show 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

SN - 0018-9448

VL - 35

SP - 1044

EP - 1047

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Connectivity Properties of a Packet Radio Network Model

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this