A
Abhay Karandikar
Researcher at Indian Institute of Technology Bombay
Publications - 184
Citations - 1867
Abhay Karandikar is an academic researcher from Indian Institute of Technology Bombay. The author has contributed to research in topics: Wireless network & Cellular network. The author has an hindex of 23, co-authored 176 publications receiving 1673 citations. Previous affiliations of Abhay Karandikar include Savitribai Phule Pune University & Center for Excellence in Education.
Papers
More filters
Journal ArticleDOI
An on-line learning algorithm for energy efficient delay constrained scheduling over a fading channel
TL;DR: A new approach for on-line implementation of the optimal packet scheduling algorithm is proposed based on reformulating the value iteration equation by introducing a virtual state called post-decision state that becomes amenable to online implementation based on stochastic approximation.
Posted Content
Quantitative Assessment of TV White Space in India
TL;DR: Comprehensive quantitative assessment and estimates for the TV white space in the 470-590 MHz band for four zones of India (all except north) are presented, this is the first effort in India to estimate TV white spaces in a comprehensive manner.
Proceedings ArticleDOI
Quantitative assessment of TV white space in India
TL;DR: In this paper, a comprehensive quantitative assessment and estimates for the TV white space in the 470-590MHz band for four zones of India (all except north) are presented in the UHF TV band.
Journal ArticleDOI
Toward enabling broadband for a billion plus population with TV white spaces
Animesh Kumar,Abhay Karandikar,Gaurang Naik,Meghna Khaturia,Shubham Saha,Mahak Arora,Jaspreet Singh +6 more
TL;DR: This exposition articulate how TV white space can address the challenge in providing broadband connectivity to a billion plus population within India and presents results from the television white space testbed that support the effectiveness of backhaul by using TV white spaces.
Journal ArticleDOI
Structural Properties of Optimal Transmission Policies Over a Randomly Varying Channel
TL;DR: By casting the problem of transmitting packets over a randomly varying point to point channel as a constrained Markov decision process in discrete time with time-averaged costs, structural results about the dependence of the optimal policy on buffer occupancy, number of packet arrivals in the previous slot and the channel fading state are proved.