Relevant bibliographies by topics / Satellite Scheduling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Satellite Scheduling'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Satellite Scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Satellite Scheduling"

1

Cui, Jintian, and Xin Zhang. "Application of a Multi-Satellite Dynamic Mission Scheduling Model Based on Mission Priority in Emergency Response." Sensors 19, no. 6 (March 23, 2019): 1430. http://dx.doi.org/10.3390/s19061430.

Full text
Abstract:
Emergency observations are missions executed by Earth observation satellites to support urgent ground operations. Emergency observations become more important for meeting the requirements of highly dynamic and highly time-sensitive observation missions, such as disaster monitoring and early warning. Considering the complex scheduling problem of Earth observation satellites under emergency conditions, a multi-satellite dynamic mission scheduling model based on mission priority is proposed in this paper. A calculation model of mission priority is designed for emergency missions based on seven impact factors. In the satellite mission scheduling, the resource constraints of scheduling are analyzed in detail, and the optimization objective function is built to maximize the observation mission priority and mission revenues, and minimize the waiting time for missions that require urgency for execution time. Then, the hybrid genetic tabu search algorithm is used to obtain the initial satellite scheduling plan. In case of the dynamic arrival of new emergency missions before scheduling plan releases, a dynamic scheduling algorithm based on mission priority is proposed to solve the scheduling problem caused by newly arrived missions and to obtain the scheduling plan of newly arrived missions. A simulation experiment was conducted for different numbers of initial missions and newly arrived missions, and the scheduling results were evaluated with a model performance evaluation function. The results show that the execution probability of high-priority missions increased because the mission priority was taken into account in the model. In the case of more satellite resources, when new missions dynamically arrived, the satellite resources can be reasonably allocated to these missions based on the mission priority. Overall, this approach reduces the complexity of the dynamic adjustment and maintains the stability of the initial scheduling plan.
APA, Harvard, Vancouver, ISO, and other styles
2

Feng, Yao, Ren Jie He, Ju Fang Li, and Li Ning Xing. "Research on Joint Scheduling of Multiple Imaging Satellites with Multiple Sensors." Advanced Materials Research 186 (January 2011): 616–20. http://dx.doi.org/10.4028/www.scientific.net/amr.186.616.

Full text
Abstract:
Guided by the application requirements of imaging satellite, this work focuses on the model construction and heuristic rule design to the joint scheduling problem of multi imaging satellites. It analyses the imaging procedure, imaging constraints, inputs and outputs, the basic scheduling flow and characteristics of the joint scheduling problem of multi imaging satellites. The heuristic algorithm was proposed to effectively solve this problem. Finally, a multi imaging satellites scheduling system is developed.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Shengyu, Zhencai Zhu, Haiying Hu, and Yuqing Li. "Research on Task Satellite Selection Method for Space Object Detection LEO Constellation Based on Observation Window Projection Analysis." Aerospace 8, no. 6 (May 31, 2021): 156. http://dx.doi.org/10.3390/aerospace8060156.

Full text
Abstract:
Aiming at the task planning and scheduling problem of space object detection LEO constellation (SODLC) for detecting space objects in deep space background, a method of SODLC task satellite selection based on observation window projection analysis is proposed. This method projects the spatial relative relationships of the SODLC observation blind zone, observation range, and the initial spatial position of the objects onto the surface of the earth for detectable analysis of satellites and targets and binds the dynamic observation conditions to the satellite trajectory after projection calculation of the visible relationship between target changes. On this basis, combined with the features of SODLC with high orbital symmetry, the task satellite selection is divided into two steps: orbit plane selection and task satellite selection. The orbit planes are selected based on the longitude range of the ascending node with the geographic location of the targets, and the task satellites are selected according to the relative motion relationship between the satellites and the targets together with the constraints of observable conditions. The selection method simplifies the calculation process of scheduling and selecting task satellites. Simulation analysis prove the method has better task satellite selection efficiency. The method has high practical value for task planning and scheduling for event-driven SODLC.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, H. J., Y. Lu, F. H. Dong, and R. Liu. "Communications Satellite Multi-Satellite Multi-Task Scheduling." Procedia Engineering 29 (2012): 3143–48. http://dx.doi.org/10.1016/j.proeng.2012.01.455.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Niu, X. N., H. Tang, and L. X. Wu. "MULTI-SATELLITE OBSERVATION SCHEDULING FOR LARGE AREA DISASTER EMERGENCY RESPONSE." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-3 (April 30, 2018): 1327–31. http://dx.doi.org/10.5194/isprs-archives-xlii-3-1327-2018.

