routing protocols

Abstract- Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon’s. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This project first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to the routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: Improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detecting packet loss on unidirectional links. Extensive simulations of AODV layered on BRA shows that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links.

We need redistribution of routing protocols for connecting two different networks. When we connect one network which is using one routing protocol for data sharing with another network which is using a different routing protocol from the first one network then we need redistribution method for the connectivity of these networks with each other for data sharing purpose. If we will not use this redistribution concept then these networks will not share their route information with each other. They will share their information only with those networks which are using the same routing protocol. The goal of redistribution is to provide full connectivity between different routing domains. Usually, redistribution is needed when you merge two networks or migrate your network from one routing protocol to another.

Secure routing protocols may be developed in near future which will mainly focus to enhance security and quality of service of the protocols. Achieving these two parameters might be challenging at times as incorporating security adds routing overhead to the protocol which might degrade its routing efficiency. So, there needs to have optimum trade off for protocols between these two parameters. The routing overhead due to encryption algorithm should not imply negative impact on its performance. One such protocol discussed above is SHARP[16] which achieves security by transmitting RSA encrypted data between clusters thus achieving inter cluster security. However, if the node within the cluster is compromised it can not be detected. So there can be addition of a security layer for intra cluster data transmission. The active or passive attacks can also be detected by having acknowledgment to the sender node.

In this paper we have provided description of several routing scheme proposed for mobile ad hoc network. We have provided a classification of these schemes according the routing performance driven and on demand and presented a comparison of these categories of routing protocols. Reactive was described. The basic actions related to the routing process were studied in details. Also merits and demerits of the protocols base on the routing processes were given in the end of the sessions for corresponding protocols. To create a algorithm to increases the input-packet rates that flows can support and decreases the end –to end delay. It is based on the ad hoc technique.

Routing protocol is the essential and vital performance factor in the Mobile Ad-hoc Network. The routing protocols in MANET are accomplished to handle a lot number of nodes with restricted resources. There is a variety of routing protocol exist in MANET. The routing protocol which is chosen may have an effect on the performance of network. In this paper, We perform a comparative study of DSDV, CSGR, WRP, AODV, OLSR, DSR, TORA, ZRP, ZHLS, DYMO routing protocol with respect to Routing Approaches, Routing structure, Route selection, Route, Routing table, Route maintenance, Operation of protocols, Strength, Weakness.

Abstract — WSN is a wireless network which comprises of small sensors. These sensors are used for creating a route between source and sink node in case of data transferring. The route creation is done by inter-connecting the most adjacent nodes. Routing is used to find the shortest distance between the different nodes from source to destination. Routing is basically used to find the efficient path to send the packets from source to destination. There are varieties of routing protocols which are specially meant for establishing efficient route between sources and sink node. This study is conducted for having a review over the work that has been done previously in this field.

Abstract: Networking plays a prominent role in present day scenario because of its vast expansion of technology throughout the world. However the purpose of networking still remains the same i.e., sharing of information as fast as possible in terms of medium such as electrical cables, fiber optic cables and wireless radio networks. This paper deals regarding efficiency and compatibility of routing protocols based on QoS metrics in a wireless environment. A Mobile Adhoc Network (MANET) environment is created in Network Simulator-2 software, where the nodes move at a particular speed selecting the shortest path to reach the destination from the source. Performance of the network in terms of quality of services metrics are analyzed for different topologies ranging from 10 to 30 nodes with routing protocol such as AODV, DSDV and AOMDV. Main aim of this paper is to choose a particular routing protocol for the topology considered under different scenarios without compromising on the QoS parameters. The graphical analysis is made in the paper based on the routing parameters such as network size, throughput, Packet Delivery Ratio (PDR), End to End delay, and Jitter.

