A Cost-Effective Satellite Service Allocation Method in ISTN Environment
摘要
The satellite computing paradigm has received considerable attention recently. The large number of satellites deployed in low-orbit constellations can jointly achieve seamless global coverage and provide real-time ubiquitous services to ground users. Affected by multiple factors such as the surge in user services, limited satellite resources, and overlapping satellite coverage, finding suitable satellites for users to assign tasks has become an extremely challenging task. The satellite service allocation(SSA) problem is known as NP-hard, so we propose a resource-based best match first heuristic algorithm to provide allocation decisions for users in coverage overlapping areas and users will offload tasks to specific satellite through provided scheme. Experimental results show that our proposed algorithm performs better than the comparative baseline methods in terms of service allocation rate and satellite resource utilization rate.