Premium
Scheduling algorithm for the multiple rovers' access to single orbiter on the Mars relay communication links
Author(s) -
Wan Peng,
Zhan Yafeng,
Pan Xiaohan,
Huang Lei
Publication year - 2019
Publication title -
international journal of satellite communications and networking
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.388
H-Index - 39
eISSN - 1542-0981
pISSN - 1542-0973
DOI - 10.1002/sat.1302
Subject(s) - computer science , proportionally fair , scheduling (production processes) , algorithm , mars exploration program , relay , orbiter , round robin scheduling , fair share scheduling , distributed computing , data transmission , computer network , real time computing , mathematical optimization , quality of service , power (physics) , physics , mathematics , quantum mechanics , astronomy , engineering , aerospace engineering
Summary The Mars relay communication services have played an important role on the scientific data transmission for several Mars surface exploration missions. However, such technologies based on CCSDS Proximity‐1 protocols only support one single user's access to orbiter at one relay communication session. In future deep space missions, there would be more rovers and facilities on the Mars surface, which requires a multiple access method with high efficiency and low resource occupation. In this article, we propose a distributed serial scheduling structure as "multiple leaky buckets + token bucket" and a scheduling algorithm as "queue equilibrium based proportional fair," in order to improve the multiple access performance on the comprehensive merits of fair access, data transfer throughput, and queue equilibrium. The mathematical model is constructed to validate our new scheduling structure and algorithm, and the multiple attribute decision‐making (MADM) method is used to compare our algorithm with the other three most frequently used algorithms as maximum rate, time polling, and proportional fair. Simulation results show that our scheduling structure and the new scheduling algorithm could find balance with fairness, throughput and queue equilibrium, which gets the best performance in all the four scheduling algorithms in the Mars relay communications case.