As stated earlier, the DSR protocol requires each packet to carry the full address (every hop in the route), from source to the destination. This means that the protocol will not be very effective in large networks, as the amount of overhead carried in the packet will continue to increase as the network diameter increases. Therefore in highly dynamic and large networks the overhead may consume most of the bandwidth. However, this protocol has a number of advantages over routing protocols such as AODV, LMR [7] and TORA [25], and in small to moderately size networks (perhaps up to a few hundred nodes), this protocol may perform better.

ABSTRACT: Internet of things (IoT) has become a potential future for all technologies related to human life. In IoT, communication between social environment and user contexts is done through smart interfaces. IoT has to connect to various heterogeneous devices in a Wireless Sensor Network.Hence energy efficient routing optimization is a key factor for network performance in IoT. With reference to this context, in this paper we have explained extensively used routing protocols in IoT. We have focused on 6LoWPAN, RPL and CoAP protocol in detail which is mainly used in energy efficient routing optimization.

The routing protocol ensures the proper information flow between computers in a network .For forwarding a packet a router refers a routing table. Thus the routing table should be populated. Directly connected routes will enter the table automatically, static entry can be done by administrator or routes can be learned dynamically by using routing protocols. Full connectivity is not achieved using directly connected networks. Drawbacks are associated with static entries as they require manual configuration, must be configured on all networks, even failed links are not accounted for and every new network needs to be entered statically. Thus learning the routes dynamically using routing protocol is necessary as it helps routers understand each other better and thus increase their understanding of overall network topology. Routing protocols are those protocols which learn about all the networks, they also learn the best path to reach all the networks and they also select the best path to reach all the network. Routing protocols are used between routers to determine paths and maintain routing tables. Once the path is determined a router can route a routed protocol.

MANET is a network with no permanent infrastructure. The nodes participate in the network are of wireless and mobile in nature. Since the network operates without a fixed infrastructure, each node in the network should act as a router to forward the packets of the other nodes. These nodes can move in any direction, at any speed and at any time. Many routing protocols are in existence in order to discover a path. The performance can be analysed using certain performance metrics like packet loss, delay, overhead and throughput.

Because of such contrasts, a lot of people new algorithms have been proposed for the issue of routing data in sensor networks. These routing mechanism has considered [2] the attributes of sensor nodes alongside the application and building design prerequisites. Very nearly the majority of the routing protocols can be delegated data-centric, hierarchical or location-based although [2, 3, 7] there are few distinct ones based on network flow or quality of service (QoS) awareness. Data-centric protocols are query based and depend with respect to the naming of desired information, which helps in disposing of numerous excess transmissions. Hierarchical protocols focus on clustering the nodes so cluster heads can do some collection and reduction of data in order to save energy. Location based protocols using the position data to relay the information to the desired regions instead of the entire system.

a) Greedy Perimeter Stateless Routing (GPSR): GPSR [1, 8] follows greedy routing mechanism for routing in VANETs. During this protocol routing, every node sends a data packet to different intermediate nodes that are close to destination node, until the data reaches the destination. If there are not any neighboring nodes nearer to message’s destination, it makes use of perimeter forwarding technique to come to a decision to which node the message should be delivered. GPCR is a stateless routing protocol which keeps information about its first hop neighbors’ position that increases scalability of protocol over the shortest path ad hoc routing protocols. A benefit of GPSR routing protocol is the dynamic forwarding packet decision it takes. This routing protocol comes across link failures that occur because of frequently changing topology of network and high mobility of the network. This drawback is handled via perimeter forwarding which causes huge data loss and because a large number of hops that is caused in perimeter forwarding technique, more latency time is taken. The information that is embedded in the packet header does not get updated, if destination node acquires a new position.

Mobile means moving and ad hoc means temporary with no any fixed infrastructure so mobile ad hoc networks are a class of temporary networks in which nodes are moving without any fixed infrastructure or centralized management. Due to the various applications that use MANETs are such as battlefield, emergency services, and disaster discovery, MANETs suggest many advantages too many organizations that need wireless roaming. Routing in MANETs is a not easy task and has expected a large amount of attention from researchers around the world. To overcome this difficulty a number of routing protocols have been developed and the number is silent increasing day by day. It is rather hard to determine which of the protocols may complete well under a number of different network scenarios such as network size and topology etc. In this paper we present a review of the existing routing protocols with their characteristics and functionality. In future this will help out the researchers to get an overview of the existing protocols.

