SearcharxivSearch

arXiv subjects

Adrish Banerjee

Publications and source records attributed to Adrish Banerjee.

At least 37 records · Page 2Linked to original sources

On Optimal Spectrum Access of Cognitive Relay With Finite Packet Buffer

We investigate a cognitive radio system where secondary user (SU) relays primary user (PU) packets using two-phase relaying. SU transmits its own packets with some access probability in relaying phase using time sharing. PU and SU have queues of finite capacity which results in packet loss when the queues are full. Utilizing knowledge of relay queue state, SU aims to maximize its packet throughput while keeping packet loss probability of PU below a threshold. By exploiting structure of the problem, we formulate it as a linear program and find optimal access policy of SU. We also propose low complexity sub-optimal access policies, namely constant probability transmission and step transmission. Numerical results are presented to compare performance of proposed methods and study effect of queue sizes on packet throughput.

cs.IT

Multi-channel Sensing And Resource Allocation in Energy Constrained Cognitive Radio Networks

We consider a cognitive radio network in a multi-channel licensed environment. Secondary user transmits in a channel if the channel is sensed to be vacant. This results in a tradeoff between sensing time and transmission time. When secondary users are energy constrained, energy available for transmission is less if more energy is used in sensing. This gives rise to an energy tradeoff. For multiple primary channels, secondary users must decide appropriate sensing time and transmission power in each channel to maximize average aggregate-bit throughput in each frame duration while ensuring quality-of-service of primary users. Considering time and energy as limited resources, we formulate this problem as a resource allocation problem. Initially a single secondary user scenario is considered and solution is obtained using decomposition and alternating optimization techniques. Later we extend the analysis for the case of multiple secondary users. Simulation results are presented to study effect of channel occupancy, fading and energy availability on performance of proposed method.

cs.IT

On Preambles With Low Out of Band Radiation for Channel Estimation

In this paper, we investigate preamble designs for channel estimation, that jointly address the estimation efficiency in terms of MSE of the channel estimates, and the OOB radiation of the transmit preambles. We provide two novel design techniques, based on a convex optimization problem, to obtain optimal preambles for a single carrier and provide a juxtaposition based method to extend their application to multi-carrier systems. The obtained preambles are shown to have 10 dB to 35 dB lower OOB radiation than the existing preamble based estimation techniques. We also show the fundamental trade-off between the estimation efficiency and the OOB radiation and highlight that the improved OOB performance comes at a cost of increased estimation error. Finally, as a case study, the estimated channel values are used in equalization of a MIMO GFDM system that is aimed for transmit diversity.

cs.NI

On Stable Throughput of Cognitive Radio Networks With Cooperating Secondary Users

In this paper, we study cooperative cognitive radio networks consisting of a primary user and multiple secondary users. Secondary users transmit only when primary user is sensed as silent and may interfere with primary transmission due to imperfect sensing. When primary activity is sensed correctly, secondary users cooperate with primary user by assisting retransmission of failed packets of primary user. We analyze packet throughput of primary and secondary users for three variations of proposed cooperation method. Signal flow graph (SFG) based approach is employed to obtain closed form expressions of packet throughput. The analysis is done for two cases; individual sensing and cooperative sensing. Further, we characterize optimal transmission probability of secondary users that maximizes individual secondary packet throughput keeping all queues in the system stable. Results present a comparison of throughput performance of proposed cooperation methods under different scenarios and show their benefits for both primary as well as secondary user throughput.

cs.IT

Resource Allocation and Fairness in Wireless Powered Cooperative Cognitive Radio Networks

We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and jointly performs the time and energy allocation for SUs. Specifically, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data. Since the STORA scheme focuses on the sum-throughput, it becomes inconsiderate towards individual SU throughput, resulting in low fairness. To enhance fairness, we investigate three resource allocation schemes, which are (i) equal time allocation, (ii) minimum throughput maximization, and (iii) proportional time allocation. Simulation results reveal the trade-off between sum-throughput and fairness. The minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but yields the least SU sum-throughput.

cs.IT

On Optimal Offline Time Sharing Policy for Energy Harvesting Underlay Cognitive Radio

RF energy harvesting can be used to power communication devices so that perpetual operation of such devices can be ensured. We consider a RF energy harvesting underlay cognitive radio system operating in slotted fashion. The primary user (PU) is equipped with a reliable power source and transmits with a constant power in all the slots. However, the secondary user (SU) harvests energy from primary's transmission and simultaneously transmits it's own data such that interference at the primary receiver (PR) remains below an acceptable threshold. At the secondary transmitter (ST), each time slot is divided into two phases: energy harvesting (EH) phase and information transfer (IT) phase. We formulated the problem of maximizing the achievable secondary sum rate under primary receiver's protection criteria as a convex optimization problem and obtained the optimal time sharing between EH and IT phase, and optimal secondary transmit power under offline setting. The optimal offline scheme is then compared with an online myopic policy, where the optimal time sharing between EH and IT phase, and optimal secondary transmit power are obtained based on instantaneous channel gains only.

cs.IT

Secure Communication Via a Wireless Energy Harvesting Untrusted Relay

The broadcast nature of the wireless medium allows unintended users to eavesdrop the confidential information transmission. In this regard, we investigate the problem of secure communication between a source and a destination via a wireless energy harvesting untrusted node which acts as a helper to relay the information; however, the source and destination nodes wish to keep the information confidential from the relay node. To realize the positive secrecy rate, we use destination-assisted jamming. Being an energy-starved node, the untrusted relay harvests energy from the received radio frequency signals, which include the source's information signal and the destination's jamming signal. Thus, we utilize the jamming signal efficiently by leveraging it as a useful energy source. At the relay, to enable energy harvesting and information processing, we adopt power splitting (PS) and time switching (TS) policies. To evaluate the secrecy performance of this proposed scenario, we derive analytical expressions for two important metrics, viz., the secrecy outage probability and the ergodic secrecy rate. The numerical analysis reveals the design insights into the effects of different system parameters like power splitting ratio, energy harvesting time, target secrecy rate, transmit signal-to-noise ratio (SNR), relay location, and energy conversion efficiency factor, on the secrecy performance. Specifically, the PS policy achieves better optimal secrecy outage probability and optimal ergodic secrecy rate than that of the TS policy at higher target secrecy rate and transmit SNR, respectively.

cs.IT

On Energy Cooperation in Energy Harvesting Underlay Cognitive Radio Network

In this paper, we consider an energy harvesting cognitive radio network (EH-CRN), where a primary and a secondary user coexist in underlay mode. Both the transmitters have energy harvesting capability and are equipped with finite capacity battery to store the harvested energy. In addition, the secondary user (SU) has an independent energy transfer unit such that it can transfer some portion of it's harvested energy to the primary user (PU). We obtain an optimal transmit power and energy transfer policy for single-slot and a suboptimal policy for multi-slot scenario maximizing the number of bits transmitted by SU under the primary sum-rate constraint in an offline setting. For both cases, the effect of energy cooperation on the system performance is studied and it is observed that energy cooperation results in higher SU throughput.

cs.IT

Interference-Assisted Wireless Energy Harvesting in Cognitive Relay Network with Multiple Primary Transceivers

We consider a spectrum sharing scenario, where a secondary network coexists with a primary network of multiple transceivers. The secondary network consists of an energy-constrained decode-and-forward secondary relay which assists the communication between a secondary transmitter and a destination in the presence of the interference from multiple primary transmitters. The secondary relay harvests energy from the received radio-frequency signals, which include the information signal from the secondary transmitter and the primary interference. The harvested energy is then used to decode the secondary information and forward it to the secondary destination. At the relay, we adopt a time switching policy due to its simplicity that switches between the energy harvesting and information decoding over time. Specifically, we derive a closed-form expression for the secondary outage probability under the primary outage constraint and the peak power constraint at both secondary transmitter and relay. In addition, we investigate the effect of the number of primary transceivers on the optimal energy harvesting duration that minimizes the secondary outage probability. By utilizing the primary interference as a useful energy source in the energy harvesting phase, the secondary network achieves a better outage performance.

cs.IT

Outage Analysis of Spectrum Sharing Energy Harvesting Cognitive Relays in Nakagami-$m$ Channels

Energy harvesting (EH) cognitive relays are an exciting solution to the problem of inefficient use of spectrum while achieving green communications and spatial diversity. In a spectrum sharing scenario, we investigate the performance of a cognitive relay network, where a secondary source communicates with its destination over Nakagami-$m$ channels via decode-and-forward EH relays while maintaining the outage probability of the primary user below a predefined threshold. Specifically, we derive a closed-form expression for the secondary outage probability and show that it is a function of the probability of an EH relay having sufficient energy for relaying, which in turn, depends on the energy harvesting and consumption rates of the EH relay and the primary outage probability threshold. We also show that relaxing the primary outage constraint may not always benefit the cognitive EH relay network due to the limitations imposed on the relay's transmit power by the energy constraint.

cs.IT

On Information and Energy Cooperation in Energy Harvesting Cognitive Radio

This paper considers the cooperation between primary and secondary users at information and energy levels when both users are energy harvesting nodes. In particular, a secondary transmitter helps relaying the primary message, and in turn, gains the spectrum access as a reward. Also, the primary transmitter supplies energy to the secondary transmitter if the latter is energy-constrained, which facilitates an uninterrupted cooperation. We address this two-level cooperation over a finite horizon with the finite battery constraint at the secondary transmitter. While promising the rate-guaranteed service to both primary and secondary users, we aim to maximize the primary rate. We develop an iterative algorithm that obtains the optimal offline power policies for primary and secondary users. To acquire insights about the structure of the optimal solution, we examine specific scenarios. Furthermore, we investigate the effects of the secondary rate constraint and finite battery on the primary rate and the probability of cooperation. We show that the joint information and energy cooperation increases the chances of cooperation and achieves significant rate gains over only information cooperation.