Full text
Abstract:
an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.
APA, Harvard, Vancouver, ISO, and other styles
6

Feng, Yao, Ren Jie He, Ju Fang Li, and Li Ning Xing. "An Intelligent Approach to Dynamic Scheduling System of Earth Observation Satellites." Advanced Materials Research 186 (January 2011): 591–95. http://dx.doi.org/10.4028/www.scientific.net/amr.186.591.

Full text
Abstract:
With the increased number of earth observation satellites, the process of acquiring high quality solution schedule for multi-satellite, multi-orbit and multi-user is more difficult than before. The multi-objective hierarchical genetic algorithm with preference and dynamic heuristic algorithm are proposed to solve the dynamic scheduling problem of earth observation satellite system. The experimental results performed on some benchmark problems suggest that this proposed approach is effective to the dynamic scheduling system.
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Yu Qing, Ri Xin Wang, and Min Qiang Xu. "An Evolution Algorithm for Satellite Range Scheduling Problem with Priority Constraint." Applied Mechanics and Materials 568-570 (June 2014): 775–80. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.775.

Full text
Abstract:
The satellite range scheduling problem is one of the most important problems in the field of the satellite operation. The purpose of this problem is finding the optimal feasible schedules, scheduling the communications between satellites and ground stations effectively, in another word. The problem is known for its high complexity and is an over-constrained problem. This paper present the resolution of the problem through a Station Coding Based Evolution Algorithm, particularly with the priority constraint, which adopting a new chromosome encoding method based on arranging the tasks in the ground station ID order. Computational results and analysis are presented for the case of the multi-ground stations scheduling.
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Jiang Cheng, Li Ning Xing, Ying Wu Chen, and Xiang Yu Wei. "Electronic Satellite Scheduling Problem and its Heuristic Method." Advanced Materials Research 989-994 (July 2014): 4062–68. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4062.

Full text
Abstract:
The problem of scheduling for electronic satellites is a serious problem involving a lot of complex constraints. Considering the specific constraints of electromagnetic detection electronic satellite, on the basis of rational hypothesis, a multi-objective mathematic model was established. Several basic scheduling strategies were proposed. Based on the roulette method and hierarchical optimization method, a heuristic algorithm based on the rules was designed. A comprehensive evaluation with Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for the algorithm was offered. Finally, some experiments are conducted to verify the correctness and practicability of our scheduling model and algorithm.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Hao, Shu Yang, Jun Li, and Ning Jing. "Exact and Heuristic Methods for Observing Task-Oriented Satellite Cluster Agent Team Formation." Mathematical Problems in Engineering 2018 (August 6, 2018): 1–23. http://dx.doi.org/10.1155/2018/2103625.

Full text
Abstract:
With the development of aerospace science and technology, Earth Observation Satellite cluster which consists of heterogeneous satellites with many kinds of payloads appears gradually. Compared with the traditional satellite systems, satellite cluster has some particular characteristics, such as large-scale, heterogeneous satellite platforms, various payloads, and the capacity of performing all the observation tasks. How to select a subset from satellite cluster to perform all observation tasks effectively with low cost is a new challenge arousing in the field of aerospace resource scheduling. This is the agent team formation problem for observation task-oriented satellite cluster. A mathematical scheduling model is built. Three novel algorithms, i.e., complete search algorithm, heuristic search algorithm, and swarm intelligence optimization algorithm, are proposed to solve the problem in different scales. Finally, some experiments are conducted to validate the effectiveness and practicability of our algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhuang, Shufeng, Zhendong Yin, Zhilu Wu, and Xiaoguang Chen. "Dynamic Relay Satellite Scheduling Based on ABC-TOPSIS Algorithm." Mathematical Problems in Engineering 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/3161069.

