Abstract :
In this article, we discuss the issue of retrieving partition connectivity for wireless sensor networks based on relay node deployment. First, we suggest a graph theory-based technique for correctly detecting network partitions consisting of vast low-energy sensor nodes. We present a heuristic Steiner tree-based partition recovery algorithm by deploying high-energy relay nodes to restore the communication connections between these partitions. To connect the disjoint partitions, the appropriate quadrilateral or triangles are selected and their Steiner nodes are discovered. On the edges of the Steiner tree, the minimum amount of relay nodes is put. Experimental results show that compared to the MST algorithm, our algorithm can achieve partition connectivity recovery for wireless sensor networks with fewer relay nodes and lower network communication energy consumption.
Keyword :
Graph theory, partition connectivity recovery, relay node deployment, Steiner tree, Wireless sensor networks.