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

Hypercube Routing Protocol with Secure Data Transmission Mechanisms in Sensor Networks Using Elliptic Curve Diffie-Hellman Key Agreements

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

1 Author(s)
Hua-Yi Lin ; Dept. of Inf. Manage., China Univ. of Technol., Taiwan

This study presents a hypercube routing algorithm with secure data transmissions, which provides rapid, efficient and fault-tolerant routing mechanisms using elliptic curve Diffie-Hellman (ECDH) scheme to perform key agreements and secure data transmissions. Since ECDH uses a small key length 160-bit to achieve compatible security levels on 1024-bit Diffee-Hellman (DH), therefore sensor nodes only need few CPU, memory and bandwidth to complete security operations. Consequently, the proposed routing algorithm with secure data transmissions can perform very rapidly and efficiently, and are highly suited for wireless sensor networks (WSNs) with limited resources.

Published in:

New Trends in Information and Service Science, 2009. NISS '09. International Conference on

Date of Conference:

June 30 2009-July 2 2009

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.