6,881 research outputs found
Cognitive and Energy Harvesting-Based D2D Communication in Cellular Networks: Stochastic Geometry Modeling and Analysis
While cognitive radio enables spectrum-efficient wireless communication,
radio frequency (RF) energy harvesting from ambient interference is an enabler
for energy-efficient wireless communication. In this paper, we model and
analyze cognitive and energy harvesting-based D2D communication in cellular
networks. The cognitive D2D transmitters harvest energy from ambient
interference and use one of the channels allocated to cellular users (in uplink
or downlink), which is referred to as the D2D channel, to communicate with the
corresponding receivers. We investigate two spectrum access policies for
cellular communication in the uplink or downlink, namely, random spectrum
access (RSA) policy and prioritized spectrum access (PSA) policy. In RSA, any
of the available channels including the channel used by the D2D transmitters
can be selected randomly for cellular communication, while in PSA the D2D
channel is used only when all of the other channels are occupied. A D2D
transmitter can communicate successfully with its receiver only when it
harvests enough energy to perform channel inversion toward the receiver, the
D2D channel is free, and the at the receiver is above the
required threshold; otherwise, an outage occurs for the D2D communication. We
use tools from stochastic geometry to evaluate the performance of the proposed
communication system model with general path-loss exponent in terms of outage
probability for D2D and cellular users. We show that energy harvesting can be a
reliable alternative to power cognitive D2D transmitters while achieving
acceptable performance. Under the same outage requirements as
for the non-cognitive case, cognitive channel access improves the outage
probability for D2D users for both the spectrum access policies.Comment: IEEE Transactions on Communications, to appea
Distributed Channel Assignment in Cognitive Radio Networks: Stable Matching and Walrasian Equilibrium
We consider a set of secondary transmitter-receiver pairs in a cognitive
radio setting. Based on channel sensing and access performances, we consider
the problem of assigning channels orthogonally to secondary users through
distributed coordination and cooperation algorithms. Two economic models are
applied for this purpose: matching markets and competitive markets. In the
matching market model, secondary users and channels build two agent sets. We
implement a stable matching algorithm in which each secondary user, based on
his achievable rate, proposes to the coordinator to be matched with desirable
channels. The coordinator accepts or rejects the proposals based on the channel
preferences which depend on interference from the secondary user. The
coordination algorithm is of low complexity and can adapt to network dynamics.
In the competitive market model, channels are associated with prices and
secondary users are endowed with monetary budget. Each secondary user, based on
his utility function and current channel prices, demands a set of channels. A
Walrasian equilibrium maximizes the sum utility and equates the channel demand
to their supply. We prove the existence of Walrasian equilibrium and propose a
cooperative mechanism to reach it. The performance and complexity of the
proposed solutions are illustrated by numerical simulations.Comment: submitted to IEEE Transactions on Wireless Communicaitons, 13 pages,
10 figures, 4 table
Improved Spectrum Mobility using Virtual Reservation in Collaborative Cognitive Radio Networks
Cognitive radio technology would enable a set of secondary users (SU) to
opportunistically use the spectrum licensed to a primary user (PU). On the
appearance of this PU on a specific frequency band, any SU occupying this band
should free it for PUs. Typically, SUs may collaborate to reduce the impact of
cognitive users on the primary network and to improve the performance of the
SUs. In this paper, we propose and analyze the performance of virtual
reservation in collaborative cognitive networks. Virtual reservation is a novel
link maintenance strategy that aims to maximize the throughput of the cognitive
network through full spectrum utilization. Our performance evaluation shows
significant improvements not only in the SUs blocking and forced termination
probabilities but also in the throughput of cognitive users.Comment: 7 pages, 10 figures, IEEE ISCC 201
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 controlled using a
tuneable admittance factor, while relaying queues service scheduling is
controlled via channel access probabilities assigned to each queue based on the
band of operation. The stability region of the proposed protocol is
characterized shedding light on its maximum expected throughput. Numerical
results demonstrate the performance gains of the proposed cooperative cognitive
protocol.Comment: Accepted in WCNC 201
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …