Related papers: Effective Capacity of Buffer-Aided Full-Duplex Rel…

A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…

We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state…

The problem of enhancing Quality-of-Service (QoS) in power constrained, mobile relay beamforming networks, by optimally and dynamically controlling the motion of the relaying nodes, is considered, in a dynamic channel environment. We assume…

Interactive applications with automated feedback will largely influence the design of future networked infrastructures. In such applications, status information about an environment of interest is captured and forwarded to a compute node,…

In this paper we consider a simple cooperative network consisting of a source, a destination and a cluster of decode-and-forward half-duplex relays. At each time-slot, the source and (possibly) one of the relays transmit a packet to another…

We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to…

In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not…

We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals,…

We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the…

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…

Realizing delay-capacity in intermittently connected mobile networks remains a largely open question, with state-of-the-art routing schemes typically focusing either on delay or on capacity. We show the feasibility of routing with both high…

Full-duplex wireless communication has the potential to double the capacity of wireless networks by reducing the band occupancy of transmissions. However, a full-duplex capability cannot always reduce the band occupancy because the real…

Motivated by fading channels and erasure channels, the problem of reliable communication over deterministic relay networks is studied, in which relay nodes receive a function of the incoming signals and a random network state. An achievable…

This paper studies a system where a set of $N$ relay nodes harvest energy from the signal received from a source to later utilize it when forwarding the source's data to a destination node via distributed beamforming. To this end, we derive…

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Closed queuing networks with finite capacity buffers and skip-over policies are fundamental models in the performance evaluation of computer and communication systems. This technical report presents the details of computational algorithms…

Energy harvesting (EH) and network coding (NC) have emerged as two promising technologies for future wireless networks. In this paper, we combine them together in a single system and then present a time switching-based network coding…

We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks.…

We investigate the percentage of delivering capacities that are actually consumed in a typical traffic dynamics where the capacities are uniformly assigned over a scale-free network. Theoretical analysis, as well as simulations, reveal that…

We consider a dual-hop wireless network where an energy constrained relay node first harvests energy through the received radio-frequency signal from the source, and then uses the harvested energy to forward the source's information to the…