LSRP: a lightweight secure routing protocol with low cost for ad-hoc networks

Authors:
Bok-Nyong Park;Jihoon Myung;Wonjun Lee
Affiliations:
Dept. of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Republic of Korea
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 6
Cited 1

Ariadne: a secure on-demand routing protocol for ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Strategies for enhancing routing security in protocols for mobile ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The handbook of ad hoc wireless networks

The handbook of ad hoc wireless networks

A key management and secure routing integrated framework for Mobile Ad-hoc Networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad-hoc networks consist of only mobile nodes and have no support infrastructure. Due to the limited resources and frequent changes in topologies, ad-hoc network should consider these features for the provision of security. We present a lightweight secure routing protocol (LSRP) applicable for mobile ad-hoc networks. Since the LSRP uses an identity-based signcryption scheme, it can eliminate public or private key exchange, and can give savings in computation cost and communication overhead. LSRP is more computationally efficient than other RSA-based protocols because our protocol is based on the properties of pairings on elliptic curves. Empirical studies are conducted using NS-2 to evaluate the effectiveness of LSRP. The simulation results show that the LSRP is more efficient in terms of cost and overhead.