Identifying Nearest Neighbor Nodes and Connectivity in Three-Dimensional Wireless Sensor Networks Using Poisson Point Field - Network and Parallel Computing Access content directly
Conference Papers Year : 2010

Identifying Nearest Neighbor Nodes and Connectivity in Three-Dimensional Wireless Sensor Networks Using Poisson Point Field

Abstract

Some problems about the connectivity of wireless sensor networks (WSNs) are always important and difficult topics in research, especially the trade-off between connectivity and energy control. In this paper, we present a novel and effective method to calculate nearest neighbor nodes in three-dimensional WSNs using Poisson point field theory, which enables each node to find the kth nearest neighbor node and adjust transmitting range according to local requirement. Moreover, we derive the probability expression of the k-connected network. Finally, we give corresponding simulation results and discussions about the practical value for node energy control and design of WSNs.
Fichier principal
Vignette du fichier
1569299777.pdf (949.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054990 , version 1 (11-08-2014)

Licence

Attribution

Identifiers

Cite

Yanhuai Qu, Jianan Fang, Shuai Zhang. Identifying Nearest Neighbor Nodes and Connectivity in Three-Dimensional Wireless Sensor Networks Using Poisson Point Field. IFIP International Conference on Network and Parallel Computing (NPC), Sep 2010, Zhengzhou, China. pp.200-209, ⟨10.1007/978-3-642-15672-4_18⟩. ⟨hal-01054990⟩
63 View
395 Download

Altmetric

Share

Gmail Facebook X LinkedIn More