Computational complexity reduction algorithms for Markov decision process based vertical handoff in mobile networks,International Journal of Communication Systems

当前位置： X-MOL 学术 › Int. J. Commun. Syst. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Computational complexity reduction algorithms for Markov decision process based vertical handoff in mobile networks
International Journal of Communication Systems ( IF 1.7 ) Pub Date : 2021-07-28 , DOI: 10.1002/dac.4938
Rida Gillani ₁ , Ali Nasir ₁

Affiliation

Vertical handoff is a major concern in the operation of mobile connections. Multiple wireless networks collate to provide smooth and quality service to the users over mobile connections. This paper formulates a Markov decision process for handoff decisions with a sample space that includes a union of parameters that are important for making a handoff decision. The major contribution of this paper is to propose three different yet closely related algorithms for reducing the computational complexity of the original problem. In particular, we propose a feature-wise assessment algorithm, a network-wise assessment algorithm, and a hybrid approach for computational complexity reduction. Discussed algorithms give pseudo-optimal solutions with a significant reduction in computational complexity. Results indicate that different complexity reduction algorithms perform best under different circumstances. This provides a guideline for the selection of complexity reduction algorithms based on real scenarios.

中文翻译：

移动网络中基于马尔可夫决策过程的垂直切换计算复杂度降低算法

垂直切换是移动连接操作中的一个主要问题。多个无线网络整合在一起，通过移动连接为用户提供流畅和优质的服务。本文为切换决策制定了马尔可夫决策过程，其样本空间包括对做出切换决策很重要的参数联合。本文的主要贡献是提出了三种不同但密切相关的算法，以降低原始问题的计算复杂度。特别是，我们提出了一种特征评估算法、一种网络评估算法和一种降低计算复杂性的混合方法。讨论的算法给出了伪最优解，并显着降低了计算复杂性。结果表明，不同的复杂度降低算法在不同的情况下表现最佳。这为选择基于真实场景的复杂度降低算法提供了指导。

更新日期：2021-09-10

点击分享查看原文

点击收藏

阅读更多本刊最新论文本刊介绍/投稿指南11