The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), the traffic interference based Load Balancing Routing (LBR) protocol and Min-Max Battery Cost Routing (MMBCR) as representatives of the stability-based routing, load-balancing and power-aware routing protocols respectively. Among the three routing protocols, FORP incurs the least number of route transitions; while LBR incurs the smallest hop count and lowest end-to-end delay per data packet. Energy consumed per node is the least for MMBCR, closely followed by LBR. MMBCR is the most fair in terms of node usage and hence it incurs the largest time for first node failure. FORP tends to repeatedly use nodes lying on the stable path and hence is the most unfair of the three routing protocols and it incurs the smallest value for the time of first node failure. As we measure the failure times of up to the first five nodes in the network, we observe that LBR incurs the maximum improvement in the lifetime of the nodes and MMBCR incurs the least improvement beyond the time of first node failure.
Information-Centric Networking is still an incomplete paradigm which introduces a large variety of new topics and approaches over the traditional networking. Since it is a relatively new concept which promises for easier and faster data access many aspects of it have been studied intensely in recent years. Nonetheless, load balancing is one of the least focused but high potency, open-ended areas. The aim of this project is to present an alternative technique to load balancing in the domain of pre-suggested routing method LSCR (Link State Content Routing). We suggested multi-path interest and m…
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum $α$ such that there exists a feasible unsplittable routing of the demands after multiplying each capacity by $α$. We also give an approximation scheme to the problem.
Mobile ad hoc networking (MANET) is a growing technology that can support the operation of adaptive wireless networks. With the increased demand rate of wireless applications it is useful to have more adaptive and self organizing technologies that adapt to changes within a network region. In this paper we initially present a brief listing of table driven ad hoc routing protocols and eventually analyze in detail the behaviour of demand driven ad hoc routing protocols like - Ad Hoc On Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), Temporally-Ordered Routing Algorithm (TORA)…
We present comparative analysis of MANET (Mobile Ad-Hoc Network) and VANET (Vehicular Ad-Hoc Network) routing protocols, in this paper. The analysis is based on various design factors. The traditional routing protocols of AODV (Ad hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and DSDV (Destination-Sequenced Distance-Vector) of MANET are utilizing node centric routing which leads to frequent breaking of routes, causing instability in routing. Usage of these protocols in high mobility environment like VANET may eventually cause many packets to drop. Route repairs and failures not…
The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of on-demand routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), Min-Max Battery Cost Routing (MMBCR) and the traffic interference based Load Balancing Routing (LBR) protocol as representatives of the stability-based routing, poweraware routing and load-balancing routing protocols respectively. FORP incurs the least number of route transitions; while LBR i…
Data center networks need load balancing mechanisms to dynamically serve a large number of flows with different service requirements. However, traditional load-balancing approaches do not allow the full utilization of network resources in a simple, programmable, and scalable way. In this context, this paper proposes RDNA Balance that exploits elephant flow isolation and source routing in core nodes. Flow classification operations are performed on the edge using features of the OpenFlow protocol. The results show that with this approach it is possible to provide a simple, scalable, and programm…
A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is quantified in terms of both message overhead and update time for non-predictive routing. This best- case model of existing routing performance is compared with predictive routing. Several specific instances of predictive improvements in routing are examined. The primary contribution of this paper is quantification of predictive gain for wireless ad hoc routing…
Efficient routing is one of the key challenges for next generation vehicular networks in order to provide fast and reliable communication in a smart city context. Various routing protocols have been proposed for determining optimal routing paths in highly dynamic topologies. However, it is the dilemma of those kinds of networks that good paths are used intensively, resulting in congestion and path quality degradation. In this paper, we adopt ideas from multipath routing and propose a simple decentral scheme for Mobile Ad-hoc Network (MANET) routing, which handles passive load balancing without…
This Article presents a thorough overview of QoS routing metrics, resources and factors affecting performance of QoS routing protocols. The relative strength, weakness, and applicability of existing QoS routing protocols are also studied and compared. QoS routing protocols are classified according to the QoS metrics used type of QoS guarantee assured.
Maximizing network lifetime is a very challenging issue in routing protocol design for Mobile Ad-hoc NETworks (MANETs), since mobile nodes are powered by limited-capacity batteries. Furthermore, replacing or recharging batteries is often impossible in critical environments (e.g. battlefields, disaster areas, etc.) The proposed MEA-DSR (Multipath Energy-Aware on Demand Source Routing) protocol uses a load distribution policy in order to maximize network lifetime. The simulation results have shown the efficiency of the proposed protocol in comparison to DSR routing protocol in many difficult sce…
This paper presents a comprehensive summery of different energy efficient protocols that are based on the basic Mechanism of DSR and enlightens the effort and commitment that has been made since last 10 year to turn the traditional DSR as energy efficient routing protocol.
With the rising interest of expedient, safe, and high-efficient transportation, vehicular ad hoc networks (VANETs) have turned into a critical technology in smart transportation systems. Because of the high mobility of nodes, VANETs are vulnerable to security attacks. In this paper, we propose a novel framework of software-defined VANETs with trust management. Specifically, we separate the forwarding plane in VANETs from the control plane, which is responsible for the control functionality, such as routing protocols and trust management in VANETs. Using the on-demand distance vector routing (T…
Swarms of collaborating Unmanned Aerial Vehicles (UAVs) that utilize ad-hoc networking technologies for coordinating their actions offer the potential to catalyze emerging research fields such as autonomous exploration of disaster areas, demanddriven network provisioning, and near field packet delivery in Intelligent Transportation Systems (ITSs). As these mobile robotic networks are characterized by high grades of relative mobility, existing routing protocols often fail to adopt their decision making to the implied network topology dynamics. For addressing these challenges, we present Predict…
We have proposed a novel Grid Based Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient path from source to destination based on grid area, where each grid will have three deferent levels of transmission power.
Routing in mobile ad hoc networks (MANETs) presents a big challenge, especially when support for a large number of nodes is needed. This paper extends the local visibility concept of the recent DHT-based URBAN_XOR routing protocol, which aims to reduce routing table sizes while keeping efficiency high. Our main contribution is providing a guarantee that if any two nodes are connected through other nodes, they are able to communicate with each other. We propose a new route acquisition method that aims to reduce the total amount of overhead traffic and improve convergence rate. In addition, we i…
Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The basic idea of cognitive radio networks is that the unlicensed devices (cognitive radio users or secondary users) need to vacate the spectrum band once the licensed device (primary user) is detected. Cognitive capability and reconfigurability are the key characteristics of cog…
One of the big challenges in ad hoc network design is packet routing. Studies have shown that on-demand routing protocols perform better than table-driven routing protocols. In order to avoid route discovery for each packet, on-demand routing protocols cache routes previously learnt. A node in ad hoc network learns routing information by overhearing or forwarding packets to other nodes and keep learned routes in its route cache. However, node movement results broken links and therefore increases risk of cache pollution. Ensuring cache freshness in on-demand routing protocols, therefore, presen…
Increasing network lifetime by reducing energy consumption across the network is one of the major concerns while designing routing protocols for Mobile Ad-Hoc Networks. In this paper, we investigate the main reasons that lead to energy depletion and we introduce appropriate routing metrics in the routing decision scheme to mitigate their effect and increase the network lifetime. For our routing scheme, we take into consideration multiple layer parameters, such as MAC queue utilization, node degree and residual energy. We integrate our multi-metric routing scheme into OLSR, a standard MANET pro…
An ad-hoc wireless network is a collection of nodes that come together to dynamically create a network, with no fixed infrastructure or centralized administration. An ad-hoc network is characterized by energy constrained nodes, bandwidth constrained links and dynamic topology. With the growing use of wireless networks (including ad-hoc networks) for real-time applications, such as voice, video, and real-time data, the need for Quality of Service (QoS) guarantees in terms of delay, bandwidth, and packet loss is becoming increasingly important. Providing QoS in ad-hoc networks is a challenging t…
Routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied for more than fifteen years. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). Different position-based protocols use different strategies to pick the neighbor to forward the packet. If a node has no neighbor that is closer to the destination than itself, greedy forwarding fails. In this case, we say there is void (no neighboring nodes) in the direction of the d…
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs will participate in route discovery process, update routing table and rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT…
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficienc…
A Vehicular Ad hoc Network consists of vehicles which communicate with each other and exchange data via wireless communication links available between the vehicles which are in communication ranges of vehicles to improve the road safety in city.The communication between vehicles is used to provide road safety, comfort and entertainment.The performance of communication depends on how better routing takes place in the network.Routing data between the source and destination vehicle depends on the routing protocols being used in vehicular adhoc network.In this simulation based study we investigate…
We propose and analyze a new on the fly strategy that discovers, repairs and maintains routes in hierarchical and distributed fashion called Janitor Based Routing (JBR). The main motivation behind our JBR protocol is to decrease flooding and routing overhead and increase efficiencies in packet movement. An analytical model for the proposed JBR is presented and detailed simulation is used to observe the performance of JBR. This route discovery and maintenance protocol clearly achieved improvement in terms of reduction of flooding, routing overhead, and, hence, provides enhanced reliability.
Volume and movement of data rapidly increasing in every type of data communications and networking, and ad hoc networks are not spared from these challenges. Traditional Multipath routing protocols in Mobile Ad-hoc Networks (MANETs) did not focus on data load distribution and balancing as much as required. In this scheme, we have proposed data load distribution and balancing through multiple paths simultaneously. We have considered three important parameters of ad hoc network those are: mobility of node, the energy of node and packet drop rate at a node. This scheme combines these three metric…
This paper is a quantitative analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them route packets accurately with increased workload and some of them drastically cut down the workload. A few of them can find out a minimum workload deviation for both UDP and TCP packets. We simulated these approaches in a well defined simulator, analyzed and evaluated their performance. After expanding o…
Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV protocol. The trade-offs among the average path reliabilities, average conditional delays, average conditional number of hops, and area spectral efficiencies and the effects of various parameters are illustrated for finite ad hoc networks with randomly placed mobiles. This paper uses a dual method of closed-form…
Due to mobility of nodes in ad hoc networks, the most challenging issue is to design and to make sound analysis of a routing protocol that determines its robustness to deliver packets in low routing packet overhead. In this paper, we thoroughly analyzed the Adaptive Monitor Based Routing (AMBR) protocol by varying different parameters that affect a routing protocol to measure its performance. Analysis shows that it requires less routing control overhead comparing with other prevalent routing protocols. An improved analytical model is also presented in this paper. All these analyses firmly prov…
In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the existing routing protocols partly fail to provide a reliable communication. We present Predictive-OLSR an extension to the Optimized Link-State Routing (OLSR) protocol: it enables efficient routing in very dynamic conditions. The key idea is to exploit GPS information to aid the routing protocol. Predictive-OLSR weights the expected transmission count (ETX) metric, taking into account the relative speed between the n…
In this paper we propose a method to enhance the life time as well as improve the performance of the mobile ad hoc networks (MANET). Since MANET consists of devices that run on batteries, having limited amount of energy and due to the self-configuring and dynamic change of topology, all operations are performed by the node itself.
Separation of user (data) plane from the control plane in networks helps scale resources independently, increase the quality of service and facilitate autonomy by employing software-defined networking techniques. Clustering introduces hierarchy in ad hoc networks where control functions can be carried out by some designated cluster heads. It is also an effective solution to handle challenges due to lack of centralized controllers and infrastructure in ad-hoc networks. Clustered network topologies gain a significant amount of scalability and reliability in comparison to flat topologies. Differe…
Unlike traditional routing procedures that, at the best, single out a unique route, multi-path routing protocols discover proactively several alternative routes. It has been recognized that multi-path routing can be more efficient than traditional one mainly for mobile ad hoc networks, where route failure events are frequent. Most studies in the area of multi-path routing focus on heuristic methods, and the performances of these strategies are commonly evaluated by numerical simulations. The need of a theoretical analysis motivates such a paper, which proposes to resort to the terminal-pair ro…
In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performanc…
This paper proposes and evaluates a new position-based Parallel Routing Protocol (PRP) for simultaneously routing multiple data packets over disjoint paths in a mobile ad-hoc network (MANET) for higher reliability and reduced communication delays. PRP views the geographical region where the MANET is located as a virtual 2-dimensional grid of cells. Cell-disjoint (parallel) paths between grid cells are constructed and used for building pre-computed routing tables. A single gateway node in each grid cell handles routing through that grid cell reducing routing overheads. Each node maintains updat…
Due to mobility in Ad-Hoc network the topology of the network may change randomly, rapidly and unexpectedly, because of these aspects, the routes in the network often disappear and new to arise. To avoid frequent route discovery and route failure EAOMDV was proposed based on existing routing protocol AOMDV. The EAOMDV (Enhanced Ad-Hoc on Demand Multipath Distance Vector) Routing protocol was proposed to solve the "route failure" problem in AOMDV. EAOMDV protocol reduces the route failure problem by preemptively predicting the link failure by the signal power received by the receiver (pr). This…
Many energy-aware routing protocols have been proposed for wireless sensor networks. Most of them are only energy savers and do not take care about energy balancing. The energy saver protocols try to decrease the energy consumption of the network as a whole; however the energy manager protocols balance the energy consumption in the network to avoid network partitioning. This means that energy saver protocols are not necessarily energy balancing and vice versa. However, the lifetime of wireless sensor network is strictly depending on energy consumption; therefore, energy management is an essent…
Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The most complex issue in …
At the same time as the emergence of multimedia in mobile Ad hoc networks, research for the introduction of the quality of service (QoS) has received much attention. However, when designing a QoS solution, the estimation of the available resources still represents one of the main issues. This paper suggests an approach to estimate available resources on a node. This approach is based on the estimation of the busy ratio of the shared canal. We consider in our estimation the several constraints related to the Ad hoc transmission mode such as Interference phenomena. This approach is implemented o…
Energy consumption is the most challenging issue in routing protocol design for mobile ad-hoc networks (MANETs), since mobile nodes are battery powered. Furthermore, replacing or recharging batteries is often impossible in critical environments such as in military or rescue missions. In a MANET, the energy depletion of a node does not affect the node itself only, but the overall network lifetime. In this paper, we present multipath and energy-aware on demand source routing (MEA-DSR) protocol, which exploits route diversity and information about batteries-energy levels for balancing energy cons…
This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a very attractive technology for many civilian and military applications. Due to the high mobility of the nodes, maintaining a communication link between the UAVs is a challenging task. The topology of these networks is more dynamic than that of typical mobile ad hoc networks (MANETs) and of typical vehicle ad hoc networks (VANETs). As a consequ…
In this paper we present a methodology employing statistical analysis and stochastic geometry to study geometric routing schemes in wireless ad-hoc networks. In particular, we analyze the network layer performance of one such scheme, the random $\frac{1}{2}$disk routing scheme, which is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. The techniques developed in this paper enable us to establish the asymptotic connectivity and the convergence results for the mea…
Mobile ad hoc networks (MANETs) are a set of mobile nodes which are self-configuring and connected by wireless links automatically as per the defined routing protocol. The absence of a central management agency or a fixed infrastructure is a key feature of MANETs. These nodes communicate with each other by interchange of packets, which for those nodes not in wireless range goes hop by hop. Due to lack of a defined central authority, securitizing the routing process becomes a challenging task thereby leaving MANETs vulnerable to attacks, which results in deterioration in the performance charact…
An optimized broadcast protocol is proposed for VANETs. It is based on two key information: the direction to the destination and the beamforming angle θ. The efficiency of this technique is demonstrated in terms of packet delivery, bandwidth gain and probability of transmission success. An analytical model is developed to calculate the transmission area. This model allows capturing the propagation shape of the forwarding area. Comparisons with simulations show that the analytical model is precise.
In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive pro…
In the mobile ad hoc networks the major role is played by the routing protocols in order to route the data from one mobile node to another mobile node. But in such mobile networks, routing protocols are vulnerable to various kinds of security attacks such as blackhole node attacks. The routing protocols of MANET are unprotected and hence resulted into the network with the malicious mobile nodes in the network. These malicious nodes in the network are basically acts as attacks in the network. In this paper, we modify the existing DSR protocol with the functionality of attacks detection without …
This paper discusses a new energy aware routing scheme which uses variable transmission range. The protocol has been incorporated along with the route discovery procedure of AODV as a case study. Both the protocols are simulated using Network Simulator and comparisons are made to analyze their performance based on energy consumption, network lifetime and number of alive nodes metrics for different network scenarios. The results show that EAR makes effective node energy utilization.
We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wireless ad hoc sensor networks. It is a simple routing protocol that can easily be combined with any other greedy routing algorithm to obtain delivery guarantee. The efficiency of HBR increases if the network is sparse and contains obstacles. The space necessary to store the additional routing information at a node u is on average not larger than the size necessary to store the IDs of the neighbors of u. The amount of wo…
The opportunistic routing has great advantages on improving packet delivery probability between the source node and candidate forwarding set. For improving and reducing energy consumption and network interference, in this paper, we propose an efficient and reliable transmission power control based opportunistic routing (ERTO) for wireless ad hoc networks. In ERTO, the network interference and fading, which are critical to routing performances but not taken into account in previous works, are considered during the prediction of. The, the expected energy consumption, and the relationship between…
Mobile Ad-hoc Network (MANET) is one of the promising wireless networking approaches where a group of wireless devices can establish communication among themselves without any infrastructure. MANET has successfully been implemented in the emergency communication, battlefield and Vehicular Ad-hoc Network (VANET) etc. Recently, MANET has also been studied to establish village level off-the-grid telephony system using mobile phones (smartphones). As the mobile phones and other modern electronic devices are increasingly equipped with efficient wireless Wi-Fi devices, phone based MANET implementati…
Routing the packets efficiently in mobile ad hoc network does not have end to end paths. Multiple copies are forwarded from the source to the destination. To deal with such networks, researches introduced flooding based routing schemes which leads to high probability of delivery. But the flooding based routing schemes suffered with contention and large delays. Here the proposed protocol "Spray Select Focus", sprays a few message copies into the network, neighbors receives a copy and by that relay nodes we are choosing the shortest route and then route that copy towards the destination. Previou…
Performance of routing protocols in mobile ad-hoc networks is greatly affected by the dynamic nature of nodes, route failures, wireless channels with variable bandwidth and scalability issues. A mobility model imitates the real world movement of mobile nodes and is central component to simulation based studies. In this paper we consider mobility nodes which mimic the vehicular motion of nodes like Manhattan mobility model and City Section mobility model. We also propose a new Group Vehicular mobility model that takes the best features of group mobility models like Reference Point Group mobilit…
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding nodes, two fundamental design parameters are the node transmission probability and the transmission spectral efficiency. In this paper these parameters are selected to maximize end-to-end performance, characterized by the product of transmitter density, hop distance and rate. Due to the intractability of the problem as stated, an approximation function is examin…
Wide implementation of IEEE 802.11 based networks could lead to deployment of localized wireless data communication environments with a limited number of mobile hosts, called ad hoc networks. Implementation of a proper routing methodology in ad hoc networks makes it efficient in terms of performance. A wide spectrum of routing protocols has been contributed by several researchers. Real time applications have been most popular among the applications, run by ad hoc networks. Such applications strictly adhere to the Quality of Service (QoS) requirements such as overall throughput, end-toend delay…
Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. We introduce a notion of convergence for geometric routing schemes that not only considers the feasibility of packet delivery through possibly multi-hop relaying, but also requires the packet delivery to occur in a finite number of hops. We derive sufficient conditions that ensure the asymptotic \emph{convergence} of the random 1/2-disk routing scheme based on…
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by these mobile devices are different from those used in a wired network; which helps to save computation time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance Vector routing protocol for enhancing mobile nodes performance and lifetime in a cl…
Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks which provides a distinguished approach for Intelligent Transport System (ITS). The survey of routing protocols in VANET is important and necessary for smart ITS. This paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks. It explores the motivation behind the designed, and traces the evolution of these routing protocols. F inally the paper concludes by a tabular comparison of the various routing protocols for VANET.
Vehicular Ad Hoc Network (VANET) is a type of mobile ad hoc network (MANET) that facilitates communication among vehicles. VANET provides inter-vehicular communications to serve for the application like road traffic safety and traffic efficiency. Infotainment service has been an anticipating trend in VANETs, and video streaming has a high potential in VANET. Although, this emerging technology is trending, there are still some issues like QoS provisions, decentralized medium access control, node coverage area, and finding and maintaining routes due to highly dynamic topology. These issues make …
Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that dynamically form a network temporarily without any support of central administration. Moreover, Every node in MANET moves arbitrarily making the multi-hop network topology to change randomly at unpredictable times. There are several familiar routing protocols like DSDV, AODV, DSR, etc...which have been proposed for providing communication among all the nodes in the network. This paper presents a performance comparison of proactive and reactive protocols DSDV, AODV and DSR based on metrics such as throughput, packet del…
