Zobrazeno 1 - 10
of 118
pro vyhledávání: '"Banani S"'
We consider scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is that VoLTE users get scheduling priority to receive their required qual
Externí odkaz:
http://arxiv.org/abs/1901.02111
Publikováno v:
In IRBM December 2021 42(6):466-473
We consider the downlink of a two-layer heterogeneous network, comprising macro cells (MCs) and small cells (SCs). The existing literature generally assumes independent placements of the access points (APs) in different layers; in contrast, we analyz
Externí odkaz:
http://arxiv.org/abs/1609.06395
Assuming a network of infinite extent, several researchers have analyzed small-cell networks using a Poisson point process (PPP) location model, leading to simple analytic expressions. The general assumption has been that these results apply to finit
Externí odkaz:
http://arxiv.org/abs/1512.03338
Autor:
Banani, S. Alireza, Adve, Raviraj S.
We analyze the uplink of coordinated multi-point (CoMP) networks in which cooperation can be amongst 2 or 3 base stations (BSs). We consider a 2D network of BSs on a regular hexagonal lattice wherein the cooperation tessellates the 2D plane into coop
Externí odkaz:
http://arxiv.org/abs/1501.04564
Autor:
Banani, S. Alireza, Adve, Raviraj
In this paper we investigate the benefit of base station (BS) cooperation in the uplink of coordinated multi-point (CoMP) networks. Our figure of merit is the required BS density required to meet a chosen rate coverage. Our model assumes a 2-D networ
Externí odkaz:
http://arxiv.org/abs/1309.7009
Autor:
Banani, S. Alireza, Adve, Raviraj S.
In this paper we obtain the required spatial density of base stations (BSs) in a coordinated multi-point uplink cellular network to meet a chosen quality of service metric. Our model assumes cooperation amongst two BSs and the required density is obt
Externí odkaz:
http://arxiv.org/abs/1302.1592
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Banani, S. Javad1 sjbanani@yahoo.com, Lankarani, Kamran B.2,3, Taghavi, Alireza4, Bagheri, Mohammad Hadi5, Sefidbakht, Sepideh5, Geramizadeh, Bita5
Publikováno v:
American Journal of Health-System Pharmacy. 6/1/2008, Vol. 65 Issue 11, p1057-1061. 5p. 3 Charts.
Publikováno v:
IET Quantum Communication, Vol 3, Iss 1, Pp 30-49 (2022)
Abstract Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The k‐clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size k. Modern‐day appl
Externí odkaz:
https://doaj.org/article/7d7e4d404a2b449aa00214380d8d127b