A fully connected topology is critical to many fundamental network operations in wireless ad-hoc networks. In this paper, we consider the problem of deploying additional wireless nodes to improve the connectivity of an existing wireless network. Specifically, given a disconnected wireless network, we investigate how to deploy as few additional nodes as possible so that the augmented network can be connected. The problem is termed as the Connectivity Improvement (CI) problem. We first prove that CI is NP-complete, and then present a Delaunay Triangulation-based algorithm, Connectivity Improvement using Delaunay Triangulation (CIDT). Depending on the priority based on which the components in a disconnected network should be chosen to connect, we devise several different versions of CIDT. We also present two additional optimization techniques to further improve the performance of CIDT. Finally, we verify the effectiveness of CIDT, and compare the performance of its variations via J-Sim simulation
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.
