DEEPJYOTI ROY

An efficient cluster based key management scheme for Mobile Ad hoc Network (MANET):

An efficient cluster based key management scheme for Mobile Ad hoc Network (MANET) Deepjyoti Roy USN: 1CR06CS017 Gomathi , Parvathavarthini Trends in information Sciences & computing, IEEE (2010) Issue Date: Dec, 2010

Presentation Overview:

Presentation Overview Mobile Ad Hoc Networks Characteristics Looking from a different angle! Vulnerabilities of MANETs PROPOSED SCHEME for Key Management System Model Initialization Communication Protocol Network Dynamics

Presentation Overview Continued:

Presentation Overview Continued Performance Analysis Experimental Setup

Mobile Ad Hoc Networks:

Mobile Ad Hoc Networks Defined by the following major characteristics: No infrastructure: Does not require centralized units (base stations, access points) to provide network functionality Dynamic network topology due to node mobility Self-organized, spontaneous Communicate using multi-hop wireless channel Individual nodes act as routers - cooperate to forward both its own traffic as well as its neighbors traffic

MANETs: Operation:

MANETs: Operation A B C D E F Internet E Gateway Stand-alone MANET After one of the nodes is configured as a gateway, the entire network is connected to an external network like Internet

Mobile Ad Hoc Networks:

Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like natural or human-induced disasters, military conflicts, emergency medical situations etc Such a network may operate in a standalone fashion, or may be connected to the larger Internet - All these features have helped MANETs gain popularity in recent years. Different angle: can be defined as strangers forming a network for a common interests. No a priori shared information  f undamental trust issue! Mobile Ad Hoc Networks

VULNERABILITIES OF MANETs:

VULNERABILITIES OF MANETs Lack of secure boundaries All nodes have the freedom to join, leave and move inside the network Any node within the radio range of the other nodes in the network, can join the network No security from dangerous network accesses

VULNERABILITIES OF MANETs:

Threats from compromised nodes inside the network Malicious nodes can gain control over nodes inside the network Hard to track the compromised nodes VULNERABILITIES OF MANETs

EXISTING KEY MANAGEMENT SCHEMES: Virtual Certificate Authority:

EXISTING KEY MANAGEMENT SCHEMES: Virtual Certificate Authority Prior to network formation Trusted Third Party (network administrator) distribute the following: Load all nodes with its public key certificate Selects n Cerificate authority (CA) servers and transfer partial CA private key shares

Slide 10:

Major disadvantages: Fundamental issue of trust: who empowers the virtual CA? Require off-line trusted third party Non-scalable solution: identity and number of nodes are predetermined.

PROPOSED SCHEME:

PROPOSED SCHEME SYSTEM MODEL: Leader of Cluster All members are divided into subsets called clusters

Slide 12:

Each cluster is headed by a cluster head Hash trees are used for authentication of public keys Cluster head generates a group key and distributes it to members through secure channel When membership changes occur, the group key is regenerated SYSTEM MODEL

Initialization:

Initialization After deployment, all nodes broadcast their IDs Node with smallest ID becomes cluster head Cluster head broadcasts a message and the member nodes reply to that message and clusters are formed

Group key generation:

Group key generation Cluster head broadcast public key Member nodes broadcast their public keys and IDs Hash tree construction

Slide 15:

A balanced Hash Tree

Slide 16:

Un-balanced hash tree

Slide 17:

To authenticate a leaf node, the path from the leaf to the node is traced to get the root hash value Each intermediate node in the tree has to send the sibling value Destination node computes the root hash value from the hash values received and compare it with the stored root hash value If both match, node is authenticated Similarly Cluster heads gets authenticated

Communication Protocol:

Communication Protocol Intra Cluster Communication Inter Cluster Communication

Network Dynamics:

Network Dynamics Member Joins Member leaves: Cluster Member leaves Cluster head leaves

Performance Analysis:

Performance Analysis Forward Secrecy Backward Secrecy Node Capture

Experimental Setup:

Experimental Setup Simulation time 1000 sec Topology size 1000m X 1000m No. of nodes 200, 80 ,32, 16 No. of clusters 8,4,2 Node mobility 0 to 20m/sec Routing Protocol AODV Frequency 11 MHz Max. no. of packets 10000 Pause time 10sec

Slide 22:

Packet loss vs No. of clusters

Conclusion:

Conclusion We proposed a decentralized approach of key management Analyzed the performance Experiment and compare the results

Slide 24:

Questions ? Thank you !