Demo Data from EDBT 2026 / reviewers in the wild / expert
Aanchal Phutela
dblp:220/3150
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0003-2928-6586ORCID · reported
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 |
Routing and switching · 56% Internet of things and sensor networks · 36% Wireless networking · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet of things and sensor networks
opportunistic networks |
1.0 | 1 | 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach · IEEE Trans. Mob. Comput. 2026 |
Routing and switching › adaptive routing
reinforcement-learning-based routing |
1.0 | 1 | 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach · IEEE Trans. Mob. Comput. 2026 |
Routing and switching
routing |
1.0 | 1 | 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks
message delivery |
0.3 | 1 | 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach · IEEE Trans. Mob. Comput. 2026 |
Wireless networking
mobile ad hoc networks |
0.3 | 1 | 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
upper confidence bound · 1.0reinforcement learning · 1.0multi-armed bandit · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | CBAR: A Cooperative Buffer-Aware Routing using node reliability for Opportunistic IoT Networks
Aanchal Phutela, Sujata Pal, Srinivas Sampalli |
Ad Hoc Networks | 1 |
| 2026 | LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit ApproachabstractEfficient routing protocols are required in opportunistic networks due to the inherent challenges of sporadic connectivity, transmission delays, and dynamic network topologies. In these networks, information is forwarded and disseminated among smart devices based on opportunistic contacts driven primarily by network dynamics and user mobility. This paper introducesLearnRouter, a dynamic reinforcement learning-based routing algorithm designed to improve the message delivery ratio while minimizing end-to-end delay in opportunistic networks. Existing routing protocols use static strategies or fixed replication schemes, leading to resource utilization and high message drop rates. LearnRouter addresses these challenges by incorporating the multi-armed bandit framework and utilizing the Upper Confidence Bound algorithm to make more intelligent and data-driven forwarding decisions. The proposed approach enables the protocol to adapt continuously to network changes while balancing the trade-off between exploration and exploitation. The simulation results show that LearnRouter surpasses end-to-end delay and message delivery ratio in comparison with Direct Delivery, Spray and Wait, CBR, SimRouter, RL-Prophet, and K-DQLR in opportunistic and dynamic environments. Aanchal Phutela, Shiva Koshta, Sujata Pal, Srinivas Sampalli |
IEEE Trans. Mob. Comput. | 1 |