A Probability Based Multicast Routing Protocol with Energy Constrained for MANET

Efficient multicasting over Wireless Mesh Network (WMN) is challenging due to dynamic and multi-hop wireless communication among multicast group members. Multicast Ad hoc On-Demand Distance Vector (MAODV) protocol is a tree based multicast routing protocol that enables dynamic, self-starting, multi-hop routing between participating mobile nodes wishing to join or participate in a multicast group in Wireless Mesh Network (WMN). The mobility of mobile nodes often causes link breakage in the tree-based protocols which sometime results in tree partitioning and poor performance. In MAODV, when a broken link is detected between two nodes on the multicast tree, the node downstream to the break is responsible for initiating the repair of the broken link. After link repair, it is likely that the previous distance between the nodes (nodes downstream to the link breakage) and the group leader will not remain same. The shortest path from the group leader to the nodes downstream to the node which initiates link breakage is not ensured. Moreover, if the node attempting to repair a tree link break does not receive a response after certain attempts, it assumes that the multicast tree is not repairable currently and this leads to tree partitioning. In this paper, an improved link repair technique is proposed which ensures shortest path from any node to the group leader. Simulation results demonstrate significant improvement in performance metrics compared to standard MAODV.

Multicast routing protocols proposed for mobile ad hoc networks have certain limitations. Most of these protocols try to discover the route on-demand by flooding route request messages, which results in increased end-to-end latency and also consumes considerable amount of network bandwidth. These limitations make protocols not suitable for real-time multimedia communication. In this paper, we have presented an efficient mobile agents aided multicast routing (MAMR) protocol which overcomes these limitations. The protocol is a hybrid protocol where intelligent mobile agents can been integrated with existing on-demand multicast routing protocols such as multicast ad hoc on-demand distance vector (MAODV) routing protocol, on-demand multicast routing protocol (ODMRP) routing protocol and others. Here, the mobile agents move around the network and collect the routing information. This routing information assists on-demand multicast routing protocols in discovering the route in a definite path instead of flooding the route request messages, thereby achieving better end-to-end latency and reduced control traffic in the network. We have used MAODV protocol as an underlying protocol with mobile agents. The proposed MAMR protocol and MAODV have been compared through extensive simulations with end-to-end latency, packet delivery ratio and control overhead as performance parameters

Ad Hoc Routing with Distributed Ordered Sequences

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

The Ad Hoc On-Demand Distance Vector (AODV) protocol is an on-demand protocol specialized for mobile ad hoc network. Because of node's mobility and limited transmission range, the routes created by original AODV become invalid frequently leading to larger control overhead. In this paper, we propose a new scheme to improve AODV protocol by the concept of reliable distance. The reliable distance, which is always smaller than transmission range, is depended on the node's velocity and direction information attained from Global Positioning System (GPS). By the new mechanism, the routes are more reliable. Performance comparison of optimized AODV with conventional AODV by NS-2 simulator in various conditions shows the performance improvement.

Mobile Ad Hoc Networks (MANETs) pose challenges in terms of power control, due to their fixed transmission power, the mobility of nodes and a constantly changing topology. High levels of power are needed in wireless networks, particularly for routing. In order to address this problem, power aware routing protocols have been proposed, with the aim of maximising the lifetime of the network. This paper presents an enhancement to the Ad Hoc On Demand Distance Vector (AODV) protocol, by reducing transmission power, when a large number of other radios are within range. This protocol, called DP-AODV (Dynamic Power AODV) combines the hello packet mechanism and the power control mechanism in order to reduce interference between nodes and increase the throughput in the network, thus reducing the overall power consumption. A performance evaluation of this enhanced protocol is carried out in comparison with three standard routing protocols, Ad Hoc On Demand Distance Vector (AODV), Ad Hoc On Demand Multipath Distance Vector (AOMDV) and Dynamic Source Routing (DSR), using network simulator 2 (NS2). Keywords-MANET; Dynamic Power; Density; Mobility; Interference.

Multicast routing in mobile ad hoc networks by using a multiagent system

Mobile Ad hoc Network (MANET) is the cornerstone for the Internet of Things (IoT) and Vehicle to Everything (V2X) networks, its devices are remarkable of lightweight to be portable and free to join or disjoined the network. Therefore, one of the MANET routing types is reactive routing protocols. Reactive routing protocols set up the connection between devices either on-demand such as Ad Hoc On-demand Distance Vector (AODV) protocol or source routing such as Dynamic Source Routing (DSR) protocol. Reactive routing protocols increase routing overhead on discovering new routes. Thus routing overhead, and delay will increase. In this paper, the method of generating a fuzzy model is presented. Also, a tuned fuzzy stability model is introduced to handle the imprecision of routing decisions by the Fuzzy Stability model for Ad Hoc On-demand Distance Vector (FSAODV) and Fuzzy Stability model for Dynamic Source Routing (FSDSR). The results showed that FSAODV and FSDSR have outperformed the state of art protocols AODV and DSR respectively.

In this paper, Ad hoc on-demand distance vector (AOMDV) routing protocol has been analysed based on different performance parameters in different network scenarios. Performance parameters like normalized routing load, throughput, dropped packets, receiving packets, average delay. At different values of network connections, pause times, simulation times, and speed rates, we compared performance of AOMDV with Ad hoc on-demand distance vector, Destination-Sequenced Distance Vector, and Dynamic Source Routing routing protocols. For simulation work, network-simulator 2.35 has been used.

