Comparison of symmetric and asymmetric routing for fixed two-hop cellular relaying network

Kwon, Eunhyun; Lee, Jaiyong; Do, Mi-Sun; Jung, Kyunghun

doi:10.1109/lcomm.2007.061887

Cited by 11 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Except for the scheme without relaying, we also consider two relaying schemes using benchmark algorithms for the purpose of comparison: † Link-optimal routing (Scheme 2): The routing algorithm is consistent with the link-optimal policy, which has been extensively utilised in previous works [18] and [19]. Each UE u will be associated with the SN with the minimum end-to-end link metrics, that is…”

Section: Simulation Resultsmentioning

confidence: 99%

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

Wang

et al. 2012

IET Commun.

View full text Add to dashboard Cite

Unlike conventional cellular networks where the evolved Node B (eNB) performs centralised scheduling, future relayenhanced cellular (REC) networks allow relay nodes (RNs) to schedule users independently. This decentralised nature of the REC networks brings about challenges to maintain fairness. In this study, we formulate the generalised proportional fair (GPF) resource allocation problem, where resource partition and routing are included as part of the overall radio resource management aiming to provide fairness across all users served by the eNB and its subordinate RNs. Although the traditional proportional fair scheduling algorithm is executed independently at the eNB and each RN to maintain local fairness, we propose efficient resource partition and routing algorithms to maintain global fairness by optimising the GPF objective for the whole relay-enhanced cell. Through system level simulations, the proposed algorithms are evaluated and compared with both non-relaying and relaying systems with benchmark resource partition and routing algorithms. The simulation results show that the proposed algorithms outperform the existing algorithms in providing a better trade-off between system throughput and fairness performance.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

Wang

et al. 2012

IET Commun.

View full text Add to dashboard Cite

show abstract

“…We compute full interference from two circles of surrounding cells, assuming that the activities in each of these surrounding cells are identical to those in the cell of interest. The routing algorithm is consistent with the linkoptimal policy, which has been extensively utilized in previous work [10].…”

Section: Simulation Resultsmentioning

confidence: 99%

Proportional Fair Resource Partition for LTE-Advanced Networks with Type I Relay Nodes

Wang

Long

et al. 2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In 3GPP LTE-Advanced networks deployed with type I relay nodes (RNs), resource partition is required to support in-band relaying. This paper focuses on how to partition system resources in order to attain improved fairness and efficiency. We first formulate the generalized proportional fair (GPF) resource allocation problem to provide fairness for all users served by the evolved node B (eNB) and its subordinate RNs. Assuming traditional proportional fair scheduling is executed independently at the eNB and each RN to achieve local fairness, we propose the proportional fair resource partition algorithm to tackle the GPF problem and ensure global fairness. Through system level simulations, the proposed algorithm is evaluated and compared with both non-relaying and relaying systems with the fixed resource partition approach. Simulation results demonstrate that the proposed algorithm can achieve a good trade-off between system throughput and fairness performance.

show abstract

“…This is because multihop relaying has been shown to increase capacity and transmission rates on the forward link in addition to the reverse link [8] [35]. Although it is possible for transmissions on the forward and the reverse link to share the same frequency band, our model assumes the use of two independent frequencies for transmissions in each direction as in [80] and interference is highest at the base station as it is the bottleneck of the network [9].…”

Section: Network Modelmentioning

confidence: 99%

Autonomous infrastructure based multihop cellular networks

DeFaria

Sousa

2009

2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

However, multihop cellular networks still suffer from large amounts of interference surrounding the base station because all traffic either emanates or is destined to the base station making it the capacity bottleneck. To resolve this problem, we propose a novel architecture called the autonomous infrastructure multihop cellular network where users can connect their mobile terminals to the backbone network giving them the functionality of an access point. Access points receive traffic from other terminals and send it directly onto the backbone, as would a base station. This reduces the traffic handled by the base station and increases network capacity. Our analysis and simulations show that in autonomous infrastructure multihop cellular networks, the SINR at the base station ii is higher, the power consumption is lower and the coverage is better than in normal multihop cellular networks.Access points require parameters like their transmission range to be adjusted autonomously to optimal levels. In this thesis, we propose an autonomous pilot power protocol. Our results show that by adjusting a parameter within the protocol, a required coverage level of terminals can be specified and achieved without knowledge of the location or density of mobile terminals. Furthermore, we show that the protocol determines the transmission range that is optimal in terms of SINR and power consumption that achieves the required coverage while effectively eliminating the bottleneck that existed at the base station.iii

show abstract

Comparison of symmetric and asymmetric routing for fixed two-hop cellular relaying network

Cited by 11 publications

References 6 publications

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

Proportional Fair Resource Partition for LTE-Advanced Networks with Type I Relay Nodes

Autonomous infrastructure based multihop cellular networks

Contact Info

Product

Resources

About