To support group oriented service which is said to be the primary application that are addressed by Mobile Ad hoc Networks (MANETs) in recent years, multicast routing is used. Hence there is a need to design stable and reliable multicast routing protocols for MANETs. Hydra, the first multicast routing protocol for MANETs establishes a multicast routing structure approximating the set of source-rooted shortest-path trees from multicast sources to receivers,

In this paper, we present a comparative performance of three multicast protocols for Mobile Ad hoc Networks ODMRP, AMRIS and MAODV focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these three protocols have not been compared in isolation. In recent years, a number of new multicast protocols have been proposed for ad hoc networks. A systematic performance evaluation of these protocols is done by performing certain simulations under NS-2. The applicability of multicast protocols to diverse situation are also studied and discussed.

Wireless ad hoc networks are an emerging and popular technology to the world. However, the benefits of them are actually their fragility, too. Owing to mobile node movements, the link break problem always occurs in the network. The problem greatly influences the throughput, delay, jitter, and lots of performance issues of a routing protocol. Many articles provide these performance issues. However, they did not trace the causes. From a different point of view, this article explores the main reason, i.e., link break problem. This article is proposed to evaluate the influence of link break problem on two categories of most popular routing protocols, i.e., table-driven and on-demand routing protocols. This article briefly discusses the main differences, building up mathematical models, setting up simulation environment, running the simulation, and finally presenting the simulation results and analyzing the performance. We found that the update probability of table-driven routing protocols increase exponentially with the number of mobile nodes and linearly with moving speed but not influenced by data traffic. On the contrary, the update probability of on-demand routing protocol increase linearly with the number of mobile nodes, moving speed, and data traffic. We conclude that the effect of link break problem on table-driven routing protocols is much more serious than that of on-demand routing protocols. This will be testified in Sections 4 and 5.

In this paper we present a hierarchical routing protocol in a large wireless, mobile network such as found in the automated battlefield or in extensive disaster recovery operations. Conventional routing does not scale well to network size. Likewise, conventional hierarchical routing cannot handle mobility efficiently. We propose a novel soft state wireless hierarchical routing protocol-Hierarchical State Routing (HSR). We distinguish between the “physical” routing hierarchy (dictated by geographical relationships between nodes) and “logical” hierarchy of subnets in which the members move as a group (e.g., company, brigade, battalion in the battlefield). HSR keeps track of logical subnet movements using home agent concepts akin to Mobile IP. A group mobility model is introduced and the performance of the HSR is evaluated through a detailed wireless simulation model

Tree multicast is a well established concept in wired networks. Two versions, per‐source tree multicast (e.g., DVMRP) and shared tree multicast (e.g., Core Based Tree), account for the majority of the wireline implementations. In this paper, we extend the tree multicast concept to wireless, mobile, multihop networks for applications ranging from ad hoc networking to disaster recovery and battlefield. The main challenge in wireless, mobile networks is the rapidly changing environment. We address this issue in our design by: (a) using “soft state” (b) assigning different roles to nodes depending on their mobility (2‐level mobility model); (c) proposing an adaptive scheme which combines shared tree and per‐source tree benefits, and (d) dynamically relocating the shared tree Rendezvous Point (RP). A detailed wireless simulation model is used to evaluate various multicast schemes. The results show that per‐source trees perform better in heavy loads because of the more efficient traffic distribution; while shared trees are more robust to mobility and are more scalable to large network sizes. The adaptive tree multicast scheme, a hybrid between shared tree and per‐source tree, combines the advantages of both and performs consistently well across all load and mobility scenarios. The main contributions of this study are: the use of a 2‐level mobility model to improve the stability of the shared tree, the development of a hybrid, adaptive per‐source and shared tree scheme, and the dynamic relocation of the RP in the shared tree.

Article Free Access Share on A group mobility model for ad hoc wireless networks Authors: Xiaoyan Hong Computer Science Department, University of California, Los Angeles, CA Computer Science Department, University of California, Los Angeles, CAView Profile , Mario Gerla Computer Science Department, University of California, Los Angeles, CA Computer Science Department, University of California, Los Angeles, CAView Profile , Guangyu Pei Computer Science Department, University of California, Los Angeles, CA Computer Science Department, University of California, Los Angeles, CAView Profile , Ching-Chuan Chiang Computer Science Department, University of California, Los Angeles, CA Computer Science Department, University of California, Los Angeles, CAView Profile Authors Info & Claims MSWiM '99: Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systemsAugust 1999 Pages 53–60https://doi.org/10.1145/313237.313248Published:01 August 1999Publication History 881citation6,406DownloadsMetricsTotal Citations881Total Downloads6,406Last 12 Months253Last 6 weeks38 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.

