Related papers: Maximum Throughput Opportunistic Network Coding in…
In this paper, a two-hop communication system with energy harvesting nodes is considered. Unlike battery powered wireless nodes, both the source and the relay are able to harvest energy from environment during communication, therefore, both…
In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can decode the messages from sources…
Relaying is an effective technique to achieve reliable wireless connectivity in harsh communication environment. However, most of the existing relaying schemes are based on relays with fixed locations, or \emph{static relaying}. In this…
Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio…
In this paper, we consider networks with multiple unicast sessions. Generally, non-linear network coding is needed to achieve the whole rate region of network coding. Yet, there exist networks for which routing is sufficient to achieve the…
We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capable of implementing any dynamic routing policy, however, the…
This paper investigates streaming codes over three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may…
We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal…
We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…
This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…
For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an…
We investigate the problem of designing delay-aware joint flow control, routing, and scheduling algorithms in general multi-hop networks for maximizing network utilization. Since the end-to-end delay performance has a complex dependence on…
We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to…
This paper investigates wireless information and power transfer in a full-duplex MIMO relay channel where the self-sustained relay harvests energy from both source transmit signal and self-interference signal to decode and forward source…
In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…
In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either…
In the paper, we investigate the delay-aware data transmission in renewable energy aided multi-carrier system. Besides utilizing the local renewables, the transmitter can also purchase grid power. By scheduling the amount of transmitted…
We consider the problem of distributed scheduling in wireless networks where heterogeneously delayed information about queue lengths and channel states of all links are available at all the transmitters. In an earlier work (by Reddy et al.…
In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance…