A Scalable and Reliable Multicast Routing Protocol for Ad-hoc Wireless Networks

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.

Wireless ad hoc network is a dynamic network with the commitment of cooperative nodes. Multicasting is intended for group communication that supports the dissemination of information from a sender to all the receivers in a group. The difficulties of ad hoc networks are the scarcity of bandwidth, short lifetime due to power constraint, dynamic topology caused by nodes' mobility, etc. These problems put in force to design simple, robust and energy efficient multicast routing protocols for this environment. In this paper, we discuss the architecture of different multicast routing protocols, address their deployment issues and provide a guideline for the researchers in this field.

TDMA-based Medium Access Control (MAC) protocols for ad hoc networks achieve good performances at high loads and high network densities. Nevertheless, their slot assignment techniques infer inefficient and unfair resources exploitation due to free slots appearance and slot assignment regardless the effective needs. This paper tackles these disadvantages by performing a slot-by-slot reservation mechanism. It results a new MAC protocol, called OSTR (One shot Slot TDMA-based Reservation). OSTR operates in a distributed and slotted environment. It is a topology-based and dynamic frame size-based protocol. OSTR leads to a slower frame size increase. Experimental results show that OSTR achieves a shorter frame size even with high densities inferring a better channel utilization.

Simultaneous transmission of data from one sender to multiple receivers is called multicasting. Several widely used applications require multicasting at least at the logical level. Examples include audio video teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is advantageous to implement multicasting at the level of the routing algorithm (other approaches would be one- to-all unicast or the implementation of multicasting at the application layer). In this paper we are presenting a comparative analysis on various multicast routing protocols in adhoc networks.

Power management in mobile network is an open challenges where the power level in the network influences the network life time. However, there are a trade off between the power consumption and the connectivity in mobile networks. We present a topology control mechanism and a routing protocol for Ad-Hoc wireless networks that chooses the shortest path given the lower power consumption. The power consumption in forwarding a packet in the proposed topology is depends on only two main factors are the number of hops and the packet size. Our analytical results are confirmed by our simulation results where both has give the same results for power consumption in sending a packet taking in consideration only the power consumed in communication.

This paper has discussed about enhancing the performance of various parameters i.e. throughput, end-to-end delay drop packets and packet delivery ratio in existing AODV routing protocols in ad-hoc wireless networks. But there are some limitations of existing Ad hoc On-demand Distance Vector Routing Protocol (AODV) routing protocol in terms of performance on above mentioned parameters due to high mobility, Scalability, overhead etc. Hence, as the number of nodes (up to 100 nodes) increases, ImprovedAd hoc On-demand Distance Vector Routing Protocol (AODV+) is suggested to make better performance on above mentioned parameters due to low mobility, scalability, low overhead etc.

In this paper we propose a new routing protocol for large scale Mobile Adhoc Networks, named HRAN. The protocol supports large networks, requires few resources from devices and lowers the control message overhead associated with discovering new routes. It works by simulating the paradigm of heat trails in a physical environment through the use of bloom filters. In our protocol each node emits a certain quantity of heat and as the node moves a heat trail is formed. After a node leaves a location the heat from surrounding nodes slowly dissipates. This heat information is then used to guide routing queries from the source to the destination.

