Long Term Evolution (LTE)-Advanced is proposed as a candidate of the 4th generation (4G) mobile telecommunication systems. As an evolved version of LTE, LTE- Advanced is also based on Orthogonal Frequency Division Multiplexing (OFDM) and in addition, it adopts some emerging technologies, such as relaying. Type I relay nodes, de_ned in LTE-Advanced standards, can control their cells with their own reference signals and have Radio Resource Management (RRM) functionalities. The rationale of RRM is to decide which resources are allocated to which users for optimising performance metrics, such as throughput, fairness, power consumption and Quality of Service (QoS). The RRM techniques in LTE-Advanced networks, including route selection, resource partitioning and resource scheduling, are facing new challenges brought by Type 1 relay nodes and increasingly becoming research focuses in recent years. The research work presented in this thesis has made the following contributions. A service-aware adaptive bidirectional optimisation route selection strategy is proposed to consider both uplink optimisation and downlink optimisation according to service type. The load between di_erent serving nodes, including eNBs and relay nodes, are rebalanced under the _xed resource partitioning. The simulation results show that larger uplink throughputs and bidirectional throughputs can be achieved, compared with existing route selection strategies. A distributed two-hop proportional fair resource allocation scheme is proposed in order to provide better two-hop end-to-end proportional fairness for all the User Equipments (UEs), especially for the relay UEs. The resource partitioning is based on the cases of none Frequency Reuse (FR) pattern, full FR pattern and partial FR patterns. The resource scheduling in access links and backhaul links are considered jointly. A proportional fair joint route selection and resource partitioning algorithm isproposed to obtain an improved solution to the two-hop Adaptive Partial Frequency Reusing (APFR) problem with one relay node per cell. In addition, two special situations of APFR, full FR and no FR, are utilised to narrow the iterative search range of the proposed algorithm and reduce its complexity.