Relay Node Placement in Wireless Sensor Networks: From Theory to Practice

Abstract

The increasingly wide utilization of Wireless Sensor Networks (WSNs) in industrial applications outstands the significance of the Delay Constrained Relay Node Placement (DCRNP) problem. Existing algorithms to the DCRNP problem are designed based on the ideal geometric disk wireless channel model, and no real-world deployments are performed to verify the effectiveness of these algorithms. However, the unreliable and unpredictable wireless links in WSNs may lead these algorithms to fail in practice. Therefore, we first conduct extensive real-world deployments under the guidance of existing algorithms to evaluate their performance and to gain some insights for designing practical deployment algorithms. The results exhibit that the WSNs built by existing algorithms have a favorable performance in end-to-end delay but a poor performance in reliability, which is mainly due to the lack of methods ensuring high-quality links. To this end, we first devise a Set-Covering-based Algorithm (SCA) which figures out the DCRNP problem while ensuring the quality of each link better than a given threshold. As our experiments also show that the fault-tolerant topology can significantly improve network reliability, we then design a $k$ k -Set-Covering-based Algorithm ( $k$ k SCA) to build fault-tolerant WSNs based on the methodology of SCA. Furthermore, the elaborate analysis proves that both SCA and $k$ k SCA are polynomial-time algorithms, and their approximation ratios are both O( $\ln n$ ln n ), where $n$ n is the number of sensor nodes. Finally, extensive experiments are performed under the guidance of SCA and $k$ k SCA to demonstrate the effectiveness of these two algorithms.