In this paper, we propose a Route Stability-based Direction Guided Routing protocol(RSDGR) in mobile ad-hoc wireless networks. The main features and contributions of the proposed routing protocol are as follows. First, it can calculate link stability between two nodes as well as route stability of multi hop quantitatively by using nodes` mobility. And this protocol can establish the most stable path between a source node and a destination node. Second, according to the route stability between a source node and a destination node, it can control and optimize the direction guided region dynamically for route setup. Third, we suggest theoretical model for quantitative calculation of link stability between two nodes and route stability of multi hop path. The performance evaluation of the proposed routing protocol is performed by simulation using OPNET(Optimized Network Engineering Tool) and theoretical analysis. The results of performance evaluation show that the patterns of PDR are similar in simulation and analysis according to route stability. The faster mobile nodes` velocity and the smaller source node`s direct guided reigion, the lower route stability and PDR and the higher delay and control overhead related to this.

Intelligent Transportation Systems (ITS) combines telematics with the conventional world of surface transportation infrastructure to fulfill four major transportation goals including safety, environmental protection, efficiency, and economy. The promising technique for building the ITS, VANETs are a subclass of Mobile Ad-hoc Networks (MANETs) with unique characteristics such as special mobility patterns, rapidly changeable topology, and temporary network fragmentation. VANETs have the potential to enhance the transportation safety, support traveller information, improve traffic flow, and develop comfort applications. Realizing these applications has resulted in new challenges for VANETs' routing protocols. Providing one-to-many and many-to-many communications for the new applications of VANETs causes the popularity of multicast routing protocols. Therefore, in this paper, at first, some applications which inherently need multicast routing protocols are introduced. Then we precisely look over the usefulness of current multicast routing protocols for VANETs.

An ad hoc network is a collection of autonomous mobile nodes to forming an instant multihop radio infrastructure-less network in a dynamic topology. Each node in Ad hoc network, functions as host and router at the same time,where maintaining connectivity in a decentralized manner by distributing the network control among the nodes. A large number of routing protocols for mobile ad-hoc networks are presented since last decade. Topology frequently changing,transmission power and asymmetric links are the main challenge that type of protocols is facing. Therefore, both proactive and reactive routing protocols for mobile ad-hoc networks show incapability, and sometimes prove to be inefficient under these circumstances. We have previously developed and presented a new multipath hybrid routing protocol in name of Multipath Distance Vector Zone Routing Protocol and we refer to it as MDVZRP. The protocol is implemented in the well known network simulator (ns2). In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. Therefore, no need to update the routing tables periodically to reduce the periodic update messages and hence we reduce the control traffic in the entire network. The protocol guarantees loop freedom, disjoint paths,and alternative paths in case of break the active path by none frequently maintaining topological map of a zone centered on each node. In this paper, the MDVZRPpsilas performance is evaluated and compared with DSDV and AODV standard protocols delivering CBR traffic. Simulation results show that it gives better performance than DSDV in all situations, and better than AODV, when mobility is low.

In this paper, we develop a Markov Chain model for stochastic routing in wireless mobile ad hoc networks (MANETs). We show that using stochastic routing technique the average energy efficiency of the network improves considerably. Besides, the protocol will also secure the data flow in the network as the random data forwarding paths from source to destination will make it difficult for an intruder to intercept, hijack, and jam the data. The intruder in this case will have to listen to all possible paths from the source to the destination. Simulation studies show that our proposed protocol achieves significant performance gains in terms of energy consumption, throughput, delay, and security of the data transmission in MANETs.

Wireless Ad-hoc networks have lack of mass deployment. An Ad hoc wireless network has a dynamic nature that leads to constant changes in its network topology. There is an infrastructure less and decentralized network which need a robust dynamic routing protocol. This article presents performance comparison of wireless Ad-hoc network on different routing protocols. Network simulator QualNet 5.0.2 has been used to evaluate the performance of wireless networks with various routing protocols.

Ad hoc networks that do not depend on fixed infrastructure but instead use multi-hop wireless links to communicate are called WANETs. These networks are decentralized and self-configuring. Because of their adaptability, they play a crucial role in emergency response, defense operations, and disaster management. Nevertheless, WANET routing is extremely difficult because of the unpredictable link quality, limited energy resources, dynamic topology, and mobile nodes. Although the Ad hoc On-Demand Distance Vector (AODV) protocol's on-demand route discovery is extensively used, it has a few drawbacks, such as a high energy consumption rate, a high rate of route failures, and limited support for Quality of Service (QoS). By facilitating data exchange between the network, media access control (MAC), and physical levels, this study improves AODV. The three enhanced versions of AODV that are suggested here are ER-AODV, E-AODV, and R-AODV. These versions aim to optimize routing decisions by considering energy metrics, signal strength, and transmission circumstances. The cross-layer variations outperform typical AODV in terms of throughput, latency reduction, packet delivery ratio, and energy consumption, according to NS-2 simulation results. In wireless contexts that are both dynamic and energy-constrained, the results show that cross-layer awareness greatly improves routing efficiency, reliability, and network longevity.

Reliable multicast in wireless ad hoc networks is important for the applications such as distributed computing, chat, and whiteboard. Due to the wireless channel characteristics, obtaining the reliability in multicast packet transmission is a difficult and challenging task. Even though IEEE 802.11 is widely adopted medium access control (MAC) protocol in wireless ad hoc networks, it does not support reliable multicast. Thus, several MAC layer protocols have been proposed that can provide reliable multicast. In this paper, we propose the reliable multicast MAC protocol which is based on the orthogonal frequency division multiple access (OFDMA) systems. The proposed method reduces the overhead required for control packets. Analysis results validate the reliability and efficiency of our multicast MAC protocol.KeywordsMedium Access ControlMedium Access Control ProtocolPacket DelayControl PacketOrthogonal Frequency Division Multiple AccessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.