Currently many efficient routing protocolshave been proposed. These protocols are classified into two categories: reactive routing protocols and proactive routing protocols. In reactive routing protocols, such as the Ad hoc On Demand Distance Vector (AODV) protocol [2], nodes find routes only when required. In proactive routing protocols, such as the Optimized Link State Routing (OLSR) protocol [3], nodes obtain routes by periodic exchange of topology information. The routes are cached prior to their requirement.

provided in this paper which is considered as a temporary network with the nodes moving freely from one position to other position without the need of an administrator. All the nodes communicate with each other through radio link and follow different topologies and protocols for transmitting the data packet within the network. Description of MANET with its characteristics has been provided along with its types. For finding the route within the network having no congestion, different types of routing protocols are defined. The routing protocols are basically divided into reactive, proactive and hybrid protocols. The examples for the same are also drawn following their comparison on the basis of characteristics and parameters. In MANET routing protocols, occurrence of different attacks exists that are considered as a problem while sending the information. In this review, attacks, namely, black hole attack, gray hole attack and DoS (Denial of Service) are mentioned with an appropriate example.

A mobile ad-hoc network is self-configuring network of mobile nodes which do not need any pre-existing infrastructure. In manet the mobility of the nodes affects the performance of network. The network topology changes frequently due to mobility of nodes. Routing is the process of transferring packets between networks or within networks. There exist many routing protocols in manet. During last few years research in various aspects of manet like routing protocols & others is being carried out. This paper tries to analyse the performance of routing protocols on some parameters like routing overhead, PDF by studying the papers. Impact of various mobility models on performance of routing protocols in MANET is presented in [1].A performance comparison of DSR and AODV protocols based on Manhattan Grid (MG) model has been published [4]. A performance study of DSR and AODV considering probabilistic random walk and boundless simulation area has been presented in [5]. A performance evaluation of AODV and DSDV using scenario based mobility models has been presented in [6]. A comparative analysis of DSR and DSDV protocols, considering RW, Group Mobility, Freeway and MG models is found in [7]. This paper tries to provide brief study of routing protocols in MANET.

VANET is a technology which is used to move cars as joint in network to make a transportable network. Principles of MANET are applied in domain of vehicles, they form VANETs. A form of mobile ad hoc network, to provide communications among nearby vehicles and between vehicles. It includes V2V communication and V2R communications. The Main purpose of Vehicular ad hoc network is to improving security on the road and increase traveler safety. Design of an efficient routing protocol has taken significant attention. In this article, we discuss about the VANETs and survey recent routing protocols. There are six categories of routing protocols topology- based , position-based routing , Geocast routing, Cluster based routing , Broadcast routing protocol and infrastructure based protocols.

Abstract: In this paper we propose an approach. The wireless sensor network consists of the nodes, base station and these networks are low cost, has limited battery, which is rechargeable, other than battery, gateways can be used, and for the communication, for the communicating we need rules so many numbers of protocols are designed for the routing. For routing protocols like LEACH, SPEED, MGEAR, DD and SPIN the above protocols are essential for conserving the energy. The routing protocol increases the lifetime of the network. This below survey represents which protocol is energy efficient.

Proactive routing protocols are additionally called as table driven routing protocols. In this protocol routing tables are maintained for each known goal [11]. Since the routes are maintained, there is diminishment in the amount of control traffic overhead as the packets are sent utilizing the maintained routes. But the timely redesigning of the routing tables is required which utilizes memory and nodes have to send upgrade message regularly to their neighbours. Regardless of the possibility that there is no traffic, the bandwidth is wasted [12]. Proactive routing is not reasonable for profoundly dynamic networks. Examples are: Destination sequenced distance vector protocol (DSDV), Optimized link state protocol (OLSR), etc