Serving node selection to minimize service time in wireless multi-hop cellular system

Abstract

The introduction of multihop relaying to cellular networks can enhance system performances. It supports not only the high data rate but also the service coverage extension while maintaining the deployment cost reduction. The primary advantage of the multihop relaying comes from the reduction of the overall pathloss between base station and mobile station. On the other hand, the redundancy resource is needed for relay because the relay cannot receive and transmit with the same resource concurrently. That is, there is a tradeoff between the path loss reduction and the increase of required resource for relay. This thesis proposes a new serving node selection method which can be used in multihop networks. The proposed algorithm enables a mobile station to communicate with the node (base station or relay station) which supports the highest data rate. It is based on least-cost criterion. This criterion is to minimize the Estimated Service Time. To evaluate the performance of the proposed algorithm, the numerical analysis is carried out. From the numerical results, we conclude that the proposed algorithm would enhance the system performances in view of throughput and fairness.