Secure Communication over Parallel Relay Channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To Appear in IEEE Transactions on Information Forensics and Security

Scientific paper

We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel which consists of multiple relay-eavesdropper channels as subchannels. For the discrete memoryless model, we establish outer and inner bounds on the rate-equivocation region. The inner bound allows mode selection at the relay. For each subchannel, secure transmission is obtained through one of two coding schemes at the relay: decoding-and-forwarding the source message or confusing the eavesdropper through noise injection. For the Gaussian memoryless channel, we establish lower and upper bounds on the perfect secrecy rate. Furthermore, we study a special case in which the relay does not hear the source and show that under certain conditions the lower and upper bounds coincide. The results established for the parallel Gaussian relay-eavesdropper channel are then applied to study the fading relay-eavesdropper channel. Analytical results are illustrated through some numerical examples.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Secure Communication over Parallel Relay Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Communication over Parallel Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Communication over Parallel Relay Channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-493878

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.