Cart (Loading....) | Create Account
Close category search window
 

Securing Mobile Ad Hoc Networks through AntTree Clustering and Threshold Cryptography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Subathra, P. ; Dept. of Comput. Sci. & Eng., Thiagarajar Coll. of Eng., Madurai ; Sivagurunathan, S. ; Selvanj, G.S.R.E.

Security has become a prime concern in providing communication between mobile nodes in a hostile environment. Unlike wired networks, the unique characteristics of Mobile Ad Hoc networks (MANETs) pose a number of non-trivial challenges to security design. This paper presents a threshold security mechanism with an AntTree clustering algorithm. Nodes which have similar movement pattern are grouped into a cluster. Clustering requires flooding of control information to all the constituent nodes in the network. Flooding is expensive in terms of overhead. It also litters valuable resources such as bandwidth and power. An improvement to flooding is to select probabilistically, a subset of nodes to rebroadcast. To perform efficient clustering, we introduce a new signal strength based metric to estimate the distance between any two nodes in the mobile environment. We employ a threshold cryptographic scheme to protect routing information and data traffic. To ensure distributed trust in the clustered environment, we divide the private key (k) into n pieces in such a way that k is easily reconstructable from any t number of pieces. Even complete knowledge of (t-1) pieces reveal absolutely no information about k.

Published in:

Ad Hoc and Ubiquitous Computing, 2006. ISAUHC '06. International Symposium on

Date of Conference:

20-23 Dec. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.