Multi-sensor fusion: fundamentals and applications with software
Multi-sensor fusion: fundamentals and applications with software
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Wireless integrated network sensors
Communications of the ACM
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed Sensor Networks (Chapman & Hall/Crc Computer and Information Science)
Distributed Sensor Networks (Chapman & Hall/Crc Computer and Information Science)
Scalable Infrastructure for Distributed Sensor Networks
Scalable Infrastructure for Distributed Sensor Networks
Hi-index | 0.00 |
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.