Computer Science And Technology - Master Dissertation

Permanent URI for this collectionhttps://kr.cup.edu.in/handle/32116/80

Browse

Now showing 1 - 2 of 2

Performance evaluation of manet routing protocols dsdv, tora enhanced tora
(Central University of Punjab, 2014) Kaur, Amandeep; Meenakshi
Wireless Networking has become the phrase du jour these days because of an attractive number of benefits it offers to the end users, by enabling them to access and share a wide pool of resources and information across the globe. Mobile ad hoc networks (MANETs) are a kind of infrastructure less wireless networks in which all the nodes act as peers and themselves configure the network. Mobile ad hoc networks are an open area of research because of its applicability in a number of areas like tactical networks, emergency services and education. One of the major challenges in networking is the efficient, accurate, reliable, secure and immediate delivery of data from source to destination. Therefore, the efficient routing of data across the mobile ad hoc network is a major concern of researchers all over the world. Several routing protocols have been developed to send data efficiently across mobile ad hoc networks. These protocols have been divided into three categories- Proactive, Reactive and Hybrid. The performance evaluation of these protocols has been going on since a long time. Most of the current research focuses on the pause times, simulation times and network size to measure the performance of various mobile ad hoc network routing protocols. A very few work has been done on the performance analysis of protocols by varying the underlying mobility models and traffic patterns. This dissertation work is focused on the improvement of the poor performance of TORA with the rise in number of traffic connections. This behavior has been credited to the link sensing mechanism of Internet MANET Encapsulation protocol (IMEP). IMEP is a multi-purpose network-layer protocol that supports the operation of many routing protocols including TORA. It provides mechanism for sensing the status of links in TORA. This link sensing mechanism has been investigated and proposed modification by K. H. Lim and A. Datta has been implemented to observe improvement in the overall performance of Enhanced-TORA protocol in comparison with original TORA. iv Through this research, investigations have been made into the behavior of DSDV, and TORA mobile ad hoc routing protocols by varying the underlying mobility models (Random Waypoint, Random Direction and Manhattan Grid model) and Traffic patterns (FTP, TELNET, HTTP). The metrics used to analyze the performance are Throughput, Average End to End delay, Routing overhead, Packet Delivery Ratio and Packet Loss. This research draws an analysis whether under which mobility model and traffic pattern combination these protocols give the best performance. Results show that DSDV gives best performance under Manhattan Grid Mobility model and FTP traffic pattern. Whereas, TORA and Enhanced-TORA give best performance under Random Direction Mobility model and FTP traffic. The performance of Enhanced-TORA is then compared with original TORA using 10 traffic connections under Random Direction mobility model and FTP Traffic and it was observed that Enhanced-TORA outperformed original TORA thereby eliminating the problem of performance degradation with rise in number of connections
Security analysis of AODV, ARAN and improved mobile adhoc networks routing protocols
(Central University of Punjab, 2014) Goel, Ruby; Meenakshi
Wireless networks use wireless connections to provide a communication environment between the communicating devices using their radio transmission range. Wireless network doesn?t require any pre-established infrastructure. Adhoc network is an infrastructure-less network which allow nodes to communicate beyond their direct wireless transmission range by introducing cooperation in mobile nodes. Wireless communication is guided by routing protocols. Wireless routing protocols come under different categories like- On-demand, Table-driven and secure routing protocols. Wireless networks face many challenges due to limited resources, dynamic topologies and lack of physical security, due to which variety of attacks have been identified that target both the on-demand and table- driven routing protocols. By attacking the routing protocols attacker can absorb network traffic, or can inject the false traffic in the network. Due to this attacks like- Blackhole, IP-Spoofing, False message fabrication, Denial of service, etc. are possible in adhoc networks. Many secure routing protocols have been developed that can deal with these attacks. One of them is Authenticated Routing for Adhoc Network (ARAN) which introduces authentication, message integrity and non- repudiation as part of its security policy and provides security against various network attacks like- Message modification, false message fabrication and impersonation attack. But ARAN is vulnerable to Distributed Denial of Service (DDOS) attack because legitimate nodes can send large amount of unnecessary packets in the network and can create congestion and thus prevent other legitimate nodes to access the network. In this research work security aspects of ARAN have been analyzed with respect to Adhoc On-Demand Distance Vector (AODV) routing protocol under Blackhole and IP-Spoofing attack. Further a technique has been proposed for ARAN to resist DDOS attack by limiting the number of packets per unit of time each node can send in the network and this enhanced ARAN in this research work is called as improved ARAN (i-ARAN). By implementing the proposed technique i- ARAN is able to prevent DDOS attack. Various performance metrics like- Packet Delivery ratio, Average Path Length, Average end-to-end delay and Throughput; iv are calculated under Glomosim-2.03 simulator. Results show that ARAN is safe against Blackhole and IP-Spoofing attack, but AODV is highly vulnerable to both the attacks. Also results of i-ARAN under DDOS attack show that the attack can be prevented by the proposed technique as it provides constant Packet delivery ratio from all the source nodes and throughput of i-ARAN is also approximately constant. By using i-ARAN there is no congestion in the network so average end- to-end delay of i-ARAN is less than the ARAN.