Related papers: Wireless Network Information Flow
We analyze a simple dynamical network model which describes the limited capacity of nodes to process the input information. For a suitable choice of the parameters, the information flow pattern is characterized by exponential distribution…
The derivation of ultimate limits to communication over certain quantum repeater networks have provided extremely valuable benchmarks for assessing near-term quantum communication protocols. However, these bounds are usually derived in the…
The rapid growth of the so-called Internet of Things is expected to significantly expand and support the deployment of resource-limited devices. Therefore, intelligent scheduling protocols and technologies such as wireless power transfer,…
The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to…
We propose novel resource allocation algorithms that have the objective of finding a good tradeoff between resource reuse and interference avoidance in wireless networks. To this end, we first study properties of functions that relate the…
This paper studies a wireless network consisting of multiple transmitter-receiver pairs sharing the same spectrum where interference is regarded as noise. Previously, the throughput region of such a network was characterized for either one…
In this paper, we extend the information theoretic framework that was developed in earlier work to multi-hop network settings. For a given network, we construct a novel deterministic model that quantifies the ability of the network in…
In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…
Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid…
The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT…
Strong resilience properties of dynamical flow networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the inflow at a non-destination node gets split among its outgoing links is…
We consider a general class of wireless scheduling and resource allocation problems where the received rate in each link is determined by the actions of the transmitter in that link along with a single dominant interferer. Such scenarios…
We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it…
Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…
Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper,…
We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the…
Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power…
When simultaneous wireless information and power transfer is carried out, a fundamental tradeoff between achievable rate and harvested energy exists because the received power is used for two different purposes. The tradeoff is well…