Related papers: Interference Spins: Scheduling of Multiple Interfe…
We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of the…
This paper investigates the problem of link scheduling to meet traffic demands with minimum airtime in a multi-transmit-receive (MTR) wireless network. MTR networks are a new class of networks, in which each node can simultaneously transmit…
We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node…
Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its…
This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at…
In this paper, we consider a wireless powered multi-relay network in which a multi-antenna hybrid access point underlaying a cellular system transmits information to distant receivers. Multiple relays capable of energy harvesting are…
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…
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical they must do so with small amounts of timely side information. In this paper, we propose three…
Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…
In this thesis, we study the downlink multiuser scheduling and power allocation problem for systems with simultaneous wireless information and power transfer (SWIPT). In the first part of the thesis, we focus on multiuser scheduling. We…
Massive multi-input multi-output (Massive MIMO) has been recognized as a key technology to meet the demand for higher data capacity and massive connectivity. Nevertheless, the number of active users is restricted due to training overhead…
This paper discusses transmission strategies for dealing with the problem of self-interference in multi-hop wireless networks in which the nodes communicate in a full- duplex mode. An information theoretic study of the simplest such…
In this paper, we derive the optimal centralized dynamic-time-division-duplex (D-TDD) scheme for a wireless network comprised of $K$ full-duplex nodes impaired by self-interference and additive white Gaussian noise. As a special case, we…
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…
We consider the problem of of multi-flow transmission in wireless networks, where data signals from different flows can interfere with each other due to mutual interference between links along their routes, resulting in reduced link…
We study throughput-optimum localized link scheduling in wireless networks. The majority of results on link scheduling assume binary interference models that simplify interference constraints in actual wireless communication. While the…
This paper considers the problem of network coding for multiple unicast connections in networks represented by directed acyclic graphs. The concept of interference alignment, traditionally used in interference networks, is extended to…
The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple…
Data traffic over wireless communication networks has experienced a tremendous growth in the last decade, and it is predicted to exponentially increase in the next decades. Enabling future wireless networks to fulfill this expectation is a…
In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…