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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Computer Networks 38(2), 393–422 (2002)
Chakrabarty, K., Iyengar, S.S.: Scalable Infrastructure for Distributed Sensor Networks. Springer, London (2005)
Pottie, G.J., Kaiser, W.J.: Wireless sensor networks. Communications of the ACM 43, 51–58 (2000)
Brooks, R.R., Iyengar, S.S.: Multi-Sensor Fusion: Fundamentals and Applications with Software. Prentice Hall, Englewood Cliffs (1998)
Iyengar, S.S., Brooks, R.R.: Distributed Sensor Networks. Chapman & Hall/CRC, Boca Raton (2005)
Hou, T.C., Li, V.O.K.: Transmission range control in multihop packet radio networks. IEEE Trans. on Communications COM 34, 38–44 (1986)
Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Trans. on Information Theory 35(5), 1044–1047 (1989)
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications. Birkhäuser, Boston (1998)
Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM Press, New York (2002)
Bettstetter, C.: On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment. In: Proc. IEEE Vehicular Technology Conference. IEEE Press, Los Alamitos (2002)
Stoyan, D., Kendall, W., Mecke, J.: Stochastic Geometry and Its Applications, 2nd edn. John Wiley & Sons, Chichester (1996)
Stoyan, D., Stoyan, H.: Fractals, Random Shapes and Point Fields. John Wiley & Sons, Chichester (1994)
Daley, D., Jones, D.V.: An Introduction to the Theory of Point Processes, 2nd edn. Elementary Theory and Methods, vol. I. Springer, New York (2003)
Daley, D., Jones, D.V.: An Introduction to the Theory of Point Processes, 2nd edn. General Theory and Structure, vol. II. Springer, New York (2008)
Bollobás, B.: Modern Graph Theory. Springer, New York (1998)
Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Penrose, M.D.: On k-connectivity for a geometric random graph. Random Structures and Algorithms 15(2), 145–164 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Qu, Y., Fang, J., Zhang, S. (2010). Identifying Nearest Neighbor Nodes and Connectivity in Three-Dimensional Wireless Sensor Networks Using Poisson Point Field. In: Ding, C., Shao, Z., Zheng, R. (eds) Network and Parallel Computing. NPC 2010. Lecture Notes in Computer Science, vol 6289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15672-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15672-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15671-7
Online ISBN: 978-3-642-15672-4
eBook Packages: Computer ScienceComputer Science (R0)