CCNxCon2012: Session 5: CCN Location Sharing System
•
0 j'aime•461 vues
CCN Location Sharing System Fabien Gavelle, Farid Benbadis (Thales Communications & Security S.A., France)
![CCN location sharing system (1)
Fabien Gavelle, Farid Benbadis, Jérémie Leguay
Thales Communications and Security, France
Context
R1
Constraint networks
Networks with a high bit error rate and latency
Communications between nodes must be confidential VHF/HF
R2 R3
Hierarchical topology
Each network is provided with a head (R1, R2, R3)
A head can act as a gateway between two networks (R2, R3)
VHF/HF VHF/HF
Nodes share information
Nodes need to share their location X1
X3
X2
Information sharing is controlled and limited by the heads
Location sharing without CCN Integration of CCN
When a node wants to retrieve another node location CCN architecture objectives
The node expresses a request for the location Limit the number of exchanged messages between the nodes sharing
The request is forwarded to the destination (if authorized by the heads information
of the crossed networks) Improve the network resource consumption
The location is returned by the destination to the interested node Deliver the shared information in a timely manner
Problem statement How to integrate the CCN architecture ?
Same location required by nearby nodes Using the open source code developed by CCNx
Retransmission from the source to the destination in case of loss Develop the application on top of the CCNx architecture
Location sharing Location retrieval
R1 R1
The Interest is forwarded if
X1 wants to share X2 and X3 want to 3 authorized by the heads
its position retrieve X1 location
2
k1 is generated and
R2 4 R2 2
stored by R2 R3 R3
Interest to request a s
k1 is delivered Interest to request X1
symmetric key and stored by k1 symmetric key
intermediate
1 VHF/HF nodes
3
k1 is delivered as a
Data k1
X3 X3
X1 X2 X1 X2
4 X1 Content Store 1 5
X1 encrypts and shares its E(X1 location) k1 X2 and X3 retrieve E(X1 location) k1 X2 and X3 can decrypt the
location using the traditional CCN mechanisms retrieved position
Location sharing system evaluation
Topologies
20 hierarchical topologies
Number of nodes = [5, 10, 15, 20, 25, 30, 35, 40]
Scenario
Each node retrieves the location of all the other nodes (one time)
Measurements
For each topology, the number of exchanged messages is counted with
and without CCN
(1) This research project is funded by FP7 Fi-‐Content](https://image.slidesharecdn.com/1gavelle-130118125854-phpapp02/85/ccnxcon2012-session-5-ccn-location-sharing-system-1-320.jpg)
Recommandé
Recommandé
Contenu connexe
Tendances
Tendances (20)
Similaire à CCNxCon2012: Session 5: CCN Location Sharing System
Similaire à CCNxCon2012: Session 5: CCN Location Sharing System (20)
Plus de PARC, a Xerox company
Plus de PARC, a Xerox company (20)
CCNxCon2012: Session 5: CCN Location Sharing System
- 1. CCN location sharing system (1) Fabien Gavelle, Farid Benbadis, Jérémie Leguay Thales Communications and Security, France Context R1 Constraint networks Networks with a high bit error rate and latency Communications between nodes must be confidential VHF/HF R2 R3 Hierarchical topology Each network is provided with a head (R1, R2, R3) A head can act as a gateway between two networks (R2, R3) VHF/HF VHF/HF Nodes share information Nodes need to share their location X1 X3 X2 Information sharing is controlled and limited by the heads Location sharing without CCN Integration of CCN When a node wants to retrieve another node location CCN architecture objectives The node expresses a request for the location Limit the number of exchanged messages between the nodes sharing The request is forwarded to the destination (if authorized by the heads information of the crossed networks) Improve the network resource consumption The location is returned by the destination to the interested node Deliver the shared information in a timely manner Problem statement How to integrate the CCN architecture ? Same location required by nearby nodes Using the open source code developed by CCNx Retransmission from the source to the destination in case of loss Develop the application on top of the CCNx architecture Location sharing Location retrieval R1 R1 The Interest is forwarded if X1 wants to share X2 and X3 want to 3 authorized by the heads its position retrieve X1 location 2 k1 is generated and R2 4 R2 2 stored by R2 R3 R3 Interest to request a s k1 is delivered Interest to request X1 symmetric key and stored by k1 symmetric key intermediate 1 VHF/HF nodes 3 k1 is delivered as a Data k1 X3 X3 X1 X2 X1 X2 4 X1 Content Store 1 5 X1 encrypts and shares its E(X1 location) k1 X2 and X3 retrieve E(X1 location) k1 X2 and X3 can decrypt the location using the traditional CCN mechanisms retrieved position Location sharing system evaluation Topologies 20 hierarchical topologies Number of nodes = [5, 10, 15, 20, 25, 30, 35, 40] Scenario Each node retrieves the location of all the other nodes (one time) Measurements For each topology, the number of exchanged messages is counted with and without CCN (1) This research project is funded by FP7 Fi-‐Content