%0 Conference Proceedings
%T Identifying Nearest Neighbor Nodes and Connectivity in Three-Dimensional Wireless Sensor Networks Using Poisson Point Field
%+ School of Information Science and Technology
%+ School of Information and Electronic Engineering
%A Qu, Yanhuai
%A Fang, Jianan
%A Zhang, Shuai
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B IFIP International Conference on Network and Parallel Computing (NPC)
%C Zhengzhou, China
%Y Chen Ding; Zhiyuan Shao; Ran Zheng
%I Springer
%3 Network and Parallel Computing
%V LNCS-6289
%P 200-209
%8 2010-09-13
%D 2010
%R 10.1007/978-3-642-15672-4_18
%K Wireless sensor networks
%K nearest neighbor nodes
%K connectivity
%K transmitting range
%K Poisson point field
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01054990/document
%2 https://inria.hal.science/hal-01054990/file/1569299777.pdf
%L hal-01054990
%U https://inria.hal.science/hal-01054990
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6289
%~ IFIP-NPC
%~ IFIP-2010