Analysis of Adhoc on demand distance vector (AODV) and dynamic source (DSR) routing algorithms in mobile Adhoc networks
| dc.contributor.author | Pokhrel, Vivek | |
| dc.date.accessioned | 2023-10-13T10:56:44Z | |
| dc.date.available | 2023-10-13T10:56:44Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Ad-hoc networking is a concept in computer communications, which means that users wanting to communicate with each other form a temporary network, without any form of centralized administration. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets for other nodes. For this purpose, a routing protocol is needed. An ad-hoc network has certain characteristics, which imposes new demands on the routing protocol. The most important characteristics are the dynamic topology, which is a consequence of node mobility. Nodes can change position quite frequently, which means that we need a routing protocol that quickly adapts to topology changes. The nodes in an ad-hoc network can consist of laptops and personal digital assistants and are often very limited in resources such as CPU capacity, storage capacity, battery power and bandwidth. This means that the routing protocol should try to minimize control traffic, such as periodic update messages. Instead the routing protocol should be reactive, thus only calculate routes upon receiving a specific request. The Internet Engineering Task Force currently has a working group named Mobile Ad-hoc Networks that is working on routing specifications for ad-hoc networks. This master thesis evaluates some of the protocols put forth by the working group. This evaluation is done by means of simulation using Network Simulator (NS-2) from Berkeley. The simulations have shown that there certainly is a need for a special ad-hoc routing protocol when mobility increases. More conventional routing protocols like DSDV have a dramatic decrease in performance when mobility is high. Two of the proposed protocols in this work are DSR and AODV. They perform very well when mobility is high. However, we have found that a routing protocol that entirely depends on messages at the IP-level will not perform well. Some sort of support from the lower layer, for instance link failure detection or neighbor discovery is necessary for high performance. The size of the network and the offered traffic load affects protocols based on source routing, like DSR, to some extent. A large network with many mobile nodes and high offered load will increase the overhead for DSR quite drastically, in these situations; a hop-by-hop based routing protocol like AODV is more desirable. Keywords: MANETS, DSR, AODV, NS2- network simulator | en_US |
| dc.identifier.uri | https://elibrary.tucl.edu.np/handle/20.500.14540/20417 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Department of Computer Science and Information Technology | en_US |
| dc.subject | Manets | en_US |
| dc.subject | NS2-network simulator | en_US |
| dc.title | Analysis of Adhoc on demand distance vector (AODV) and dynamic source (DSR) routing algorithms in mobile Adhoc networks | en_US |
| dc.type | Thesis | en_US |
| local.academic.level | Masters | en_US |
| local.institute.title | Central Department of Computer Science and Information Technology | en_US |