Related papers: An Algorithmic Solution for Computing Circle Inter…
Intersection detection between three-dimensional bodies has various applications in computer graphics, video game development, robotics as well as military industries. In some respects, entities do not want to disclose sensitive information…
The Split Packing algorithm \cite{splitpacking_ws, splitpackingsoda, splitpacking} is an offline algorithm that packs a set of circles into triangles and squares up to critical density. In this paper, we develop an online alternative to…
We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the…
With the recent explosion of publicly available biological data, the analysis of networks has gained significant interest. In particular, recent promising results in Neuroscience show that the way neurons and areas of the brain are…
Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions…
While well-known methods to list the intersections of either a list of segments or a complex polygon aim at achieving optimal time-complexity they often do so at the cost of memory comsumption and complex code. Real-life software…
Multi-tier architecture improves the spatial reuse of radio spectrum in cellular networks, but it introduces complicated heterogeneity in the spatial distribution of transmitters, which brings new challenges in interference analysis. In…
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…
This work aims to jointly optimize the coding and node selection to minimize the processing time for distributed computing tasks over wireless edge networks. Since the joint optimization problem formulation is NP-hard and nonlinear, we…
This work addresses the challenge of minimizing the energy consumption of a wireless communication network by joint optimization of the base station transmit power and the cell activity. A mixed-integer nonlinear optimization problem is…
In a graph, a community may be loosely defined as a group of nodes that are more closely connected to one another than to the rest of the graph. While there are a variety of metrics that can be used to specify the quality of a given…
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed number of crossings on a given set $S$ of points, while…
The reconfigurable intelligent surface (RIS) is a promising technology that is anticipated to enable high spectrum and energy efficiencies in future wireless communication networks. This paper investigates optimum location-based RIS…
This paper is concerned with the channel estimation problem in millimetre wave (MMW) wireless systems with large antenna arrays. By exploiting the sparse nature of the MMW channel, we present an efficient estimation algorithm based on a…
This work studies the problem of secrecy energy efficiency maximization in multi-user wireless networks aided by reconfigurable intelligent surfaces, in which an eavesdropper overhears the uplink communication. A provably convergent…
Rate-splitting multiple access (RSMA) has emerged as a promising technique for efficient interference management in next-generation wireless networks. While most existing studies focus on downlink and single-cell designs, the modeling and…
The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number is computationally expensive. Hence, a number of…
To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…
An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…
A novel technique is proposed to optimize energy efficiency for wireless networks based on hierarchical mobile clustering. The new bi-level clustering technique minimizes mutual interference and energy consumption in large-scale tracking…