A relay station deployment scheme with a rotational clustering algorithm for multi-hop relay networks

Abstract

Multi-hop relay networks have been widely considered as supplementary technology in mobile wireless communication systems. The coverage area is extended and the deployment cost is reduced by deploying the relay stations. Suitable deployment for the relay stations is one of the most important features of the demand nodes to obtain a high data transmission rate in such systems. In order to make a trade-off among the network throughput, the deployment budget, and the overall coverage of the systems, a rotational clustering algorithm is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. We take into account the traffic demands and adopt the dynamic cluster concepts to reduce the data transmission distances of demand nodes. Several clusters are created according to the positions of demand nodes. The clusters are dynamically adaptive in order to select the suitable deployment positions of the relay stations. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of relay stations. A favorable network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Additionally, a suitable deployment budget can be carried out. In accordance with the simulation and analysis, it is shown that the superior performance of our proposed deployment scheme strike the appropriate performance in the network throughput, coverage ratio and deployment cost for the multi-hop relay network systems.