16 citations · 35 across the 8 of their papers we have counts for
9 papers
Completely Uncoupled User Association Algorithms for State Dependent Wireless Networks
S. Ramakrishnan, Venkatesh Ramaiyan, K. P. Naveen
We study a distributed user association algorithm for a heterogeneous wireless network with the objective of maximizing the sum of the utilities (on the received throughput of wire…
Efficient-UCBV: An Almost Optimal Algorithm using Variance Estimates
Subhojyoti Mukherjee, K. P. Naveen, Nandan Sudarsanam +1
We propose a novel variant of the UCB algorithm (referred to as Efficient-UCB-Variance (EUCBV)) for minimizing cumulative regret in the stochastic multi-armed bandit (MAB) setting.…
Thresholding Bandits with Augmented UCB
Subhojyoti Mukherjee, K. P. Naveen, Nandan Sudarsanam +1
In this paper we propose the Augmented-UCB (AugUCB) algorithm for a fixed-budget version of the thresholding bandit problem (TBP), where the objective is to identify a set of arms…
Competitive Selection of Ephemeral Relays in Wireless Networks
K. P. Naveen, Anurag Kumar, Eitan Altman
We consider a setting in which two nodes (referred to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally become available (e.g., wake up from a…
QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks
Abhijit Bhattacharya, Akhila Rao, K. P. Naveen +3
We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireles…
Optimal Sequential Wireless Relay Placement on a Random Lattice Path
Abhishek Sinha, Arpan Chattopadhyay, K. P. Naveen +2
Our work is motivated by the need for impromptu (or "as-you-go") deployment of relay nodes (for establishing a packet communication path with a control centre) by fire-men/commando…