Demo Data from EDBT 2026 / reviewers in the wild / expert
Tushar Bose
dblp:322/3423
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2024
0000-0002-4749-9254ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-author · 4 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 |
Optical networks · 44% Cellular and mobile networks · 44% Network optimization and economics · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cellular and mobile networks › radio access networks › cellular access
5g radio access network |
0.8 | 1 | 2024 | Planning Cost-Efficient FiWi Access Network With Joint Deployment of FWA and FTTH · IEEE Trans. Commun. 2024 |
Optical networks › optical access network
fiber-wireless access network |
0.8 | 1 | 2024 | Planning Cost-Efficient FiWi Access Network With Joint Deployment of FWA and FTTH · IEEE Trans. Commun. 2024 |
Network optimization and economics
resource allocation |
0.2 | 1 | 2024 | Planning Cost-Efficient FiWi Access Network With Joint Deployment of FWA and FTTH · IEEE Trans. Commun. 2024 |
Methods — techniques the papers use, named apart from their topics
topology optimization · 0.8convex optimization · 0.8beamforming · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | DeMPUP: Energy-Efficient UPF Placement for Beyond 5G Social Metaverse TrafficabstractThe future social metaverse traffic demands over 5G and beyond (B5G) networks can be supported by efficiently placing the user plane function (UPF). Third-generation partnership project (3GPP) standard mandates that all application traffic in B5G core network must be routed through a UPF before it can reach its destination. In this regard, we propose an optimal UPF placement algorithm, referred to as Decomposed Minimum Power UPF Placement (DeMPUP), which selects the minimum power consumption path from the next-generation node B (gNB) to the edge server on the overlay backbone network. Coupled with the optimal path selection, the proposed algorithm also identifies the optimal node over which the UPF would be placed. We provide a power consumption model of the core network with a corresponding joint non-linear programming (NLP) minimization problem for UPF placement. Owing to the high complexity of the formulated NLP, for enhanced scalability over large B5G cores, we decompose the problem into two sub-problems. The first sub-problem identifies a set of feasible paths commensurate with UPF power requirement, and the subsequent sub-problem selects the optimum path among the feasible paths that minimizes the power consumption. The selected path also uniquely identifies the node to place the UPF for minimum power consumption. Analysis of DeMPUP shows that it executes in linear time and scales linearly with the number of nodes. Experimental results reveal significant power reduction for different network sizes. Nairit Das, Kounteya Sarkar, Tushar Bose, Aneek Adhya, Sudip Misra |
GLOBECOM | 3 |
| 2024 | Planning Cost-Efficient FiWi Access Network With Joint Deployment of FWA and FTTHabstractThis paper investigates the deployment of a cost-efficient fiber-wireless (FiWi) access network with joint utilization of fixed wireless access (FWA) and fiber-to-the-home (FTTH) technologies. In this work, we consider that residential users over a geographical area are to be provided with network services, constrained by the available network resources. We explore the implementation of hybrid FiWi access network that integrates a fiber-based passive optical network (PON) and fifth-generation (5G) wireless access network to provide efficient network services. This paper proposes a methodology for topology optimization of FiWi access networks, considering the usage of three-dimensional (3D) beamforming and 3D resource grid for downlink transmission from the gNB to the users in 5G scenario. We derive the beam codebook and generate multiple beams to simultaneously serve the spatially separated users. We derive the closed-form expression for millimeter-wave channel model incorporating large-scale and small-scale parameters to compute the effective SINR of users. Further, we propose an optimization framework for optimal resource allocation (i.e., beam and resource block) by utilizing the 3D resource grid for downlink transmission. We perform extensive simulations to demonstrate the effectiveness of the proposed methodology for various 3GPP 5G outdoor propagation scenarios, viz., RMa, UMa, and UMi-street canyon. Nilesh Chatur, Tushar Bose, Aneek Adhya |
IEEE Trans. Commun. | 2 |
| 2024 | Caching and Computing Resource Allocation in Cooperative Heterogeneous 5G Edge Networks Using Deep Reinforcement LearningabstractIn this work, we explore a framework for a 5G non-standalone (NSA) heterogeneous network, to meet heterogeneous content requests for users moving in vehicles. We consider that an enhanced NodeB (eNB) acts as a macrocell and next-generation NodeBs (gNBs) act as the small cells. To reduce the downstream latency, entire (or part) of the popular contents are fetched from the core network and cached (stored) at the eNB and gNBs. The computing resources are required at the eNB and gNBs along with the caching resources, for content compression and decompression, leading to a reduced requirement for the caching resources. The eNB and gNBs cooperatively decide on the resources (caching and computing) to be allocated. In this network planning approach, first we compute the optimal coverage radius of the eNB and gNBs. Thereafter, we identify the optimal number of non-overlapping gNBs under the coverage area of the eNB. Finally, we propose a novel deep-Q network (DQN)-based algorithm to train the centralized controller agent so as to identify an optimal policy for caching and computing resource allocation. In case the content popularity and road traffic condition change, the agent can be trained again so as to identify a new optimal policy. We also explore the resource allocation policy using other optimization techniques, such as pattern search, genetic algorithm, and multi-start search. The proposed DQN-based algorithm is scalable and shows an average percentage gain of 66.52%, 76.31%, and 53.64% in terms of computation time to identify an optimal policy for caching and computing resource allocation, over pattern search, genetic algorithm, and multi-start search technique, respectively. Tushar Bose, Nilesh Chatur, Sonil Baberwal, Aneek Adhya |
IEEE Trans. Netw. Serv. Manag. | 1 |
| 2022 | Improving Quality-of-Service in Cluster-Based UAV-Assisted Edge NetworksabstractWith millions of devices connected together, the Internet of Things (IoT) has become an emerging technology for future wireless networks. The ever-increasing number of smart devices and data hungry applications demand a high Quality-of-Service (QoS) for IoT. In conventional networks, data being sent to cloud for computational purpose leads to poor QoS. In order to address QoS challenges, mobile edge networks have emerged as a promising solution. In edge networks, bringing the networks resources closer to the end devices results in improved QoS. The maneuverability and the ease of versatile deployment coupled with cost efficiency makes unmanned aerial vehicles (UAVs) a promising candidate for future edge networks. The UAVs can act as edge servers to provide computational capabilities and improved services to the edge devices. Due to the flying ability, UAVs can establish better line-of-sight link with the ground devices. In this paper, we consider that the edge devices in the area of interest have to be facilitated with a certain desired QoS, which is based on the notion of outage probability of the wireless link between the UAV and the edge devices. In this context, we first propose a novel method that computes the optimum height at which UAV should hover, resulting in maximum coverage radius with sufficiently small outage probability. Then the geographical area is divided in optimal number of clusters using a novel algorithm based on K-means clustering. The method computes the optimum number of UAVs required for covering the area of interest. Each of the UAVs utilizes 3D beamforming in order to cover its own coverage area. For this purpose, we are taking coordinate transformation of the original area and forming a wide beam to cover the desired area. The obtained results demonstrate the effectiveness of the proposed method when compared to existing methods, which validate the utilization of the proposed method over large scale network applications. Tushar Bose, Aala Suresh, Om Jee Pandey, Linga Reddy Cenkeramaddi, Rajesh M. Hegde |
IEEE Trans. Netw. Serv. Manag. | 1 |