TY - GEN
T1 - Increasing the information-theoretic secrecy by cooperative relaying and jamming
AU - Marina, Ninoslav
AU - Stojanovski, Toni Draganov
AU - Poor, H. Vincent
PY - 2012
Y1 - 2012
N2 - The use of cooperation to increase the information-theoretic secrecy in a decentralized ad-hoc wireless network is investigated. In particular, four cases of cooperative relaying are analyzed and compared. These cases include the no-cooperation case, the case with single-hop cooperation with multiple relays, the case with single-hop cooperation with the strongest relay, and finally the case of multi-hop cooperation with the strongest relay. From the results, it is seen that cooperation increases the probability of a positive secrecy rate between two nodes in a network with friendly (cooperative) nodes and eavesdropping nodes. The improved information-theoretic secrecy increases the probability that two nodes can share a secret message with perfect secrecy using a multi-hop route of trusted nodes. Cooperative jamming is also studied, and it is observed that very often it is more beneficial to use friendly nodes for cooperative jamming than cooperative relaying. Finally, a combination of cooperative relaying and jamming is considered.
AB - The use of cooperation to increase the information-theoretic secrecy in a decentralized ad-hoc wireless network is investigated. In particular, four cases of cooperative relaying are analyzed and compared. These cases include the no-cooperation case, the case with single-hop cooperation with multiple relays, the case with single-hop cooperation with the strongest relay, and finally the case of multi-hop cooperation with the strongest relay. From the results, it is seen that cooperation increases the probability of a positive secrecy rate between two nodes in a network with friendly (cooperative) nodes and eavesdropping nodes. The improved information-theoretic secrecy increases the probability that two nodes can share a secret message with perfect secrecy using a multi-hop route of trusted nodes. Cooperative jamming is also studied, and it is observed that very often it is more beneficial to use friendly nodes for cooperative jamming than cooperative relaying. Finally, a combination of cooperative relaying and jamming is considered.
UR - http://www.scopus.com/inward/record.url?scp=84875757603&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875757603&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2012.6483324
DO - 10.1109/Allerton.2012.6483324
M3 - Conference contribution
AN - SCOPUS:84875757603
SN - 9781467345385
T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
SP - 974
EP - 981
BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
T2 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Y2 - 1 October 2012 through 5 October 2012
ER -