229 search results - page 15 / 46 » On the Secrecy Capacity of Fading Channels |
MOBIHOC
2010
ACM
14 years 11 months ago
2010
ACM
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
100
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we provide a new achievable ergodic secrecy rate region for the multiple access wiretap channel in fading. Our achievable scheme is based on repeating each symbol at...
102
click to vote
CORR
2010
Springer
15 years 10 days ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation...
119
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...