Lifetime Maximization for Multi-modal Confident Information Coverage in Sensor Networks

In this paper, based on our proposed confident information coverage model [1], we address the multi-modal confident information coverage (M2CIC) problem, with the goal of maximizing the network lifetime of a wireless sensor network. We model the M2CIC problem as a multi-modal set cover problem (M2SC), which is a NP-complete problem. For solving the M2SC problem, we design two energy-efficient greedy heuristics including a centralized one, CGHA, and a distributed one, DGHA. In CGHA and DGHA, different modal sensors are organized into a family of set covers, each of which can confident information cover all the required physical attributes. Simulation results show that both the CGHA and DGHA can prolong the network lifetime efficiently. Furthermore, they all outperform two peer algorithms in terms of the network lifetime and CGHA performs the best.