A distributed solution for detecting boundaries and holes in the Wireless Sensor Network (WSN) is proposed.
At first, each node collects connectivity information of its one-hop neighbors and constructs its one-hop neighbors’ graph.
Secondly, independent sets are constructed.
Finally, the independent sets are connected in order to find the closed path.
Our algorithm performs better than some former works.