Algorithm for the placement of nodes for effective coverage

Abstract

An effective method for extending wireless sensor network lifetime is presented for redundancy nodes. Because most of the existing coverage protocols are based on the circular sensing model, this paper discusses how to combine consideration of coverage and connectivity maintenance in a single effective scheduling when the sensing model is not circular. The least redundancy coverage strategy (LRCS) strategy takes the smallest redundant coverage as the criterion whose goal is to maximize the lifetime of the sensor network. The sensor nodes are divided into five statuses: the judgment status, the waiting status, the activity status, the dormancy status and the exhausted status. Simulations show that LRCS outperforms the coverage configuration protocol and is suitable for various situations. It effectively reduces the number of active nodes and extends the lifetime of the sensor network.

Keywords

wireless sensor network, coverage, least redundancy