Secure and effective random paths selection (SERPS) algorithm for security in MANETs
-
2018-03-19 https://doi.org/10.14419/ijet.v7i2.8.10345 -
Dynamic Routing, Node Disjoint Paths, Minimum Cost, Secure and Effective Random Paths Selection (SERPS) Algorithm. -
Abstract
Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.
-
References
[1] Adnan Nadeem., Michael P. Howarth, “ A survey of manet intrusion detection & prevention approaches for network layer attacks,†IEEE COMMUNICATIONS SURVEYS & TUTORIALS, Vol. 15, Issue 4, pp. 2027-2045, 2013.https://doi.org/10.1109/SURV.2013.030713.00201.
[2] J. Godwin Ponsam and R.Srinivasan, “A survey on MANET security challenges, attacks and its countermeasures,†International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), Vol. 3, Issue 1, 2014.
[3] Shiva Shankar, GollaVaraprasad and Hosahalli Narayan [1]agowda Suresh, "Importance of on-demand modified power aware dynamic source routing protocol in mobile ad-hoc networks," IET Microwaves, Antennas & Propagation, Vol. 8, Issue 7, pp. 459-464, 2014.https://doi.org/10.1049/iet-map.2013.0230.
[4] Zaiba Ishrat, “Security issues, challenges & solution in MANETâ€, IJCST Vol. 2, Issue 4, 2011.
[5] P.Suma, “Overview of Terminology Related to the Security Issues in MANETSâ€, IJAER, Vol. 10, Issue 11, 2015, pp.29457-29466.
[6] Yuxin Mao and Ping Zhu, "A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Node's Selfishness", Mobile Networks and Applications, Vol. 20, no. 5, pp. 593-603, 2015.https://doi.org/10.1007/s11036-015-0610-7.
[7] Shubhajeet Chatterjee and Swagatam Das, "Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network," Information Sciences, Vol. 295, pp. 67–90, 2015. https://doi.org/10.1016/j.ins.2014.09.039.
[8] P Suma, O Nagaraju, MA Hussain, “Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETSâ€, International Journal of Electrical and Computer Engineering (IJECE), Vol. 7 Issue. 3, pp. 1197-1203, 2017. https://doi.org/10.11591/ijece.v7i3.pp1197-1203.
[9] Dr.ShuchitaUpadhayaya and Charu Gandhi., "Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation". International Journal of Computer Science Issues (IJCSI), Vol. 7, Issue 1, No. 2. 2010.
[10] Luo LIU1, Laurie CUTHBERT2. "QoS in Node-Disjoint Routing for Ad Hoc Networks", I. J. Communications, Network and System Sciences. vol , no. 1-103, 2008.
[11] A.Monisha, K.Vijayalakshmi, "A Reliable Node-Disjoint Multipath Routing Protocol For MANET", International Journal of Computational Engineering Research, Vol. 03, Issue. 4, pp. 6, 2013.
[12] Jayshree Tajne, Veena Gulhane, "Multipath Node-Disjoint Routing Protocol to Minimize End To End Delay and Routing Overhead for MANETs", International Journal of Engineering Research and Applications (IJERA), Vol. 3, no. 4, pp.1691-1698, 2013.
[13] Priyanka Goyal, Sahil Batra, Ajit Singh, “A Literature Review of Security Attack in Mobile Ad-hoc Networksâ€, International Journal of Computer Applications. Vol. 9, No.12, 2013.
[14] Xu Yi, Cui Mei, Yang Wei, Xan Yin, “A Node disjoint Multipath Routing in Mobile Ad hoc Networksâ€, IEEE,2011.
[15] Liang Huang ,Fubao Wang, Guoqiang Yan, WeijunDuan, “An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networksâ€, 2nd International Conference on Challenges in Environmental Science and Computer Engineering (CESCE 2011), Volume 11, Part A, PP.518–524, 2011.https://doi.org/10.1016/j.proenv.2011.12.082.
[16] S.SharonRanjini, G.Shine Let , “Security-Efficient Routing For Highly Dynamic MANETS “, International Journal of Engineering and Advanced Technology (IJEAT),vol 2, no. 4, 2013.
[17] Rajinder Singh, Parvinder Singh and Manoj Duhan ,"An effective implementation of security based algorithmic approach in mobile adhoc networksâ€, Human-centric Computing and Information Sciences, 2014.
[18] S.-J. Lee and M. Gerla, "AODV-BR: Backup Routing in Ad hoc Networks", In Proceedings of IEEE WCNC 2000, Chicago, IL, Sep. 2000.https://doi.org/10.1109/WCNC.2000.904822.
[19] Hamdy H El-Sayed., “Shortest paths routing problemâ€, Applied Mathematics & Information Sciences, Vol. 10, Issue. 5, pp. 1885-1891, 2016.
[20] Dr.Mohammed Ali Hussain, et al, “Energy Conservation Techniques in Ad hoc Networksâ€, International Journal of Computer Science and Information Technologies, Vol. 2, no. 3, pp. 1182-1186, 2013.
[21] S.J. Sultanuddin, et al, “An Efficient Approach For Countering Black Hole Attack In Manets “,International Journal of Computer and Electronics Research Vol. 2, no. 2, 2013.
[22] P. Suma, O. Nagaraju and Md. Ali Hussain, “Cost Optimal Random Path Selection Algorithm for Security in MANETSâ€, www.ijird.com, International Journal of Innovative Research and Development, ISSN 2278 – 0211 (Online), January, 2016, Vol 5 Issue 2.
[23] Dr.Seetaiah Kilaru, Hari Kishore K, Sravani T, Anvesh Chowdary L, Balaji T “Review and Analysis of Promising Technologies with Respect to fifth Generation Networksâ€, 2014 First International Conference on Networks & Soft Computing, ISSN: 978-1-4799-3486-7/14, pp. 270-273, August 2014.
[24] T. Padmapriya and V.Saminadan, “Improving Performance of Downlink LTE-Advanced Networks Using Advanced Networks Using Advanced feedback Mechanisms and SINR Modelâ€, International Conference on Emerging Technology (ICET), vol.7, no.1, pp: 93, March 2014.
[25] S.V.Manikanthan and V.Rama“Optimal Performance Of Key Predistribution Protocol In Wireless Sensor Networks†International Innovative Research Journal of Engineering and Technology ,ISSN NO: 2456-1983,Vol-2,Issue –Special –March 2017.
[26] K.Srikar, M.Akhil, V.Krishna reddy “Execution of Cloud Scheduling Algorithmsâ€, International Innovative Research Journal of Engineering and Technology ISSN NO: 2456-1983.Volume 2, Issue 4 June 2017. 108 -111.
-
Downloads
-
How to Cite
Suma, P., & Ali Hussain, M. (2018). Secure and effective random paths selection (SERPS) algorithm for security in MANETs. International Journal of Engineering & Technology, 7(2.8), 134-138. https://doi.org/10.14419/ijet.v7i2.8.10345Received date: 2018-03-19
Accepted date: 2018-03-19
Published date: 2018-03-19