Papers
Topics
Authors
Recent
Search
2000 character limit reached

Secure Ad-hoc Routing Scheme

Published 8 Jun 2015 in cs.IT, cs.CR, cs.NI, and math.IT | (1506.02354v2)

Abstract: This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop network with several relays and an eavesdropper at each hop which provides a safe routing scheme to transmit confidential message from transmitter to legitimate receiver. The selection is based on the instantaneous channel conditions of relay and eavesdropper at each hop. A theoretical analysis is performed to derive new closed form expressions for probability of non-zero secrecy capacity along with the exact end to end secrecy outage probability at a normalized secrecy rate. Furthermore, we provide the asymptotic expression to gain insights on the diversity gain.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.