Distributed node election for full coverage using connectivity information

This paper proposes a distributed node election algorithm to efficiently select a subset of nodes which provide full coverage. In addition the boundary of un-triangulated holes can be accurately detected. This algorithm only uses binary connectivity information without any additional information such as sensing range or distance between nodes. Assumptions of a Unit Disk Graph (UDG) or d-quasi UDG network configuration are not required. The number of elected nodes is close to the minimum number of nodes for full coverage as shown in simulations with arbitrary topologies and various densities. The algorithm is scalable to any network size. Its time complexity is only sensitive to the density of the network (or average number of neighbors for each node) and is insensitive to the total number of nodes in the network.