QRMSC: Efficient QoS-aware relay node placement in wireless sensor networks using Minimum Steiner tree on the Convex hull

Abstract

Due to the risky and power limited environment, sensor nodes deployed in wireless sensor networks are susceptible to a large-scale damage which usually causes simultaneous failures of a group of collocated sensors and thus gets the network fragmented into distinct partitions. In order to make the application operative under the situation, repairing the overall network connectivity is crucial. Moreover, the restoration may be subject to heterogeneous quality of service (QoS) requirements between the partitions. In this paper, we study an effective strategy for establishing a QoS satisfied connected topology among the partitions by deploying the least count of relay nodes. Finding the optimal number and position of RNs is NP-hard without considering QoS. Therefore we propose heuristics which is QoS-aware Relay node placement using Minimum Steiner tree on Convex hull (QRMSC). We validate the effectiveness of QRMSC through extensive simulation experiments.