Critical Sensor Density for Partial Connectivity in Large Area Wireless Sensor Networks
In this article, we study the critical sensor density for partial connectivity of a large area sensor network. We assume that sensor deployment follows the Poisson distribution. For a given partial connectivity requirement., 0.5 <. < 1, we prove that there exists a critical sensor density.0, around which the probability that at least a fraction. of sensors are connected in the network increases sharply from e to 1 - e within a short interval of sensor density.. The length of this interval is in the order of O(- log e/ log A) as A.8, where A is the area of the sensor field, and the location of.0 is at the sensor density where the aforesaid probability is about 1/ 2. We prove the preceding theoretical results in the hexagonal model. We also extend our results to the disk model that models transmission range of sensors as disks. Simulations are performed to confirm the analytical results.
wireless sensor networks simulation algorithms theory critical density