The objective of this study is to enhance the Ad hoc On-demand Distance Vector (AODV) routing protocol, a representative mobile ad hoc network environment routing protocol. In the existing AODV protocol, dynamic topology changes due to node mobility cause frequent route failures and network instability. We herein propose a local repair scheme to re-establish routes when links are broken and a dual-path routing scheme to improve network stability by employing alternate routes. After comparing the total data processing volumes, average packet end-to-end delays, numbers of connection pairs, energy consumptions, and numbers of generated packets of the enhanced AODV protocols, we discuss the optimal operating conditions for each scheme. We also investigated the performance variations resulting from changing the number of nodes and node mobility, using an NS-2 simulator. The results revealed that the dual-path protocol generally performs the best and improves the packet end-to-end delay by up to 45 %.

Problem statement: This study propose an improvement of Ad Hoc on Demand Distance Vector (AODV) Routing protocol in order to include some of the aspects of ad hoc networks such as load balancing, congestion avoidance and avoidance of link breakage. Approach: The most important problem nowadays is link breakage which mainly occurs due to excessive load and congestion in the network. Each node contains a buffer in order to detect the congestion in the network. Thus it selects a route from source to destination to avoid congestion and balance the load. The threshold value is initially set to a pre-determined value. Once the buffer crosses the threshold value, then packet forwarding is carried out via alternate path. Results: As a result, the proposed protocol Secure Enhanced Authenticated Routing Protocol (SEARP) avoids congestion and balances the load to avoid link failure. Conclusion: By detailed simulation studies, we show that even in high mobility scenario, SEARP achieves better packet delivery ratio with reduced delay and overhead compared to AODV protocol.

Recently mobile ad-hoc networks (MANET) have found widespread applications. In this infrastructure-less networks the routes have to be refreshed often due to mobility of nodes which also acting as routers. Many ad-hoc routing protocols have been proposed, of which on-demand routing protocols are very popular. To meet the scarce of network resources, the need of the time is to develop a protocol which makes efficient use of resources. In this paper we propose a mobility adaptive cross layer design to enhance the performance of ad-hoc on-demand distance vector (AODV) routing protocol by establishing stable routes. The adaptive decision making according to the speed of mobile nodes on route request (RREQ) packet forwarding results in stable routes. Comparing with the basic AODV protocol, the new cross layer algorithm has better performance as shown with the simulation results obtained using the network simulator, GloMoSim.

Mobile Ad Hoc Networks (MANETs) require special management when compared to wired networks because of their hardware and energy limitations. A key concept that could help provide this management is Self-organization. Here the concentration is on typical MANET scenarios that depend heavily on the reliability of the network. Reliability is a direct cost of the overall network lifetime, i.e., energy of the nodes. In this paper a Self-Organizing AODV protocol (SO_AODV) has been developed by integrating self-organizing concepts found in Efficient Self-Organization Algorithm (EESOA) and Ad hoc On-demand Distance Vector (AODV) algorithm. SO_AODV has been compared with Traditional AODV and basic EESOA using the following metrics: network lifetime, average end to end delay, delivery ratio and convergence time. In order to appreciate the performance of the proposed SO_AODV algorithm, an implementation in the NS2 simulator is done. The observations from the simulation are: SO_AODV has better network lifetime and end to end delay than Traditional AODV and has better values of convergence time when compared to EESOA.

The Multicast Ad hoc On-Demand Distance Vector (MAODV) protocol achieves multicast routing in self-organizing wireless mobile on-demand networks, e.g., Mobile Ad-hoc Networks (MANETs). However, unreliable wireless links degrade network reliability and network goodput, and the unreliable link problem becomes worse in multicasting because a multicast tree consists of more number of wireless links. MAODV adopts a broadcast-type local repair, and thus yields a large number of broadcast-type repair messages, increases extensive control overhead, and involves largely power consumption. Thus, a cross-layer unicast-type multihop local repair approach is proposed to recover broken links in multicasting MANETs. Additionally, the cross-layer mechanism provides mobile nodes to send a cross-layer message to the TCP sender to keep current congestion window (cwnd) and slow start threshold (ssthresh) when downstream links are temporarily broken, and then increases network goodput. Finally, the optimal number of neighbor-tiers is analyzed and the optimal substitute node is identified. Numerical results demonstrate that the proposed approach outperforms other approaches in successful repair rate, control message overhead, packet delivery ratio, and network goodput.

Within the IETF, the working group for Mobile Hoc Networking (MANET) has recently made new steps towards standardizing new routing protocols. In particular, there is now a document specifying a new protocol called DYMO (for Dynamic Mobile Networks).I will discuss these recent steps forward, and to give concrete examples I will describe more specifically some recent improvements to Ad Hoc On-Demand Distance Vector protocol (AODV) [RFC 3561]. Four protocols have been published as experimental specifications within the MANET working group of the IETF. I will describe in brief certain aspects of these protocols, and then go into a more detailed description of DYMO. After describing these protocols, I will then give some opinions about how a convergence may be affected. Convergence between protocols does provide a significant force for acceptance, and so technology that finds commonality between otherwise divergent protocols is highly desirable. The good and recent news is that commonality has been identified, so that link-state and distance-vector protocols can be merged, as well as (possibly!) proactive and reactive protocols. Along the way, much has been learned about the basic nature of routing protocols, and yet much remains to be learned. I will present some interesting recent performance results and suggest some avenues for further research results.