In the field of mobile distributed computing, the term prefetching is used to describe the practice of retrieving data before its actual usage. Doing so results in several beneficial effects for the user, ranging from reduced perceived delay, the possibility to handling lower connection speeds to masking network outages completely. This thesis proposes a prefetch scheduling algorithm. The described algorithm is capable of scheduling requests so that, in a best-case scenario, the results are fetched exactly on-time and no delay at all is experienced by the user (or client code). After discussing some formal concepts necessary as a foundation for the proposed algorithm, a basic idea on how to approach a scenario of volatile network connectivity with a given context (predicted future network quality) is presented. The idea is first stated as a problem of mathematical analysis, and subsequently transformed into a concrete algorithm, of which a reference implementation stub in Java is shown. The second main section of this thesis is a simulation environment capable of reproducibly evaluating the prefetching scenarios by running simulations of mobile units with fluctuating network quality. This thesis presents the architecture of this simulation environment in detail. Following this description, a series of simulation configurations is shown and the resulting simulation outcomes are presented. The results show that the algorithm indeed increases the overall quality of user experience significantly, in the typical use case modelled after a real-world situation by up to 70 %, while maintaining context constraints like limited energy usage. Concluding, the algorithm is put into context of real-world applications and its feasibility is discussed, alongside with possible future fields of research and concepts of enhancement.