Abstract
A Mobile Adhoc Network (MANET) consists of numerous number of nodes, neighbor nodes are connected by means of radio links. Each node is constrained with limited power, bandwidth and scalability. Many researchers lay their effort to develop various techniques for providing a secure route in MANET. As a result, an Elliptic Curve Cryptography (ECC) technique is used to develop a secure shortest algorithm for routing the packet from source node to destination node, since ECC is famous due to its shorter key length and less computational overhead for encryption and decryption operation. ECC is more suitable for power constrained devices. But ECC based secure routing protocol requires a large number of Route Request (RREQ) packet in Adhoc on Demand Distance Vector (AODV) protocol and consumes more power. In order to reduce the number of RREQ packet and power consumption, a proposed secure energy efficient routing protocol is implemented. Finally, discuss the improvement of the proposed approach with the existing systems using GloMoSim software tool.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vijaya I, Mishra PB, Dash AR, Rath AK (2011) Influence of routing protocols in performance of wireless mobile adhoc network. In: The IEEE proceedings of second international conference on emerging applications of information technology (EAIT), pp 340–344
Lai J-Y, Huang C-T (2011) Energy-adaptive dual-field processor for high-performance elliptic curve cryptographic applications. In: The IEEE transactions on very large scale integration (VLSI) systems 19(8)
Tutanescu I, Anton C, Ionescu L, Caragata D (2012) Elliptic curves cryptosystems approaches. IEEE Proc Inf Soc 357–362
Yingzhan K (2011) Extended fault analysis on elliptic curve cryptosystems against repeated doubling. In: The IEEE proceedings of international conferences of instrumentation, measurement, computer, communication and control, pp 545–548
Fan X, Wollinger T, Gong G (2007) Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems. IEEE J Proc Inf Secur 1(2):65–81
Wollinger T, Pelzl J, Paar C (2005) Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems. IEEE Trans. Comput. 54(7):861–872
Fang Y, Wu Z (2012) A new parallel processor architecture for genus 2 hyperelliptic curve cryptosystems. In: The proceedings of IEEE computer society annual symposium on VLSI (ISVLSI), pp 177–182
Nizamuddin N, Ch SA, Amin N (2011) Signcryption schemes with forward secrecy based on hyperelliptic curve cryptosystem. In: The IEEE proceedings of high capacity optical networks and enabling technologies (HONET), pp 244–247
Jalil KA (2011) Securing routing table update in AODV routing protocol. In: The IEEE proceedings of IEEE conference on open systems (ICOS), pp 116–121
Vaidya B, Makeakis D (2011) Provisioning secure on-demand protocol in mobile ad hoc network. In: The IEEE proceedings of international conference on internet (AH-ICI), pp 1–5
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Vijayakumar, P., Rajashree, R., Sandhya, P. (2017). A Secure Route Discovery Protocol for AODV Based Mobile Adhoc Networks Using Hyperelliptic Curve Cryptography. In: Attele, K., Kumar, A., Sankar, V., Rao, N., Sarma, T. (eds) Emerging Trends in Electrical, Communications and Information Technologies. Lecture Notes in Electrical Engineering, vol 394. Springer, Singapore. https://doi.org/10.1007/978-981-10-1540-3_22
Download citation
DOI: https://doi.org/10.1007/978-981-10-1540-3_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1538-0
Online ISBN: 978-981-10-1540-3
eBook Packages: EngineeringEngineering (R0)