cs.IT

Secondary Outage Analysis of Amplify-and-Forward Cognitive Relays with Direct Link and Primary Interference

The use of cognitive relays is an emerging and promising solution to overcome the problem of spectrum underutilization while achieving the spatial diversity. In this paper, we perform an outage analysis of the secondary system with amplify-and-forward relays in a spectrum sharing scenario, where a secondary transmitter communicates with a secondary destination over a direct link as well as the best relay. Specifically, under the peak power constraint, we derive a closed-form expression of the secondary outage probability provided that the primary outage probability remains below a predefined value. We also take into account the effect of primary interference on the secondary outage performance. Finally, we validate the analysis by simulation results.

cs.IT

Sensing-Throughput Tradeoff in Cognitive Radio With Random Arrivals and Departures of Multiple Primary Users

This letter analyzes the sensing-throughput tradeoff for a secondary user (SU) under random arrivals and departures of multiple primary users (PUs). We first study the case where PUs change their status only during SU's sensing period. We then generalize to a case where PUs change status anytime during SU frame, and compare the latter case with the former in terms of the optimal sensing time and SU throughput. We also investigate the effects of PU traffic parameters and the number of PUs on the sensing-throughput tradeoff for SU. Results show that, though the increase in the number of PUs reduces the optimal sensing time for SU, the opportunity to find a vacant PU channel reduces simultaneously, in turn, reducing SU throughput. Finally, we validate the analysis by Monte Carlo simulations.

cs.IT

Energy Harvesting Cognitive Radio with Channel-Aware Sensing Strategy

An energy harvesting cognitive radio scenario is considered where a secondary user (SU) with finite battery capacity opportunistically accesses the primary user (PU) channels. The objective is to maximize the throughput of SU under energy neutrality constraint and fading channel conditions in a single-user multi-channel setting. Channel selection criterion based on the probabilistic availability of energy with SU, channel conditions, and primary network's belief state is proposed, which chooses the best subset of channels for sensing, yielding higher throughput. We construct channel-aware optimal and myopic sensing strategies in a Partially Observable Markov Decision Process framework based on the proposed channel selection criterion. The effects of sensing errors and collisions between PU and SU on the throughput of latter are studied. It is shown that there exists a trade-off between the transmission duration and the energy lost in collisions.

cs.IT

On the Effect of Primary User Traffic on Secondary Throughput and Outage Probability Under Rayleigh Flat Fading Channel

The effect of the primary traffic on a secondary user's (SU) throughput under Rayleigh flat fading channel is investigated. For this case, closed form expressions are derived for the average probability of detection and the average probability of false alarm. Based on these expressions, the average SU throughput under the desired signal-to-noise ratio (SNR) constraint in order to maintain the quality of the secondary link is found analytically considering the random arrival or departure of the primary user. It is shown that the spectrum sensing performance and SU throughput degrade with increase in the primary traffic and the deep fade condition of the channel over which the detection is performed. The degree of degradation in SU throughput is seen to be severed further due to the interference link from the primary transmitter to the secondary receiver. Under these detrimental effects, a sensing-throughput trade-off for SU is illustrated. Finally, the combined effect of the primary traffic, fading, imperfect spectrum sensing and the interference link from a primary transmitter is studied on the outage probability at SU.

cs.IT

Block Outlier Methods for Malicious User Detection in Cooperative Spectrum Sensing

Block outlier detection methods, based on Tietjen-Moore (TM) and Shapiro-Wilk (SW) tests, are proposed to detect and suppress spectrum sensing data falsification (SSDF) attacks by malicious users in cooperative spectrum sensing. First, we consider basic and statistical SSDF attacks, where the malicious users attack independently. Then we propose a new SSDF attack, which involves cooperation among malicious users by masking. In practice, the number of malicious users is unknown. Thus, it is necessary to estimate the number of malicious users, which is found using clustering and largest gap method. However, we show using Monte Carlo simulations that, these methods fail to estimate the exact number of malicious users when they cooperate. To overcome this, we propose a modified largest gap method.

stat.AP

Selection Relaying at Low Signal to Noise Ratios

Performance of cooperative diversity schemes at Low Signal to Noise Ratios (LSNR) was recently studied by Avestimehr et. al. [1] who emphasized the importance of diversity gain over multiplexing gain at low SNRs. It has also been pointed out that continuous energy transfer to the channel is necessary for achieving the max-flow min-cut bound at LSNR. Motivated by this we propose the use of Selection Decode and Forward (SDF) at LSNR and analyze its performance in terms of the outage probability. We also propose an energy optimization scheme which further brings down the outage probability.

cs.IT

Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

In this letter we present a new construction of interleavers for turbo codes from 3-regular Hamiltonian graphs. The interleavers can be generated using a few parameters, which can be selected in such a way that the girth of the interleaver graph (IG) becomes large, inducing a high summary distance. The size of the search space for these parameters is derived. The proposed interleavers themselves work as their de-interleavers.

cs.IT