Pratyashi Satapathy

dblp:319/8949 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0001-7614-8587ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Cellular and mobile networks · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobility management
handover optimization
1.012026
Handover Optimization Using a Dynamic $\epsilon$-Greedy Based Q-Learning and a Hybrid MCDM Approach in Heterogeneous Networks · IEEE Trans. Mob. Comput. 2026
Cellular and mobile networks
heterogeneous networks
1.012026
Handover Optimization Using a Dynamic $\epsilon$-Greedy Based Q-Learning and a Hybrid MCDM Approach in Heterogeneous Networks · IEEE Trans. Mob. Comput. 2026
Cellular and mobile networks › mobility management › handover
vertical handover
1.012026
Handover Optimization Using a Dynamic $\epsilon$-Greedy Based Q-Learning and a Hybrid MCDM Approach in Heterogeneous Networks · IEEE Trans. Mob. Comput. 2026
Cellular and mobile networks
mobility management
0.312026
Handover Optimization Using a Dynamic $\epsilon$-Greedy Based Q-Learning and a Hybrid MCDM Approach in Heterogeneous Networks · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

q-learning · 1.0multi-criteria decision making · 1.0epsilon-greedy · 1.0
YearPublicationVenuePosition
2026 Handover Optimization Using a Dynamic $\epsilon$-Greedy Based Q-Learning and a Hybrid MCDM Approach in Heterogeneous Networks
abstract
Heterogeneous network is a dedicated approach to leveraging the potential benefits of all existing wireless networks by integrating diverse radio access technologies with varying specifications to fulfill the demands of mobile users. Two primary factors that influence a mobile user to switch network connections are their mobility and changing network conditions. An efficient vertical handover solution can enable the seamless transfer of an ongoing user's connection to a better-suited network. This paper proposes an intelligent, optimized vertical handover decision algorithm with a two-phase approach. First, a feasible network category (i.e., small cell or macro cell) is determined based on user speed. This phase ensures fast-moving users do not experience handover abnormalities during communication. Then, an optimal target node is selected from this feasible set using a hybrid multi-criteria decision-making approach. Second, a dynamic$\epsilon$-greedy-based Q-learning technique is employed to learn the near-optimal handover triggering point, ensuring timely and successful handover execution. Crucially, the$\epsilon$value is not rigidly fixed; instead, it adapts dynamically, driven by rewards from the environment. The conclusions drawn from network simulations illustrate that the proposed algorithm outperforms other existing algorithms by minimizing handover delays, ping-pong effects, failure rates, and packet loss rates.
Pratyashi Satapathy, Judhistir Mahapatro, Maheswar Rajagopal
IEEE Trans. Mob. Comput.1
2023 An adaptive context-aware vertical handover decision algorithm for heterogeneous networks
Pratyashi Satapathy, Judhistir Mahapatro
Comput. Commun.1