Sensor networks with decentralized binary detection: clustering and lifetime

In this paper, we analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality of service (QoS) constraint, given by the maximum tolerable probability of decision error at the access point (AP). In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal) for the single sensors' lifetime. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime.