Volume 0 , Issue 1 , PP: 31-44, 2019 | Cite this article as | XML | Html | PDF | Full Length Article
Uma Maheshwari 1 * , Suresh Babu 2 , Mahendra khan 3 , Kadiyam Rajshekar 4 , Manideepika Manchikalapati 5
In an ad hoc network, the routing protocol takes into account a variety of activities, including maintaining network connection, transmission scheduling, channel evaluation, and preserving network connectivity. Additionally, it determines network architecture. In addition, a number of different elements determines the performance of a routing protocol. These include node mobility, which is responsible for multiple link failures, support for quality of service (QoS), network size, the amount of traffic, and the level of security. The performance may occasionally also be affected by the manner in which the network is behaving in addition to the kinds of apps that are running in that environment. Selecting an appropriate protocol that is based on security is highly crucial in order to set up an effective network. A significant amount of effort has been put into improving the safety mechanisms that are built into routing protocols, most prominently in WSNs, MANETs, VANETs, and WMNs. Only MANET will be the topic of discussion here. Mobile Ad-Hoc Network is a wireless network that does not need infrastructure and is composed of mobile nodes. Mobile ad-hoc network, also known as MANET, is one of the most promising forms of next-generation wireless networking technology. It has garnered a significant amount of interest because it is self-organized and can be deployed at a cheap cost. In comparison to a traditional network, a MANET presents a number of challenges that are especially difficult to overcome when it comes to the duty of routing. The many difficulties that are inherent with MANET have made it an excellent subject for academic investigation. This provides a concise overview of security in MANETs as well as the issues that relate to maintaining them. Understanding the different routing mechanisms and the potential attacks that might be mounted against them is the first step in designing a reliable security mechanism. Within the scope of this study effort, we have provided specifics on the detection and prevention of various routing attacks, with the primary emphasis being placed on the network layer assaults that are unique to MANET. When compared to other study fields, MANET presents the greatest challenge in terms of maintaining network security. In recent years, a significant amount of research has been carried out to investigate several forms of assault; nevertheless, most of the surveys have been carried out without any kind of performance analysis. There is a paucity of research that seeks to find an all-encompassing study of the impact of the many different attacks that bring the overall performance of the Adhoc network down. On the other hand, secure routing in the face of a black hole attack can be difficult because preferences are often incomplete. The in-degree centrality and importance degree measurement applied to the collected consensus-based trust from decision-makers solves the issue of incomplete preferences and improves the accuracy of trust at the same time. Utilizing Network Simulator, we examine how well the suggested approach works. Based on the findings of the simulations, it has been demonstrated that the detection accuracy and throughput of the proposed CREDIT are both significantly higher than those of existing work, making the proposed CREDIT scheme superior.
Ad-Hoc Network , Mobile ad-hoc network , routing protocol , Black-hole attack
[1] Perkins CE, Bhagwat P (1994) Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. Proceedings of ACM SIGCOMM 1994:234–244
[2] Cheng C, Riley R, Kumar SPR, Garcia-Luna-Aceves JJ (1989) A Loop-Free Extended Bellman- Ford Routing Protocol Without Bouncing Effect. ACM SIGCOMM Computer Communications Review, Volume 19, Issue 4:224–236
[3] Murthy S, Garcia-Luna-Aceves JJ (1996) An Efficient Routing Protocol for Wireless Networks. Mobile Networks and Applications, Volume 1, Issue 2:183–197 ISSN : 0975-3397711
[4] G.Vijaya Kumar et. al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 03, 2010, 706-713
[5] Humblet PA (1991) Another Adaptive Distributed Shortest-Path Algorithm. IEEE Transactions on Communications, Volume 39, Issue 6:995–1003
[6] Rajagopalan B, Faiman M (1991) A Responsive Distributed Shortest-Path Routing Algorithm Within Autonomous Systems. Journal of Internetworking Research and Experiment, Volume 2, Issue 1:51–69
[7] Chiang C-C, Wu H-K, Liu W, Gerla M (1997) Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel. Proceedings of IEEE SICON:197–211
[8] Chen T-W, Gerla M (1998) Global State Routing: A New Routing Scheme for Ad-hoc Wireless Networks. Proceedings of IEEE ICC 1998:171–175
[9] Iwata A, Chiang C-C, Pei G, Gerla M, Chen T-W (1999) Scalable Routing Strategies for Ad Hoc Wireless Networks. IEEE Journal on Selected Areas in Communications, Volume 17, Issue 8:1369–1379
[10] Jao-Ng M, Lu I-T (1999) A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks. IEEE Journal on Selected Areas in Communications, Volume 17, Issue 8:1415–1425
[11] Pei G, Gerla M, Hong X (2000) LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Network with Group Mobility. First Annual Workshop on Mobile and Ad Hoc Networking and Computing 2000 (MobiHoc 2000):11–18
[12] Tsuchiya PF (1988) The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks. Computer Communication Review, Volume 18, Issue 4:35–42
[13] Jacquet P, Mu¨ hlethaler P, Clausen T, Laouiti A, Qayyum A, Viennot L (2001) Optimized Link State Routing Protocol for Ad Hoc Networks. IEEE INMIC 2001:62–68
[14] Toh C-K (1996) A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing. Proceedings of the 1996 IEEE 15th Annual International Phoenix Conference on Computers and Communications:480–486
[15] Dube R, Rais CD, Wang K-Y, Tripathi SK (1997) Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks. IEEE Personal Communications, Volume 4, Issue 1:36–45
[16] Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. Proceedings of IEEE INFOCOM 1997, Volume 3:1405–1413
[17] Jiang M, Li J, Tay YC (1999) Cluster Based Routing Protocol (CBRP). IETF Draft, August 1999, available at http://tools.ietf.org/html/draft-ietf-manet-cbrp-spec-01. Accessed 21 February 2008
[18] Broch J, Johnson DB, Maltz DA (1999) The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. IETF Draft, October, 1999, available at http://tools.ietf.org/id/draft-ietf-manetdsr- 03.txt. Accessed 21 February 2008
[19] Perkins CE, Royer EM, Chakeres ID (2003) Ad hoc On-Demand Distance Vector (AODV) Routing. IETF Draft, October, 2003, available at http://tools.ietf.org/html/draft-perkins-manetaodvbis- 00. Accessed 21 February 2008
[20] McDonald AB, Znati T (2000) A Dual-Hybrid Adaptive Routing Strategy for Wireless Ad-Hoc Networks. Proceedings of IEEE WCNC 2000, Volume 3:1125–1130 26.
[21] McDonald AB, Znati T (1999) A Mobility Based Framework for Adaptive Clustering in Wireless Ad-Hoc Networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Volume 17, Issue 8:1466–1487
[22] Boppana RV, Konduru SP (2001) An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks. Proceedings of IEEE INFOCOM 2001:1753–1762.
