An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Path Selection Method in IEEE 802.16j Mobile Multi-hop Relay Networks
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Handover in multihop cellular networks
IEEE Communications Magazine
Analysis of optimal relay selection in IEEE 802.16 multihop relay networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Relay technologies for WiMAX and LTE-advanced mobile systems
IEEE Communications Magazine
Joint base station and relay station placement for IEEE 802.16j networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A novel relay placement mechanism for capacity enhancement in IEEE 802.16j WiMAX networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
Suitable deployment for the base stations and the relay stations is one of the most important features for the portable devices to obtain a high data transmission rate in multi-hop relay networks. In this paper, a novel clustering algorithm is proposed to select the appropriate deployment locations for the base stations and relay stations from the candidate positions by accounting for the traffic demands and using the uniform cluster concepts. Based on the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the base stations and relay stations. A reasonable network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Our simulation results indicate the superior performance of our proposed deployment scheme in achieving the appropriate performance for the network throughput and coverage ratio. Additionally, a suitable deployment budget can be utilized in multi-hop relay network systems.