62,206 research outputs found
Communicating over Filter-and-Forward Relay Networks with Channel Output Feedback
Relay networks aid in increasing the rate of communication from source to
destination. However, the capacity of even a three-terminal relay channel is an
open problem. In this work, we propose a new lower bound for the capacity of
the three-terminal relay channel with destination-to-source feedback in the
presence of correlated noise. Our lower bound improves on the existing bounds
in the literature. We then extend our lower bound to general relay network
configurations using an arbitrary number of filter-and-forward relay nodes.
Such network configurations are common in many multi-hop communication systems
where the intermediate nodes can only perform minimal processing due to limited
computational power. Simulation results show that significant improvements in
the achievable rate can be obtained through our approach. We next derive a
coding strategy (optimized using post processed signal-to-noise ratio as a
criterion) for the three-terminal relay channel with noisy channel output
feedback for two transmissions. This coding scheme can be used in conjunction
with open-loop codes for applications like automatic repeat request (ARQ) or
hybrid-ARQ.Comment: 15 pages, 8 figures, to appear in IEEE Transactions on Signal
Processin
Using Channel Output Feedback to Increase Throughput in Hybrid-ARQ
Hybrid-ARQ protocols have become common in many packet transmission systems
due to their incorporation in various standards. Hybrid-ARQ combines the normal
automatic repeat request (ARQ) method with error correction codes to increase
reliability and throughput. In this paper, we look at improving upon this
performance using feedback information from the receiver, in particular, using
a powerful forward error correction (FEC) code in conjunction with a proposed
linear feedback code for the Rayleigh block fading channels. The new hybrid-ARQ
scheme is initially developed for full received packet feedback in a
point-to-point link. It is then extended to various different multiple-antenna
scenarios (MISO/MIMO) with varying amounts of packet feedback information.
Simulations illustrate gains in throughput.Comment: 30 page
Optimal Active Social Network De-anonymization Using Information Thresholds
In this paper, de-anonymizing internet users by actively querying their group
memberships in social networks is considered. In this problem, an anonymous
victim visits the attacker's website, and the attacker uses the victim's
browser history to query her social media activity for the purpose of
de-anonymization using the minimum number of queries. A stochastic model of the
problem is considered where the attacker has partial prior knowledge of the
group membership graph and receives noisy responses to its real-time queries.
The victim's identity is assumed to be chosen randomly based on a given
distribution which models the users' risk of visiting the malicious website. A
de-anonymization algorithm is proposed which operates based on information
thresholds and its performance both in the finite and asymptotically large
social network regimes is analyzed. Furthermore, a converse result is provided
which proves the optimality of the proposed attack strategy
- …