Full text
Abstract:
Tracking and Data Relay Satellite System (TDRSS) is a space-based telemetry, tracking, and command system, which represents a research field of the international communication. The issue of the dynamic relay satellite scheduling, which focuses on assigning time resource to user tasks, has been an important concern in the TDRSS system. In this paper, the focus of study is on the dynamic relay satellite scheduling, whose detailed process consists of two steps: the initial relay satellite scheduling and the selection of dynamic scheduling schemes. To solve the dynamic scheduling problem, a new scheduling algorithm ABC-TOPSIS is proposed, which combines artificial bee colony (ABC) and technique for order preference by similarity to ideal solution (TOPSIS). The artificial bee colony algorithm is performed to solve the initial relay satellite scheduling. In addition, the technique for order preference by similarity to ideal solution is adopted for the selection of dynamic scheduling schemes. Plenty of simulation results are presented. The simulation results demonstrate that the proposed method provides better performance in solving the dynamic relay satellite scheduling problem in the TDRSS system.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Satellite Scheduling"

1

Sauer, Birgit M. (Birgit Maria) 1971. "Autonomous mission scheduling for satellite operations." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/49978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Glim, Carl. "MULTI-USER SATELLITE TRACKING NETWORK SCHEDULING." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/609211.

Full text
Abstract:
International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California
The recent proliferation of Low Earth Orbiting (LEO) science, earth resources, and global communication satellites requires a significant number of ground stations for support. A network of satellite tracking ground stations with the ability to support multiple users and communicate with multiple satellites requires a robust scheduling and conflict resolution system. This paper describes an automated scheduling implementation for managing such a commercial, multi-user, multiple satellite, ground station network.
APA, Harvard, Vancouver, ISO, and other styles
3

Ganti, Anand 1975. "Transmission scheduling for wireless and satellite systems." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29316.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (p. 135-137).
We study queuing systems with time-varying service rates, as a natural model of satellite and wireless communication systems. Packets arrive at a satellite to be transmitted to one of the sub-regions (channels) in a service area. The packets are stored in an on-board buffer and in a separate queue for each channel. The satellite has a limited power available for scheduling transmissions, and a fixed number of transmitters. The power allocated to a particular channel, in conjunction with the channel state, determines the transmission rate of the channel, i.e., the service rate for the queue corresponding to that channel. The assignment of transmitters to the queues as well as the power allocated to each transmitter are modeled as control variables. The goal is to design a power allocation policy so that the expected queue size, in steady-state, is minimized. We model the system as a slotted system with N queues, and i.i.d. Bernoulli arrivals at each queue during each slot. Each queue is associated with a channel that changes between "on" and "off" states according to i.i.d. Bernoulli processes. We assume that the system has K identical transmitters ("servers").
(cont.) Each server, during each slot, can transmit up to Co packets from a queue associated with an "on" channel. We show that when K and Co are arbitrary and a total of up to KCo packets can be served from all the N queues in a time slot, a policy that assigns the K servers to the "on" channels associated with the K longest queues is optimal. We also consider a "fluid" service model under which fractional packets can be served, for the case K = N, and subject to a constraint that at most C packets can be served in total over all of the N queues. We show that there is an optimal policy which serves the queues so that the resulting vector of queue lengths is "Most Balanced." We also describe techniques to upper bound the expected queue size in steady-state under an optimal policy.
by Anand Ganti.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
4

Shen, Haijun. "Optimal scheduling for satellite refueling in circular orbits." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/12331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kinney, Mark D. "General loss function applied to satellite scheduling optimization." Thesis, Monterey, California: Naval Postgraduate School, 2014. http://hdl.handle.net/10945/43938.

Full text
Abstract:
Approved for public release; distribution is unlimited
Satellite imagery utilization is an oversubscribed problem and therefore requires optimum scheduling methodology to maximize the use of the systems. There are many methods to determine performance of a scheduling algorithm, many of which rely on comparison to already established standards. Based on Taguchi’s quality loss function formulation that was developed for the manufacturing industry, four general quality loss functions are presented. These loss functions show the dollars lost when two different performances are changed. The two examined are (1) system response time to user image request and (2) total number of image requests satisfied. The general loss function is applied to the satellite scheduling problem to associate losses captured by the algorithm into a common unit, dollars lost. These loss functions, once developed, help decision makers determine how best to utilize their systems in terms of expected bottom line value to the company.
APA, Harvard, Vancouver, ISO, and other styles
6

Maillard, Adrien. "Flexible Scheduling for Agile Earth Observing Satellites." Thesis, Toulouse, ISAE, 2015. http://www.theses.fr/2015ESAE0024/document.

