This website stores cookies on your computer. These cookies are used to collect information about how you interact with our website and allow us to remember your browser. We use this information to improve and customize your browsing experience, for analytics and metrics about our visitors both on this website and other media, and for marketing purposes. By using this website, you accept and agree to be bound by UVic’s Terms of Use for web and social media privacy.  If you do not agree to the above, you can configure your browser’s setting to “do not track.”

Skip to main content

Pooria Seyed Eftetahi

  • B.Sc. (Isfahan University of Technology, 2015)

Notice of the Final Oral Examination for the Degree of Doctor of Philosophy

Topic

Wireless backhaul for 6G Communication Systems

Department of Electrical and Computer Engineering

Date & location

  • Tuesday, November 24, 2026

  • 9:30 A.M.

  • Engineering Office Wing 

Reviewers

Supervisory Committee

  • Dr. Lin Cai, Department of Electrical and Computer Engineering, University of Victoria (Supervisor)

  • Dr. Hong-Chuan Yang, Department of Electrical and Computer Engineering, UVic (Member)

  • Dr. Sudhakar Ganti, Department of Computer Science, UVic (Outside Member) 

External Examiner

  • Dr. Qiang Ye, Department of Electrical and Software Engineering, University of Calgary 

Chair of Oral Examination

  • Dr. Andrew Caruthers, School of Earth and Ocean Sciences, UVic

     

Abstract

As wireless networks become increasingly dense to enhance coverage and capacity, wireless multi-hop backhaul offers a cost-effective and flexible solution for network deployment. These benefits have motivated the adoption of integrated access and backhaul (IAB) in industry and its incorporation into 5G standards. Looking ahead to 6G, IAB is expected to continue playing an important role in supporting scalable and adaptable wireless networks. Beyond terrestrial coverage, low Earth orbit (LEO) satellite backhaul can extend connectivity to remote, maritime, and airborne users. Efficient routing and resource allocation are essential to support timely and fair service across these terrestrial and satellite networks. This dissertation develops routing and scheduling methods for terrestrial IAB networks and LEO satellite backhaul, addressing packet delay requirements, fairness, and application-specific utility.

For multi-hop IAB networks, given limited wireless resources and increasing needs of delay-sensitive services, a distributed delay-guaranteed path selection and scheduling (DGPS) approach is developed to improve network utility while satisfying the end-to-end delay requirements of delay-sensitive packets. DGPS jointly selects forwarding paths and output queues using packet delay budgets, local queue information, downstream queuing-delay upper bounds, and channel quality. Simulations under different traffic loads, including bursty traffic, demonstrate improvements in end-to-end delay and packet delivery ratio compared with other routing baselines.

When applying LEO satellite links in IAB, due to high mobility and large coverage of LEO satellites, beam placement scheduling is critical to maximize throughput while maintaining fairness under satellite resource constraints. The dissertation first proposes a heuristic approach, termed beam placement scheduling–heuristic (BPS-H), to explore the beam placement scheduling problem. Building on these insights, it develops beam placement scheduling with advantage actor-critic (BPS-A2C), a reinforcement learning approach for real-time beam scheduling. Evaluations under uniform and non-uniform terminal distributions, with and without inter-beam interference, examine throughput, fairness, and the time until a terminal is first illuminated. BPSA2C achieves comparable throughput and fairness to the proposed heuristic approach with substantially lower decision-making time.

To accommodate heterogeneous application requirements and service priorities in LEO networks, UBER, a utility-based beam and resource scheduler, coordinates beam placement with adaptive bandwidth allocation. Application-specific utility functions and weights represent terminal satisfaction and service priorities. Proximal policy optimization guides beam selection using rewards for throughput efficiency, utility gains, and demand satisfaction, with penalties for interference and unproductive beam activations. An adaptive bandwidth allocator then assigns frequency chunks and permits spatial reuse subject to interference constraints and reuse limits. Simulations under uniform and population-based user distributions show improvements in total utility and payload delivery, with high fairness over terminal utilities by the end of the scheduling window.