TY - GEN
T1 - Online Uplink Scheduling for Multi-User LEO Satellite IoT Networks
AU - Yang, Song
AU - Hu, Mengjun
AU - Wang, Yongzhen
AU - Wang, Buyu
AU - Qi, Jingwei
AU - Zhao, Bo
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Low-Earth-orbit (LEO) satellite constellations are emerging as a promising infrastructure for uplink-dominated Internet of Things (IoT) services. However, rapid satellite mobility leads to highly time-varying user-satellite associations, frequent handovers, and limited onboard processing capacity, which jointly complicate uplink scheduling design. Moreover, uplink tasks often span multiple time slots, resulting in strong cross-slot coupling due to task queue evolution and association switching costs. This paper investigates online uplink scheduling for multi-user LEO satellite IoT networks under time-varying visibility and switching costs. We formulate a cross-slot uplink scheduling model that captures dynamic association, onboard processing constraints, and task backlog evolution. To address the resulting complexity, we propose a Lyapunov-based primal-dual online scheduling algorithm that operates without future system information and guarantees queue stability. Simulation results demonstrate that the proposed approach effectively reduces uplink delay, improves satellite load balancing, and suppresses unnecessary handovers compared with representative baseline schemes.
AB - Low-Earth-orbit (LEO) satellite constellations are emerging as a promising infrastructure for uplink-dominated Internet of Things (IoT) services. However, rapid satellite mobility leads to highly time-varying user-satellite associations, frequent handovers, and limited onboard processing capacity, which jointly complicate uplink scheduling design. Moreover, uplink tasks often span multiple time slots, resulting in strong cross-slot coupling due to task queue evolution and association switching costs. This paper investigates online uplink scheduling for multi-user LEO satellite IoT networks under time-varying visibility and switching costs. We formulate a cross-slot uplink scheduling model that captures dynamic association, onboard processing constraints, and task backlog evolution. To address the resulting complexity, we propose a Lyapunov-based primal-dual online scheduling algorithm that operates without future system information and guarantees queue stability. Simulation results demonstrate that the proposed approach effectively reduces uplink delay, improves satellite load balancing, and suppresses unnecessary handovers compared with representative baseline schemes.
KW - Internet of Things
KW - LEO satellite networks
KW - Lyapunov optimization
KW - handover-Aware association
KW - online optimization
KW - uplink scheduling
UR - https://www.scopus.com/pages/publications/105044692441
U2 - 10.1109/GIIS69881.2026.11585755
DO - 10.1109/GIIS69881.2026.11585755
M3 - Conference contribution
AN - SCOPUS:105044692441
T3 - 2026 Global Information Infrastructure and Networking Symposium, GIIS 2026
BT - 2026 Global Information Infrastructure and Networking Symposium, GIIS 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2026 Global Information Infrastructure and Networking Symposium, GIIS 2026
Y2 - 22 April 2026 through 24 April 2026
ER -