Tasking planning based on task splitting and merging in relay satellite network

Run-zi LIU; Min SHENG; Cheng-yuan TANG; Jian-dong LI; Kai DU; Yong-an YANG

doi:10.11959/j.issn.1000-436x.2017243

您当前的位置：

首页 >

文章列表页 >

Tasking planning based on task splitting and merging in relay satellite network

Papers | 更新时间：2024-06-05

- Tasking planning based on task splitting and merging in relay satellite network
- Journal on Communications Vol. 38, Issue Z1, Pages: 110-117(2017)
- 作者机构：
  
  1. 西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071
  2. 西安卫星测控中心宇航动力学国家重点实验室，陕西西安 710043
- 作者简介：
- 基金信息：
  
  China Postdoctoral Science Foundation(2017M623121);The National Natural Science Foundation of China(61701365);The National Natural Science Foundation of China(91638202);The National Natural Science Foundation of China(91338114);Fundamental Research Funds for the Central Universities(JB170105)
- DOI：10.11959/j.issn.1000-436x.2017243
  CLC： TN927
- Online First：2017-10，
  
  Published：25 October 2017
- 稿件说明：
移动端阅览
Run-zi LIU, Min SHENG, Cheng-yuan TANG, et al. Tasking planning based on task splitting and merging in relay satellite network[J]. Journal on Communications, 2017, 38(Z1): 110-117.
DOI：

Run-zi LIU, Min SHENG, Cheng-yuan TANG, et al. Tasking planning based on task splitting and merging in relay satellite network[J]. Journal on Communications, 2017, 38(Z1): 110-117. DOI： 10.11959/j.issn.1000-436x.2017243.

摘要

针对服务时间过长或过短任务规划效率较低的问题，提出一种基于任务拆分聚合的中继卫星系统任务规划方法。首先，设计任务拆分、聚合方法将用户请求的任务需求转化为规划效率较高的任务元。其次，基于并行机调度模型，建模最大化网络中任务完成数的任务元调度优化问题，并在此基础上设计了一种多项式时间的启发式调度算法。最后，通过仿真将该算法与传统算法比较，验证了其在任务完成数、资源利用率以及公平性方面的增益。

Abstract

To handle the low planning efficiency of the tasks with too long or too short service time

a task planning scheme was proposed based on task splitting and merging for relay satellite systems.First

a task splitting and merging was developed to transfer the task requirements of user to task units which could be planned with high efficiency.Secondly

based on the parallel machine scheduling model

the optimization problem of the task unit planning to maximize the number of completed tasks in the network was built.Further

a heuristic polynomial time scheduling algorithm was proposed.Simulation results show that compared to the traditional scheme

the task planning scheme perform better in terms of completed task number

resource utilization and fairness.

关键词

Keywords

references

YU Q Y , MENG W X , YANG M C , et al . Virtual multi-beamforming for distributed satellite clusters in space information networks [J ] . IEEE Wireless Commun , 2016 , 23 ( 1 ): 95 - 101 .

LIU R , SHENG M , XU C , et al . Antenna slewing time aware mission scheduling in space networks [J ] . IEEE Commun Lett , 2017 , 21 ( 3 ): 516 - 519 .

ROJANASOONTHON S , BARD J , REDDY S D . Algorithms for parallel machine scheduling:a case study of the tracking and data relay satellite system [J ] . Journal of the Operational Research Society , 2003 , 54 ( 8 ): 806 - 821 .

BARD J F , ROJANASOONTHON S . A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities [J ] . Naval Research Logistics (NRL) , 2006 , 53 ( 1 ): 24 - 44 .

LIN P , KUANG L , CHEN X , et al . Adaptive subsequence adjustment with evolutionary asymmetric path-relinking for TDRSS scheduling [J ] . Journal of Systems Engineering and Electronics , 2014 , 25 ( 5 ): 800 - 810 .

BIANCHESSI N , RIGHINI G . Planning and scheduling algorithms for the COSMO-SkyMed constellation [J ] . Aerospace Science and Technology , 2008 , 12 ( 7 ): 535 - 544 .

ANON . Space network users’ guide (SNUG)-revision 10 [M ] . Greenbelt : MD:NASA GSFC , August 1979 .

ROJANASOONTHON S . Parallel machine scheduling with time windows [D ] . Austin:University of Texas , 2004 .

BONDY J A , MURTY U S R . Graph theory with applications [J ] . London:Macmillan , 1976 , 28 ( 1 ): 237 - 238 .

GARY M R , JOHNSON D S . Computers and intractability:a guide to the theory of NP-completeness [M ] . New York : W.H.Freeman and Company , 1979 .

Views

1981

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

AI问答

⁰