• DocumentCode
    3502655
  • Title

    Satellite Network Range Scheduling

  • Author

    Wu, Jun ; Cao, Shuang ; Yong Li ; Li, Yong

  • Author_Institution
    Sch. of Inf. Eng., Yangzhou Univ., Yangzhou, China
  • fYear
    2010
  • fDate
    1-5 Nov. 2010
  • Firstpage
    326
  • Lastpage
    331
  • Abstract
    Constellation networking is the prominent technology for the next generation satellite systems. The communication schedule is a key problem for constellation maintenance. However, the traditional SRS (Satellite Range Scheduling) model do not use inter-satellite links. In this paper, a communication scheduling model is proposed, in which the ISLs (Inter Satellite Links) is built. And the NP complicity of SNRS is proved. Meanwhile, a two stage greedy algorithm is designed to calculate the SNRS. And heuristic strategies in the proposed algorithm are compared by simulation. The experiment results show that EDF strategy combined with minimum distance route can bring into an acceptable schedule.
  • Keywords
    computational complexity; next generation networks; optimisation; satellite links; scheduling; NP complicity; communication schedule; constellation maintenance; constellation networking; heuristic strategy; inter satellite links; next generation satellite systems; satellite network range scheduling; Deadline; ISL; Satellite; Schedule;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Grid and Cooperative Computing (GCC), 2010 9th International Conference on
  • Conference_Location
    Nanjing
  • Print_ISBN
    978-1-4244-9334-0
  • Electronic_ISBN
    978-0-7695-4313-0
  • Type

    conf

  • DOI
    10.1109/GCC.2010.70
  • Filename
    5662482