Enhancement of Network Life Time using Binary Tree Based Multicast Routing Protocol for Mobile Ad hoc Network

A mobile ad hoc network (MANET) is an interconnected system of mobile hosts without a fixed infrastructure. In MANETs, each mobile host has multi-hop transmission capability, and it has to serve as a router. Owing to the dynamic topology and limited resources of mobile hosts, the routing scheme in MANETs presents an important challenge. In this study, a Enhancement of Network Life Time using Binary Tree Based Multicast Routing Protocol for MANET is proposed. In this proposed scheme, all nodes are randomly classified into two types, group-1 and group-2. To achieve the load balance, two multicast trees (tree-1 for group-1 and tree-2 for group-2) are constructed. The proposed system mainly focused on maintaining route stability. Thus proposed system outperform AOMDV version of AODV in term of Performance evaluation metrics such as packet delivery ratio, control overhead , Network life time, Normalized delay

A Novel Scalable Multicast Mesh Routing Protocol for Mobile ad hoc Networks

In recent years the use of portable and wireless equipment is becoming more widespread, and as in many situations communication infrastructure might not be available, wireless networks such as Mobile Ad Hoc Networks (MANETs) are becoming increasingly important. A mobile ad hoc network is a collection of nodes that exchanges data over wireless paths. The nodes in this network are free to move at any time, therefore the network topology changes in an unpredictable way. Since there is no fixed infrastructure support in mobile ad hoc networks, each node functions as a host and a router. Due to mobility, continuous change in topology, limited bandwidth, and reliance on batteries; designing a reliable and scalable routing protocol for mobile ad hoc networks is a challenging task. Multicast routing protocols have been developed for routing packets in mobile ad hoc networks. Existing protocols suffer from overheads and scalability. As the number of senders, groups, and mobility speed increases, the routing overhead and the packet collision increases, and therefore the packet delivery ratio decreases. Thus none of the existing proposed multicast routing protocols perform well in every situation. In this study a novel multicast routing protocol for ad hoc networks is proposed. It is an efficient and scalable routing protocol, and named Network Sender Multicast Routing Protocol (NSMRP). NSMRP is a reactive mesh based multicast routing protocol. A central node called mesh sender (MS) is selected periodically from among the group(s) sender(s) to create one mesh in order to be used in forwarding control and data packets to all multicast group(s) member(s). One invitation message will be periodically flooded to all group(s) member(s) by MS to join the group(s). The proposed routing protocol is evaluated by simulation and compared with a well known routing protocol. The results are analyzed and conclusions are drawn

Reliable Multicast in Mobile Ad Hoc Wireless Networks

A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the mission critical nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented best effort protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead

From a Location Service to a Multicast Service for Wireless Mobile Adhoc Networks

In this paper we propose a novel approach for multicasting in Mobile Ad-hoc Networks (MANETs). Since no fixed infrastructure of servers is assumed in MANETs, efficient location management schemes are necessary in order to store and provide information about various services offered throughout the network. MDLM is the first multicast algorithm relying on a location management service. We thus avoid fragile data structures such as trees or DAGs to manage multicast groups, without reverting to more reliable, yet overhead-prone mesh-based algorithms

Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks.

The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Xcast Based Routing Protocol For Push To Talk Application In Mobile Ad Hoc Networks

Mobile ad-hoc networks comprise a type of wireless network that can be easily created without the need for network infrastructure or administration. These networks are organized and administered into temporary and dynamic network topologies. Unfortunately, mobile ad-hoc networks suffer from some limitations related to insufficient bandwidth. The proliferation of new IP Multimedia subsystem services (IMs), such as Push-to-talk (PTT) applications consume large amounts of bandwidth, resulting in degraded QoS performance of mobile ad-hoc networks. In this thesis, a Priority XCAST based routing protocol (P-XCAST) is proposed for mobile ad-hoc networks to minimize bandwidth consumption. P-XCAST is based on demand route requests and route reply mechanisms for every destination in the PXCAST layer. To build the network topology and fill up the route table for nodes, the information in the route table is used to classify the XCAST list of destinations according to similarities on their next hop. Furthermore, P-XCAST is merged with a proposed Group Management algorithm to handle node mobility by classifying nodes into two types: group head and member. The proposed protocol was tested using the GloMoSim network simulator under different network scenarios to investigate Quality of Service (QoS) performance network metrics. P-XCAST performance was better by about 20% than those of other tested routing protocols by supporting of group size up to twenty receivers with an acceptable QoS. Therefore, it can be applied under different network scenarios (static or dynamic). In addition Link throughput and average delay was calculated using queuing network model; as this model is suitable for evaluating the IEEE 802.11 MAC that is used for push to talk applications. The analytical results for link throughput and average delay were used to validate the simulated results

Mobility-adaptive clustering and network-layer multicasting in mobile ad hoc networks

Ph.DDOCTOR OF PHILOSOPH

RoMR: Robust Multicast Routing in Mobile Ad-Hoc Networks

Support for multicast services is crucial for mobile ad-hoc networks (MANETs) to become a viable alternative to infrastructured networks. Efficient multicasting in MANETs faces challenges not encountered in other types of networks such as the mobility of nodes, the tenuous status of communication links, limited resources, and indefinite knowledge of the network topology. This thesis addresses these challenges by providing a framework and architecture with proactive and reactive components to support multicasting in MANETs emphasizing reliability and efficiency of end-to-end packet delivery. The architecture includes the Robust Multicast Routing protocol (RoMR) to provide multicast services to multicast applications. RoMR's proactive component calculates multiple multicast trees based on the prediction of future availability of the links and the assumption that the trees will become disconnected over time. The reactive components respond to changes in the network topology due to the mobility of the nodes and to changes in the multicast group's membership. Sending redundant data packets over multiple paths further enhances the reliability at the cost of an increase in the use of network resources. RoMR uses approximations to Steiner trees during tree formation and forward error correction encoding techniques during packet transmission in order to counteract this increase. To avoid additional network traffic, trees are distributed only when the existing trees cannot be easily patched to accommodate changes in topology or group membership. The novelty of the proposed protocol stems from integrating techniques that have not previously been combined into a multicasting protocol and a unique method to calculate the relative weights of the links. In addition to the specifications of the protocol, a simulation framework was developed to test different implementations of the various components of RoMR. Simulations compared the performance of the basic version of RoMR to a version that ignored link weights, and to a link-state multicast protocol currently being considered by the Internet Engineering Task Force. A statistical analysis of the results showed that RoMR performed better overall, than the other two protocols