Sanket Sanjay Kalamkar has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Deployment of Reconfigurable Intelligent Surfaces in the Presence of Blockages

    by Vikrant Malik, Gourab Ghatak, Abhishek K. Gupta, Sanket S. Kalamkar

    Wireless communications aided by reconfigurable intelligent surfaces (RISs) is a promising way to improve the coverage for cellular users. The controlled reflection of signals from RISs is especially useful in mm-wave/THz networks when the direct link between a cellular user and its serving base station (BS) is weak or unavailable due to blockages. However, the joint blockage of the user-RIS and the user-BS links may significantly degrade the performance of RIS-aided transmissions. This paper aims to study the impact of joint blockages on downlink performance. When RIS locations are coupled with BS locations, using tools from stochastic geometry, we obtain an optimal placement of RISs to either minimize the joint blockage probability of the user-RIS and the user-BS links or maximize the downlink coverage probability. The results show that installing RISs near the cell edge of BSs usually provides optimal coverage. Moreover, deploying RISs on street intersections improves the coverage probability. For users associated with BSs that are deployed sufficiently close to intersections, the intersection-mounted RISs offer a better coverage performance as compared to BS-coupled RISs.

  • Radar Detection in Vehicular Networks: Fine-Grained Analysis and Optimal Channel Access

    by Gourab Ghatak, Sanket S. Kalamkar, Yash Gupta

    Automotive radar is a critical feature in advanced driver-assistance systems. It is important in enhancing vehicle safety by detecting the presence of other vehicles in the vicinity. The performance of radar detection is, however, affected by the interference from radars of other vehicles as well as the variation in the target radar cross-section (RCS) due to varying physical features of the target vehicle. Considering such interference and random RCS, this work provides a fine-grained performance analysis of radar detection. Specifically, using stochastic geometry, we calculate the meta distribution of the signal-to-interference-and-noise ratio that permits the reliability analysis of radar detection at individual vehicles. We also evaluate the delay aspect of radar detection, namely, the mean local delay which is the average number of transmission attempts needed until the first successful target detection. For a given target distance, we obtain the optimal transmit probability that maximizes the density of successful radar detection while keeping the mean local delay below a threshold. We also provide several system design insights in terms of the fraction of reliable radar links, transmission delay, the density of vehicles, and congestion control. Finally, leveraging on the derived meta distribution framework, we present an online algorithm to select the transmit probability in a distributed manner, particularly when system parameters such as vehicular density, interferer locations, etc. are unknown to individual vehicles. We demonstrate the efficacy of the proposed online framework for selecting the optimal transmit probability within a deadline of 0.1 ms, which is critical for sustaining automotive safety applications and services.


  • On point processes defined by angular conditions on Delaunay neighbors in the Poisson–Voronoi Tessellation

    by François Baccelli, Sanket S. Kalamkar

    Consider a homogeneous Poisson point process of the Euclidean plane and its Voronoi tessellation. The present note discusses the properties of two stationary point processes associated with the latter and depending on a parameter . The first is the set of points that belong to some one-dimensional facet of the Voronoi tessellation and such that the angle with which they see the two nuclei defining the facet is . The main question of interest on this first point process is its intensity. The second point process is that of the intersections of the said tessellation with a straight line having a random orientation. Its intensity is well known. The intersection points almost surely belong to one-dimensional facets. The main question here concerns the Palm distribution of the angle with which the points of this second point process see the two nuclei associated with the facet. We will give answers to these two questions and briefly discuss their practical motivations. We also discuss natural extensions to three dimensions.


  • Open Access

    Beam Management in 5G: A Stochastic Geometry Analysis

    by Sanket S. Kalamkar, Francois Baccelli, Fuad M. Abinader, Andrea S. Marcano Fani, Luis G. Uzeda Garcia

    Beam management is central in the operation of beamformed wireless cellular systems such as 5G New Radio (NR) networks. Focusing the energy radiated to mobile terminals (MTs) by increasing the number of beams per cell increases signal power and decreases interference, and has hence the potential to bring major improvements on area spectral efficiency (ASE). This paper proposes a first system-level stochastic geometry model encompassing major aspects of the beam management problem: frequencies, antenna configurations, and propagation; physical layer, wireless links, and coding; network geometry, interference, and resource sharing; sensing, signaling, and mobility management. This model leads to a simple analytical expression for the effective rate that the typical user gets in this context. This in turn allows one to find the number of beams per cell and per MT that maximizes the effective ASE by offering the best tradeoff between beamforming gains and beam management operational overheads and costs, for a wide variety of 5G network scenarios including millimeter wave (mmWave) and sub-6 GHz. As part of the system-level analysis, we define and analyze several underlying new and fundamental performance metrics that are of independent interest. The numerical results discuss the effects of different systemic tradeoffs and performance optimizations of mmWave and sub-6 GHz 5G deployments.


  • Maximum Utility-Aware Capacity Partitioning in Cooperative Computing

    by Nitin Singha, Sanket S. Kalamkar, Yatindra Nath Singh

    In many networks, a user has to allocate the link capacity between upload and download. When such networks are used for cooperative computing, the user needs to maintain the division of upload and download capacities at an optimal value to receive the maximum utility. To determine this optimal value, we model upload-download partitioning as a resource maximization game. We show that a Nash equilibrium (NE) obtained for this game is socially optimal. Thus this NE acts as an upper bound on capacity partitioning and serves as a benchmark to analyze the efficiency and performance of various capacity partitioning algorithms. Specifically, using this upper bound and simulations, we examine the performance of different partitioning algorithms while considering the dynamics of resource requests.

  • Open Access

    Stochastic Geometry-Based Modeling and Analysis of Beam Management in 5G

    by Sanket S. Kalamkar, Fuad M. Abinader Jr., François Baccelli, Andrea S. Marcano Fani, Luis G. Uzeda Garcia

    Beam management is central in the operation of dense 5G cellular networks. Focusing the energy radiated to mobile terminals (MTs) by increasing the number of beams per cell increases signal power and decreases interference, and has hence the potential to bring major improvements on area spectral efficiency (ASE). This benefit, however, comes with unavoidable overheads that increase with the number of beams and the MT speed. This paper proposes a first system-level stochastic geometry model encompassing major aspects of the beam management problem: frequencies, antennas, and propagation; physical layer, wireless links, and coding; network geometry, interference, and resource sharing; sensing, signaling, and mobility management. This model leads to a simple analytical expression for the effective ASE that the typical user gets in this context. This in turn allows one to find, for a wide variety of 5G network scenarios including millimeter wave (mmWave) and sub-6 GHz, the number of beams per cell that offers the best global trade-off between these benefits and costs. We finally provide numerical results that discuss the effects of different systemic trade-offs and performances of mmWave and sub-6 GHz 5G deployments.

  • Open Access

    Reliability and Local Delay in Wireless Networks: Does Bandwidth Partitioning Help?

    by Sanket Sanjay Kalamkar

    This paper studies the effect of bandwidth partitioning (BWP) on the reliability and delay performance in infrastructureless wireless networks. The reliability performance is characterized by the density of concurrent transmissions that satisfy a certain reliability (outage) constraint and the delay performance by so-called local delay, defined as the average number of time slots required to successfully transmit a packet. We concentrate on the ultrareliable regime where the target outage probability is close to 0. BWP has two conflicting effects: while the interference is reduced as the concurrent transmissions are divided over multiple frequency bands, the signal-to-interference ratio (SIR) requirement is increased due to smaller allocated bandwidth if the data rate is to be kept constant. Instead, if the SIR requirement is to be kept the same, BWP reduces the data rate and in turn increases the local delay. For these two approaches with adaptive and fixed SIR requirements, we derive closed-form expressions of the local delay and the maximum density of reliable transmissions in the ultrareliable regime. Our analysis shows that, in the ultrareliable regime, BWP leads to the reliability-delay tradeoff.

  • The Spatial Outage Capacity of Wireless Networks

    by Sanket S. Kalamkar, Martin Haenggi

    We address a fundamental question in wireless networks that, surprisingly, has not been studied before: what is the maximum density of concurrently active links that satisfy a certain outage constraint? We call this quantity the spatial outage capacity (SOC), give a rigorous definition, and analyze it for Poisson bipolar networks with ALOHA. Specifically, we provide exact analytical and approximate expressions for the density of links satisfying an outage constraint and give simple upper and lower bounds on the SOC. In the high-reliability regime where the target outage probability is close to zero, we obtain an exact closed-form expression of the SOC, which reveals the interesting and perhaps counter-intuitive result that all transmitters need to be always active to achieve the SOC, i.e., the transmit probability needs to be set to 1 to achieve the SOC.


  • Resource Allocation and Fairness in Wireless Powered Cooperative Cognitive Radio Networks

    by Sanket S. Kalamkar, Jeya Pradha Jeyaraj, Adrish Banerjee, Ketan Rajawat

    We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and jointly performs the time and energy allocation for SUs. In particular, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data. Since the STORA scheme focuses on the sum throughput, it becomes inconsiderate toward individual SU throughput, resulting in low fairness. To enhance fairness, we investigate three resource allocation schemes, which are: 1) equal time allocation; 2) minimum throughput maximization; and 3) proportional time allocation. Simulation results reveal the tradeoff between sum throughput and fairness. The minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but yields the least SU sum throughput.


  • On information and energy cooperation in energy harvesting cognitive radio

    by J Jeya Pradha, Sanket S. Kalamkar, Adrish Banerjee

    This paper considers the cooperation between primary and secondary users at information and energy levels when both users are energy harvesting nodes. In particular, a secondary transmitter helps relaying the primary message, and in turn, gains the spectrum access as a reward. Also, the primary transmitter supplies energy to the secondary transmitter if the latter is energy-constrained, which facilitates an uninterrupted cooperation. We address this two-level cooperation over a finite horizon with the finite battery constraint at the secondary transmitter. While promising the rate-guaranteed service to both primary and secondary users, we aim to maximize the primary rate. We develop an iterative algorithm that obtains the optimal offline power policies for primary and secondary users. To acquire insights about the structure of the optimal solution, we examine specific scenarios. Furthermore, we investigate the effects of the secondary rate constraint and finite battery on the primary rate and the probability of cooperation. We show that the joint information and energy cooperation increases the chances of cooperation and achieves significant rate gains over only information cooperation.