相关论文: Unique coverage in Boolean models
By moving to millimeter wave (mmWave) frequencies, base stations (BSs) will be densely deployed to provide seamless coverage in sixth generation (6G) mobile communication systems, which, unfortunately, leads to severe cell-edge problem. In…
The performance of a cellular network can be significantly improved by employing many base stations (BSs), which shortens transmission distances. However, there exist no known results on quantifying the performance gains from deploying many…
The present work considers the localization problem in wireless sensor networks formed by fixed nodes. Each node seeks to estimate its own position based on noisy measurements of the relative distance to other nodes. In a centralized batch…
Massive multiple-input multiple-output (MIMO) is a transmission technique for cellular systems that uses many antennas to support not-as-many users. Thus far, the performance of massive MIMO has only been examined in finite cellular…
Despite coverage enhancement in rural areas is one of the main requirements in next generations of wireless networks (i.e., 5G and 6G), the low expected profit prevents telecommunication providers from investing in such sparsely populated…
While analyzing mobile systems we often approximate the actual coverage surface and assume an ideal cell shape. In a multi-cellular network, because of its tessellating nature, a hexagon is more preferred than a circular geometry. Despite…
This work explores the flexible assignment of users to beams in order to match the non-uniform traffic demand in satellite systems, breaking the conventional cell boundaries and serving users potentially by non-dominant beams. The…
We study norm-based uniform convergence bounds for neural networks, aiming at a tight understanding of how these are affected by the architecture and type of norm constraint, for the simple class of scalar-valued one-hidden-layer networks,…
In this paper, we address the deployment of base stations (BSs) in a one-dimensional network in which the users are randomly distributed.In order to take into account the users' distribution to optimally place the BSs we optimize the uplink…
We study the degrees of freedom (DoF) of cellular networks in which a full duplex (FD) base station (BS) equipped with multiple transmit and receive antennas communicates with multiple mobile users. We consider two different scenarios. In…
Small-cell deployment in licensed and unlicensed spectrum is considered to be one of the key approaches to cope with the ongoing wireless data demand explosion. Compared to traditional cellular base stations with large transmission power,…
User pairing in Non-Orthogonal Multiple-Access (NOMA) uplink based on channel state information is investigated considering some predefined power allocation schemes. The base station divides the set of users into disjunct pairs and assigns…
Motivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views…
We introduce a unified framework for analyzing utility regions of wireless networks, with a focus on signal-to-interference-plus-noise-ratio (SINR) and achievable rate regions. The framework provides valuable insights into interference…
Small cells deployed in licensed spectrum and unlicensed access via WiFi provide different ways of expanding wireless services to low mobility users. That reduces the demand for conventional macro-cellular networks, which are better suited…
The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple…
The number of users that can be spatially multiplexed by a wireless access point depends on the aperture of its antenna array. When the aperture increases and wavelength shrinks, "new" electromagnetic phenomena can be utilized to further…
The speed of an exhaustive search can be measured by a cover time, which is defined as the time it takes a random searcher to visit every state in some target set. Cover times have been studied in both the physics and probability…
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing/communication radius. Based on the…
In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational…