Related papers: Flow-level performance of random wireless networks

Proportional fair scheduling (PFS) has been adopted as a standard solution for fair resource allocation in modern wireless cellular networks. With the emergence of heterogeneous networks with widely varying user loads, it is of great…

The spatial-and-temporal correlation of interference has been well studied in Poisson networks where the interfering base stations (BSs) are independent of each other. However, there exists spatial interdependence including attraction and…

Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…

The industry is satisfying the increasing demand for wireless bandwidth by densely deploying a large number of access points which are centrally managed, e.g. enterprise WiFi networks deployed in university campuses, companies, airports…

We study, in this paper, the impact of imperfect small cell positioning with respect to traffic hotspots in cellular networks. In order to derive the throughput distribution in macro and small cells, we firstly perform static level analysis…

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

This paper investigates the benefits of cooperation and proposes a relay activation strategy for a large wireless network with multiple transmitters. In this framework, some nodes cooperate with a nearby node that acts as a relay, using the…

Two-way relaying in wireless systems has initiated a large research effort during the past few years. While one-way relay with a single data flow introduces loss in spectral efficiency due to its half-duplex operation, two-way relaying…

In a large-scale wireless ad hoc network in which all transmitters form a homogeneous of Poisson point process, the statistics of the signal-to-interference ratio (SIR) in prior work is only derived in closed-form for the case of Rayleigh…

Network densification with small cell base stations is a promising solution to satisfy future data traffic demands. However, increasing small cell base station density alone does not ensure better users quality-of-experience and incurs high…

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Inspired by biological swimming and flying with distributed sensing, we propose a data-driven approach for load estimation that relies on complex networks. We exploit sparse, real-time pressure inputs, combined with pre-trained transition…

In this paper, we consider the stochastic network with dynamic traffic. The spatial distribution of access points (APs) and users are first modeled as mutually independent Poisson point processes (PPPs). Different from most previous…

Reaction-diffusion processes can be adopted to model a large number of dynamics on complex networks, such as transport processes or epidemic outbreaks. In most cases, however, they have been studied from a fermionic perspective, in which…

This letter shows that the flexible association of possibly multiple base stations (BSs) to each user over multiple frequency bands, along with the joint optimization of BS transmit power that encourages the turning-off of the BSs at…

We consider transport networks with nodes scattered at random in a large domain. At certain local rates, the nodes generate traffic flowing according to some navigation scheme in a given direction. In the thermodynamic limit of a growing…

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if…

In wireless distributed computing, networked nodes perform intermediate computations over data placed in their memory and exchange these intermediate values to calculate function values. In this paper we consider an asymmetric setting where…

Predicting performance-related behavior of the underlying network structure becomes more and more indispensable in terms of the aspired application outcome quality. However, the reliable forecast of QoS metrics like packet transfer delay in…