Xinyi Lin

Xinyi Lin

Auto-generated profile, based on publicly available information

Xinyi Lin

School of Engineering, University of Glasgow, Glasgow, U.K.

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 November 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XLXinyi Lin
Xinyi Lin
YFYixuan Fan
Yixuan Fan
LZLei Zhang
Lei Zhang
KMKairong Ma
Kairong Ma
YSYao Sun
Yao Sun
Muhammad ImranMuhammad Imran
Muhammad Imran
The emergence of reconfigurable intelligent surfaces (RIS) represents a notable technological advancement that has gained considerable interest within the wireless communication domain. However, due to cost and privacy concerns, different operators may not make an agreement on cooperatively utilizing RISs and sharing resources. In the presence of non-cooperative base stations (BSs) from different operators, conventional resource allocation and RIS design are rendered inapplicable. Motivated by this fact, we explore the resource allocation scheme for RIS-assisted millimeter wave (mmWave) systems with cooperative and non-cooperative BSs. We first delineate between the cooperation and non-cooperation modes of BSs, based on their agreement concerning the joint utilization of RISs. We then formulate the joint optimization problem of the reflection coefficients of RISs, active beamforming, power allocation, and user association at BSs. The objective is to maximize the sum rates for users served by cooperative BSs while ensuring the channel gain constraints between non-cooperative BSs and their associated users so as to mitigate the effects of RISs on the communication of non-cooperative BSs. To address the mixed binary optimization problem, we leverage the block coordinate descent (BCD) technique to decompose the original problem into several sub-problems, each iteratively optimized until convergence is achieved. Simulation results validate the effectiveness of RISs in improving sum rate performance, while also providing additional benefits by mitigating their impact on non-cooperative BSs and their associated users.

15 January 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XLXinyi Lin
Xinyi Lin
LZLei Zhang
Lei Zhang
ATAnvar Tukmanov
Anvar Tukmanov
YLYihong Liu
Yihong Liu
Qammer AbbasiQammer Abbasi
Qammer Abbasi
Muhammad ImranMuhammad Imran
Muhammad Imran
Reconfigurable intelligent surface (RIS) has been identified as a promising disruptive innovation to realize a faster, safer and more efficient communication system. In this paper, we study the broad beamwidth design of RIS. A problem is formulated to achieve broadbeam with maximum and equal power gain within a pre-defined angular region given constraints of the unit modulus weights of RIS. Since the formulated problem is non-convex, where the optimal solution cannot be analytically obtained, we propose the difference-of-convex-based semi-definite programming (DC-SDP) algorithm. In addition, as important guidance of signal coverage for arbitrary angular regions, we mathematically derive the relationship between the angular range of the spatial sector and the maximum average received power. The upper bounds of the average received power with different RIS configurations are also obtained, where uniform rectangular array (URA) and uniform linear array (ULA) are considered. Simulation results demonstrate the effectiveness of our derivations and verify that our proposed DC-SDP algorithm is applicable in practical applications and outperforms other baseline methods. Overall, this work can be viewed as a foundation for the practical implementation of RIS on coverage enhancement and can also be seen as an initial step towards achieving channel estimation.

28 August 2024 in IEEE Systems Journal
Verified
Journal Article
Closed access
ZZZiyi Zhou
Ziyi Zhou
OOOluwakayode Onireti
Oluwakayode Onireti
XLXinyi Lin
Xinyi Lin
LZLei Zhang
Lei Zhang
Muhammad ImranMuhammad Imran
Muhammad Imran
The ever-increasing mobile users pose a great challenge to the current centralized structure, where the failure of the network center significantly compromises privacy and data security. Practical byzantine fault tolerant (PBFT), a voting-based consensus blockchain, is a plausible solution to the wireless network for its distributed and decentralized traits, and it is not computation-intensive. The view change mechanism guarantees the liveness and resilience of PBFT, but it also causes delay. Moreover, spectrum is usually shared in the wireless network, introducing additional channel contention. Hence, we develop a framework investigating the impacts of channel contention on the wireless PBFT network using the IEEE 802.11 protocol. Based on the Markov model, we derive the throughput, transmission success probability, and transaction confirmation delay of such a network. Furthermore, we derive the view change delay in reference to the transaction confirmation delay. The analysis and results show that channel contention impacts in two ways. It impairs the success probability and increases the chance of view change. Optimal pairs of packet arrival rate and contention window size are formulated to maximize the consensus's success probability without sacrificing the overall network performance. Further, the optimal pairs under different network sizes are demonstrated for straightforward guidance.

10 October 2024 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
ZZZiyi Zhou
Ziyi Zhou
OOOluwakayode Onireti
Oluwakayode Onireti
XLXinyi Lin
Xinyi Lin
LZLei Zhang
Lei Zhang
Muhammad ImranMuhammad Imran
Muhammad Imran
Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.

28 October 2025 in IEEE Communications Standards Magazine
Verified
Journal Article
Closed access
PLPeizheng Li
Peizheng Li
XLXinyi Lin
Xinyi Lin
AAAdnan Aijaz
Adnan Aijaz
Networked robotics continues to be a key component of various industrial systems. 6G will empower networked robotics with the envisaged capabilities like hyper-reliable and low-latency connectivity and in-network intelligence. While communication and control techniques have been widely investigated; co-design and AI-based solutions for autonomy and reasoning are still emerging. In this article, we propose a generative Al-in-the-Loop (GITL) framework for the control and coordination of networked robotic systems. The generative AI (GAI) agent oversees three interrelated loops: the communication loop, the robot control loop, and the Al model control loop, making holistic decisions by interpreting task requirements, network status, and robotic operations. Acting as a high-level cross-domain coordinator, the GAI agent leverages background knowledge of AI models, robot behaviors, and network policies, ensuring seamless interplay across different operational scenarios. This approach ultimately enables a highly autonomous networked robotic system capable of handling complex tasks with minimal human intervention. We anticipate that the GITL paradigm will play a pivotal role in unlocking the full potential of networked robotic systems, enabling enhanced autonomy, adaptability, and coordination in the emerging 6G and Industry 5.0 era.

1 October 2026 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
QLQiming Li
Qiming Li
LZLei Zhang
Lei Zhang
XLXinyi Lin
Xinyi Lin
HXHaoran Xu
Haoran Xu
Lina MohjaziLina Mohjazi
Lina Mohjazi
Muhammad ImranMuhammad Imran
Muhammad Imran
Wireless V2V networks must coordinate scarce bandwidth and power under rapidly varying channel conditions while simultaneously supporting V2V communications and sensing. This paper considers distributed power-bandwidth allocation for an ISAC-enabled V2V network supporting (i) per-link V2V communication, (ii) detection of unconnected vehicles with a prescribed false-alarm probability, and (iii) tracking among connected vehicles quantified by the EKF-based posterior Cramér–Rao bound (PCRB). We propose a semi-distributed two-level framework. At the vehicle level, each vehicle first minimizes the sensing power required to satisfy the detection constraint, and then solves a tracking-oriented joint power-bandwidth problem via block coordinate descent (BCD) with convex reformulations. At the network level, a lightweight leader broadcasts a scalar bandwidth price and aggregates scalar bandwidth demands, yielding an asynchronous distributed pricing loop with $\mathcal {O}(K)$ signaling overhead. Simulations show that the proposed method converges quickly and achieves near-centralized tracking performance with lightweight coordination. Compared with fixed or uniform benchmark schemes, it improves bandwidth utilization and attains a comparable tracking accuracy with less total bandwidth. The results also reveal how vehicle geometry and weighting affect the global Fisher information, and indicate graceful performance degradation under CSI uncertainty.