Increasing the Security by Cooperation in Wireless Networks

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 385252 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 RI

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 Hawaii 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 any
  eavesdropper 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

13

14

15

16

17
4
3
1
2
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
Y01001011
I(WY)/nH(W)/n-H(WY)/n 1 0
1
Z00101110
W01001011
I(WZ)/nH(W)/n-H(WZ)/n 1 1
0
0.5
0.5
The eavesdropper must be degraded
24
(No Transcript)
25
cooperation
26
(No Transcript)
27
(No Transcript)
28

• 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 one jammer

29
R
R
D
S
R
M
30

• Noise Gaussian(0, s2)

31

• Correlation models
• Model 1
• Model 2

32

• Upper bound Gastpar Vetterli 2005
• Lower bound Gastpar Vetterli 2005
• where

33

• Malicious node
• Secrecy capacity bounds

34

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.
35

If q1
36

37

38

39
(No Transcript)
40
(No Transcript)
41

42

• Cooperation among the nodes improves the
  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

43

• 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

• Coding Theory
• How to design practical codes
• LDPC
• Other types

• Networking
• Cross layer designs

44

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

45
(No Transcript)
46

ARIGATO
??????????
ninoslav.marina_at_gmail.com www.unik.no/nino