Abstract:
Within large wireless sensor networks deployed randomly; the coverage holes may be formed due to the presence of obstacles in the deployment area, destruction and depletion of sensors, or simply due to the deployment process itself. So detecting these holes as well as the outer boundary of the whole network is of great importance not only for a possible patching, but also for the exploitation of the boundaries’ information in other processes such as routing, virtual coordinates systems and target tracking.
To resolve this issue, we proposed a boundary detection protocol based on connected independent sets (BDCIS). The execution of our protocol is divided in three main steps. In the first step, each node collects connectivity information of its one-hop neighbors and constructs its one-hop neighbors’ graph. In the second step, independent sets are constructed. In the last step, connecting sets and searching for closed path. Therefore, the node can make its own decision to be an inner or a boundary node.
Simulation results shown that our algorithm can detect fine-grained boundaries with high accuracy, low energy consumption and less communication overhead as compared with the aforementioned works.