Network connectivity maintenance of WSNs in node failure-prone environment: A detailed survey

Abstract

Network connectivity maintenance in failure prone environment has received more attention in the recent years. Unfortunately due to hostile environment there is need of some other active nodes i.e. backbone nodes which can compensate the failure of the nodes. One of the main design challenges for wireless sensor network (WSNs) is to obtain connecting dominating set (CDS) in polynomial time with low message complexity. However CDS problem is shown to be NP-hard. In a simple graph, a dominating set is a set of vertices such that every other vertex is adjacent to at least one vertex of this set. A dominating set with least number of vertices is called minimum dominating set and a dominating set which form connected graph is called minimum connected dominating set (MCDS). In this paper, we propose the state-of-the-art survey of CDS construction algorithms i.e. distributed and centralized algorithms based on time complexity, message complexity, approximation factor, neighborhood knowledge and quality parameters. The basic challenges, open research issues and research gaps are briefly explored in this paper. Finally, we conclude our work insight for future research direction regarding development of a CDS algorithm with in linear time and low message complexity.