| Summary: | 碩士 === 國立虎尾科技大學 === 資訊工程研究所 === 102 === Relay networks such as IEEE WiMAX 802.16j and Long Term Evolution (LTE-Advanced) provide new infrastructure of wireless mobile communication networks. The end users can communicate with Base Station (BS) through a Relay Station (RS). As a result, deploying RS in the environment can get a lot of advantages. For example, the coverage of the BS can be increased. Besides, the transmission throughput for the users will be enhanced, too. Furthermore, the cost for deploying an RS is much cheaper than BS. In order to achieve the above advantages, the deployment of RS for the end users is important. Thus, where to deploy RS should be taken into consideration; meanwhile, it needs to make a trade-off among the throughput, the amount of RSs, and the overall coverage. Path selection is another problem for relay network system. End users can choose an appropriate path according to several factors like throughput or cost. For the above reasons, we propose different kinds of strategies to achieve the deployment and path selection problem. The problems in my thesis will be divided into two parts. One is that the simulate environment has several RS Candidate Positions (RPs). According to the proposed deployment strategies such as clustering-based and voting-based schemes, the ideal RPs could be determined; at the same time, the budget of deploying RSs and traffic demands of users will also be taken into consideration. The other is that the RSs have been deployed in the simulated environment. The users will select the RS based on several proposed strategies. However, how to choose an appropriate route to prevent from getting lower transmission throughput is critical. In deployment problem, the simulated results show that the proposed schemes can get better coverage ratio and reasonable transmission throughput under the request budget constraints. In path selection problem, the simulated results express our proposed scheme can improve the proposed strategies.
|
|---|
