Position based Multicast Routing Protocol for AD-hoc Wireless Network Using Backpressure Restoration

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 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.

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.

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.

The field that is the key issue of wire, wireless environment is security and many routing protocols are studied also at the ad-hoc network. In the mobile ad-hoc network which has no fixed base structure, the weakest point is security. This paper analyzed AODV protocol, which is a routing protocol, the important routing protocol in ad-hoc network, so that it can overcome the problem in security threats. It used the lightest and fastest message authentication code, so was able to design rather safer AODV routing protocol.

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay-jitter, packet-loss and bandwidth should satisfy the pre-specified bounds. This paper presents a hierarchical QoS multicast routing protocol (HQMRP) for mobile ad-hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed HQMRP scheme, each local node just only needs to maintain local multicast routing information and/or summary information of other clusters (or domains), but does not requires any global ad hoc network states to be maintained. The HQMRP attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. The performance measures of HQMRP are evaluated using simulation. Simulation results show that HQMRP is an available approach to multicast routing decision for mobile ad-hoc networks.

The Ad-Hoc networks are autonomous and infrastructure-less networks that provide flexibility to network nodes to connect and disconnect at any time. Routing protocol is a crucial part in the changeable topology network. DSDV, DSR and AODV are the most typical basic protocols for wireless Ad-Hoc networks. In this paper, it interprets and compares these three typical routing protocols using NS-2 simulator. It analyzes these three protocols in several aspects such as packet loss rate, route cost, average end-to-end delay and packet delivery fraction through simulations using Network Simulator in varying network conditions including the number of nodes, maximum moving speed of mobile node, maximum number of connections, node pause time, data rate and node moving range. Performance analysis of simulation results shows that each protocol has its own best suitable scene, so one can choose the optimal protocol under different scenarios according to the simulation results.

Mobile Ad-Hoc Networks (MANETs) are becoming increasingly popular as more and more mobile devices find their way to the public. A crucial problem in Ad-Hoc networks is finding an efficient route between a source and a destination. Due to MANET’s inherent characteristics, secure routing may be one of the most difficult areas to tackle because opponents can add themselves to a MANET using the existing common routing protocols. Hence, this paper proposed a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. Moreover, by dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance. An overview and a qualitative comparison between ARANz and some existing Ad-Hoc routing protocols is presented in this paper.

Mobile adhoc network are self configured and self maintained network without any central authority. The MANET has the problem of robustness and control overhead issues for designing the network. Due to the mobility of the node the topology of the network changes and link instability issues occurs. The proposed protocol deals with the above issues using Fuzzy Logic on scalable multipath on-demand routing protocol for mobile adhoc network. The proposed fuzzy based protocol provides a new approach for stable on demand routing to improve the performance of the network. The proposed protocol provides minimum control overheads, minimum delay and improved packet delivery ratio based stable link.

The lack of infrastructure in mobile Ad Hoc networks has posed a lot of opportunities for the researches in relaying the data to destination. Mobility of nodes in such an environment offers many challenges due to link failures. Different routing protocols have considered specific aspect of such a network considerably the energy consumption, bandwidth, geographic location etc. for efficiently routing the packets. If security aspect is considered in such a protocol, they will be concentrating mainly on effect of different type attacks. In this paper a novel approach for securely routing the packets is proposed to support volatile nature of the network. Being membership history count the foundation, the routing decision is made according to the number of registrations made by a node with the source node and by establishing a private trusted path of its own to securely route the packets. The protocol proposed here works in a safe manner to ensure data security and end to end connectivity. The results evaluated in the simulation reveal that, the proposed algorithm provides significant improvement in terms of delivery ratio and level of security.

The field of Adhoc Network has gained an important art of the awareness of researchers and become very popular in last few years.Adhoc network can operate without fixed infrastructure and can survive rapid changes in the network topology.This paper presents a survey on the art of energy efficient routing protocols for Mobile Ad-Hoc Network (MANET).Since the nodes in MANET are movable, the routing and power management become significant issue.In this paper, the performance comparisons of mobile ad hoc network's protocol with its quality of service factors has been considered.The main concentration of the paper is on hybrid routing protocols which is basically combination of proactive and reactive routing protocols.In this paper three different types of hybrid protocols are chosen for performance comparison on the basis of diverse simulation parameters.

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This work presents a scalable and reliable multicasting protocol for ad-hoc wireless networks. A virtual backbone is used as a shared structure for multiple sessions. A clustering scheme is used to reduce the routing path length. A novel scheme is developed to effectively multicast packets using forwarding gates. Furthermore, a lost packet recovery scheme is developed for reliable packet transmission. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio, packet delivery time, control overhead, multicast efficiency, and cost effect. Furthermore, our approach is stable for networks with high mobility and the lost packet recovery scheme is cost-effective.

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.

Multicast routing protocols for mobile adhoc networks has the inability to handle high priority traffic, poor response to network congestion, excessive processing of control information, sub optimal error recovery and retransmission procedures. Gossip is well matched to the needs of ad-hoc networks since it is a controlledform of flooding. Messages are propagated through the network without congesting the wireless medium and are independent of topology. Gossip based approach forwards a message with some probability to reduce the overhead of routing protocols. Gossip protocols are characterized by each node probabilistically choosing to exchange information with another node. Gossip has also been considered as a scalable broadcast solution in wireless network and widely used for distributed protocol design. We analyze in this paper the performance comparison of various gossip protocols viz Anonymous gossip and Route driven gossip for wireless adhoc network that exhibit various topological and mobility characteristics.

Ad hoc network is sub-domain of network communication in which user communicates with each other by temporarily network without any centralized network administration. Each node acts as node as well as router to forward data packets on the basis of routing protocols. Wireless communication is the most research oriented era now days; most importantly in the field of vehicular ad hoc network. VANET is the sub-ordinate of the Mobile ad hoc Network (MANET). Efficient routing protocols play vital role in ad hoc networks in terms of network reliability and network performance. Routing in VANET is the most important and challenging research issue. Mostly MANET routing protocols used in the VANET, but usually MANET routing protocols are not compatible within VANET's scenario due to its mobility differences. In this research we validate a VANET routing protocol GeoWave for better information dissemination to overcome the traffic blockage and which will reduce the Carbon Dioxide (CO) of the Vehicles in the large congested urban area scenario. We use well-known network simulator Omnet++ and SUMO traffic generator to simulate the network environment.