1 / 46

Increasing the Security by Cooperation in Wireless Networks

Increasing the Security by Cooperation in Wireless Networks. My school and my personal data Motivation for the proposed research Marie Curie Project Current work Cooperative communications (game theory approach) Cooperation for security with jamming with relaying

zeal
Download Presentation

Increasing the Security by Cooperation in Wireless Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Increasing the Security by Cooperation in Wireless Networks

  2. My school and my personal data • Motivation for the proposed research • Marie Curie Project • Current work • Cooperative communications (game theory approach) • Cooperation for security • with jamming • with relaying • Disscusion and directions for future work

  3. Kingdom of Norway Size: 385’252 km2 Population: 4.8 million Capital: Oslo Oslo

  4. UNIK

  5. University of Oslo (UiO) • Norwegian University of Science and Technology (NTNU) in Trondheim • Norwegian Defense Research Establishment (FFI) • Institute for Energy Technology (Ife) • Telenor R&I

  6. Applied information technology • Energy and environment

  7. Network, information security, and • signal processing for communications • Prof. Are Hjørungnes (www.unik.no/~arehj) • Electronics and photonics • Cybernetics and Industrial Mathematics 7

  8. Nationality – Macedonia (Makedonia, マケドニア) • Undergraduate studies – University of Skopje (93 – 98) • Graduate Studies – EPFL (Lausanne, CH) (98 – 04) • Nokia Research Center (Helsinki, FIN) (03) • Sowoon Technologies (Company, Lausanne, CH) (04-07) • University of Hawai’i at Manoa (Honolulu, HI) (07-08) • University of Oslo (08-09) • Princeton University (09-12) • EPFL (12-13?) 8

  9. Improve the secrecy of transmitted data in a wireless network by cooperation among the terminals. Information theoretic security – the ability of the physical layer to provide security (beside the reliability) of the transmitted (broadcasted) data

  10. Security – traditionally higher layer issue • Physical layer security – secrecy capacity [Wyner ‘75] • Design a decentralized system that will protect the broadcasted data and make it hard for anyeavesdropper to receive the packets intended to reach only the destination • All malicious nodes should be kept as ignorant of that information as possible • The channel is wireless – no perfect secrecy can be guaranteed

  11. Two years at Princeton (with Prof. H. Vincent Poor) • Channel models for secure cooperative communications • Cooperative scenarios (Game Theory, Feedback) • Code design (LDPC, other codes) • One year at EPF Lausanne (with Prof. Bixio Rimoldi) • Completing the project, testing and simulating wireless ad-hoc and hybrid networks

  12. 4 3 1 2 1→3 2 → 4 t  1-

  13. Y=01001011 0 0 1 1 0 0 1 1 I(W;Y)/n=H(W)/n-H(W|Y)/n = 1 – 0 = 1 Z=00101110 W=01001011 I(W;Z)/n=H(W)/n-H(W|Z)/n = 1 – 1 = 0 0.5 0.5 The eavesdropper must be degraded

  14. cooperation

  15. Jamming improves the secrecy capacity • Interaction between the source and jammers • Distributed solution • Tradeoff for the jammers price • Multiple jammer case: the source should buy service from only onejammer

  16. R R D S R M

  17. Destination • Relay i • Power constraints • Source • Relay • Path loss coefficient model • Noise: Gaussian(0, σ2)

  18. Correlation models • Model 1: • Model 2:

  19. Upper bound [Gastpar & Vetterli 2005] • Lower bound [Gastpar & Vetterli 2005] • where

  20. Malicious node • Secrecy capacity bounds

  21. Definition 1: The geometrical area (region) in which the secrecy capacity is positive is called secrecy region. Definition 2: The geometrical area (region) in which the secrecy capacity vanishes is called vulnerability region. Definition 3: The normalized vulnerability region (NVR) is the ratio between the vulnerability region and the surface of the disk with radius dd,s.

  22. If q=1:

  23. source destination relay malicious node

  24. source destination relay malicious node

  25. source destination relay malicious node

  26. Cooperation among the nodes improvesthe physical layer security by minimizing the vulnerability region • More relays, less increase in the improvement: The most dramatic improvement is obtained by cooperation with one relay in comparison to the non-cooperative case • The source should choose relays that stay closer to the S-D line • The source has more benefit from the relays than the eavesdropper

  27. Cryptography • Physical layer secrecy to distribute the keys • Game Theory • Jamming • Cooperation • Different types of games • Mechanism design • Information theoretic security • Interference channels • Feedback • Partial channel state information • Relaying • Networking • Cross layer designs • Coding Theory • How to design practical codes • LDPC • Other types

  28. Binary channels (BEC, BSC, ZC, BAC) • Discrete memoryless channels • Channels with memory • Gaussian channels • Fading channels • MIMO

  29. ARIGATO ありがとうございます ninoslav.marina@gmail.com www.unik.no/~nino

More Related