Determining The Efficiency Of A Protocol

AODV are utilized, instead of broadcasting data packets, S start off a route discovery protocol that requires broadcasting smaller Route Request

Being proactive, AODV doesn’t need all its nodes in a network to maintain the routes to destinations rather request a route only when needed i.e., only the nodes which are communicating would require to maintain the route. Also AODV uses sequence numbers to avoid routing loops like in DSDV. Whenever a node needs to communicate with another node, a route has to be found and for that purpose Route Request (RREQ) message is broadcasted to all its neighbors till it reaches the destination node or route to destination. A temporary route table entry in initiated by the RREQ messages throughout the network. Once the destination or a route is found, Route Reply (RREP) message is sent back to source by unicasting along the temporary reverse path of the received RREQ message. RREP message initiates in creating a routing table entries for the destination in intermediate nodes on its way back to source. After certain amount of time these routing table entries expire. Neighbors are detected by periodic HELLO messages (a special RREP message). If a node A does not receive HELLO messages from a neighbor B through which it sends traffic, it assumes that a link is broken and the failure indication is forwarded to its active neighbors. When this message reaches the sources, then either they request a new route by sending new RREQ messages or stop sending data. HELLO messages and the

We have simulated another network having 30 numbers of nodes. The simulation is made using the same platform used for network 1. This simulation is done taking node 1 as a source and node 28 as destination. The optimal path obtained in this simulation is 1-23-13-28, in which data rate is 0.47 kbps. The second optimal path is 1-17-28, in which data rate is 0.35 kbps. The simulated results are summarized here in

During this paper several things will be explained or gone over. The first will be communication protocols and I will identify the network protocols and provide rationale for the decision. Next will be to define the full network architecture and explain the usefulness of the traffic analysis. The next thing will be to define the terms response time, latency, and jitter, and describe their effect on the main network performance and on the performance of the chosen organization 's network. Next the effect of data rates on each part of the network will also be explained. Describing strategies to ensure the availability of network access in switched and routed networks will be the last part of this paper.

Thus, conventional routing strategies cannot be used in DTNs, thus new routing protocols need to be devised which are quite different from the conventional ones. Other features of DTNs include lack of constant connectivity between end-to-end nodes. Moreover, since there are no immediate path connections for data packets to reach their destinations, the latency for data delivery is high, and thus, data rates are low. Other problems also include long queuing delays and finite longevity of a single node.

The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes. It is loop-free, self-starting, and scales to large numbers of mobile nodes.

Routing Protocol for Low-Power and Lossy Networks (RPL) is distance-vector protocol that builds a Destination Oriented Directed Acyclic Graph (DODAG) that has only one route from each leaf node to the root in which all the traffic from the node will be routed to. [35]

Ad hoc On-Demand Distance Vector (AODV) [1] Routing could be a routing protocol for (MANETs) and all other wireless ad-hoc networks. it 's collectively developed in Nokia centre, University of California, USA and University of cincinnati by C. Perkins, E. Belding-Royer and S. Das[16]. AODV is capable of each unicast and multicast routing. it 's a reactive routing protocol, that means that it establishes a route to a destination solely on demand. In distinction, the foremost common routing protocols of the internet are proactive, that means they notice routing route severally of the usage of the route. AODV is, because the name indicates, a distance-vector routing protocol. AODV avoids the counting-to-infinity weakness of different distance-vector protocols by use of sequence numbers on route updates.

Realization and Assessment of AODV Routing Protocol for MANET under Blackhole Attack and proposing a Potential Solution by R-AODV

Technology advancement is growing very rapidly one example we can see surrounding us is wireless networks and its related very complex applications such as sensor database network, robotics military and so on. At the starting point following paper represents about the mobile ad hoc network and related basic history. After that research paper explores the problems related with the current technology and major drawbacks. Later paper shows the need of the leader election algorithm and its implementation. At the end it

Performance metrics are measured which shows that packet loss is less than AODV. Packet Loss increases as mobility increases. In route discovery process, an intermediate node will try to create a route and this route should not contain a node whose legitimacy ratio lesser the lower threshold level.

Proposed work we have used OSPF routing protocol that is distance vector protocol that has following characteristics.

Recent trends in compact computing and wireless technologies are expansion of ad hoc network. Ad hoc network consists of versatile flat forms which are free to move expeditiously. Ad hoc networks are multi-hop network that use wireless communication for transmission without any fixed infrastructure. The networks are form and deform on-the-fly without the need for any system. Ad hoc structure does not require an access point, it is easy to setup, especially in a small or temporary network. Each node in the network forwards the packet without the need of central administration. In ad hoc network, node acts as a router to send and receive the data. An advantage of the system is robustness, flexibility and mobility. Ad hoc network are capable for analyzing radio propagation environment to optimize the performance. This typically requires that the network node have positioning capability as well as memory to recall geographical local condition. An ad hoc network typically refers to any set of network where all devices have equal status on a network and are free to associate with any other ad hoc network device in link range. Ad hoc network often refers to a mode of operation of IEEE 802.11 wireless networks. This review is focused on the applications, advantages and challenges of ad hoc networks.

This section has represents the over read of connected paper support the present analysis. These papers do not seem to be utterly associated with project approach however positively enhance the performance of network routing protocol.

A class of wireless network is represented by Delay Tolerant Networks (DTNs) that experience regular and long lasting partitions due to light distribution of nodes in the network topology. In DTN, store-carry-forward mechanism is used for packets routing. In this paper, for performance evaluation three popular routing protocols are used namely; Epidemic, Direct Delivery and First contact. The performance of these routing protocols generates a new subarea movement model based on the splitting of network simulation area.