Related papers: Minimizing the Maximum Interference is Hard
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges. This…
Interference alignment (IA) is a revolutionary wireless transmission strategy that reduces the impact of interference. The idea of interference alignment is to coordinate multiple transmitters so that their mutual interference aligns at the…
This paper considers multiple-input multiple-output (MIMO) relay communication in multi-cellular (interference) systems in which MIMO source-destination pairs communicate simultaneously. It is assumed that due to severe attenuation and/or…
The wireless sensor network is a collection of energy-constrained nodes. Their objective is to sense, collect and process information for some ad-hoc purpose. Typically the nodes are deployed in geographically inaccessible regions. Thus the…
It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard.…
We develop a new framework for measuring and comparing the accuracy of any wireless interference models used in the analysis and design of wireless networks. Our approach is based on a new index that assesses the ability of the interference…
In optimizing the topology of wireless networks built of a dynamic set of spatially embedded agents, there are many trade-offs to be dealt with. The network should preferably be as small (in the sense that the average, or maximal,…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…
We present a mathematical model for communication subject to both network interference and noise. We introduce a framework where the interferers are scattered according to a spatial Poisson process, and are operating asynchronously in a…
It is well known that minimum received energy per bit in the interference channel is -1.59dB as if there were no interference. Thus, the best way to mitigate interference is to operate the interference channel in the low-SNR regime.…
Interference Management is a vast topic present in many disciplines. The majority of wireless standards suffer the drawback of interference intrusion and the network efficiency drop due to that. Traditionally, interference management has…
Critical transmission ranges (or radii) in wireless ad-hoc and sensor networks have been extensively investigated for various performance metrics such as connectivity, coverage, power assignment and energy consumption. However, the regions…
The recent advances in modelling nonlinear interference of systems operating beyond the C-band are discussed. Estimation accuracy as well as computational complexity of current approaches are compared and addressed.
Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in…
In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…
Consider a consensus-driven multi-agent dynamic system. The interaction range, which defines the set of neighbors for each agent, plays a key role in influencing connectivity of the underlying network. In this paper, we assume the system is…
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…
Starting from first principles of wave propagation, we consider a multiple-input multiple-output (MIMO) representation of a communication system between two spatially-continuous volumes. This is the concept of holographic MIMO…