Full text
Abstract:
Les satellites d’observation de la Terre sont des senseurs qui acquièrent des données, les compressent et les mémorisent à bord, puis les vident vers le sol. Des incertitudes rendent la planification des activités au sol de plus en plus discutable car la planification est alors pessimiste et les plans largement sous-optimaux. Cette thèse détaille la conception d'une planification mixte qui permet de profiter de la réalisation des paramètres incertains à bord tout en préservant la prévisibilité de l'exécution pour les opérateurs au sol. Notre première contribution concerne le problème de planification des vidages. Un mécanisme de planification flexible a été conçu dans lequel seules les acquisitions de haute priorité sont planifiées de manière pessimiste. A bord, un algorithme adapte le plan en fonction des volumes réels, en s'assurant que le vidage des acquisitions de haute priorité est toujours garanti, et insère des nouveaux vidages si possible. Notre deuxième contribution concerne le problème de planification des acquisitions. Au sol, des contraintes contribuent à éliminer du plan de nombreuses acquisitions qui auraient pu être réalisées car les niveaux de ressources à bord sont souvent plus hauts que ceux prévus par ces contraintes. Dans un nouveau mécanisme de décision, le sol produit des plans conditionnels dans lesquels la réalisation des acquisitions de basse priorité est conditionnée par des niveaux d'énergie requis. Comparées à d'autres mécanismes de planification, ces deux approches flexibles permettent d'éviter le gaspillage des ressources et de réaliser plus d'acquisitions et de vidages tout en conservant de la prévisibilité
Earth-observation satellites are space sensors which acquire data, compress and record it on board, and then download it to the ground. Some uncertainties make planning and scheduling satellite activities offline on the ground more and more arguable as worst-case assumptions are made about uncertain parameters and plans are suboptimal. This dissertation details our efforts at designing a flexible decision-making scheme that allows to profit from the realization of uncertain parameters on board while keeping a fair level of predictability on the ground. Our first contribution concerns the data download problem. A flexible decision-making mechanism has been designed where only high-priority acquisition downloads are scheduled with worst-case assumptions. Other acquisition downloads are scheduled with expected parameters and conditioned by resource availability. The plan is then adapted on board. Our second contribution concerns the acquisition planning problem. A lot of acquisitions that could have been done are eliminated when planning because of worst-case assumptions. In a new decision-making scheme, these high-level constraints are removed for low-priority acquisitions. Observation plans produced on the ground are conditional plans involving conditions for triggering low-priority acquisitions. Compared with pure ground and pure onboard methods, these two approaches avoid wastage of resource and allow more acquisitions to be executed and downloaded to the ground while keeping a fair level of predictability on the ground
APA, Harvard, Vancouver, ISO, and other styles
7

Horan, Stephen. "An Operational Concept for a Demand Assignment Multiple Access System for the Space Network." International Foundation for Telemetering, 1996. http://hdl.handle.net/10150/611436.

Full text
Abstract:
International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California
An operational concept for how a Demand Access Multiple Assignment (DAMA) system could be configured for the NASA Space network is examined. Unique aspects of this concept definition are the use of the Multiple Access system within the Space Network to define an order wire channel that continuously scans the Low Earth Orbit space for potential users and the use of advanced digital signal processing technology to look for the Doppler-shifted carrier signal from the requesting satellite. After the reception of the signal, validation and processing of the request is completed. This paper outlines the concept and the ways in which the system could work.
APA, Harvard, Vancouver, ISO, and other styles
8

Kennedy, Andrew Kitrell. "Planning and scheduling for earth-observing small satellite constellations." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120415.

