SearcharxivSearch

arXiv subjects

Mohamed Nafie

Publications and source records attributed to Mohamed Nafie.

4 recordsLinked to original sources

SWIPT using Hybrid ARQ over Time Varying Channels

We consider a class of wireless powered devices employing Hybrid Automatic Repeat reQuest (HARQ) to ensure reliable end-to-end communications over a two-state time-varying channel. A receiver, with no power source, relies on the energy transferred by a Simultaneous Wireless Information and Power Transfer (SWIPT) enabled transmitter to \emph{receive} and \emph{decode} information. Under the two-state channel model, information is received at two different rates while it is only possible to harvest energy in one of the states. The receiver aims to decode its messages with minimum expected number of re-transmissions. Dynamic and continuous nature of the problem motivated us to use a novel Markovian framework to bypass the complexities plaguing the conventional approaches such as MDP. Using the theory of absorbing Markov chains, we show that there exists an optimal policy utilizing the incoming RF signal solely to harvest energy or to accumulate mutual information. Hence, we convert the original problem with continuous action and state space into an equivalent one with discrete state and action space. For independent and identically distributed channels, we prove the optimality of a simple-to-implement {\em harvest-first-store-later} type policy. However, for time-correlated channels, we demonstrate that statistical knowledge of the channel may significantly improve the performance over such policies.

cs.NI

Maximum Throughput Opportunistic Network Coding in Two-Way Relay Networks

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 optimal opportunistic network coding policy that maximizes the aggregate network throughput subject to an average packet delay constraint. Towards this objective, first, we consider a pair of nodes communicating through a common relay and develop a two dimensional Markov chain model capturing the buffers' length states at the two nodes. Second, we formulate an optimization problem for the delay constrained optimal throughput. Exploiting the structure of the problem, it can be cast as a linear programming problem. Third, we compare the optimal policy to two baseline schemes and show its merits with respect to throughput, average delay and power consumption. First, the optimal policy significantly outperforms the first baseline with respect to throughput, delay and power consumption. Moreover, it outperforms the second baseline with respect to the average delay and power consumption for asymmetrical traffic arrival rates.

cs.IT

On the Coexistence of a Primary User with an Energy Harvesting Secondary User: A Case of Cognitive Cooperation

In this paper, we consider a cognitive scenario where an energy harvesting secondary user (SU) shares the spectrum with a primary user (PU). The secondary source helps the primary source in delivering its undelivered packets during periods of silence of the primary source. The primary source has a queue for storing its data packets, whereas the secondary source has two data queues; a queue for storing its own packets and the other for storing the fraction of the undelivered primary packets accepted for relaying. The secondary source is assumed to be a battery-based node which harvests energy packets from the environment. In addition to its data queues, the SU has an energy queue to store the harvested energy packets. The secondary energy packets are used for primary packets decoding and data packets transmission. More specifically, if the secondary energy queue is empty, the secondary source can neither help the primary source nor transmit a packet from the data queues. The energy queue is modeled as a discrete time queue with Markov arrival and service processes. Due to the interaction of the queues, we provide inner and outer bounds on the stability region of the proposed system. We investigate the impact of the energy arrival rate on the stability region. Numerical results show the significant gain of cooperation.

cs.IT

Maximum Secondary Stable Throughput of a Cooperative Secondary Transmitter-Receiver Pair: Protocol Design and Stability Analysis

In this paper, we investigate the impact of cooperation between a secondary transmitter-receiver pair and a primary transmitter (PT) on the maximum stable throughput of the primary-secondary network. Each transmitter, primary or secondary, has a buffer for storing its own traffic. In addition to its own buffer, the secondary transmitter (ST) has a buffer for storing a fraction of the undelivered primary packets due to channel impairments. Moreover, the secondary destination has a relaying queue for storing a fraction of the undelivered primary packets. In the proposed cooperative system, the ST and the secondary destination increase the spectrum availability for the secondary packets by relaying the unsuccessfully transmitted packets of the PT. We consider two multiple access strategies to be used by the ST and the secondary destination to utilize the silence sessions of the PT. Numerical results demonstrate the gains of the proposed cooperative system over the non-cooperation case.

cs.IT