“…Having delved into the latest state-of-the-art node scheduling literature, it can be concluded that most scheduling algorithms focus on considering only two requirements and do not address all three requirements of the WSN altogether, i.e., connectivity, coverage, and network lifetime. Most works address each requirement in isolation, e.g., [ 4 , 11 , 12 , 18 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 ] do not consider network coverage; other works such as [ 6 , 29 ] consider network coverage but without ensuring a good level of network connectivity; and [ 6 ] uses a very simple WSN scenario that lacks tests on realistic and complex WSNs. To the authors’ best knowledge, there are two published works that consider addressing the three objectives collectively: the RCS algorithm [ 13 ] and clique-based node scheduling [ 13 , 30 ] have shown that partitions can occur further away from the base station as the deaths of subsequent nodes can result in live nodes attempting to compensate for the drop-in coverage and connectivity in the system (cf.…”