Full text
Abstract:
Thesis: Ph. D. in Space Systems, Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 225-235).
The growth of Earth-observing small satellite constellations requires effective, automated operations management. State-of-the-art techniques must be improved to manage scheduling of observation data collection, data routing through a crosslinked constellation network, and maintenance of limited onboard resources, as well as to enable scaling to hundreds of satellites. This work has four primary contributions. The first is the development of a hierarchical smallsat constellation planning and scheduling system that addresses data routing and resource management. A centralized ground-based algorithm, the Global Planner, manages the whole constellation, while an onboard algorithm, the Local Planner, replans in real-time to handle urgent, unexpected observations. The second contribution is the development of the software infrastructure for simulating the constellation with high fidelity. The third is the analysis of system performance with a set of representative orbit geometries, ground station networks, and communications contexts. The fourth is the demonstration of routing of urgent observation data. The Global Planner algorithm demonstrates execution on larger problem sizes than the state-of-the-art, by quickly executing for both long planning horizons (requiring < 1 minute for a 1000 min. horizon) and many satellites (< 30 mins for 100 sats). Representative constellation geometries are simulated and analyzed with a 6U CubeSat bus model, including a 10-sat Sun-synchronous Orbit Ring and a 30-sat Walker Delta constellation. The improvement using crosslinks in addition to downlinks is assessed over a set of metrics including observation data throughput, latency of data delivery to ground, average Age of Information (freshness) of observation data, and freshness of TT&C data. In every case, performance is found to improve when using crosslinks and downlinks versus only using downlinks. Unplanned, urgent observation data is routed effectively by the Local Planner, achieving comparable latency performance with regular observation data (median of 42 minutes versus 38 mins) in a 6-sat simulation. This work enables efficient scheduling of operations for large, complex smallsat constellations. Future work is discussed that promises further scalability and schedule quality increases from the algorithm architecture presented.
by Andrew Kitrell Kennedy.
Ph. D. in Space Systems
APA, Harvard, Vancouver, ISO, and other styles
9

Xu, Kai J. "Radio Resource Management for Satellite UMTS. Dynamic scheduling algorithm for a UMTS-compatible satellite network." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/5685.

Full text
Abstract:
The third generation of mobile communication systems introduce interactive Multicast and Unicast multimedia services at a fast data rate of up to 2 Mbps and is expected to complete the globalization of the mobile telecommunication systems. The implementation of these services on satellite systems, particularly for broadcast and multicast applications to complement terrestrial services is ideal since satellite systems are capable of providing global coverage in areas not served by terrestrial telecommunication services. However, the main bottleneck of such systems is the scarcity of radio resources for supporting multimedia applications which has resulted in the rapid growth in research efforts for deriving efficient radio resource management techniques. This issue is addressed in this thesis, where the main emphasis is to design a dynamic scheduling framework and algorithm that can improve the overall performance of the radio resource management strategy of a UMTS compatible satellite network, taking into account the unique characteristics of wireless channel conditions. This thesis will initially be focused on the design of the network and functional architecture of a UMTS -compatible satellite network. Based on this architecture, an effective scheduling framework is designed, which can provide different types of resource assigning strategies. A functional model of scheduler is defined to describe the behaviours and interactions between different functional entities. An OPNET simulation model with a complete network protocol stack is developed to validate the performance of the scheduling algorithms implemented in the satellite network. Different types of traffic are considered for the OPNET simulation, such as the Poisson Process, ONOFF Source and Self Similar Process, so that the performance of scheduling algorithm can be analyzed for different types of services. A novel scheduling algorithm is proposed to optimise the channel utilisation by considering the characteristics of the wireless channel, which are bursty and location dependent. In order to overcome the channel errors, different code rates are applied for the user under different channel conditions. The proposed scheduling algorithm is designed to give higher priority to users with higher code rate, so that the throughput of network is optimized and at the same time, maintaining the end users¿ service level agreements. The fairness of the proposed scheduling algorithm is validated using OPNET simulation. The simulation results show that the algorithm can fairly allocate resource to different connections not only among different service classes but also within the same service class depending on their QoS attributes.
Inmarsat Global Ltd. BGAN and the European Space Agency (ESA)
APA, Harvard, Vancouver, ISO, and other styles
10

Xu, Kai. "Radio resource management for satellite UMTS : dynamic scheduling algorithm for a UMTS-compatible satellite network." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/5685.

