1,624 research outputs found
Opportunistic Adaptive Relaying in Cognitive Radio Networks
Combining cognitive radio technology with user cooperation could be
advantageous to both primary and secondary transmissions. In this paper, we
propose a first relaying scheme for cognitive radio networks (called "Adaptive
relaying scheme 1"), where one relay node can assist the primary or the
secondary transmission with the objective of improving the outage probability
of the secondary transmission with respect to a primary outage probability
threshold. Upper bound expressions of the secondary outage probability using
the proposed scheme are derived over Rayleigh fading channels. Numerical and
simulation results show that the secondary outage probability using the
proposed scheme is lower than that of other relaying schemes. Then, we extend
the proposed scheme to the case where the relay node has the ability to decode
both the primary and secondary signals and also can assist simultaneously both
transmissions. Simulations show the performance improvement that can be
obtained due to this extension in terms of secondary outage probability.Comment: 5 pages, 4 figures. Accepted for publication in Proc. IEEE
International Communications Conference (ICC), Ottawa (ON), Canada, June 201
Energy-aware cooperative wireless networks with multiple cognitive users
In this paper, we study and analyze cooperative cognitive radio networks with arbitrary number of secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data transmission demand. We consider a multi-packet transmission framework that allows multiple SUs to transmit simultaneously because of dirty-paper coding. We propose power allocation and scheduling policies that optimize the throughput for both PU and SU with minimum energy expenditure. The performance of the system is evaluated in terms of throughput and delay under different opportunistic relay selection policies. Toward this objective, we present a mathematical framework for deriving stability conditions for all queues in the system. Consequently, the throughput of both primary and secondary links is quantified. Furthermore, a moment generating function approach is employed to derive a closed-form expression for the average delay encountered by the PU packets. Results reveal that we achieve better performance in terms of throughput and delay at lower energy cost as compared with equal power allocation schemes proposed earlier in the literature. Extensive simulations are conducted to validate our theoretical findings
Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks
For improving the efficiency and the reliability of the opportunistic routing
algorithm, in this paper, we propose the cross-layer and reliable opportunistic
routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the
improved efficiency fuzzy logic and humoral regulation inspired topology
control into the opportunistic routing algorithm. In CBRT, the inputs of the
fuzzy logic system are the relative variance (rv) of the metrics rather than
the values of the metrics, which reduces the number of fuzzy rules
dramatically. Moreover, the number of fuzzy rules does not increase when the
number of inputs increases. For reducing the control cost, in CBRT, the node
degree in the candidate relays set is a range rather than a constant number.
The nodes are divided into different categories based on their node degree in
the candidate relays set. The nodes adjust their transmission range based on
which categories that they belong to. Additionally, for investigating the
effection of the node mobility on routing performance, we propose a link
lifetime prediction algorithm which takes both the moving speed and moving
direction into account. In CBRT, the source node determines the relaying
priorities of the relaying nodes based on their utilities. The relaying node
which the utility is large will have high priority to relay the data packet. By
these innovations, the network performance in CBRT is much better than that in
ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201
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
Interference-Based Optimal Power-Efficient Access Scheme for Cognitive Radio Networks
In this paper, we propose a new optimization-based access strategy of
multipacket reception (MPR) channel for multiple secondary users (SUs)
accessing the primary user (PU) spectrum opportunistically. We devise an
analytical model that realizes the multipacket access strategy of SUs that
maximizes the throughput of individual backlogged SUs subject to queue
stability of the PU. All the network receiving nodes have MPR capability. We
aim at maximizing the throughput of the individual SUs such that the PU's queue
is maintained stable. Moreover, we are interested in providing an
energy-efficient cognitive scheme. Therefore, we include energy constraints on
the PU and SU average transmitted energy to the optimization problem. Each SU
accesses the medium with certain probability that depends on the PU's activity,
i.e., active or inactive. The numerical results show the advantage in terms of
SU throughput of the proposed scheme over the conventional access scheme, where
the SUs access the channel randomly with fixed power when the PU is sensed to
be idle
Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems
In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state information (CSI) in the multi-hop SU system. We shall determine a low
complexity, decentralized algorithm to maximize the average end-to-end
throughput of the SU system with dynamic spatial reuse. The problem is
challenging due to the decentralized requirement as well as the causality
constraint on the knowledge of CSI. Furthermore, the problem belongs to the
class of stochastic Network Utility Maximization (NUM) problems which is quite
challenging. We exploit the time-scale difference between the PU activity and
the CSI fluctuations and decompose the problem into a master problem and
subproblems. We derive an asymptotically optimal low complexity solution using
divide-and-conquer and illustrate that significant performance gain can be
obtained through dynamic hop selection and power control. The worst case
complexity and memory requirement of the proposed algorithm is O(M^2) and
O(M^3) respectively, where is the number of SUs
- …