Breadcrumb

On the stable throughput of cooperative cognitive radio networks with finite relaying buffer
In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput region of a cognitive radio network with a finite relaying buffer at the secondary user. Towards this objective, we formulate a constrained optimization problem for maximizing the secondary user throughput while guaranteeing the stability of the primary user queue. We consider a general cooperation policy where the packet admission and queue selection

Optimal energy allocation for delay-constrained traffic over fading multiple access channels
In this paper, we consider a multiple-access fading channel where N users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over the transmission window. We derive the optimal energy allocation policy for each user that maximizes the total system throughput under two different assumptions on the channel state information. First, we consider the offline allocation problem where the channel states are known a priori before transmission. We solve a convex optimization problem to maximize the

RF energy harvesting in wireless networks with HARQ
In this paper, we consider a class of wireless powered communication networks using data link layer hybrid automatic repeat request (HARQ) protocol to ensure reliable communications. In particular, we analyze the trade-off between accumulating mutual information and accumulating RF energy at the receiver of a point-to-point link using HARQ with incremental redundancy over a Rayleigh fading channel. The transmitter is assumed to have a constant energy source while the receiver relies, solely, on the RF energy harvested from the received signal. First, we target the optimal time switching (TS)

Protocol design and stability analysis of cooperative cognitive radio users
A single cognitive radio transmitter-receiver pair shares the spectrum with two primary users communicating with their respective receivers. Each primary user has a local traffic queue, whereas the cognitive user has three queues; one storing its own traffic while the other two are relaying queues used to store primary relayed packets admitted from the two primary users. A new cooperative cognitive medium access control protocol for the described network is proposed, where the cognitive user exploits the idle periods of the primary spectrum bands. Traffic arrival to each relaying queue is

CRC: Collaborative research and teaching testbed for wireless communications and networks
The validation of wireless communications research, whether it is focused on PHY, MAC or higher layers, can be done in several ways, each with its limitations. Simulations tend to be simplified. Equipping wireless labs requires funding and time. Remotely accessible testbeds present a good option to validate research. The existing testbeds have gone a long way in building the infrastructure for managing and operating themselves. Yet, there is still space to improve the administration of resources whether it is nodes, frequency spectrum or storage space. In this work, we present the

Topology realization using gain control for wireless testbeds
Wireless testbeds present a convenient and cost effective option for researchers in communications to validate their work. The main drawback of these testbeds is their reliance on nodes with fixed placement; this limits experimenters ability to test protocols that depend on a complex connectivity between the nodes such as relaying. In this work, we present a way to overcome this limitation; this method attempts to realize a given topology between a set of nodes by adjusting each node's transmit power and receive gain in a manner to connect and disconnect the links between the nodes as desired

Proactive power allocation and caching node selection for regular service guarantees
This paper studies the potential of proactive resource allocation to prolong the communication sessions in networks with limited energy budgets and stringent quality-of-service (QoS) requirement, particularly a regular service guarantee. A threshold-based proactive communication policy is proposed to minimize the consumed transmission energy and maximize the network lifetime based on the different link states and the buffer state at the destination node. A closed-form expression is presented for the proactive gain in terms of the channel gain threshold, the amount of the proactively-

Degrees of Freedom of the Full-Duplex Asymmetric MIMO Three-Way Channel with Unicast and Broadcast Messages
In this paper, we characterize the total degrees of freedom (DoFs) of the full-duplex asymmetric multiple-input multiple- output (MIMO) three-way channel. Each node has a separate-antenna full-duplex MIMO transceiver with a different number of antennas, where each antenna can be configured for either signal transmission or reception. We study this system under two message configurations; the first configuration is when each node has two unicast messages to be delivered to the two other nodes, while the second configuration is when each node has two unicast messages as well as one broadcast

Wireless energy and information transfer in networks with hybrid ARQ
In this paper, we consider a class of wireless powered communication devices using hybrid automatic repeat request (HARQ) protocol to ensure reliable communications. In particular, we analyze the trade-off between accumulating mutual information and harvesting RF energy at the receiver of a point-to-point link over a time-varying independent and identically distributed (i.i.d.) channel. The transmitter is assumed to have a constant energy source while the receiver relies, solely, on the RF energy harvested from the received signal. At each time slot, the incoming RF signal is split between

Degrees of freedom in cached MIMO relay networks with multiple base stations
The ability of physical layer relay caching to increase the degrees of freedom (DoF) of a single cell was recently illustrated. In this paper, we extend this result to the case of multiple cells in which a caching relay is shared among multiple non-cooperative base stations (BSs). In particular, we show that a large DoF gain can be achieved by exploiting the benefits of having a shared relay that cooperates with the BSs. We first propose a cache-assisted relaying protocol that improves the cooperation opportunity between the BSs and the relay. Next, we consider the cache content placement
Pagination
- Previous page ‹‹
- Page 15
- Next page ››