By Topic

Full connectivity and probabilistic coverage in random deployed 3D WSNs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zhe Xiao ; Sch. of Inf. Sci. & Eng., Yunnan Univ., Kunming, China ; Ming Huang ; Jihong Shi ; Jingjing Yang
more authors

Connectivity and coverage problem is an important and fundamental issue in sensor networks, which reflects how well a sensor network is communication-connected and monitored by sensors. While connectivity and coverage problem in two dimensional wireless sensor networks (WSNs) have been well studied, three dimensional WSNs have gained relatively less attention in present literatures. This paper discusses the connectivity and coverage problem in random deployed three dimensional WSNs. We propose an experimental analysis of the fundamental relationship between connectivity probability, the number of nodes and the nodes' transmitting ranges. Based on probability model, we calculate a feasible range of the number of nodes for an effective sensing coverage in a three dimensional sensing field. Thus, a practical guidance for random deployment in three dimensional WSNs from connectivity and coverage perspective is given.

Published in:

Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on

Date of Conference:

13-15 Nov. 2009