Related papers: Optimal Paths on the Space-Time SINR Random Graph
We consider the problem of optimally allocating resources across a set of transmitters and receivers in a wireless network. The resulting optimization problem takes the form of constrained statistical learning, in which solutions can be…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
Over the past decade, many works on the modeling of wireless networks using stochastic geometry have been proposed. Results about probability of coverage, throughput or mean interference, have been provided for a wide variety of networks…
We consider the problem of allocating radio channels to links in a wireless network. Links interact through interference, modelled as a conflict graph (i.e., two interfering links cannot be simultaneously active on the same channel). We aim…
Recently, wireless communication industries have begun to extend their services to machine-type communication devices as well as to user equipments. Such machine-type communication devices as meters and sensors need intermittent uplink…
The current analysis of wireless networks whose transceivers are confined to streets is largely based on Poissonian models, such as Poisson line processes and Poisson line Cox processes. We demonstrate important scenarios where a model with…
Recent work has shown that adaptive CSMA algorithms can achieve throughput optimality. However, these adaptive CSMA algorithms assume a rather simplistic model for the wireless medium. Specifically, the interference is typically modelled by…
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned…
We focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system…
Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…
We investigate the optimal transport (OT) problem over networks, wherein supply and demand are conceptualized as temporal marginals governing departure rates of particles from source nodes and arrival rates at sink nodes. This setting…
We give numerically tractable, explicit integral expressions for the distribution of the signal-to-interference-and-noise-ratio (SINR) experienced by a typical user in the down-link channel from the k-th strongest base stations of a…
Impact of mobility will be increasingly important in future generation wireless services and the related challenges will need to be addressed. Sojourn time, the time duration that a mobile user stays within a cell, is a mobility-aware…
This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…
Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected and at the same time the maximum of accumulated…
We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an…
We address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random linear network…
This paper addresses the robust adaptive beamforming (RAB) problem via the worst-case signal-to-interference-plus-noise ratio (SINR) maximization over distributional uncertainty sets for the random interference-plus-noise covariance (INC)…
We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We investigate the optimal input distribution with respect to…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…