Minimizing File Transfer Time in Opportunistic Spectrum Access Model
Minimizing File Transfer Time in Opportunistic Spectrum Access Model
复制标题
DOI：
10.1109/tmc.2022.3212926
复制
发表时间：
2022-10
影响因子：
7.9
通讯作者：
Jie Hu;Vishwaraj Doshi;Do Young Eun
中科院分区：
文献类型：
--
作者：
Jie Hu;Vishwaraj Doshi;Do Young Eun
我们研究了机会频谱接入（OSA）模型中的文件传输问题，该模型在面向吞吐量的应用中得到了广泛的研究，最大吞吐量策略和延迟相关的工作通常假设相同的信道速率和固定的文件大小。我们的工作明确考虑最小化文件传输时间为一个给定的文件在一组异质速率伯努利通道，表明最大吞吐量的政策一般不会最小化文件传输时间。我们制定了一个数学框架，静态扩展到动态的政策，我们的文件传输问题映射到一个随机的最短路径问题。我们分析了我们提出的静态和动态的最佳政策的最大吞吐量政策的性能。我们提出了一个混合整数规划公式作为一种有效的替代方法来获得动态最优策略，并显示出巨大的减少计算时间。然后，我们提出了一个启发式的政策，考虑到性能的复杂性权衡，并考虑在线实现与未知的信道参数。此外，我们提出了数值模拟来支持我们的分析结果，并讨论了切换延迟对不同的政策的影响。最后，我们将文件传输问题扩展到马尔可夫信道，并证明了每个信道的相关性的影响。
We study the file transfer problem in opportunistic spectrum access (OSA) model, which has been widely studied in throughput-oriented applications for max-throughput strategies and in delay-related works that commonly assume identical channel rates and fixed file sizes. Our work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transfer time in general. We formulate a mathematical framework for static extend to dynamic policies by mapping our file transfer problem to a stochastic shortest path problem. We analyze the performance of our proposed static and dynamic optimal policies over the max-throughput policy. We propose a mixed-integer programming formulation as an efficient alternative way to obtain the dynamic optimal policy and show a huge reduction in computation time. Then, we propose a heuristic policy that takes into account the performance-complexity tradeoff and consider the online implementation with unknown channel parameters. Furthermore, we present numerical simulations to support our analytical results and discuss the effect of switching delay on different policies. Finally, we extend the file transfer problem to Markovian channels and demonstrate the impact of the correlation of each channel.