Jaber Kakar

Mr. Jaber Kakar


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 March 2019 in IEEE Access
Verified
Journal Article
Closed access
JKJaber Kakar
Jaber Kakar
SESeyedhamed Ebadifar
Seyedhamed Ebadifar
ASAydin Sezgin
Aydin Sezgin

14 July 2017 in Entropy
Verified
Journal Article
Open access
PDF file
JKJaber Kakar
Jaber Kakar
ASAydin Sezgin
Aydin Sezgin
Recent advances in the characterization of fundamental limits on interference management in wireless networks and the discovery of new communication schemes on how to handle interference led to a better understanding towards the capacity of such networks. The benefits in terms of achievable rates of powerful schemes handling interference, such as interference alignment, are substantial. However, the main issue behind most of these results is the assumption of perfect channel state information at the transmitters (CSIT). In the absence of channel knowledge the performance of various interference networks collapses to what is achievable by time division multiple access (TDMA). Robustinterference management techniques are promising solutions to maintain high achievable rates at various levels of CSIT, ranging from delayed to imperfect CSIT. In this survey, we outline and study two main research perspectives of how to robustly handle interference for cases where CSIT is imprecise on examples for non-distributed and distributed networks, namely broadcast and X-channel. To quantify the performance of these schemes, we use the well-known (generalized) degrees of freedom (GDoF) metric as the pre-log factor of achievable rates. These perspectives maintain the capacity benefits at similar levels as for perfect channel knowledge. These two perspectives are: First,scheme-adaptationthat explicitly accounts for the level of channel knowledge and, second,relay-aided infrastructure enlargementto decrease channel knowledge dependency. The relaxation on CSIT requirements through these perspectives will ultimately lead to practical realizations of robust interference management techniques. The survey concludes with a discussion of open problems.

6 June 2019 in IEEE Access
Verified
Journal Article
Open access
JKJaber Kakar
Jaber Kakar
AAAlaa Alameer Ahmad
Alaa Alameer Ahmad
ACAnas Chaaban
Anas Chaaban
ASAydin Sezgin
Aydin Sezgin
APArogyaswami Paulraj
Arogyaswami Paulraj
An emerging trend of next generation communication systems is to deploy caches at network edges to reduce file delivery latency. To investigate this aspect, we study the fundamental limits of a cache-aided broadcast-relay wireless network consisting of one central base station, M cache-equipped transceivers and K receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency at high signal-to-noise ratio (SNR). The objective is to jointly design the cache placement and file delivery in order to minimize the NDT. To this end, we establish two converse results and two achievability schemes. The first converse result is restricted to one-shot delivery schemes, while the second excludes this restriction. Similarly, the first achievable scheme is a general NDT-optimal one-shot scheme that synergistically exploits both multicasting and distributed zero-forcing opportunities. With respect to the second converse result, this scheme performs well for various parameter settings, particularly at higher cache sizes. The second scheme, effective at lower cache sizes, designs beamformers to facilitate both subspace interference alignment and zero-forcing. Exploiting both schemes, we are able to characterize the optimal tradeoff between cache storage and latency in networks satisfying K+M≤4. The tradeoff illustrates that the NDT is the preferred choice to capture the latency of a system rather than the commonly used sum degrees of freedom (DoF). In fact, our optimal tradeoff refutes the popular belief that increasing cache sizes translates to increasing the achievable sum DoF. As such, we discuss cases where increasing cache sizes decreases both the delivery time and the achievable DoF.

26 May 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JKJaber Kakar
Jaber Kakar
AKAnton Khristoforov
Anton Khristoforov
SESeyedhamed Ebadifar
Seyedhamed Ebadifar
ASAydin Sezgin
Aydin Sezgin
In secure distributed matrix multiplication (SDMM) the multiplication AB from two private matrices A and B is outsourced to N distributed servers. In ℓ-SDMM, the goal is to design a joint communication-computation procedure that optimally balances conflicting communication and computation metrics without leaking any information on both A and B to any set of ℓ<N servers. To this end, the user applies coding with Ãi and Bi representing encoded versions of A and B destined to the i-th server. Now, SDMM involves multiple tradeoffs. One such tradeoff is the tradeoff between upload (UL) and download (DL) costs. To find a good balance between these two metrics, we propose two schemes which we term USCSA and GSCSA that are based on secure cross subspace alignment (SCSA). We show that there are various scenarios where they outperform existing SDMM schemes from the literature with respect to UL-DL efficiency. Next, we implement schemes from the literature, including USCSA and GSCSA, and test their performance on Amazon EC2. Our numerical results show that USCSA and GSCSA establish a good balance between the time spent on the communication and computation in SDMMs. This is because they combine advantages of polynomial codes, namely low time for the upload of Ãi and Bi, i1:N, and the computation of Oi=ÃiBi, with those of SCSA, being a low timing overhead for the download of Oi, i1:N, and the decoding of AB.

27 July 2017 in arXiv
Verified
Preprint
Open access
PDF file
JKJaber Kakar
Jaber Kakar
SGSoheil Gherekhloo
Soheil Gherekhloo
ASAydin Sezgin
Aydin Sezgin
Stringent mobile usage characteristics force wire- less networks to undergo a paradigm shift from conventional connection-centric to content-centric deployment. With respect to 5G, caching and heterogeneous networks (HetNet) are key technologies that will facilitate the evolution of highly content- centric networks by facilitating unified quality of service in terms of low-latency communication. In this paper, we study the impact of transceiver caching on the latency for a HetNet consisting of a single user, a receiver and one cache-assisted transceiver. We define an information-theoretic metric, the delivery time per bit (DTB), that captures the delivery latency. We establish coinciding lower and upper bounds on the DTB as a function of cache size and wireless channel parameters; thus, enabling a complete characterization of the DTB optimality of the network under study. As a result, we identify cache beneficial and non-beneficial channel regimes.

11 March 2018 in arXiv
Verified
Preprint
Open access
PDF file
JKJaber Kakar
Jaber Kakar
ACAnas Chaaban
Anas Chaaban
ASAydin Sezgin
Aydin Sezgin
APArogyaswami Paulraj
Arogyaswami Paulraj
An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency. To investigate the impact of this technique on latency, we study the delivery time of a cache-aided broadcast-relay wireless network consisting of one central base station, $M$ cache-equipped transceivers and $K$ receivers under finite precision channel state information (CSI). We use the normalized delivery time (NDT) to capture the worst-case per-bit latency in a file delivery. Lower and upper bounds on the NDT are derived to understand the influence of $K,M$, cache capacity and channel quality on the NDT. In particular, regimes of NDT-optimality are identified and discussed.