A Pythagorean Tree based Key Generation Algorithm for Secure Group Communication in MANETs

نویسندگان

  • B. Gopalakrishnan
  • A. Shanmugam
چکیده

An efficient and secure group communication in Mobile Adhoc Network (MANETs) has brought attention to many security issues. In this paper, we propose Energy Efficient Dynamic Core based Multicast Routing Protocol to establish the path between the nodes that participate in group communication. During the routing process each node computes a Pythagorean Triple and constructs a Pythagorean Triple Tree (PTT) to generate a Contributory Key. Each node computes a pair of keys which will be exchanged among the nodes to compute group key for secure group communication. The rekeying operation is performed when the node join/leave the group. The proposed approach was analyzed on Computational cost, Group Formation, Percentage of Rekeying of nodes and Communicational cost with respect to Group Size. It reduces computational and communicational cost of the secure group communication when compared with other protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault - Tolerant Extension of Hypercube Algorithm for Efficient , Robust Group Communications in MANETs

Securing multicast communications in Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research directions in the areas of wireless networking and security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security on the other hand, is becoming an indispensable re...

متن کامل

Ternary Tree Based Group Key Agreement for Cognitive Radio MANETs

This paper presents an efficient contributory group key agreement protocol for secure communication between the lightweight small devices in cognitive radio mobile ad hoc networks. A Ternary tree based Group ECDH.2 (TGECDH.2) protocol that uses a batch rekeying algorithm during membership change is proposed in this paper. This ternary tree is a balanced key tree in which appropriate insertion p...

متن کامل

Group Key Agreement Protocol for MANETs Based on HSK Scheme

In this paper, we first provide a spanning tree (ST)-based centralized group key agreement protocol for unbalanced mobile Ad Hoc networks (MANETs). Based on the centralized solution, a local spanning tree (LST)-based distributed protocol for general MANETs is subsequently presented. Both protocols follow the basic features of the HSK scheme: 1) H means that a hybrid approach, which is the combi...

متن کامل

An Authenticated Transitive-Closure Scheme for Secure Group Communication in MANETS

It is essential to provide authentication on mobile nodes in group communication to ensure security and privacy. The nodes that are interested in participating in the group communication form Graphs (V, E). In this paper we authenticate the mobile nodes through transitive closure property of the graph in the routing phase of the On Demand Multicast Routing Protocol (ODMRP) that forms Transitive...

متن کامل

Key Generation using Ternary Tree based Group Key Generation for Data Encryption and Classification

Here in this paper a new and efficient technique for the Cohort of Keys using Tree based Algorithm is proposed for the Sharing of Data in Secure manner. The Key Group Procedure is implemented for the Sharing of Data where Data Owner who needs to send Data is first Encrypted Information using Tree grounded Key Group and then when Data is received at the other end it is decrypted and Classify as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013