1-Movable Dominating Set in Wireless Sensor Networks

In this paper we consider the 1-movable dominating set problem in wireless sensor networks (WSNs), motivated by applications of WSNs such as detection of environmental activity, surveillance, area monitoring and attaining small degree of fault tolerance in such applications. To find a minimum 1-movable dominating set is shown to be NP-complete. Hence, in this paper we design centralized and distributed approximation algorithms with constant approximation ratios to find 1-movable dominating sets in networks with homogeneous and heterogeneous transmission radii.