168 research outputs found
Power Allocation Strategies for Wireless Relay Networks with Analog Network Coding: Survey
Relay aided communication with network coding can bring spectacular performance enhancements for wireless networks. The proper design of power allocated to each of the nodes involved in the communication is essential as it has impact on the performance when Analog Network coding (ANC) is used. This paper presents a survey on recent power allocation strategies, intended objectives, practical constraints that have been considered, and corresponding performances for networks with ANC protocol
Capacity of All Nine Models of Channel Output Feedback for the Two-user Interference Channel
In this paper, we study the impact of different channel output feedback
architectures on the capacity of the two-user interference channel. For a
two-user interference channel, a feedback link can exist between receivers and
transmitters in 9 canonical architectures (see Fig. 2), ranging from only one
feedback link to four feedback links. We derive the exact capacity region for
the symmetric deterministic interference channel and the constant-gap capacity
region for the symmetric Gaussian interference channel for all of the 9
architectures. We show that for a linear deterministic symmetric interference
channel, in the weak interference regime, all models of feedback, except the
one, which has only one of the receivers feeding back to its own transmitter,
have the identical capacity region. When only one of the receivers feeds back
to its own transmitter, the capacity region is a strict subset of the capacity
region of the rest of the feedback models in the weak interference regime.
However, the sum-capacity of all feedback models is identical in the weak
interference regime. Moreover, in the strong interference regime all models of
feedback with at least one of the receivers feeding back to its own transmitter
have the identical sum-capacity. For the Gaussian interference channel, the
results of the linear deterministic model follow, where capacity is replaced
with approximate capacity.Comment: submitted to IEEE Transactions on Information Theory, results
improved by deriving capacity region of all 9 canonical feedback models in
two-user interference channe
Can Artificial Noise Boost Further the Secrecy of Dual-hop RIS-aided Networks?
In this paper, we quantify the physical layer security of a dual-hop
regenerative relaying-based wireless communication system assisted by
reconfigurable intelligent surfaces (RISs). In particular, the setup consists
of a source node communicating with a destination node via a regenerative
relay. In this setup, a RIS is installed in each hop to increase the
source-relay and relay-destination communications reliability, where the RISs'
phase shifts are subject to quantization errors. The legitimate transmission is
performed under the presence of a malicious eavesdropper attempting to
compromise the legitimate transmissions by overhearing the broadcasted signal
from the relay. To overcome this problem, we incorporate a jammer to increase
the system's secrecy by disrupting the eavesdropper through a broadcasted
jamming signal. Leveraging the well-adopted Gamma and Exponential distributions
approximations, the system's secrecy level is quantified by deriving
approximate and asymptotic expressions of the secrecy intercept probability
(IP) metric in terms of the main network parameters. The results show that the
secrecy is enhanced significantly by increasing the jamming power and/or the
number of reflective elements (REs). In particular, an IP of approximately
can be reached with REs and dB of jamming power-to-noise
ratio even when the legitimate links' average signal-to-noise ratios are
-dB less than the eavesdropper's one. We show that cooperative jamming is
very helpful in strong eavesdropping scenarios with a fixed number of REs, and
the number of quantization bits does not influence the secrecy when exceeding
bits. All the analytical results are endorsed by Monte Carlo simulations
Two-Way Interference Channel Capacity: How to Have the Cake and Eat it Too
Two-way communication is prevalent and its fundamental limits are first
studied in the point-to-point setting by Shannon [1]. One natural extension is
a two-way interference channel (IC) with four independent messages: two
associated with each direction of communication. In this work, we explore a
deterministic two-way IC which captures key properties of the wireless Gaussian
channel. Our main contribution lies in the complete capacity region
characterization of the two-way IC (w.r.t. the forward and backward sum-rate
pair) via a new achievable scheme and a new converse. One surprising
consequence of this result is that not only we can get an interaction gain over
the one-way non-feedback capacities, we can sometimes get all the way to
perfect feedback capacities in both directions simultaneously. In addition, our
novel outer bound characterizes channel regimes in which interaction has no
bearing on capacity.Comment: Presented in part in the IEEE International Symposium on Information
Theory 201
Transparent Spectrum Co-Access in Cognitive Radio Networks
The licensed wireless spectrum is currently under-utilized by as much as 85%. Cognitive radio networks have been proposed to employ dynamic spectrum access to share this under-utilized spectrum between licensed primary user transmissions and unlicensed secondary user transmissions. Current secondary user opportunistic spectrum access methods, however, remain limited in their ability to provide enough incentive to convince primary users to share the licensed spectrum, and they rely on primary user absence to guarantee secondary user performance. These challenges are addressed by developing a Dynamic Spectrum Co-Access Architecture (DSCA) that allows secondary user transmissions to co-access transparently and concurrently with primary user transmissions. This work exploits dirty paper coding to precode the cognitive radio channel utilizing the redundant information found in primary user relay networks. Subsequently, the secondary user is able to provide incentive to the primary user through increased SINR to encourage licensed spectrum sharing. Then a region of co-accessis formulated within which any secondary user can co-access the licensed channel transparently to the primary user. In addition, a Spectrum Co-Access Protocol (SCAP) is developed to provide secondary users with guaranteed channel capacity and while minimizing channel access times. The numerical results show that the SCAP protocol build on the DSCA architecture is able to reduce secondary user channel access times compared with opportunistic spectrum access and increased secondary user network throughput. Finally, we present a novel method for increasing the secondary user channel capacity through sequential dirty paper coding. By exploiting similar redundancy in secondary user multi-hop networks as in primary user relay networks, the secondary user channel capacity can be increased. As a result of our work in overlay spectrum sharing through secondary user channel precoding, we provide a compelling argument that the current trend towards opportunistic spectrum sharing needs to be reconsidered. This work asserts that limitations of opportunistic spectrum access to transparently provide primary users incentive and its detrimental effect on secondary user performance due to primary user activity are enough to motivate further study into utilizing channel precoding schemes. The success of cognitive radios and its adoption into federal regulator policy will rely on providing just this type of incentive
STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative Wireless LANs
Relay-assisted cooperative wireless communication has been shown to have
significant performance gains over the legacy direct transmission scheme.
Compared with single relay based cooperation schemes, utilizing multiple relays
further improves the reliability and rate of transmissions. Distributed
space-time coding (DSTC), as one of the schemes to utilize multiple relays,
requires tight coordination between relays and does not perform well in a
distributed environment with mobility. In this paper, a cooperative medium
access control (MAC) layer protocol, called \emph{STiCMAC}, is designed to
allow multiple relays to transmit at the same time in an IEEE 802.11 network.
The transmission is based on a novel DSTC scheme called \emph{randomized
distributed space-time coding} (\emph{R-DSTC}), which requires minimum
coordination. Unlike conventional cooperation schemes that pick nodes with good
links, \emph{STiCMAC} picks a \emph{transmission mode} that could most improve
the end-to-end data rate. Any station that correctly receives from the source
can act as a relay and participate in forwarding. The MAC protocol is
implemented in a fully decentralized manner and is able to opportunistically
recruit relays on the fly, thus making it \emph{robust} to channel variations
and user mobility. Simulation results show that the network capacity and delay
performance are greatly improved, especially in a mobile environment.Comment: This paper is a revised version of a paper with the same name
submitted to IEEE Transaction on Wireless Communications. STiCMAC protocol
with RTS/CTS turned off is presented in the appendix of this draf
Link Quality Control Mechanism for Selective and Opportunistic AF Relaying in Cooperative ARQs: A MLSD Perspective
Incorporating relaying techniques into Automatic Repeat reQuest (ARQ)
mechanisms gives a general impression of diversity and throughput enhancements.
Allowing overhearing among multiple relays is also a known approach to increase
the number of participating relays in ARQs. However, when opportunistic
amplify-and-forward (AF) relaying is applied to cooperative ARQs, the system
design becomes nontrivial and even involved. Based on outage analysis, the
spatial and temporal diversities are first found sensitive to the received
signal qualities of relays, and a link quality control mechanism is then
developed to prescreen candidate relays in order to explore the diversity of
cooperative ARQs with a selective and opportunistic AF (SOAF) relaying method.
According to the analysis, the temporal and spatial diversities can be fully
exploited if proper thresholds are set for each hop along the relaying routes.
The SOAF relaying method is further examined from a packet delivery viewpoint.
By the principle of the maximum likelihood sequence detection (MLSD),
sufficient conditions on the link quality are established for the proposed
SOAF-relaying-based ARQ scheme to attain its potential diversity order in the
packet error rates (PERs) of MLSD. The conditions depend on the minimum
codeword distance and the average signal-to-noise ratio (SNR). Furthermore,
from a heuristic viewpoint, we also develop a threshold searching algorithm for
the proposed SOAF relaying and link quality method to exploit both the
diversity and the SNR gains in PER. The effectiveness of the proposed
thresholding mechanism is verified via simulations with trellis codes.Comment: This paper has been withdrawn by the authors due to an improper proof
for Theorem 2. To avoid a misleading understanding, we thus decide to
withdraw this pape
Impacts of Channel Switching Overhead on the Performance of Multicast in Wireless Mesh Networks
Wireless mesh networks (WMNs) have emerged as a promising technology for next generation wireless networking. A WMN extends network coverage using wireless mesh routers that communicate with each other via multi-hop wireless communications. One technique to increase the network capacity of WMNs is to use routers equipped with multiple radios capable of transmitting and receiving on multiple channels. In a Multi-Channel Multi-Radio wireless mesh network (MCMR WMN), nodes are capable of transmitting and receiving data simultaneously through different radios and at least theoretically doubling the average throughput. On the other hand, the use of multi-radio and multi-channel technology in many cases requires routers to switch channels for each transmission and/or reception. Channel switching incurs additional costs and delay. In this thesis, we present a simulation-based study of the impacts of channel switching overheads on the performance of multicast in MCMR WMNs. We study how channel switching overheads affect the performance metrics such as packet delivery ratio, throughput, end-to-end delay, and delay jitter of a multicast session. In particular, we examine:
1. the performance of multicast in MCMR WMNs with three orthogonal channels
versus eleven overlapping channels defined in IEEE 802.11b.
2. the performance of the Minimum-interference Multi-channel Multi-radio Multicast
(M4) algorithm with and without channel switching.
3. the performance of the Multi-Channel Minimum Number of Transmissions (MCMNT)
algorithm (which does not do channel switching) in comparison with the M4 algorithm
(which performs channel switching)
- …