bbabanner.jpg

Maximum throughput of a secondary user cooperating with an energy-aware primary user

This paper proposes a cooperation protocol between a secondary user (SU) and a primary user (PU) which dedicates a free frequency subband for the SU if cooperation results in energy saving. Time is slotted and users are equipped with buffers. Under the proposed protocol, the PU releases portion of its bandwidth for secondary transmission. Moreover, it assigns a portion of the time slot duration for the SU to relay primary packets and achieve a higher successful packet reception probability at the primary receiver. We assume that the PU has three states: idle, forward, and retransmission states

Software and Communications

Optimizing Cooperative Cognitive Radio Networks Performance with Primary QoS Provisioning

We consider the problem of optimizing the performance of a cooperative cognitive radio user subject to constraints on the quality-of-service (QoS) of the primary user (PU). In particular, we design the probabilistic admission control parameter of the PU packets in the secondary user (SU) relaying queue and the randomized service parameter at the SU under non-work-conserving (non-WC) and WC cooperation policies. In the non-WC policy, two constrained optimization problems are formulated; the first problem is maximizing the SU throughput while the second problem is minimizing the SU average delay

Software and Communications

Constrained interference alignment and the spatial degrees of freedom of mimo cognitive networks

An interference alignment (IA) scheme is presented that allows multiple opportunistic transmitters (secondary users) to use the same frequency band of a pre-existing primary link without generating any interference. The primary and secondary transmit-receive pairs are equipped with multiple antennas. Under power constraints on the primary transmitter, the rate of the primary user is maximized by water-filling on the singular values of its channel matrix leaving some eigen modes unused, and hence, the secondary users can align their transmitted signals to produce a number of interference-free

Software and Communications

A subspace method for the blind identification of multiple time-varying FIR channels

A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coefficients are represented via a finite basis expansion model, i.e. linear combination of known basis functions. In contrast to earlier related works, the basis functions need not be limited to complex exponentials, and therefore do not necessitate the a priori estimation of frequency parameters. This considerably simplifies the implementation of the proposed method and provides added flexibility in applications. The

Software and Communications

Deep stacked ensemble learning model for COVID-19 classification

COVID-19 is a growing problem worldwide with a high mortality rate. As a result, the World Health Organization (WHO) declared it a pandemic. In order to limit the spread of the disease, a fast and accurate diagnosis is required. A reverse transcript polymerase chain reaction (RT-PCR) test is often used to detect the disease. However, since this test is time-consuming, a chest computed tomography (CT) or plain chest X-ray (CXR) is sometimes indicated. The value of automated diagnosis is that it saves time and money by minimizing human effort. Three significant contributions are made by our

Software and Communications

Gaining-Sharing Knowledge Based Algorithm with Adaptive Parameters for Engineering Optimization

As optimization algorithms have a great power to solve nonlinear, complex, and hard optimization problems, nature-inspired algorithms have been applied extensively in distinct fields in order to solve real life optimization cases. In this paper, modifications for the recently proposed Gaining-Sharing-Knowledge based algorithm (GSK) are presented for enhancing its performance. Gaining-Sharing-Knowledge algorithm is considered as a perfect example of modern nature-inspired algorithm that considered the human life behavior as a source of inspiration in order to solve optimization problems. GSK

Software and Communications

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

Software and Communications

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)

Software and Communications

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

Software and Communications

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

Software and Communications