Critical communication radius for sink connectivity in wireless networks

Hongchao Zhou; Fei Liu; Xiaohong Guan

Critical communication radius for sink connectivity in wireless networks

Hongchao Zhou
, Fei Liu
, Xiaohong Guan

Tsinghua University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted C_n? is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node's radius chosen as r_n =√Ad/(πn), then the resulting network satisfies C_n→P 1 as n → ∞ if and only if d √∞ co, Simulation results show that if we tolerate a very small fraction of the nodes being isolated from the network, the communication cost can be considerably reduced. The cases in more practical connection models are also explored.

Original language	English
Title of host publication	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Publisher	University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages	224-227
Number of pages	4
ISBN (Electronic)	9781605600864
State	Published - 2007
Externally published	Yes
Event	45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States Duration: 26 Sep 2007 → 28 Sep 2007

Publication series

Name	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume	1

Conference

Conference	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Country/Territory	United States
City	Monticello
Period	26/09/07 → 28/09/07

Cite this

Zhou, H., Liu, F., & Guan, X. (2007). Critical communication radius for sink connectivity in wireless networks. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007 (pp. 224-227). (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 1). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Zhou, Hongchao ; Liu, Fei ; Guan, Xiaohong. / Critical communication radius for sink connectivity in wireless networks. 45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. pp. 224-227 (45th Annual Allerton Conference on Communication, Control, and Computing 2007).

@inproceedings{badaa1440f2344a38c5483a7ff22523f,

title = "Critical communication radius for sink connectivity in wireless networks",

abstract = "Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted Cn? is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node's radius chosen as rn =√Ad/(πn), then the resulting network satisfies Cn→P 1 as n → ∞ if and only if d √∞ co, Simulation results show that if we tolerate a very small fraction of the nodes being isolated from the network, the communication cost can be considerably reduced. The cases in more practical connection models are also explored.",

author = "Hongchao Zhou and Fei Liu and Xiaohong Guan",

year = "2007",

language = "英语",

series = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

pages = "224--227",

booktitle = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

note = "45th Annual Allerton Conference on Communication, Control, and Computing 2007 ; Conference date: 26-09-2007 Through 28-09-2007",

}

Zhou, H, Liu, F & Guan, X 2007, Critical communication radius for sink connectivity in wireless networks. in 45th Annual Allerton Conference on Communication, Control, and Computing 2007. 45th Annual Allerton Conference on Communication, Control, and Computing 2007, vol. 1, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 224-227, 45th Annual Allerton Conference on Communication, Control, and Computing 2007, Monticello, United States, 26/09/07.

Critical communication radius for sink connectivity in wireless networks. / Zhou, Hongchao; Liu, Fei; Guan, Xiaohong.
45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. p. 224-227 (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Critical communication radius for sink connectivity in wireless networks

AU - Zhou, Hongchao

AU - Liu, Fei

AU - Guan, Xiaohong

PY - 2007

Y1 - 2007

N2 - Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted Cn? is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node's radius chosen as rn =√Ad/(πn), then the resulting network satisfies Cn→P 1 as n → ∞ if and only if d √∞ co, Simulation results show that if we tolerate a very small fraction of the nodes being isolated from the network, the communication cost can be considerably reduced. The cases in more practical connection models are also explored.

AB - Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted Cn? is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node's radius chosen as rn =√Ad/(πn), then the resulting network satisfies Cn→P 1 as n → ∞ if and only if d √∞ co, Simulation results show that if we tolerate a very small fraction of the nodes being isolated from the network, the communication cost can be considerably reduced. The cases in more practical connection models are also explored.

UR - https://www.scopus.com/pages/publications/84940653821

M3 - 会议稿件

AN - SCOPUS:84940653821

T3 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

SP - 224

EP - 227

BT - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

Y2 - 26 September 2007 through 28 September 2007

ER -

Zhou H, Liu F, Guan X. Critical communication radius for sink connectivity in wireless networks. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2007. p. 224-227. (45th Annual Allerton Conference on Communication, Control, and Computing 2007).

Critical communication radius for sink connectivity in wireless networks

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this