CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Efficient and Secured AOMDV Routing Protocol with Shamir's Secret Sharing Scheme

by Lt.Dr. S. Santhosh Baboo, C. Chandrasekar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 33 - Number 4
Year of Publication: 2011
Authors: Lt.Dr. S. Santhosh Baboo, C. Chandrasekar
10.5120/4012-5698

Lt.Dr. S. Santhosh Baboo, C. Chandrasekar . An Efficient and Secured AOMDV Routing Protocol with Shamir's Secret Sharing Scheme. International Journal of Computer Applications. 33, 4 ( November 2011), 44-48. DOI=10.5120/4012-5698

@article{ 10.5120/4012-5698,
author = { Lt.Dr. S. Santhosh Baboo, C. Chandrasekar },
title = { An Efficient and Secured AOMDV Routing Protocol with Shamir's Secret Sharing Scheme },
journal = { International Journal of Computer Applications },
issue_date = { November 2011 },
volume = { 33 },
number = { 4 },
month = { November },
year = { 2011 },
issn = { 0975-8887 },
pages = { 44-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume33/number4/4012-5698/ },
doi = { 10.5120/4012-5698 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:19:20.009396+05:30
%A Lt.Dr. S. Santhosh Baboo
%A C. Chandrasekar
%T An Efficient and Secured AOMDV Routing Protocol with Shamir's Secret Sharing Scheme
%J International Journal of Computer Applications
%@ 0975-8887
%V 33
%N 4
%P 44-48
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Security has turned out to be a most important concern to facilitate secured communication between mobile nodes in a wireless environment. It is essential to protect the network from several kinds of security attacks. Recently, large numbers of routing protocols have been developed. But, most of the available protocols are single path or makes use of only a certain path at a particular time or can not prevent both the passive attacks and active attacks at the same time. Hence, propose a secured Ad-hoc On-demand Distance Vector routing protocol (AOMDV) based on secret sharing. Cryptography is one of the efficient technique to provide security to data being broadcasted in wireless communications systems. Enhanced information security can be offered by integrating AOMDV and Shamir's secret sharing scheme. In this approach, keys are produced by source and transmitted to the other nodes in the network. AOMDV and SAOMDV (AOMDV with Shamir's Secret Sharing Scheme) are simulated and the performance of both the protocols are evaluated. The performance of Secured AOMDV was stable but that of AOMDV was found to be degrading sharply with intrusion of malicious nodes in the network.

References
  1. Luo Junhai, Ye Danxia, Xue Liu, and Fan Mingyu, “A Survey of Multicast Routing Protocols for Mobile Ad-Hoc Networks”, IEEE Communications Surveys & Tutorials, Vol. 11, No. 1, Pp. 78-91, 2009.
  2. Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, “Survey of routing attacks in Mobile Ad-Hoc Networks”, IEEE wireless communication, Pp. 85-91, 2007.
  3. Hongmei Deng, Wei Li, and Dharma P. Agarwal “Routing security in wireless Ad Hoc networks”, IEEE Communications Magazine, 2002.
  4. M. Guerrero Zapata and N. Asokan, “Securing Ad hoc Routing Protocols,” in Proceedings of the 1st ACM workshop on Wireless security, Atlanta, GA, USA, Sep 2002, pp. 1–10.
  5. C. E. Perkin, E. M. Royer, “Ad-hoc on demand distance vector(AODV)routing”, The Second IEEE Workshop on Mobile Computing Systems and Applications, 1999.
  6. Naeem, M.; Ahmed, Z.; Mahmood, R.; Azad, M.A.; “QOS based performance evaluation of secure on-Demand routing protocols for MANET's”, International Conference on Wireless Communication and Sensor Computing, 2010, pages 1-6, ICWCSC 2010.
  7. Cerri, D. Ghioni, A. “Securing AODV: the A-SAODV secure routing prototype”, IEEE Communications Magazine, Vol. 46, No. 2, page(s): 120 – 125, 2008.
  8. Kotzanikolaou, P.; Mavropodi, R.; Douligeris, C.; “Secure Multipath Routing for Mobile Ad Hoc Networks”, WONS 2005. Second Annual Conference on Wireless On-demand Network Systems and Services, Page(s): 89 – 96, 2005.
  9. R. Perlman, Fault-tolerant broadcast of routing information, Computer Networks, 7, 395–405 (1983).
  10. L. Zhou, and Z. J. Haas, Securing ad-hoc networks, IEEE Network Mag., 13, 24–30 (1999).
  11. Perkins CE, Royer EM, “Ad hoc on-demand distance vector routing”, In Proceedings of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 1999.
  12. Perkins CE, Belding-Royer E, Das SR, “Ad hoc on-demand distance vector (AODV) routing”, http://www.ietf.org/rfc/rfc3561.txt, 2003.
  13. Marina MK, Das SR, “Performance of route caching strategies in dynamic source routing”, In Proceedings of Workshop on Wireless Networks and Mobile Computing (WNMC) in conjunction with International Conference on Distributed Computing Systems (ICDCS), 2001.
  14. Marina MK, Das SR, “Routing performance in the presence of unidirectional links in multihop wireless networks”, In Proceedings of ACM MobiHoc, 2002.
  15. Nasipuri A, Castaneda R, Das SR, “Performance of multipath routing for on-demand protocols in mobile ad hoc networks”, ACM/Kluwer Mobile Networks and Applications (MONET), Vol. 6, No. 4, Pp. 339–349, 2001.
  16. A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and Its Applications, ISBN 0-8493-8523-7, 1997.
  17. 17 Adi Shamir, “How to Share a Secret”, Communications of the ACM, Vol. 22, No. 11, Pp. 612-613, 1979.
Index Terms

Computer Science
Information Sciences

Keywords

Mobile Ad Hoc Networks Multihop Wireless Networks On-Demand Routing Multipath Routing Secret Sharing

Powered by PhDFocusTM