{"ID":2837722,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.19369","arxiv_id":"2511.19369","title":"Connectivity-Aware Task Offloading for Remote Northern Regions: a Hybrid LEO-MEO Architecture","abstract":"Arctic regions, such as northern Canada, face significant challenges in achieving consistent connectivity and low-latency computing services due to the sparse coverage of Low Earth Orbit (LEO) satellites. To enhance service reliability in remote areas, this paper proposes a hybrid satellite architecture for task offloading that combines Medium Earth Orbit (MEO) and LEO satellites. We develop an optimization framework to maximize task offloading admission rate while balancing the energy consumption and delay requirements. Accounting for satellite visibility and limited computing resources, our approach integrates dynamic path selection with frequency and computational resource allocation. Because the formulated problem is NP-hard, we reformulate it into a mixed-integer convex form using disjunctive constraints and convex relaxation techniques, enabling efficient use of off-the-shelf optimization solvers. Simulation results show that, compared to a standalone LEO network, the proposed hybrid LEO-MEO architecture improves the task admission rate by 15\\% and reduces the average delay by 12\\%. These findings highlight the architecture's potential to enhance connectivity and user experience in remote Arctic areas.","short_abstract":"Arctic regions, such as northern Canada, face significant challenges in achieving consistent connectivity and low-latency computing services due to the sparse coverage of Low Earth Orbit (LEO) satellites. To enhance service reliability in remote areas, this paper proposes a hybrid satellite architecture for task offloa...","url_abs":"https://arxiv.org/abs/2511.19369","url_pdf":"https://arxiv.org/pdf/2511.19369v1","authors":"[\"Mohammed Almekhlafi\",\"Antoine Lesage-Landry\",\"Gunes Karabulut Kurt\"]","published":"2025-11-24T18:06:03Z","proceeding":"eess.SP","tasks":"[\"eess.SP\"]","methods":"[]","has_code":false}