Identifying nearest neighbor nodes and connectivity in three-dimensional wireless sensor networks using poisson point field

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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 k th 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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Qu, Y., Fang, J., & Zhang, S. (2010). Identifying nearest neighbor nodes and connectivity in three-dimensional wireless sensor networks using poisson point field. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6289 LNCS, pp. 200–209). https://doi.org/10.1007/978-3-642-15672-4_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free