4,936 research outputs found
Power Allocation and Cooperative Diversity in Two-Way Non-Regenerative Cognitive Radio Networks
In this paper, we investigate the performance of a dual-hop block fading
cognitive radio network with underlay spectrum sharing over independent but not
necessarily identically distributed (i.n.i.d.) Nakagami- fading channels.
The primary network consists of a source and a destination. Depending on
whether the secondary network which consists of two source nodes have a single
relay for cooperation or multiple relays thereby employs opportunistic relay
selection for cooperation and whether the two source nodes suffer from the
primary users' (PU) interference, two cases are considered in this paper, which
are referred to as Scenario (a) and Scenario (b), respectively. For the
considered underlay spectrum sharing, the transmit power constraint of the
proposed system is adjusted by interference limit on the primary network and
the interference imposed by primary user (PU). The developed new analysis
obtains new analytical results for the outage capacity (OC) and average symbol
error probability (ASEP). In particular, for Scenario (a), tight lower bounds
on the OC and ASEP of the secondary network are derived in closed-form. In
addition, a closed from expression for the end-to-end OC of Scenario (a) is
achieved. With regards to Scenario (b), a tight lower bound on the OC of the
secondary network is derived in closed-form. All analytical results are
corroborated using Monte Carlo simulation method
Analysis of dynamic spectrum leasing for coded Bi-directional communication
In this paper, we aim to present a cooperative relaying based two way wireless communication scheme which can provide both spectral and energy efficiency in future wireless networks. To this end, we propose a novel network coding based Dynamic Spectrum Leasing (DSL) technique in which the cognitive secondary users cooperatively relay the primary data for two-way primary communication. In exchange for the relaying services, the primary grants exclusive access to the secondary users for their own activity. We model the random geometry of the ad hoc secondary users using a Poisson point process. We devise a game theoretic framework for the division of leasing time between the primary cooperation and secondary activity phases. We demonstrate that under these considerations and employing network coding, DSL can improve the number of bits that are successfully transmitted by 54% as compared to un-coded direct two way primary communication. Also the energy costs of the proposed DSL scheme are more than 10 times lower. Employing DSL also enables the cognitive users to get reasonable time for their own transmission after increasing the primary spectral and energy efficiency
Secure and Private Cloud Storage Systems with Random Linear Fountain Codes
An information theoretic approach to security and privacy called Secure And
Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to
distributed data storage systems. In this approach, random combinations of all
contents are stored across the network. Our coding approach is based on Random
Linear Fountain (RLF) codes. To retrieve a content, a group of servers
collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves
asymptotic perfect secrecy if at least one of the servers within an RG is not
compromised. Further, a Private Information Retrieval (PIR) scheme based on
random queries is proposed. The PIR approach ensures the users privately
download their desired contents without the servers knowing about the requested
contents indices. The proposed scheme is adaptive and can provide privacy
against a significant number of colluding servers.Comment: 8 pages, 2 figure
Optimizing Pilot Overhead for Ultra-Reliable Short-Packet Transmission
In this paper we optimize the pilot overhead for ultra-reliable short-packet
transmission and investigate the dependence of this overhead on packet size and
error probability. In particular, we consider a point-to-point communication in
which one sensor sends messages to a central node, or base-station, over AWGN
with Rayleigh fading channel. We formalize the optimization in terms of
approximate achievable rates at a given block length, pilot length, and error
probability. This leads to more accurate pilot overhead optimization.
Simulation results show that it is important to take into account the packet
size and the error probability when optimizing the pilot overhead.Comment: To be published on IEEE ICC 2017 Communication Theory Symposiu
Adaptive Modulation and Coding and Cooperative ARQ in a Cognitive Radio System
In this paper, a joint cross-layer design of adaptive modulation and coding
(AMC) and cooperative automatic repeat request (C-ARQ) scheme is proposed for a
secondary user in a shared-spectrum environment. First, based on the
statistical descriptions of the channel, closed-form expressions of the average
spectral efficiency (SE) and the average packet loss rate (PLR) are presented.
Then, the cross-layer scheme is designed, with the aim of maximizing the
average SE while maintaining the average PLR under a prescribed level. An
optimization problem is formed, and a sub-optimal solution is found: the target
packet error rates (PER) for the secondary system channels are obtained and the
corresponding sub-optimal AMC rate adaptation policy is derived based on the
target PERs. Finally, the average SE and the average PLR performance of the
proposed scheme are presented
- …