Full text
Abstract:
The third generation of mobile communication systems introduce interactive Multicast and Unicast multimedia services at a fast data rate of up to 2 Mbps and is expected to complete the globalization of the mobile telecommunication systems. The implementation of these services on satellite systems, particularly for broadcast and multicast applications to complement terrestrial services is ideal since satellite systems are capable of providing global coverage in areas not served by terrestrial telecommunication services. However, the main bottleneck of such systems is the scarcity of radio resources for supporting multimedia applications which has resulted in the rapid growth in research efforts for deriving efficient radio resource management techniques. This issue is addressed in this thesis, where the main emphasis is to design a dynamic scheduling framework and algorithm that can improve the overall performance of the radio resource management strategy of a UMTS compatible satellite network, taking into account the unique characteristics of wireless channel conditions. This thesis will initially be focused on the design of the network and functional architecture of a UMTS -compatible satellite network. Based on this architecture, an effective scheduling framework is designed, which can provide different types of resource assigning strategies. A functional model of scheduler is defined to describe the behaviours and interactions between different functional entities. An OPNET simulation model with a complete network protocol stack is developed to validate the performance of the scheduling algorithms implemented in the satellite network. Different types of traffic are considered for the OPNET simulation, such as the Poisson Process, ONOFF Source and Self Similar Process, so that the performance of scheduling algorithm can be analyzed for different types of services. A novel scheduling algorithm is proposed to optimise the channel utilisation by considering the characteristics of the wireless channel, which are bursty and location dependent. In order to overcome the channel errors, different code rates are applied for the user under different channel conditions. The proposed scheduling algorithm is designed to give higher priority to users with higher code rate, so that the throughput of network is optimized and at the same time, maintaining the end users' service level agreements. The fairness of the proposed scheduling algorithm is validated using OPNET simulation. The simulation results show that the algorithm can fairly allocate resource to different connections not only among different service classes but also within the same service class depending on their QoS attributes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Satellite Scheduling"

1

