Asymmetric Key management in Wireless Ad-hoc network- A Survey
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2014, Vol 2, Issue 7
Abstract
As Mobile Ad-hoc network(MANET) has no fixed infrastructure, due to which securing MANET is always a major challenge. All efficient cryptosystem require a Key management. In fact, for a good cryptosystem require an effective key management. In mobile ad hoc networks, the computational load and complexity for keymanagement are mainly related to availably of node’s resources and the dynamicnature of network topology. In this study we are trying to identify various methods for effective asymmetric key management in MANET.
Authors and Affiliations
Rajneesh Kumar, KKS Gautam
Keywords
Related Articles
- EP ID EP18401
- DOI -
- Views 305
- Downloads 13
A Modern Design of Torque Ripples Reduction in BLDC Drive for Electric Vehicle Application
BLDC motors are one of the motor type’s fast gaining the interest of the researchers. This motor attracts to a great extent concern due to its better speed, high dynamic response, high efficiency, long operating life, n...
Towards a Digital Home
The Digital Home refers to a residence with devices that are connected through a computer network. Though Digital Home technology and standards are evolving towards an integrated electronic home system, currently the di...
Exploring Agriculture Sector Using Crowdsourcing Predictors
India is a nation where agriculture is considered as a basic occupation and the largest source of national growth. Farmer is said to be man of nation. We consider this as our responsibility and prime duty to explore thi...
Design of high speed low power Content Addressable Memory (CAM) using parity bit and gated power matchline sensing
Content Addressable Memory (CAM) offers high speed search function in single clock cycle. Due to its parallel matchline comparison, Content Addressable Memory power is hungry. In general CAM has three operation modes re...
Traversal of Trees
To traverse a tree data structure is to process, however you like, every node in the data structure exactly once.The Traversal is that kind of process in which all nodes are visiting one bye one.in other words, this is...