Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints

In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius rs. Moreover, considering the inherent irregularity of a sensor's sensing range caused by time-varying environments, we model the sensing radius rs as a random variable with mean r0 and variance r2 02 s . Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius rc. The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network's lifetime from a novel probabilistic perspective, called -lifetime (0 < < 1). It is defined as the expectation of the time interval durin...

• Type: Conference
• Year: 2006
• Where: DCOSS
• Authors: Wei Mo, Daji Qiao, Zhengdao Wang
• Keywords: DCOSS 2006, Distributed And Parallel Computing, Sensor, Sensor Network Lifetime, Wireless Sensor Network