Vazquez Alvarez, Antonio Jose, and Richard Scott Erwin. An Introduction to Optimal Satellite Range Scheduling. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pei, Wang, ed. Duo xing duo zhan ji cheng diao du you hua fang fa. Beijing: Guo fang gong ye chu ban she, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Office, General Accounting. Space communications: Better understanding of scheduling system limitations needed : report to the Chairman, Committee on Science, Space, and Technology, House of Representatives. Washington, D.C: The Office, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alvarez, Antonio Jose Vazquez, and Richard Scott Erwin. An Introduction to Optimal Satellite Range Scheduling. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alvarez, Antonio Jose Vazquez, and Richard Scott Erwin. An Introduction to Optimal Satellite Range Scheduling. Springer, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Automating mission scheduling for space-based observatories. [Washington, DC: National Aeronautics and Space Administration, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alan, Tuchman, Potter William J. 1829?-1893, and United States. National Aeronautics and Space Administration., eds. Using C to build a satellite scheduling expert system 4: Examples from the Explorer platform planning system. [Washington, DC: National Aeronautics and Space Administration, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

T, Guffin O., and United States. National Aeronautics and Space Administration., eds. Mission planning and scheduling concept for the advanced x-ray astrophysics facility (AXAF). Huntsville, Ala: Computer Sciences Corporation, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Office, General Accounting. Space communications: Performance of NASA's White Sands ground terminal : report to the chairman, Committee on Science, Space, and Technology, House of Represenatives. Washington, D.C: The Office, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Satellite Scheduling"

1

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "Optimal Satellite Range Scheduling." In An Introduction to Optimal Satellite Range Scheduling, 49–73. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "Noncooperative Satellite Range Scheduling." In An Introduction to Optimal Satellite Range Scheduling, 77–106. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "Robust Satellite Range Scheduling." In An Introduction to Optimal Satellite Range Scheduling, 107–28. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "Reactive Satellite Range Scheduling." In An Introduction to Optimal Satellite Range Scheduling, 129–47. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "Scheduling Process." In An Introduction to Optimal Satellite Range Scheduling, 11–17. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jiang, Shu, and Nitin H. Vaidya. "Scheduling Data Broadcast." In Internetworking and Computing Over Satellite Networks, 221–37. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0431-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vázquez Álvarez, Antonio José, and Richard Scott Erwin. "The Satellite Range Scheduling Problem." In An Introduction to Optimal Satellite Range Scheduling, 21–47. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25409-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Santosh Kumar, J., and K. Shanti Swarup. "Residential Energy Consumption Scheduling Techniques Under Smart Grid Environment." In Wireless and Satellite Systems, 3–17. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25479-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhuang, Haixiao, Zongbo He, Yuan Tian, Qiang Zhang, and Feilong Jiang. "A New Problem of Resource Scheduling for Cooperative Awareness." In Wireless and Satellite Systems, 14–21. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69072-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pemberton, Joseph, and Galiber. "A constraint-based approach to satellite scheduling." In Constraint Programming and Large Scale Discrete Optimization, 101–14. Providence, Rhode Island: American Mathematical Society, 2001. http://dx.doi.org/10.1090/dimacs/057/06.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Satellite Scheduling"

1

Yun, Sang-Hyuk, Hyo-Sung Ahn, Sun-Ju Park, Ok-Chul Jung, and Dae-Won Chung. "Ground Antenna Scheduling Algorithm for Multi-Satellite Tracking." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48042.

Full text
Abstract:
In this paper, we address the optimal ground antenna scheduling problem for multiple satellites when multiple satellites have visibility conflicts at a ground station. Visibility conflict occurs when multiple satellites have either overlapping visibilities at a ground station or difference with time of loss of signal (LOS) of a satellite and time of acquisition of signal (AOS) of another satellite is less than reconfiguration time of ground station. Each satellite has a priority value that is a weight function with various factors. Multi-antenna scheduling (MAS) algorithm 1 and Multi-antenna scheduling (MAS) algorithm 2 are proposed to find the optimal schedule of multi-antenna at a ground station using pre-assigned priority values of satellites. We use the depth first search (DFS) method to search the optimal schedule in MAS algorithm 1 and MAS algorithm 2. Through the simulations, we confirm the efficiency of these algorithms by comparing with greedy algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Jun, Shuang Cao, Yong Li, and Bin Li. "Satellite Network Range Scheduling." In 2010 9th International Conference on Grid and Cloud Computing (GCC 2010). IEEE, 2010. http://dx.doi.org/10.1109/gcc.2010.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Chao, Patrick De Causmaecker, and Yingwu Chen. "Data-driven Onboard Scheduling for an Autonomous Observation Satellite." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/830.

Full text
Abstract:
Observation requests for autonomous observation satellites are dynamically generated. Considering the limited computing resources, a data-driven onboard scheduling method combining AI techniques and polynomial-time heuristics is proposed in this work. To construct observation schedules, a framework with offline learning and onboard scheduling is adopted. A neural network is trained offline in ground stations to assign the scheduling priority to observation requests in the onboard scheduling, based on the optimized historical schedules obtained by genetic algorithms which are computationally demanding to run onboard. The computational simulations show that the performance of the scheduling heuristic is enhanced using the data-driven framework.
APA, Harvard, Vancouver, ISO, and other styles
4

Soma, P., S. Venkateswarlu, S. Santhalakshmi, Tapan Bagchi, and Sanjay Kumar. "Multi-Satellite Scheduling Using Genetic Algorithms." In Space OPS 2004 Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2004. http://dx.doi.org/10.2514/6.2004-743-515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Soon-mi Han, Seung-woo Beak, Kyuem-rae Cho, Dae-woo Lee, and Hae-dong Kim. "Satellite mission scheduling using genetic algorithm." In SICE 2008 - 47th Annual Conference of the Society of Instrument and Control Engineers of Japan. IEEE, 2008. http://dx.doi.org/10.1109/sice.2008.4654845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vazquez, Antonio J., and R. Scott Erwin. "Robust fixed interval satellite range scheduling." In 2015 IEEE Aerospace Conference. IEEE, 2015. http://dx.doi.org/10.1109/aero.2015.7119277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"Optimal Fixed Interval Satellite Range Scheduling." In International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004760604010408.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ohno, Taijiro, Hiroshi Watanabe, Toru Kawakami, Shouzou Fujita, and Ronald H. Cohen. "Data acquisition scheduling algorithm for multitelescope instrument with pointing function." In Satellite Remote Sensing III, edited by Hiroyuki Fujisada, Guido Calamai, and Martin N. Sweeting. SPIE, 1997. http://dx.doi.org/10.1117/12.265423.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zorn, Alan, and Matt West. "Optimal Attitude Scheduling of an Imaging Satellite." In AIAA Guidance, Navigation, and Control (GNC) Conference. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2013. http://dx.doi.org/10.2514/6.2013-5254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

BARRY, JOHN. "Increasing autonomy through satellite expert system scheduling." In 2nd Space Logistics Symposium. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1988. http://dx.doi.org/10.2514/6.1988-4755.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Satellite Scheduling' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography