The persistent data-ferrying problem has a naturally cascaded structure between vehicle and communication dynamics, allowing the wireless link scheduling optimization to be encapsulated within a path-planning optimization problem. This work derives and analyzes policies to solve the inner link scheduling problem quickly. Given a path and properties about the communication environment, the link scheduling problem is formulated as a binary integer linear program with unique ferrying constraints. The performances of several heuristic link scheduling policies are analyzed in terms of computation effort and achievable throughput of the solution. The performance characteristics are then validated through simulation, showing that the greedy knapsack solution achieves within 99% of the optimal allocation in less than 2% of the computation time compared to traditional solvers. The quickness of this policy reduces the computational complexity needed to solve the full data-ferry problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Link Scheduling Policies for Persistent Data Ferrying


    Contributors:

    Published in:

    Publication date :

    2016-12-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Cascaded Optimization of Aircraft Trajectories for Persistent Data Ferrying

    Carfang, Anthony J. / Frew, Eric W. / Kingston, Derek B. | AIAA | 2014


    A Cascaded Approach to Optimal Aircraft Trajectories for Persistent Data Ferrying

    Carfang, Anthony J. / Frew, Eric W. / Kingston, Derek | AIAA | 2013


    Ferrying Services

    Online Contents | 1994


    Electric ferrying vehicle

    YANG ZHUOSHU / WANG FENG / ZHOU QI et al. | European Patent Office | 2016

    Free access

    A Cascaded Approach to Optimal Aircraft Trajectories for Persistent Data Ferrying (AIAA 2013-4558)

    Carfang, A.J. / Frew, E.W. / Kingston, D. et al. | British Library Conference Proceedings | 2013