Pros And Cons Of Ad Hoc Routing Protocols

A routing protocol is required to find routes between nodes within the network. We are presenting two different routing protocols and their evaluation and then provide a comparison and discussion of their respective advantages and drawbacks. ABR (Associativity Based Routing) and RSR (Robust Source Routing) protocol. In ABR protocol, a route is selected based on nodes having associativity states that imply periods of stability. The ABR protocol is suitable for mobility in ad hoc wireless networks. Whereas the RSR is secure, on-demand, multi –path, source routing protocol.

| Given a network topology of two or more routers and an IPv4 addressing scheme, implement static routing and confirm layer 3 connectivity.

This protocol use Dijkstra algorithm. It maintains a complex data base, also called as link state database, which contains full information about the remote routers and the exact network topology. The goal from this protocol is to provide similar information about network connection to each router, so each router can calculate the best route to each network this is happen when each router generates information about itself and pass these information to other routers in the network so each router make a copy of this information without changing it.

DSDV is a proactive, hop-by-hop distance vector routing protocol where the routing table is maintained by each and every network node. The routing table consists of all the nodes required to reach destination also including the nodes to which packets are not sent. The routing table is kept updated at every time after each entry. In order to avoid the routing loops, DSDV uses the concept of sequence numbers to maintain the originality of route at all times. For the network in figure. 1 below, the routing table for node A can be seen in table. 1 which contains information about all possible paths reachable by node A, along with the next hop, number of hops and sequence number.

In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

routing. In this chapter, we introduce some popular routing protocols in each of the three

The Mobile ad hoc networks is one of the emerging technologies today. The instability of the nodes in a mobile ad hoc network makes it difficult to calculate the reliability of the network. When a node moves freely move in a

3. What is an ad hoc network? In this network, the wireless clients (stations) communicate directly with each

MANETs (Mobile ad-hoc network) is defined as autonomous collection of wireless mobile nodes that are self-configure to construct a network that can communicate over relatively bandwidth constrained wireless links.

Develop a subnetting plan and implement it in the lab. Configure RIP as a routing protocol.

The broadcast tree construction of the routing protocol is having of two stages. In the first stage, the sink node broadcast an advertisement message ADV1. Upon receipt ofADV1 message, each node of the WSN executes the algorithm given in the procedureBTC-phase1, and set its first parent field so that the path to the sink node through it has least cost. Upon completion of the first stage, the sink broadcast a second advertisement message ADV2. Upon receipt of ADV2 message, each node of the WSN executes the algorithm given in the procedure BTC-phase2, and set its second parent field so that the path to the sink node through it has the

The Wireless Routing Protocol (WRP) is a table-based distance-vector routing protocol. Each node in the network maintains a Distance table (DT), a Link-Cost table, a Routing table and a Message Retransmission list. The DT contains the network observation of the neighbours of a node. It contains a matrix where each element contains the distance and the one

Reactive routing protocols were designed to reduce the overheads by maintaining information for active routes at each node [8]. This means that each node determined and maintained routes only, when it requires sending data to a particular destination. It using two main mechanisms for route establishment: Route discovery and Route maintenance [17, 25]. Route discovery mechanism uses two messages: Route Request (RREQ) and Route Reply (RREP).

Routing in WSN is different form the routing in the fixed networks. Routing protocols proposed for WSNs are divided into seven categories. They are given in Table.1. The routing protocols in the table are explained well by Shio Kumar Singh, M P Singh in [37]. Many routing algorithms were developed for wireless networks. These are categorized into seven parts and are explained in provided in the reference list.