Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks

In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asymptotic coverage, prove many mathematical lemmas, and study properties including asymptotic properties of network coverage intensity, detection probability, and detection delay in wireless sensor networks.