RSRP: A Robust Secure Routing Protocol in MANET

• Autorzy: Sinha D , Bhattacharya U. , Rituparna C

Identyfikatory

DOI

10.2478/fcds-2014-0008

• Języki publikacji: EN

Abstrakty

EN

In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA-CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

Słowa kluczowe

EN

CRT; Shamirs’ secret sharing; safety key; trust agent; suspect node

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2014
• Tom: Vol. 39, No. 2
• Strony: 129--154
• Opis fizyczny: Bibliogr. 26 poz.

Twórcy

autor

Sinha D

• Assistant Professor, Department of Information Technology, CIEM, Kolkata 700040, India

autor

Bhattacharya U.

• Professor, Department of Computer Science & Technology, Bengal Engineering & Science University, Shibpur, Howrah 711103, India

autor

Rituparna C

• Associate Professor, Department of Computer Science & Engineering,West Bengal University of Technology, Kolkata 700064, India

Bibliografia

• [1] Amuthan, A., & Baradwaj, B. A., Secure Routing Scheme in MANETs using Secret Key Sharing, International Journal of Computer Applications, 22,1, 2011.
• [2] Ateniese, G., Santis, A.D., Ferrara, A.L., & Masucci, B., Provably-Secure Time-Bound Hierarchical Key Assignment Schemes, Proceedings of CCS’06.Alexandria, Virginia, USA: ACM, 2006.
• [3] Broch, J., Maltz, A.D., Johnson, B.D., Hu, C.Y., & Jetcheva, J., A performance comparison of multi-hop wireless ad hoc network routing protocols, Journal of Mobile Computing and Networking, 1998, 85-97.
• [4] Dang, L., Xu, J., Li, H. & Dang, N., DASR: Distributed Anonymous Secure Routing with Good Scalability for Mobile Ad Hoc Networks, Proceedings of 5th IEEE Asia- Pacific Services Computing Conference,.Hangzhou, China: IEEE Computer Society, 454-461, 2010.
• [5] Djenouril, D., Mahmoudil, O., Bouamama, M., Jones, D. L., & Merabti, M., On Securing MANET Routing Protocol Against Control Packet. Available:www.researchgate.net /.On_Securing_MANET_Routing_Protocol AgainstControlPacket ,2007.
• [6] Grobler, T. L., & Penzhorn, W. T., Fast Decryption Methods for RSA Cryptosystem, 7th AFRICON Conference.Paris, France: IEEEXPLORE, 2004.
• [7] Hu, Y. C., Johnson, D. B., & Perrig, A., SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless AdHoc Networks. Ad Hoc Networks Journal Elsevier, 1, 1, 2003, 175-192.
• [8] Johnson, D. B., & Maltz, D. A., Dynamic Source Routing in Ad Hoc Wireless Tomaz Imielinski and Hank Korth (Ed), Mobile Computing ,1997, 153-181.
• [9] Komninos,N., Dimitrios D., Vergados, Douligeris, C., Authentication in a layered security approach for mobile ad hoc networks , Journal of Computers & Security,26, 2007, 373-380, available at www.sciencedirect.com.
• [10] Li, H., Singhal., A Secure Routing Protocol for Wireless Ad Hoc Networks. In Proceeding of 39th Hawaii International Conference on System Sciences , Kauai, Hawaii:IEEE,2006,205a.
• [11] Lin, C. H., Lai, W. S., Huang, Y.L., & Chou, M.C., I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks, Proceedings of International Conference on Multimedia and Ubiquitous Engineering, Busan, Korea: IEEE, 2008, 102-107.
• [12] Lou, W., Liu, W., Zhang, Y., & Fang, Y., SPREAD: Improving network security by multipath routing in mobile ad hoc networks. Springer Wireless Network, 15, 279-294, 2009.
• [13] Menaka, A., & Pushpa, M.E., Trust Based Secure Routing in AODV Routing Protocol, Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications, Piscataway, NJ, USA: IEEE Xplore, 2009, 268-273.
• [14] Perkins, C. E., Belding-Royer, E. M., & Das, S. R., Ad hoc On-Demand Distance Vector (AODV) Routing, Proceedings of 2nd Workshop on Mobile computing and Applications (WMCSA '99), 1999, 90-100.
• [15] Perkins.C. E.& Bhagwa P., Highly dynamic destinationsequenced distance-vector routing (DSDV) for mobile computers, Comp. Commun. Rev.1994, 234-244.
• [16] Rivest, R.L., Shamir, A., &Adleman, L., A method for obtaining digital signatures and public-key cryptosystems., ACM, 21,2, 1978, 120-126.
• [17] Sarkar, S., Kisku, B., Misra, S., & Obaidat, M. S., Chinese Remainder Theorem- Based RSA-Threshold Cryptography in MANET using Verifiable Secret Sharing Scheme. Proceedings of IEEE International Conference On Wireless and Mobile Computing, Networking and Communications, Marrakech:IEEE, 258-262, 2009. ]
• [18] Sanzgiri, K., Dahill, B., Levine, B.N., Shields, C., & Belding-Royer., E. M.,A., Secure Routing Protocol for Ad Hoc Networks, Proceedings of 10th IEEE International Conference on Network Protocols ICNP’02, Paris, France: IEEE, 78-79, 2002.
• [19] Sehgal, P.K., & Nath, R, An Encryption Based Dynamic and Secure Routing Protocol for Mobile Adhoc Network. International Journal of Computer Science and Security IJCSS,3,1, 2009.
• [20] Shamir, A.,How to share a secret? Magazine of Communications of the ACM, 22, 11, 1979. doi:10.1145/359168.359176.
• [21] Sun, H.M., & Wu, M. E., An Approach Towards Rebalanced RSA-CRT with Short PublicExponent, Cryptology ePrint Archive: Report 2005/053, Available: http://eprint.iacr.org/2005/053.
• [22] Varaprasad, G., Dhanalakshmi, S., & Rajaram, M., New Security Algorithm for Mobile Adhoc Networks Using Zonal Routing Protocol. Ubiquitous Computing and Communication Journal (ubicc.org), 2008.
• [23] Wang, J. W., Chen, H. C., & Lin, Y. P., A Secure DSDV Routing Protocol for Ad Hoc Mobile Networks. In Proceedings of Fifth International Joint Conference on INC, IMS and IDC. 2009, 2079-2084.
• [24] Wu, C. H., Hong, J.H., & Wu, C. W., RSA Cryptosystem Design Based on the Chinese Remainder Theorem. Asia and South Pacific Design Automation Conference, Yokohama, Japan:ACM, 2001, 391-395.
• [25] Xia, G., Huang, Z. G., Wang, Z., Cheng, X., Li, W., & Znati, Secure Data Transmission on Multiple Paths in Mobile Ad Hoc Networks, LNCS Springer- Verlag Berlin Heidelberg .4138, 2006, 424-434 .
• [26] Y. Sun, W. Yu, Z. Han, K.J.R. Liu, Information theoretic framework of trust modeling and evaluation for ad hoc networks, IEEE Journal on Selected Areas in Communications, 24, 2, 305-317, 2006.