Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yajian Liu

dblp:27/4944 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Cellular and mobile networks · 70% Datacenter networks · 23% Routing and switching · 7%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Datacenter networks
load balancing
0.112006
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations · IEEE J. Sel. Areas Commun. 2006
Cellular and mobile networks › mobile networks › mobile network architecture › cellular network architecture
multihop cellular network
0.112006
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations · IEEE J. Sel. Areas Commun. 2006
Cellular and mobile networks › radio resource management
radio resource allocation
0.112006
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations · IEEE J. Sel. Areas Commun. 2006
Cellular and mobile networks
relay node
0.112006
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations · IEEE J. Sel. Areas Commun. 2006

Methods — techniques the papers use, named apart from their topics

simulation · 0.1integer programming · 0.1heuristic algorithm · 0.1
YearPublicationVenuePosition
2025 Considering integrated information on environmental features and neighborhood deformation: A missing value filling framework for arch dam deformation sequence
Yajian Liu, Xiangqian Fan, Chongshi Gu, Jinjun Guo, Bo Li 0152, Shaowei Hu
Adv. Eng. Informatics3
2008 An Efficient Resource Allocation Strategy for Future Wireless Cellular Systems
abstract
Future mobile communication systems will be designed to support a wide range of data rates with complex quality of service matrix. It is becoming more challenging to optimize the radio resource management and maximise the system capacity whilst meeting the required quality of service from user's point of view. Traditional schemes have approached this problem mainly focusing on resources within a cell and to large extent ignoring effects of multi-cell architecture. This paper addresses the influence of multi-cell interference on overall radio resource utilisation and proposes a novel approach, setting a new direction for future research on resource scheduling strategies in a multi-cell system. It proposes a concept called load matrix (LM) which facilitates joint management of interference within and between cells for allocation of radio resources. Simulation results show significant improvement in the resource utilization and overall network performance. Using the LM strategy, average cell throughput can be increased as much as 30% compared to a benchmark algorithm. Results also show that maintaining cell interference within a margin instead of a hard target can significantly improve resource utilization.
Mohammad Abaii, Yajian Liu, Rahim Tafazolli
IEEE Trans. Wirel. Commun.2
2006 Routing Mechanisms for Multi-Hop Cellular Communications in the WINNER Air Interface
abstract
In this paper we present network-centric and user- centric routing mechanisms designed for the wireless world initiative new radio (WINNER) multi-hop cellular air interface. We study the pros-and-cons of each mechanism and describe the interactions between routing and main radio resource management (RRM) functionalities.
Keivan Navaie, Yajian Liu, Mohammad Abaii, Adrian Florea, Halim Yanikomeroglu, Rahim Tafazolli
VTC Fall2
2006 Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations
abstract
Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheless, due to the inherent drawbacks of multihop relaying, e.g., the requirement for extra radio resources for relaying hops, and the sensitivity to the quality of relaying routes, multihop cellular networks (MCNs) require a well-designed radio resource allocation strategy in order to secure performance gains. In this paper, the optimal radio resource allocation problem in MCNs, with the objective of throughput maximization, is formulated mathematically and proven to be NP-hard. Considering the prohibitive complexity of finding the optimal solution for such an NP-hard problem, we propose an efficient heuristic algorithm, named integrated radio resource allocation (IRRA), to find suboptimal solutions. The IRRA is featured as a low-complexity algorithm that involves not only base station (BS) resource scheduling, but also routing and relay station (RS) load balancing. Specifically, a load-based scheme is developed for routing. A mode-aware BS resource-scheduling scheme is proposed for handling links in different transmission modes, i.e., direct or multihop. Moreover, a priority-based RS load balancing approach is presented for the prevention of the overloading of RSs. Within the framework of the IRRA, the above three functions operate periodically with coordinated interactions. To prove the effectiveness of the proposed IRRA algorithm, a case study was carried out based on enhanced uplink UMTS terrestrial radio access/frequency-division duplex with fixed RSs. The IRRA is evaluated through system level simulations, and compared with two other cases: 1) nonrelaying and 2) relaying with a benchmark approach. The results show that the proposed algorithm can ensure significant gains in terms of cell throughput
Yajian Liu, Reza Hoshyar, Rahim Tafazolli
IEEE J. Sel. Areas Commun.1
2005 On the radio resource allocation in enhanced uplink UTRA-FDD with fixed relay stations
abstract
In this paper, an integrated radio resource allocation (IRRA) algorithm is proposed for enhanced uplink UTRA-FDD with fixed relay stations (RSs). It comprises three entities: load based route manager (LBRM), base station resource scheduler (BSRS), and relay station load balancer (RSLB). LBRM is responsible for the selection of user transmission routes, BSRS is for the scheduling of user transmission time and rates based on the available base station (BS) capacity, and RSLB is for the fine-tuning of user resource assignments (e.g. assigned rates) so as to prevent the overloading of RSs. The three entities operate periodically, synchronously, and with coordinated interactions. By system level simulations, the proposed algorithm is evaluated and compared with two other cases: 1) non-relaying, 2) relaying with a benchmark approach. The results show that IRRA can ensure significant gains in terms of cell throughput.
Yajian Liu, Reza Hoshyar, Rahim Tafazolli
PIMRC1