Improving the 3-star approximation algorithm for relay node placement in wireless sensor network

Abstract

A Wireless Sensor Network (WSN) is composed by a larger number of low-power sensor nodes to gather environmental information and forward those gathered information wirelessly to a base station. However, due to the limited communication range of sensor nodes, relay nodes need to be included in order to make the whole WSN connected. Relay nodes are typically more advanced and more expensive than sensor nodes. Therefore, developing strategies to deploy relay nodes effectively and minimize the number of relay nodes has always been a hot research topic, also known as the Steiner Tree Problem with Minimum number of Steiner Points (SMT-MSP), which is proved to be NP-hard by previous work. In this paper, we analyze and improve the 3-star approximation algorithm by reducing the time complexity from O(n3) to O(n log n) with identical performance ratio. Experiments are conducted to verify the correctness of the proposed algorithm.