In this paper we consider a large population of mobile stations which are interconnected by a multihop wireless net. The applications of this wireless infrastructure range from ad hoc networking (eg, collaborative, distributed computing) to disaster recovery ((re, ood, earthquake), law enforcement (eg, crowd control), search and rescue and battleeeld. Key characteristics of this system are the large number of users, their mobility and the ability to operate without the support of a xed (wired or wireless) infrastructure. The last feature sets this system apart from existing cellular systems and in fact makes its design much more challenging. In this environment, we investigate routing strategies which scale well to large number and can handle mobility. In addition to large number and mobility, we address also the need to support multimedia communications, with low latency requirements for interactive traac and QoS support for real time streams (voice/video). In the wireless routing area, several schemes have already been proposed and implemented (eg, hierarchical routing, on-demand routing etc). We discuss the pro's and con's of the existing schemes, and introduce two new schemes-Fish-eye state routing (FSR) and Hierarchical State Routing (HSR)-which ooer some competitive advantages over the existing schemes. We compare the performance of existing and proposed schemes via simulation.

Wireless networks provide mobile users with ubiquitous communicating capability and information access regardless of location. Conventional ground radio networks are the last extension of a wireline network, thus supporting only hop communications within a cell. In this dissertation we address a novel type of wireless networks called networks. As a difference from single (i.e., cellular) networks which require fixed base stations inter-connected by a wired backbone, multihop networks have no fixed based stations nor a wired backbone. The main application for mobile wireless multihopping is rapid deployment and dynamic reconfiguration. When the wireline network is not available, as in battlefield communications and search and rescue operations, multihop wireless networks provide the only feasible means for ground communications and information access. Multihopping poses several new challenges in the design of wireless network protocols. We focus on multicasting in this thesis. The multicast service is critical in applications characterized by the close collaboration of teams (e.g., rescue patrol, battalion, scientists, etc.) with audio/video conferencing requirements and sharing of text and images. Multicasting in a multihop wireless network is much more complex than in cellular wireless networks where all mobiles in a cell can be reached in a hop. In fact, one or more multicast structures (e.g., trees) are maintained in the multihop network to efficiently deliver packets from sources to destinations in the multicast group. Multicast solutions similar to those used in mesh wireline networks such as the Internet might be considered. Yet, these solutions are not directly applicable to wireless networks because of the mobility of the users and the dynamically changing topology. In this dissertation we evaluate various popular multicast protocols via simulations and propose new protocols which are well suitable for multihop networks. This dissertation mainly covers five areas: (1) Cluster-Token infrastructure and cluster routing; (2) Shared tree wireless multicast routing protocols; (3) Wireless multicast routing without Rendezvous Points; (4) On-demand wireless multicast; (5) Reliable wireless multicast.

In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast packets is designated according to members’ requests. Multicast is then carried out via “scoped” flooding over such a set of nodes. The forwarding group is periodically refreshed to handle topology/membership changes. Multicast using forwarding group takes advantage of wireless broadcast transmissions and reduces channel and storage overhead, thus improving the performance and scalability. The key innovation with respect to wired multicast schemes like DVMRP is the use of flags rather than upstream/downstream link state, making the protocol more robust to mobility. The dynamic reconfiguration capability makes this protocol particularly suitable for mobile networks. The performance of the proposed scheme is evaluated via simulation and is compared to that of DVMRP and global flooding.

In this paper we present a multicast protocol which builds upon a cluster based wireless network infrastructure. First, we introduce the network infrastructure which includes several innovative features such as: minimum change cluster formation; dynamic priority token access protocol, and distributed hierarchical routing. Then, for this infrastructure we propose a multicast protocol which is inspired by the core based tree approach developed for the Internet. We show that the multicast protocol is robust to mobility, has low bandwidth overhead and latency, scales well with membership group size, and can be generalized to other wireless infrastructures.