Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy
---
paper_title: Host extensions for IP multicasting

paper_content:

This memo specifies the extensions required of a host implementation ::: of the Internet Protocol (IP) to support multicasting. Recommended ::: procedure for IP multicasting in the Internet. This RFC obsoletes RFCs ::: 998 and 1054. [STANDARDS-TRACK]
---
paper_title: Ad hoc mobile wireless networks : protocols and systems

paper_content:

About The Author. Preface. Acknowledgments. Quotes & Words of Wisdom. 1. Introduction to Wireless Networks. Evolution of Mobile Cellular Networks. Global System for Mobile Communications (GSM). General Packet Radio Service (GPRS). Personal Communications Services (PCSs). Wireless LANs (WLANS). Universal Mobile Telecommunications System (UMTS). IMT2000. IS-95, cdmaOne and cdma2000 Evolution. Organization of this Book. 2. Origins Of Ad Hoc: Packet Radio Networks. Introduction. Technical Challenges. Architecture of PRNETs. Components of Packet Radios. Routing in PRNETs. Route Calculation. Pacing Techniques. Media Access in PRNETs. Flow Acknowledgments in PRNETs. Conclusions. 3. Ad Hoc Wireless Networks. What Is an Ad Hoc Network? Heterogeneity in Mobile Devices. Wireless Sensor Networks. Traffic Profiles. Types of Ad Hoc Mobile Communications. Types of Mobile Host Movements. Challenges Facing Ad Hoc Mobile Networks. Conclusions. 4. Ad Hoc Wireless Media Access Protocols. Introduction. Problems in Ad Hoc Channel Access. Receiver-Initiated MAC Protocols. Sender-Initiated MAC Protocols. Existing Ad Hoc MAC Protocols. MARCH: Media Access with Reduced Handshake. Conclusions. 5. Overview of Ad Hoc Routing Protocols. Table-Driven Approaches. Destination Sequenced Distance Vector (DSDV). Wireless Routing Protocol (WRP). Cluster Switch Gateway Routing (CSGR). Source-Initiated On-Demand Approaches. Ad Hoc On-Demand Distance Vector Routing (AODV). Dynamic Source Routing (DSR). Temporally Ordered Routing Algorithm (TORA). Signal Stability Routing (SSR). Location-Aided Routing (LAR). Power-Aware Routing (PAR). Zone Routing Protocol (ZRP). Source Tree Adaptive Routing (STAR). Relative Distance Microdiversity Routing (RDMAR). Conclusions. 6. Associativity-Based Long-Lived Routing. A New Routing Paradigm. Associativity-Based Long-Lived Routing. ABR Protocol Description. Conclusions. 7. Implementation Of Ad Hoc Mobile Networks. Introduction. ABR Protocol Implementation in Linux. Experimentation and Protocol Performance. Important Deductions. Conclusions. 8. Communication Performance of Ad Hoc Networks. Introduction. Performance Parameters of Interest. Route Discovery (RD) Time. End-to-End Delay (EED) Performance. Communication Throughput Performance. Packet Loss Performance. Route Reconfiguration/Repair Time. TCP/IP-Based Applications. Conclusions. 9. Energy Conservation: Power Life Issues. Introduction. Power Management. Advances in Device Power Management. Advances in Protocol Power Management. Power Conservation by Mobile Applications. Periodic Beaconing On Battery Life. Standalone Beaconing. HF Beaconing with Neighboring Nodes. Comparison of HF Beaconing with and without Neighbors. LF Beaconing with Neighboring Nodes. Comparison of LF Beaconing with and without Neighbors. Deductions. Conclusions. 10. Ad Hoc Wireless Multicast Routing. Multicasting in Wired Networks. Multicast Routing in Mobile Ad Hoc Networks. Existing Ad Hoc Multicast Routing Protocols. ABAM: Associativity-Based Ad Hoc Multicast. Comparisons of Multicast Routing Protocols. Conclusions. 11. TCP Over Ad Hoc. Introduction to TCP. Versions of TCP. Problems Facing TCP in Wireless Last-Hop. Problems Facing TCP in Wireless Ad Hoc. Approaches to TCP over Ad Hoc. Conclusion. 12. Internet & Ad Hoc Service Discovery. Resource Discovery in the Internet. Service Location Protocol (SLP) Architecture. SLPv2 Packet Format. Jini. Salutation Protocol. Simple Service Discovery Protocol (SSDP). Service Discovery for Ad Hoc. Ad Hoc Service Location Architectures. Conclusions. 13. BLUETOOTH TECHNOLOGY. Bluetooth Specifications. Bluetooth Architectures. Bluetooth Protocols. Bluetooth Service Discovery. Bluetooth MAC. Bluetooth Packet Structure. Bluetooth Audio. Bluetooth Addressing. Bluetooth Limitations. Bluetooth Implementation. Conclusions. 14. WIRELESS APPLICATION PROTOCOL (WAP). The WAP Forum. The WAP Service Model. The WAP Protocol Architecture. The WWW Programming Model. The WAP Programming Model. Conclusions. 15. Ad Hoc Nomadic Mobile Applications. In the Office. While Traveling. Arriving Home. In the Car. Shopping Malls. The Modern Battlefield. Car-to-Car Mobile Communications. Mobile Collaborative Applications. Location/Context Based Mobile Services. Conclusions. 16. Conclusions and The Future. Pervasive Computing. Motorola PIANO Project. UC Berkeley Sensor Networks: Smart Dust. EPFL Terminodes/Large-Scale Networks. 802.15 PANs and 802.16 Wireless MANs. Ad Hoc Everywhere? Glossary of Terms. References. Index.
---
paper_title: Shared tree wireless network multicast

paper_content:

In this paper we propose a multicast protocol for a multihop, mobile wireless network with cluster based routing and token access protocol within each cluster. The multicast protocol uses a shared tree which is dynamically updated to adjust to changes in topology and membership (i.e. dynamic joins and quits). Two options for tree maintenance have been simulated and evaluated: "hard state" (i.e. each connection must be explicitly cleared) and "soft state" (each connection is automatically timed out and must be refreshed). For the soft state policy, the performance of different choices of timeout and refresh timers is first analyzed for a range of node mobility values. Next, soft state and hard state policies are compared based on throughput, join delay, and control overhead criteria.
---
paper_title: Routing and multicast in multihop, mobile wireless networks

paper_content:

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.
---
paper_title: Tree Multicast Strategies in Mobile, Multihop Wireless Networks

paper_content:

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.
---
paper_title: Wireless Network Multicasting

paper_content:

Wireless networks provide mobile users with ubiquitous communicating capability and information access regardless of location. Conventional ground radio networks are the "last hop" extension of a wireline network, thus supporting only single hop communications within a "cell". In this dissertation we address a novel type of wireless networks called "multihop" networks. As a difference from "single hop" (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 single 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.
---
paper_title: Adaptive shared tree multicast in mobile wireless networks

paper_content:

Shared tree multicast is a well established concept used in several multicast protocols for wireline networks (e.g. core base tree, PIM sparse mode etc). In this paper, we extend the shared tree 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 (two level mobility model); (c) proposing an adaptive scheme which combines shared tree and source tree benefits. A detailed wireless simulation model is used to evaluate the proposed schemes and compare them with source based tree (as opposed to shared tree) multicast. The results show that shared tree protocols have low overhead and are very robust to mobility.
---
paper_title: Handbook of Wireless Networks and Mobile Computing

paper_content:

If you want to get Handbook of Internet Computing pdf eBook copy write by good Handbook of Wireless Networks and Mobile Computing Google Books. Mobile Computing General. Handbook of Algorithms for Wireless Networking and Mobile Computing by Azzedine Boukerche (Editor). Call Number: TK 5103.2. CITS4419 Mobile and Wireless Computing software projects related to wireless networks, (2) write technical reports and documentation for complex computer.
---
paper_title: Ad Hoc Wireless Networks: Architectures and Protocols

paper_content:

Practical design and performance solutions for every ad hoc wireless networkAd Hoc Wireless Networks comprise mobile devices that use wireless transmission for communication. They can be set up anywhere and any time because they eliminate the complexities of infrastructure setup and central administration-and they have enormous commercial and military potential. Now, there's a book that addresses every major issue related to their design and performance. Ad Hoc Wireless Networks: Architectures and Protocols presents state-of-the-art techniques and solutions, and supports them with easy-to-understand examples. The book starts off with the fundamentals of wireless networking (wireless PANs, LANs, MANs, WANs, and wireless Internet) and goes on to address such current topics as Wi-Fi networks, optical wireless networks, and hybrid wireless architectures. Coverage includes: Medium access control, routing, multicasting, and transport protocols QoS provisioning, energy management, security, multihop pricing, and much more In-depth discussion of wireless sensor networks and ultra wideband technology More than 200 examples and end-of-chapter problemsAd Hoc Wireless Networks is an invaluable resource for every network engineer, technical manager, and researcher designing or building ad hoc wireless networks.
---
paper_title: Ad hoc mobile wireless networks : protocols and systems

paper_content:

About The Author. Preface. Acknowledgments. Quotes & Words of Wisdom. 1. Introduction to Wireless Networks. Evolution of Mobile Cellular Networks. Global System for Mobile Communications (GSM). General Packet Radio Service (GPRS). Personal Communications Services (PCSs). Wireless LANs (WLANS). Universal Mobile Telecommunications System (UMTS). IMT2000. IS-95, cdmaOne and cdma2000 Evolution. Organization of this Book. 2. Origins Of Ad Hoc: Packet Radio Networks. Introduction. Technical Challenges. Architecture of PRNETs. Components of Packet Radios. Routing in PRNETs. Route Calculation. Pacing Techniques. Media Access in PRNETs. Flow Acknowledgments in PRNETs. Conclusions. 3. Ad Hoc Wireless Networks. What Is an Ad Hoc Network? Heterogeneity in Mobile Devices. Wireless Sensor Networks. Traffic Profiles. Types of Ad Hoc Mobile Communications. Types of Mobile Host Movements. Challenges Facing Ad Hoc Mobile Networks. Conclusions. 4. Ad Hoc Wireless Media Access Protocols. Introduction. Problems in Ad Hoc Channel Access. Receiver-Initiated MAC Protocols. Sender-Initiated MAC Protocols. Existing Ad Hoc MAC Protocols. MARCH: Media Access with Reduced Handshake. Conclusions. 5. Overview of Ad Hoc Routing Protocols. Table-Driven Approaches. Destination Sequenced Distance Vector (DSDV). Wireless Routing Protocol (WRP). Cluster Switch Gateway Routing (CSGR). Source-Initiated On-Demand Approaches. Ad Hoc On-Demand Distance Vector Routing (AODV). Dynamic Source Routing (DSR). Temporally Ordered Routing Algorithm (TORA). Signal Stability Routing (SSR). Location-Aided Routing (LAR). Power-Aware Routing (PAR). Zone Routing Protocol (ZRP). Source Tree Adaptive Routing (STAR). Relative Distance Microdiversity Routing (RDMAR). Conclusions. 6. Associativity-Based Long-Lived Routing. A New Routing Paradigm. Associativity-Based Long-Lived Routing. ABR Protocol Description. Conclusions. 7. Implementation Of Ad Hoc Mobile Networks. Introduction. ABR Protocol Implementation in Linux. Experimentation and Protocol Performance. Important Deductions. Conclusions. 8. Communication Performance of Ad Hoc Networks. Introduction. Performance Parameters of Interest. Route Discovery (RD) Time. End-to-End Delay (EED) Performance. Communication Throughput Performance. Packet Loss Performance. Route Reconfiguration/Repair Time. TCP/IP-Based Applications. Conclusions. 9. Energy Conservation: Power Life Issues. Introduction. Power Management. Advances in Device Power Management. Advances in Protocol Power Management. Power Conservation by Mobile Applications. Periodic Beaconing On Battery Life. Standalone Beaconing. HF Beaconing with Neighboring Nodes. Comparison of HF Beaconing with and without Neighbors. LF Beaconing with Neighboring Nodes. Comparison of LF Beaconing with and without Neighbors. Deductions. Conclusions. 10. Ad Hoc Wireless Multicast Routing. Multicasting in Wired Networks. Multicast Routing in Mobile Ad Hoc Networks. Existing Ad Hoc Multicast Routing Protocols. ABAM: Associativity-Based Ad Hoc Multicast. Comparisons of Multicast Routing Protocols. Conclusions. 11. TCP Over Ad Hoc. Introduction to TCP. Versions of TCP. Problems Facing TCP in Wireless Last-Hop. Problems Facing TCP in Wireless Ad Hoc. Approaches to TCP over Ad Hoc. Conclusion. 12. Internet & Ad Hoc Service Discovery. Resource Discovery in the Internet. Service Location Protocol (SLP) Architecture. SLPv2 Packet Format. Jini. Salutation Protocol. Simple Service Discovery Protocol (SSDP). Service Discovery for Ad Hoc. Ad Hoc Service Location Architectures. Conclusions. 13. BLUETOOTH TECHNOLOGY. Bluetooth Specifications. Bluetooth Architectures. Bluetooth Protocols. Bluetooth Service Discovery. Bluetooth MAC. Bluetooth Packet Structure. Bluetooth Audio. Bluetooth Addressing. Bluetooth Limitations. Bluetooth Implementation. Conclusions. 14. WIRELESS APPLICATION PROTOCOL (WAP). The WAP Forum. The WAP Service Model. The WAP Protocol Architecture. The WWW Programming Model. The WAP Programming Model. Conclusions. 15. Ad Hoc Nomadic Mobile Applications. In the Office. While Traveling. Arriving Home. In the Car. Shopping Malls. The Modern Battlefield. Car-to-Car Mobile Communications. Mobile Collaborative Applications. Location/Context Based Mobile Services. Conclusions. 16. Conclusions and The Future. Pervasive Computing. Motorola PIANO Project. UC Berkeley Sensor Networks: Smart Dust. EPFL Terminodes/Large-Scale Networks. 802.15 PANs and 802.16 Wireless MANs. Ad Hoc Everywhere? Glossary of Terms. References. Index.
---
paper_title: Handbook of Wireless Networks and Mobile Computing

paper_content:

If you want to get Handbook of Internet Computing pdf eBook copy write by good Handbook of Wireless Networks and Mobile Computing Google Books. Mobile Computing General. Handbook of Algorithms for Wireless Networking and Mobile Computing by Azzedine Boukerche (Editor). Call Number: TK 5103.2. CITS4419 Mobile and Wireless Computing software projects related to wireless networks, (2) write technical reports and documentation for complex computer.
---
paper_title: Ad Hoc Wireless Networks: Architectures and Protocols

paper_content:

Practical design and performance solutions for every ad hoc wireless networkAd Hoc Wireless Networks comprise mobile devices that use wireless transmission for communication. They can be set up anywhere and any time because they eliminate the complexities of infrastructure setup and central administration-and they have enormous commercial and military potential. Now, there's a book that addresses every major issue related to their design and performance. Ad Hoc Wireless Networks: Architectures and Protocols presents state-of-the-art techniques and solutions, and supports them with easy-to-understand examples. The book starts off with the fundamentals of wireless networking (wireless PANs, LANs, MANs, WANs, and wireless Internet) and goes on to address such current topics as Wi-Fi networks, optical wireless networks, and hybrid wireless architectures. Coverage includes: Medium access control, routing, multicasting, and transport protocols QoS provisioning, energy management, security, multihop pricing, and much more In-depth discussion of wireless sensor networks and ultra wideband technology More than 200 examples and end-of-chapter problemsAd Hoc Wireless Networks is an invaluable resource for every network engineer, technical manager, and researcher designing or building ad hoc wireless networks.
---
paper_title: Multicasting techniques in mobile ad hoc networks

paper_content:

This chapter gives a general survey of multicast protocols in mobile ad hoc networks (MANETs). After giving a brief summary of two multicast protocols in wired networks--shortest path multicast tree protocol and core-based tree multicast protocol -- we point out limitations of these protocols when they are applied in the highly dynamic environment of MANETs. Four multicast protocols -- On-Demand Multicast Routing Protocol (ODMRP), Multicast Ad Hoc On-Demand Distance Vector Routing Protocol (Multcast AODV), Forwarding Group Multicast Protocol (FGMP), and Core-Assisted Mesh Protocol -- are discussed in detail with a focus on how the limitations of multicast protocols in wired networks are overcome. A brief overview of other multicast protocols in MANETs is provided. The chapter ends with two important related issues: QoS multicast and reliable multicast in MANETs.
---
paper_title: Multicast in Mobile ad hoc Networks

paper_content:

A method for measuring the velocity of earth surface motion utilizing coherent light energy which comprises steps of generating and directing a coherent light beam toward a selected earth surface position, reflecting said beam from a stationary reflector located at the earth surface position, and simultaneously reflecting said beam from a reflector at said earth surface position which moves with earth surface motion; and, detecting the reflected beam, including both the reflection path components, to derive an instantaneous difference frequency that is proportional to the velocity of the earth surface motion.
---
paper_title: Ad hoc mobile wireless networks : protocols and systems

paper_content:

About The Author. Preface. Acknowledgments. Quotes & Words of Wisdom. 1. Introduction to Wireless Networks. Evolution of Mobile Cellular Networks. Global System for Mobile Communications (GSM). General Packet Radio Service (GPRS). Personal Communications Services (PCSs). Wireless LANs (WLANS). Universal Mobile Telecommunications System (UMTS). IMT2000. IS-95, cdmaOne and cdma2000 Evolution. Organization of this Book. 2. Origins Of Ad Hoc: Packet Radio Networks. Introduction. Technical Challenges. Architecture of PRNETs. Components of Packet Radios. Routing in PRNETs. Route Calculation. Pacing Techniques. Media Access in PRNETs. Flow Acknowledgments in PRNETs. Conclusions. 3. Ad Hoc Wireless Networks. What Is an Ad Hoc Network? Heterogeneity in Mobile Devices. Wireless Sensor Networks. Traffic Profiles. Types of Ad Hoc Mobile Communications. Types of Mobile Host Movements. Challenges Facing Ad Hoc Mobile Networks. Conclusions. 4. Ad Hoc Wireless Media Access Protocols. Introduction. Problems in Ad Hoc Channel Access. Receiver-Initiated MAC Protocols. Sender-Initiated MAC Protocols. Existing Ad Hoc MAC Protocols. MARCH: Media Access with Reduced Handshake. Conclusions. 5. Overview of Ad Hoc Routing Protocols. Table-Driven Approaches. Destination Sequenced Distance Vector (DSDV). Wireless Routing Protocol (WRP). Cluster Switch Gateway Routing (CSGR). Source-Initiated On-Demand Approaches. Ad Hoc On-Demand Distance Vector Routing (AODV). Dynamic Source Routing (DSR). Temporally Ordered Routing Algorithm (TORA). Signal Stability Routing (SSR). Location-Aided Routing (LAR). Power-Aware Routing (PAR). Zone Routing Protocol (ZRP). Source Tree Adaptive Routing (STAR). Relative Distance Microdiversity Routing (RDMAR). Conclusions. 6. Associativity-Based Long-Lived Routing. A New Routing Paradigm. Associativity-Based Long-Lived Routing. ABR Protocol Description. Conclusions. 7. Implementation Of Ad Hoc Mobile Networks. Introduction. ABR Protocol Implementation in Linux. Experimentation and Protocol Performance. Important Deductions. Conclusions. 8. Communication Performance of Ad Hoc Networks. Introduction. Performance Parameters of Interest. Route Discovery (RD) Time. End-to-End Delay (EED) Performance. Communication Throughput Performance. Packet Loss Performance. Route Reconfiguration/Repair Time. TCP/IP-Based Applications. Conclusions. 9. Energy Conservation: Power Life Issues. Introduction. Power Management. Advances in Device Power Management. Advances in Protocol Power Management. Power Conservation by Mobile Applications. Periodic Beaconing On Battery Life. Standalone Beaconing. HF Beaconing with Neighboring Nodes. Comparison of HF Beaconing with and without Neighbors. LF Beaconing with Neighboring Nodes. Comparison of LF Beaconing with and without Neighbors. Deductions. Conclusions. 10. Ad Hoc Wireless Multicast Routing. Multicasting in Wired Networks. Multicast Routing in Mobile Ad Hoc Networks. Existing Ad Hoc Multicast Routing Protocols. ABAM: Associativity-Based Ad Hoc Multicast. Comparisons of Multicast Routing Protocols. Conclusions. 11. TCP Over Ad Hoc. Introduction to TCP. Versions of TCP. Problems Facing TCP in Wireless Last-Hop. Problems Facing TCP in Wireless Ad Hoc. Approaches to TCP over Ad Hoc. Conclusion. 12. Internet & Ad Hoc Service Discovery. Resource Discovery in the Internet. Service Location Protocol (SLP) Architecture. SLPv2 Packet Format. Jini. Salutation Protocol. Simple Service Discovery Protocol (SSDP). Service Discovery for Ad Hoc. Ad Hoc Service Location Architectures. Conclusions. 13. BLUETOOTH TECHNOLOGY. Bluetooth Specifications. Bluetooth Architectures. Bluetooth Protocols. Bluetooth Service Discovery. Bluetooth MAC. Bluetooth Packet Structure. Bluetooth Audio. Bluetooth Addressing. Bluetooth Limitations. Bluetooth Implementation. Conclusions. 14. WIRELESS APPLICATION PROTOCOL (WAP). The WAP Forum. The WAP Service Model. The WAP Protocol Architecture. The WWW Programming Model. The WAP Programming Model. Conclusions. 15. Ad Hoc Nomadic Mobile Applications. In the Office. While Traveling. Arriving Home. In the Car. Shopping Malls. The Modern Battlefield. Car-to-Car Mobile Communications. Mobile Collaborative Applications. Location/Context Based Mobile Services. Conclusions. 16. Conclusions and The Future. Pervasive Computing. Motorola PIANO Project. UC Berkeley Sensor Networks: Smart Dust. EPFL Terminodes/Large-Scale Networks. 802.15 PANs and 802.16 Wireless MANs. Ad Hoc Everywhere? Glossary of Terms. References. Index.
---
paper_title: Supporting multicasting in mobile ad‐hoc wireless networks: issues, challenges, and current protocols

paper_content:

The basic philosophy of personal communication services is to provide user-to-user, location independent communication services. The emerging group communication wireless applications, such as multipoint data dissemination and multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad-hoc networking environments a necessity and not just a desire. Multicast protocols in mobile ad-hoc networks have been an area of active research for the past couple of years. This paper summarizes the activities and recent advances in this work-in-progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad-hoc networking environments, and by surveying several existing multicasting protocols. This article presents a classification of the current multicast protocols, discusses the functionality of the individual existing protocols, and provides a qualitative comparison of their characteristics according to several distinct features and performance parameters. Furthermore, since many of the additional issues and constraints associated with the mobile ad-hoc networks are due, to a large extent, to the attribute of user mobility, we also present an overview of research and development efforts in the area of group mobility modeling in mobile ad-hoc networks. Copyright © 2001 John Wiley & Sons, Ltd.
---
paper_title: Effective location-guided tree construction algorithms for small group multicast in MANET

paper_content:

Group communication has become increasingly important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have a large overhead due to the dynamic network topology. To overcome this problem, there is a recent shift towards stateless multicast in small groups. We introduce a small group multicast scheme, based on packet encapsulation, which uses a novel packet distribution tree construction algorithms for efficient data delivery. The tree is constructed with the goal of minimizing the overall bandwidth cost of the tree. Two construction algorithms, for a location-guided k-ary (LGK) tree and a location-guided Steiner (LGS) tree, utilize the geometric locations of the destination nodes as heuristics to compute the trees. They are accompanied by a hybrid location update mechanism to disseminate location information among a group of nodes. Our simulation results show that LGS tree has lower bandwidth cost than LGK tree when the location information of the nodes is up-to-date, and its cost is similar to that of an optimal Steiner multicast tree. When location information of the nodes is out-dated, LGK tree outperforms LGS tree due to its lower computational complexity.
---
paper_title: DESIRE: Density Aware Heterogenous Overlay Multicast Forwarding Scheme in Mobile Ad Hoc Networks

paper_content:

Two nested half cylinders, having a concentric axis and closed ends, are pivoted together on aligned pivot pins mounted in the closed ends and on the concentric axis. The nested half cylinders are actuated to pivot 90 degrees oppositely around the concentric axis and aligned pivot pins to close non-compressively around free flowing granular material in a closed cylindrical hoist bucket, thereby saving the additional weight and strength of material and the actuating energy therefor required for compressive loading of hoist buckets having off center or non-concentric axis of pivot. Additionally, the non-compressive loading does not move the granular material nor overflow the closed cylindrical hoist bucket to pollute the environment with dust therefrom.
---
paper_title: Secure group communications using key graphs

paper_content:

Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue.In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U,K,R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype group key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size.
---
paper_title: On-demand overlay multicast in mobile ad hoc networks

paper_content:

This paper presents the on-demand overlay multicast protocol (ODOMP), a novel approach for multicast data distribution in mobile ad hoc networks. ODOMP is a reactive protocol which creates an overlay among the group members on-demand. The created overlay is a source rooted tree which connects the group members via IP-in-IP tunnels. Routing is done by an arbitrary underlying unicast routing protocol. A novel creation mechanism allows ODOMP to create an efficient overlay with low communication overhead. The performance of ODOMP is compared with the performance of the well known multicast routing protocol ODMRP by means of simulations.
---
paper_title: Efficient overlay multicast for mobile ad hoc networks

paper_content:

Overlay multicast protocol builds a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. The advantages of this approach are robustness and low overhead. However, efficiency is an issue since the generated multicast trees are normally not optimized in terms of total link cost and data delivery delay. In this paper, we propose an efficient overlay multicast protocol to tackle this problem in MANET environment. The virtual topology gradually adapts to the changes in underlying network topology in a fully distributed manner. A novel source-based Steiner tree algorithm is proposed for constructing the multicast tree. The multicast tree is progressively adjusted according to the latest local topology information. Simulations are conducted to evaluate the tree quality. The results show that our approach solves the efficiency problem effectively.
---
paper_title: Application versus network layer multicasting in ad hoc networks: The ALMA routing protocol. Ad Hoc Networks Journal

paper_content:

Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting.
---
paper_title: MAC Layer Multicast in Wireless Multihop Networks

paper_content:

Many applications in wireless ad-hoc networks require multicast communication. In order to provide efficient multicast, various multicast routing protocols have been designed in recent years to facilitate formation of routes between multicast senders and receivers. There has also been some work to develop a suitable MAC protocol to improve efficiency of multicast communication. In this work we explore some approaches for reliable multicast at the MAC layer. We develop a multicast extension of IEEE 802.11 protocol and evaluate its performance. We have implemented our protocol in the popular ns-2 simulator and have performed experiments with multicast routing protocol.1. Our approach demonstrates superior performance in terms of packet deliveryfraction as well as delay compared to the IEEE 802.11 protocol.
---
paper_title: Effective location-guided tree construction algorithms for small group multicast in MANET

paper_content:

Group communication has become increasingly important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have a large overhead due to the dynamic network topology. To overcome this problem, there is a recent shift towards stateless multicast in small groups. We introduce a small group multicast scheme, based on packet encapsulation, which uses a novel packet distribution tree construction algorithms for efficient data delivery. The tree is constructed with the goal of minimizing the overall bandwidth cost of the tree. Two construction algorithms, for a location-guided k-ary (LGK) tree and a location-guided Steiner (LGS) tree, utilize the geometric locations of the destination nodes as heuristics to compute the trees. They are accompanied by a hybrid location update mechanism to disseminate location information among a group of nodes. Our simulation results show that LGS tree has lower bandwidth cost than LGK tree when the location information of the nodes is up-to-date, and its cost is similar to that of an optimal Steiner multicast tree. When location information of the nodes is out-dated, LGK tree outperforms LGS tree due to its lower computational complexity.
---
paper_title: Differential destination multicast-a MANET multicast routing protocol for small groups

paper_content:

In this paper we propose a multicast routing protocol for mobile ad hoc networks (MANETs). The protocol-termed differential destination mmulticast (DDM)-differs from common approaches proposed for MANET multicast routing in two ways. Firstly, instead of distributing membership control throughout the network, DDM concentrates this authority at the data sources (i.e. senders) thereby giving sources knowledge of group membership. Secondly, differentially-encoded, variable-length destination headers are inserted in data packets which are used in combination with unicast routing tables to forward multicast packets towards multicast receivers. Instead of requiring that multicast forwarding state to be stored in all participating nodes, this approach also provides the option of stateless multicasting. Each node independently has the choice of caching forwarding state or having its upstream neighbor to insert this state into self-routed data packets, or some combination thereof. The protocol is best suited for use with small multicast groups operating in dynamic networks of any size.
---
paper_title: Scalable multicasting in mobile ad hoc networks

paper_content:

Many potential applications of mobile ad hoc networks (MANETs) involve group communications among the nodes. Multicasting is an useful operation that facilitates group communications. Efficient and scalable multicast routing in MANETs is a difficult issue. In addition to the conventional multicast routing algorithms, recent protocols have adopted the following new approaches: overlays, backbone-based, and stateless. In this paper, we study these approaches from the protocol state management point of view, and compare their scalability behaviors. To enhance performance and enable scalability, we have proposed a framework for hierarchical multicasting in MANET environments. Two classes of hierarchical multicasting approaches, termed as domain-based and overlay-based, are proposed. We have considered a variety of approaches that are suitable for different mobility patterns and multicast group sizes. Results obtained through simulations demonstrate enhanced performance and scalability of the proposed techniques
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: ABAM: on-demand associativity-based multicast routing for ad hoc mobile networks

paper_content:

Multicast has emerged as a very desirable feature in communication networks. With multicast, data can be distributed to multiple recipients in an efficient and economical manner. We present a performance evaluation of a novel multicast routing strategy for a mobile ad hoc network environment, which is characterized by a highly-dynamic topology with constrained bandwidth and limited power. The associativity-based ad hoc multicast (ABAM) protocol establishes multicast session on demand and utilizes an association stability concept, which is introduced in the ABR protocol for mobile ad hoc unicast routing. The performance of ABAM is simulated and compared with a flooding-based multicast routing protocol. The results show impressive throughput and very low communication overhead.
---
paper_title: Differential destination multicast-a MANET multicast routing protocol for small groups

paper_content:

In this paper we propose a multicast routing protocol for mobile ad hoc networks (MANETs). The protocol-termed differential destination mmulticast (DDM)-differs from common approaches proposed for MANET multicast routing in two ways. Firstly, instead of distributing membership control throughout the network, DDM concentrates this authority at the data sources (i.e. senders) thereby giving sources knowledge of group membership. Secondly, differentially-encoded, variable-length destination headers are inserted in data packets which are used in combination with unicast routing tables to forward multicast packets towards multicast receivers. Instead of requiring that multicast forwarding state to be stored in all participating nodes, this approach also provides the option of stateless multicasting. Each node independently has the choice of caching forwarding state or having its upstream neighbor to insert this state into self-routed data packets, or some combination thereof. The protocol is best suited for use with small multicast groups operating in dynamic networks of any size.
---
paper_title: Bandwidth-efficient multicast routing for multihop, ad-hoc wireless networks

paper_content:

In this paper, we propose and investigate a bandwidth-efficient multicast routing protocol for ad-hoc networks. The proposed protocol achieves low communication overhead, namely, it requires a small number of control packet transmissions for route setup and maintenance. The proposed protocol also achieves high multicast efficiency, namely, it delivers multicast packets to receivers with a small number of transmissions. In order to achieve low communication overhead and high multicast efficiency, the proposed protocol employs the following mechanisms: (1) on-demand invocation of the route setup and route recovery processes to avoid periodic transmissions of control packets, (2) a new route setup process that allows a newly joining node to find the nearest forwarding node to minimize the number of forwarding nodes, and (3) a route optimization process that detects and removes unnecessary forwarding nodes to eliminate redundant and inefficient routes. Our simulation results show that the proposed protocol achieves high multicast efficiency with low communication overhead compared with other existing multicast routing protocols, especially in the ease where the number of receivers in a multicast group is large.
---
paper_title: Weight based multicast routing protocol for ad hoc wireless networks

paper_content:

Ad hoc wireless networks are self-organizing, dynamic topology networks formed by a collection of mobile nodes through radio links. Minimal configuration, absence of infrastructure and quick deployment make them convenient for emergency situations apart from military applications. Multicasting plays a crucial role in the application of ad hoc networks. Since bandwidth is limited in ad hoc wireless networks, a multicast routing protocol must be efficient. It is well known that tree based multicast routing protocols are efficient. But, the main drawback of these protocols is that they are not robust enough to achieve high packet delivery ratios. We propose a tree based multicast protocol in which, to make the protocol robust as well as efficient, a node joins the multicast tree by taking into consideration not only the number of forwarding nodes but also the distance between the source and receiver. For tree maintenance, we have used a localized prediction scheme which results in a high packet delivery ratio.
---
paper_title: MZRP: An Extension of the Zone Routing Protocol for Multicasting in MANETs

paper_content:

In recent years, a variety of unicast and multicast routing protocols for Mobile Ad hoc wireless NETworks (MANETs) have been developed. The Zone Routing Protocol (ZRP) is a hybrid unicast protocol that proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. In this paper, we extend ZRP for application to multicast routing and call it the Multicast Zone Routing Protocol (MZRP). MZRP is a shared tree multicast routing protocol that proactively maintains the multicast tree membership for nodes’ local routing zones at each node while establishing multicast trees on-demand. It is scalable to a large number of multicast senders and groups. IP tunnel mechanism is used to improve the data packet delivery ratio during transmission. Detailed simulations were performed on the NS-2 simulator. Its performance was also compared with that of ODMRP.
---
paper_title: MCEDAR: multicast core-extraction distributed ad hoc routing

paper_content:

In this paper, we present the MCEDAR (multicast core extraction distributed ad hoc routing) multicast routing algorithm for ad hoc networks. MCEDAR is an extension to the CEDAR architecture and provides the robustness of mesh based routing protocols and the approximates the efficiency of tree based forwarding protocols. It decouples the control infrastructure from the actual data forwarding infrastructure. The decoupling allows for a very minimalistic and low overhead control infrastructure while still enabling very efficient data forwarding.
---
paper_title: CEDAR: a core-extraction distributed ad hoc routing algorithm

paper_content:

CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c) a QoS route computation algorithm that is executed at the core nodes using only locally available state. But preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network while still approximating link-state performance for stable networks.
---
paper_title: Independent-tree ad hoc multicast routing (ITAMAR)

paper_content:

Multicasting is an efficient means of one to many communication and is typically implemented by creating a multicasting tree. Because of the severe battery power and transmission bandwidth limitations in ad hoc networks, multicast routing can significantly improve the performance of this type of network. However, due to the frequent and hard-to-predict topological changes of ad hoc networks, maintenance of a multicasting tree to ensure its availability could be a difficult task. We borrow from the concept of alternate path routing, which has been studied for providing QoS routing, effective congestion control, security, and route failure protection, to propose a scheme in which a set of multicasting trees is continuously maintained. A tree is used until it fails at which time it is replaced by an alternative tree in the set, so that the time between failure of a tree and resumption of multicast routing is minimal. We introduce the scheme and present a number of heuristics to compute a set of alternate trees. The heuristics are then compared in terms of transmission cost, improvement in the average time between multicast failures and the probability of usefulness. Simulations show significant gains over a wide range of network operational conditions. In particular, we show that using alternate trees has the potential of improving mean time between interruption by 100-600% in a 50 node network (for most multicast group sizes) with small increase in the tree cost and the route discovery overhead.
---
paper_title: A preferred link based multicast protocol for wireless mobile ad hoc networks

paper_content:

Existing multicast routing protocols for mobile ad hoc networks can be broadly classified into two categories, tree based protocols and mesh based protocols. Mesh based protocols have high packet delivery ratio compared to tree based protocols, but incur more control overhead. The packet delivery ratio of tree based protocols decreases with increasing mobility. This is due to the occurrence of frequent tree breaks and lack of proper tree maintenance mechanisms. These tree breaks result in frequent flooding of JoinQuery packets by the multicast group member nodes which try to get re-connected to the tree. These broadcast packets collide with the data packets and reduce the efficiency of the protocol. We propose an efficient protocol which we call as preferred link based multicast protocol (PLBM). PLBM uses a preferred link approach for forwarding JoinQuery packets. Subsets of neighbors of a node are selected using a preferred link based algorithm. These nodes, termed as preferred nodes, are only eligible for further forwarding of JoinQuery packets. We also propose a quick link break detection mechanism that locally repairs broken links. Simulation results show that our protocol performs better than other existing multicast protocols in terms of packet delivery ratio and control overhead.
---
paper_title: Ad Hoc Wireless Networks: Architectures and Protocols

paper_content:

Practical design and performance solutions for every ad hoc wireless networkAd Hoc Wireless Networks comprise mobile devices that use wireless transmission for communication. They can be set up anywhere and any time because they eliminate the complexities of infrastructure setup and central administration-and they have enormous commercial and military potential. Now, there's a book that addresses every major issue related to their design and performance. Ad Hoc Wireless Networks: Architectures and Protocols presents state-of-the-art techniques and solutions, and supports them with easy-to-understand examples. The book starts off with the fundamentals of wireless networking (wireless PANs, LANs, MANs, WANs, and wireless Internet) and goes on to address such current topics as Wi-Fi networks, optical wireless networks, and hybrid wireless architectures. Coverage includes: Medium access control, routing, multicasting, and transport protocols QoS provisioning, energy management, security, multihop pricing, and much more In-depth discussion of wireless sensor networks and ultra wideband technology More than 200 examples and end-of-chapter problemsAd Hoc Wireless Networks is an invaluable resource for every network engineer, technical manager, and researcher designing or building ad hoc wireless networks.
---
paper_title: A preferred link based routing protocol for wireless ad hoc networks

paper_content:

Routing protocols in wireless ad hoc networks experience high control overhead due to frequent path breaks that occur due to mobility of nodes, which leads to flooding of control packets throughout the network. We propose a preferred link based routing protocol that reduces flooding of control packets by selectively allowing some nodes to forward the packets using a preferred list. We propose two algorithms to compute the preferred list. The first algorithm computes the preferred list based on neighbor's degree. The second algorithm computes the preferred list based on stability information. Simulation results illustrate their performance and demonstrate their good behavior compared to other protocols. They also show that the stability based algorithm finds more stable paths while the neighbor's degree based algorithm has least control overhead.
---
paper_title: PPMA , a probabilistic predictive multicast algorithm for ad hoc networks q

paper_content:

Ad hoc networks are collections of mobile nodes communicating using wireless media without any fixed infrastructure. Existing multicast protocols fall short in a harsh ad hoc mobile environment, since node mobility causes conventional multicast trees to rapidly become outdated. The amount of bandwidth resource required for building up a multicast tree is less than that required for other delivery structures, since a tree avoids unnecessary duplication of data. However, a tree structure is more subject to disruption due to link/node failure and node mobility than more meshed structures. This paper explores these contrasting issues and proposes PPMA, a Probabilistic Predictive Multicast Algorithm for ad hoc networks, that leverages the tree delivery structure for multicasting, solving its drawbacks in terms of lack of robustness and reliability in highly mobile environments. PPMA overcomes the existing trade-off between the bandwidth efficiency to set up a multicast tree, and the tree robustness to node energy consumption and mobility, by decoupling tree efficiency from mobility robustness. By exploiting the non-deterministic nature of ad hoc networks, the proposed algorithm takes into account the estimated network state evolution in terms of node residual energy, link availability and node mobility forecast, in order to maximize the multicast tree lifetime, and consequently reduce the number of costly tree reconfigurations. The algorithm statistically tracks the relative movements among nodes to capture the dynamics in the ad hoc network. This way, PPMA estimates the node future relative positions in order to calculate a long-lasting multicast tree. To do so, it exploits the most stable links in the network, while minimizing the total network energy consumption. We propose PPMA in both its centralized and distributed version, providing performance evaluation through extensive simulation experiments. � 2005 Elsevier B.V. All rights reserved.
---
paper_title: Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks

paper_content:

The use of on-demand techniques in routing protocols for multi-hop wireless ad hoc networks has been shown to have significant advantages in terms of reducing the routing protocol's overhead and improving its ability to react quickly to topology changes in the network. A number of on-demand multicast routing protocols have been proposed, but each also relies on significant periodic (non-on-demand) behavior within portions of the protocol. This paper presents the design and initial evluation of the Adaptive Demand-Driven Multicast Routing protocol (ADMR), a new on-demand ad hoc network multicast routing protocol that attemps to reduce as much as possible any non-on-demand components within the protocol. Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. Each multicast data packet is forwarded along the shortest-delay path with multicast forwarding state, from the sender to the receivers, and receivers dynamically adapt to the sending pattern of senders in order to efficiently balance overhead and maintenance of the multicast routing state as nodes in the network move or as wireless transmission conditions in the network change. We describe the operation of the ADMR protocol and present an initial evaluation of its performance based on detailed simulation in ad hoc networks of 50 mobile nodes. We show that ADMR achieves packet delivery ratios within 1% of a flooding-based protocol, while incurring half to a quarter of the overhead.
---
paper_title: Adaptive shared tree multicast in mobile wireless networks

paper_content:

Shared tree multicast is a well established concept used in several multicast protocols for wireline networks (e.g. core base tree, PIM sparse mode etc). In this paper, we extend the shared tree 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 (two level mobility model); (c) proposing an adaptive scheme which combines shared tree and source tree benefits. A detailed wireless simulation model is used to evaluate the proposed schemes and compare them with source based tree (as opposed to shared tree) multicast. The results show that shared tree protocols have low overhead and are very robust to mobility.
---
paper_title: Multipath passive data acknowledgement on-demand multicast protocol

paper_content:

Ad hoc network is a multihop wireless network of mobile nodes without fixed infrastructure. We have proposed PDAODMRP (Passive Data Acknowledgement ODMRP) to adapt the limited bandwidth and frequently changing topology of ad hoc network. PDAODMRP defines the adjacent un-forwarding nodes of forwarding nodes as pool nodes to reduces its local route maintenance scope, and its local route maintenance scope is at least one-hop smaller than that of PatchODMRP. However, PDAODMRP does not make full use of its multiple paths by distributing its data load to these paths. Therefore, in this paper, we propose MPDAODMRP (Multipath PDAODMRP) to extend PDAODMRP. MPDAODMRP distributes data overhead to multipath based on diversity coding. The simulation results show that the data overhead and the data delivery delay of MPDAODMRP are much lower than that of PDAODMRP.
---
paper_title: Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks

paper_content:

The use of on-demand techniques in routing protocols for multi-hop wireless ad hoc networks has been shown to have significant advantages in terms of reducing the routing protocol's overhead and improving its ability to react quickly to topology changes in the network. A number of on-demand multicast routing protocols have been proposed, but each also relies on significant periodic (non-on-demand) behavior within portions of the protocol. This paper presents the design and initial evluation of the Adaptive Demand-Driven Multicast Routing protocol (ADMR), a new on-demand ad hoc network multicast routing protocol that attemps to reduce as much as possible any non-on-demand components within the protocol. Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. Each multicast data packet is forwarded along the shortest-delay path with multicast forwarding state, from the sender to the receivers, and receivers dynamically adapt to the sending pattern of senders in order to efficiently balance overhead and maintenance of the multicast routing state as nodes in the network move or as wireless transmission conditions in the network change. We describe the operation of the ADMR protocol and present an initial evaluation of its performance based on detailed simulation in ad hoc networks of 50 mobile nodes. We show that ADMR achieves packet delivery ratios within 1% of a flooding-based protocol, while incurring half to a quarter of the overhead.
---
paper_title: PatchODMRP: an ad-hoc multicast routing protocol

paper_content:

We propose an ad-hoc multicast routing protocol, referred to as PatchODMRP. PatchODMRP extends the ODMRP (on-demand multicast routing protocol), which is a mesh-based multicast routing protocol proposed for ad-hoc networks. In ODMRP, the nodes that are on the shortest paths between the multicast group members are selected as forwarding group (FG) nodes, and form a forwarding mesh for the multicast group. The ODMRP reconfigures the forwarding mesh periodically to adapt it to the node movements. When the number of sources in the multicast group is small, usually the forwarding mesh is formed sparsely and it can be very vulnerable to mobility. In this case, very frequent mesh reconfigurations are required in ODMRP, resulting in a large control overhead. To deal with this problem in a more efficient way, PatchODMRP deploys a local patching scheme instead of having very frequent mesh reconfigurations. In PatchODMRP, each FG node keeps checking if there is a symptom of mesh separation around itself. When an FG node finds such a symptom, it tries to patch itself to the mesh with local flooding of control messages. Through a course of simulation experiments, the performance of PatchODMRP is compared to the performance of ODMRP. The simulation results show that PatchODMRP improves the data delivery ratio, and reduces the control overheads. It has also been shown that the performance gain is larger when the degree of node mobility is bigger.
---
paper_title: Preemptive Multicast Routing in Mobile Ad-hoc Networks

paper_content:

Preemptive route maintenance allows a routing algorithm to maintain connectivity by preemptively switching to a path of higher quality when the quality of the currently used path is deemed questionable. Preemptive routing initiates recovery actions early by detecting that a link is likely to be broken soon and searching for a new path before the current path actually breaks. Preemptive route maintenance has been used for unicast (point-to-point) communications in wired networks and in mobile ad-hoc networks (MANETs) to minimize the number of route breaks and thus packet losses, and end-to-end delays. In addition to these advantages, we show that preemptive route maintenance can help minimize control overhead and improve the scalability of multicast routing protocols in MANETs. In this paper, we present design and implementation issues of preemptive routing for multicast in MANETs. We then describe a preemptive multicast routing protocol based on ODMRP (On-Demand Multicast Routing Protocol), which we call PMR (Preemptive Multicast Routing). PMR significantly improves the scalability of ODMRP: it offers similar or higher packet delivery ratios while incurring much less control overhead. Our simulation results have confirmed these advantages of PMR.
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: A dynamic core based multicast routing protocol for ad hoc wireless networks

paper_content:

Ad hoc wireless networks are self-organizing dynamic topology networks formed by a collection of mobile nodes through radio links. Minimal configuration absence of infrastructure and quick deployment make them convenient for emergency situations other than military applications. Multicasting plays a very crucial role in the application of Ad hoc networks. As the number of participants increases scalability of the multicast protocol becomes an important issue. Among the existing multicast protocols On Demand Multicast Routing Protocol (ODMRP) perfo exhibits a high packet delivery ratio even at high mobility. But ODMRP suffers from higher control overhead as the network size and the number of sources increase.In this paper we propose an efficient multicast routing protocol for Ad hoc wireless networks. This protocol reduces the control overhead by dynamically classifying the sources into Active and Passive categories. The control overhead is significantly reduced by about 30% compared to ODMRP which contributes to the scalability of the protocol. We study the effectiveness of the proposed multicast routing protocol by simulation studies and the results show that the multicast efficiency is increased by 10--15% and packet delivery ratio is also improved at high network load.
---
paper_title: Ad hoc Multicast Routing Algorithm with Swarm Intelligence

paper_content:

Swarm intelligence refers to complex behaviors that arise from very simple individual behaviors and interactions, which is often observed in nature, especially among social insects such as ants. Although each individual (an ant) has little intelligence and simply follows basic rules using local information obtained from the environment, such as ant's pheromone trail laying and following behavior, globally optimized behaviors, such as finding a shortest path, emerge when they work collectively as a group. In this paper, we apply this biologically inspired metaphor to the multicast routing problem in mobile ad hoc networks. Our proposed multicast protocol adapts a core-based approach which establishes multicast connectivity among members through a designated node (core). An initial multicast connection can be rapidly setup by having the core flood the network with an announcement so that nodes on the reverse paths to the core will be requested by group members to serve as forwarding nodes. In addition, each member who is not the core periodically deploys a small packet that behaves like an ant to opportunistically explore different paths to the core. This exploration mechanism enables the protocol to discover new forwarding nodes that yield lower total forwarding costs, where cost is abstract and can be used to represent any metric to suit the application. Simulations have been conducted to demonstrate the performance of the proposed approach and to compare it with certain existing multicast protocols.
---
paper_title: Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks

paper_content:

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.
---
paper_title: Core based trees (CBT)

paper_content:

One of the central problems in one-to-many wide-area communications is forming the delivery tree - the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these.In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms.
---
paper_title: Dynamic source routing in ad hoc wireless networks

paper_content:

An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
---
paper_title: Neighbor supporting ad hoc multicast routing protocol

paper_content:

An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust, simple, and energy-conserving. This paper proposes a new ad hoc multicast routing protocol called Neighbor-Supporting Multicast Protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route failure recovery and mesh maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: Host extensions for IP multicasting

paper_content:

This memo specifies the extensions required of a host implementation ::: of the Internet Protocol (IP) to support multicasting. Recommended ::: procedure for IP multicasting in the Internet. This RFC obsoletes RFCs ::: 998 and 1054. [STANDARDS-TRACK]
---
paper_title: OGHAM: On-demand global hosts for mobile ad-hoc multicast services

paper_content:

Abstract Recent advances in pervasive computing and wireless technologies have enabled novel multicast services anywhere, anytime, such as mobile auctions, advertisement, and e-coupons. Routing/multicast protocols in large-scale ad-hoc networks adopt two-tier infrastructures to accommodate the effectiveness of the flooding scheme and the efficiency of the tree-based scheme. In these protocols, hosts with a maximal number of neighbors are chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations or bottlenecks of the network and spend significant amount of time forwarding packets. In this paper, a distinct strategy is proposed for constructing a two-tier infrastructure in a large-scale ad-hoc network. Hosts with a minimal number of hops to the other hosts rather than those with a maximal number of neighbors will be adopted as BHs in order to obtain shorter multicast routes. The problem of determining BHs can be formulated with linear programming. BHs thus found have the advantages of shorter relay and less concentration. Besides, BHs are selected on-demand and can be globally reused for different multicast groups without flooding again. Simulation results show that the proposed protocol has shorter transmission latency, fewer control/data packets and higher receiving data packet ratios than other existing multicast protocols. Besides, the two-tier infrastructure constructed by the proposed protocol is more stable.
---
paper_title: A Novel Adaptive Protocol for Lightweight Efficient Multicasting in Ad Hoc Networks Abstract

paper_content:

In group communications, we find that current multicast protocols are far from ''one size fits all'': they are typically geared towards and optimized for particular scenarios. As a result, when deployed in different scenarios, their performance and overhead often degrades significantly. A common problem is that most of these protocols incur high overheads with a high density of group members and in high mobility. Our objective is to design a protocol that adapts in response to the dynamics of the network. In particular, our objective is to provide efficient and lightweight multicast data dissemination irrespective of the density of group members and node density. Our work is motivated by two observations. First, broadcasting in some cases is more efficient than multicasting. Second, member and node layout distributions are not necessarily homogeneous. For example, many MANET applications result in a topological clustering of group members that move together. Thus, we develop Fireworks, an adaptive approach for group communications in mobile ad hoc networks. Fireworks is a hybrid 2-tier multicast/broadcast protocol that adapts to maintain performance given the dynamics of the network topology and group density. In a nutshell, our protocol creates pockets of broadcast distribution in areas with many members, while it develops a multicast backbone to interconnect these dense pockets. Fireworks offers packet delivery statistics comparable to that of a pure multicast scheme but with significantly lower overheads.
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: Multicast routing in mobile ad hoc networks by using a multiagent system

paper_content:

Multicast routing in mobile ad hoc networks (MANETs) poses several challenges due to inherent characteristics of the network such as node mobility, reliability, scarce resources, etc. This paper proposes an Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents. Five types of agents are used in the scheme: Route manager static agent, Network initiation mobile agent, Network management static agent, Multicast initiation mobile agent and Multicast management static agent. The scheme operates in the following steps: (1) to identify reliable nodes; (2) to connect reliable nodes through intermediate nodes; (3) to construct a backbone for multicasting using reliable nodes and intermediate nodes; (4) to join multicast group members to the backbone; (5) to perform backbone and group members management in case of mobility. The scheme has been simulated in various network scenarios to test operation effectiveness in terms of performance parameters such as packet delivery ratio, control overheads and group reliability. Also, a comparison of proposed scheme with MAODV (Multicast Ad hoc on-demand Distance Vector) protocol is presented. ABMRS performs better than MAODV as observed from the simulation. ABMRS offers flexible and adaptable multicast services and also supports component based software development.
---
paper_title: MZRP: An Extension of the Zone Routing Protocol for Multicasting in MANETs

paper_content:

In recent years, a variety of unicast and multicast routing protocols for Mobile Ad hoc wireless NETworks (MANETs) have been developed. The Zone Routing Protocol (ZRP) is a hybrid unicast protocol that proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. In this paper, we extend ZRP for application to multicast routing and call it the Multicast Zone Routing Protocol (MZRP). MZRP is a shared tree multicast routing protocol that proactively maintains the multicast tree membership for nodes’ local routing zones at each node while establishing multicast trees on-demand. It is scalable to a large number of multicast senders and groups. IP tunnel mechanism is used to improve the data packet delivery ratio during transmission. Detailed simulations were performed on the NS-2 simulator. Its performance was also compared with that of ODMRP.
---
paper_title: OPHMR: An Optimized Polymorphic Hybrid Multicast Routing Protocol for MANET

paper_content:

We propose in this paper an optimized, polymorphic, hybrid multicast routing protocol for MANET. This new polymorphic protocol attempts to benefit from the high efficiency of proactive behavior (in terms of quicker response to transmission requests) and the limited network traffic overhead of the reactive behavior, while being power, mobility, and vicinity-density (in terms of number of neighbor nodes per specified area around a mobile node) aware. The proposed protocol is based on the principle of adaptability and multibehavioral modes of operations. It is able to change behavior in different situations in order to improve certain metrics like maximizing battery life, reducing communication delays, improving deliverability, etc. The protocol is augmented by an optimization scheme, adapted from the one proposed for the optimized link state routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead. Extensive simulations and comparison to peer protocols demonstrated the effectiveness of the proposed protocol in improving performance and in extending battery power longevity
---
paper_title: Multicast Optimized Link State Routing

paper_content:

This document describes the Multicast extension for the Optimized Link State Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
---
paper_title: On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

paper_content:

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP 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 performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
---
paper_title: Efficient overlay multicast for mobile ad hoc networks

paper_content:

Overlay multicast protocol builds a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. The advantages of this approach are robustness and low overhead. However, efficiency is an issue since the generated multicast trees are normally not optimized in terms of total link cost and data delivery delay. In this paper, we propose an efficient overlay multicast protocol to tackle this problem in MANET environment. The virtual topology gradually adapts to the changes in underlying network topology in a fully distributed manner. A novel source-based Steiner tree algorithm is proposed for constructing the multicast tree. The multicast tree is progressively adjusted according to the latest local topology information. Simulations are conducted to evaluate the tree quality. The results show that our approach solves the efficiency problem effectively.
---
paper_title: Application versus network layer multicasting in ad hoc networks: The ALMA routing protocol. Ad Hoc Networks Journal

paper_content:

Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting.
---
paper_title: On-demand overlay multicast in mobile ad hoc networks

paper_content:

This paper presents the on-demand overlay multicast protocol (ODOMP), a novel approach for multicast data distribution in mobile ad hoc networks. ODOMP is a reactive protocol which creates an overlay among the group members on-demand. The created overlay is a source rooted tree which connects the group members via IP-in-IP tunnels. Routing is done by an arbitrary underlying unicast routing protocol. A novel creation mechanism allows ODOMP to create an efficient overlay with low communication overhead. The performance of ODOMP is compared with the performance of the well known multicast routing protocol ODMRP by means of simulations.
---
paper_title: Supporting MAC layer multicast in IEEE 802.11 based MANETs: issues and solutions

paper_content:

In IEEE 802.11 based mobile ad hoc networks (MANET) multicast packets are generally forwarded as one hop broadcast; mainly to reach all the multicast members in the neighborhood in a single transmission. Because of the broadcast property of the forwarding, packets suffer from increased instances of the hidden terminal problem. Mobility of nodes makes things more difficult, and unlike unicast transmissions where MAC can detect the movement of a nexthop by making several retries, it is not possible in case of multicast forwarding. To address these issues, we propose a multicast aware MAC protocol (MMP) for MANET. The basic objective of MMP is to provide a MAC layer support for multicast traffic. This is done by attaching an extended multicast header (EMH) by the multicast agent, which provides the address of the nexthop nodes that are supposed to receive the multicast packet. The MAC layer in MMP uses the EMH field to support an ACK based data delivery. After sending the data packet, the transmitter waits for the ACK from each of its destinations in a strictly sequential order. A retransmission of the multicast packet is performed only if the ACK from any of the nodes in EMH is missing. We compare MMP with IEEE 802.11 and results show that MMP substantially improves the performance of multicast packet delivery in MANET without creating much MAC overhead. In addition, MMP provides a better mechanism to detect the movement of its nexthop members.
---
paper_title: Congestion control multicast in wireless ad hoc networks

paper_content:

In this paper, the interaction of the Medium Access Control (MAC) and routing layer is used to address the congestion control multicast routing problem in wireless ad hoc networks. We first introduce the Broadcast Medium Window (BMW) MAC protocol, which provides robust delivery to broadcast packets at the MAC layer. In doing so, we show that although BMW is able to provide high reliability under low to medium network load, reliability dramatically degrades under high network load. We then extend the wireless On-Demand Multicast Routing Protocol (ODMRP) to facilitate congestion control in ad hoc networks using BMW to combat the poor performance under highly congested network conditions. Through simulation, we show that ODMRP with congestion control adapts well to multicast sources that are aggressive in data transmissions.
---
paper_title: RMAC: a reliable multicast MAC protocol for wireless ad hoc networks

paper_content:

This work presents a new MAC protocol called RMAC that supports reliable multicast for wireless ad hoc networks. By utilizing the busy tone mechanism to realize multicast reliability, RMAC has the following three novelties: (1) it uses a variable-length control frame to stipulate an order for the receivers to respond, such that the problem of feedback collision is solved; (2) it extends the traditional usage of busy tone for preventing data frame collisions into the multicast scenario; and (3) it introduces a new usage of busy tone for acknowledging data frames. In addition, we also generalize RMAC into a comprehensive MAC protocol that provides both reliable and unreliable services for all the three modes of communications: unicast, multicast, and broadcast. Our evaluation shows that RMAC achieves high reliability with very limited overhead. We also compare RMAC with other reliable multicast MAC protocols, showing that RMAC not only provides higher reliability but also involves lower cost.
---
paper_title: Reliable MAC layer multicast in IEEE 802.11 wireless networks

paper_content:

Multicast/broadcast is an important service primitive in networks. The IEEE 802.11 multicast/broadcast protocol is based on the basic access procedure of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). This protocol does not provide any media access control (MAC) layer recovery on multicast/broadcast frames. As a result, the reliability of the multicast/broadcast service is reduced due to the increased probability of lost frames resulting from interference or collisions. In this paper, we propose a reliable Batch Mode Multicast MAC protocol, BMMM, which substentially reduces the number of contention phases, thus considerably reduces the time required for a multicast/broadcast. We then propose a Location Aware Multicast MAC protocol, LAMM, that uses station location information to further improve upon BMMM. Extensive analysis and simulation results validate the reliability and efficiency of our multicast MAC protocols.
---
paper_title: MAC reliable broadcast in ad hoc networks

paper_content:

Traditional wireless ad hoc medium access control (MAC) protocols often utilize control frames such as request-to-send (RTS), clear-to-send (CTS) and acknowledgement (ACK) to reliably deliver unicast data. However, little effort has been given to improve the reliable delivery of broadcast data. Often, broadcast data are transmitted blindly without any consideration of hidden terminals. In this paper, we proposed a novel MAC protocol, broadcast medium window (BMW) that reliably delivers broadcast data.
---
paper_title: MAC Layer Multicast in Wireless Multihop Networks

paper_content:

Many applications in wireless ad-hoc networks require multicast communication. In order to provide efficient multicast, various multicast routing protocols have been designed in recent years to facilitate formation of routes between multicast senders and receivers. There has also been some work to develop a suitable MAC protocol to improve efficiency of multicast communication. In this work we explore some approaches for reliable multicast at the MAC layer. We develop a multicast extension of IEEE 802.11 protocol and evaluate its performance. We have implemented our protocol in the popular ns-2 simulator and have performed experiments with multicast routing protocol.1. Our approach demonstrates superior performance in terms of packet deliveryfraction as well as delay compared to the IEEE 802.11 protocol.
---
paper_title: Supporting MAC layer multicast in IEEE 802.11 based MANETs: issues and solutions

paper_content:

In IEEE 802.11 based mobile ad hoc networks (MANET) multicast packets are generally forwarded as one hop broadcast; mainly to reach all the multicast members in the neighborhood in a single transmission. Because of the broadcast property of the forwarding, packets suffer from increased instances of the hidden terminal problem. Mobility of nodes makes things more difficult, and unlike unicast transmissions where MAC can detect the movement of a nexthop by making several retries, it is not possible in case of multicast forwarding. To address these issues, we propose a multicast aware MAC protocol (MMP) for MANET. The basic objective of MMP is to provide a MAC layer support for multicast traffic. This is done by attaching an extended multicast header (EMH) by the multicast agent, which provides the address of the nexthop nodes that are supposed to receive the multicast packet. The MAC layer in MMP uses the EMH field to support an ACK based data delivery. After sending the data packet, the transmitter waits for the ACK from each of its destinations in a strictly sequential order. A retransmission of the multicast packet is performed only if the ACK from any of the nodes in EMH is missing. We compare MMP with IEEE 802.11 and results show that MMP substantially improves the performance of multicast packet delivery in MANET without creating much MAC overhead. In addition, MMP provides a better mechanism to detect the movement of its nexthop members.
---
paper_title: MAC Layer Multicast in Wireless Multihop Networks

paper_content:

Many applications in wireless ad-hoc networks require multicast communication. In order to provide efficient multicast, various multicast routing protocols have been designed in recent years to facilitate formation of routes between multicast senders and receivers. There has also been some work to develop a suitable MAC protocol to improve efficiency of multicast communication. In this work we explore some approaches for reliable multicast at the MAC layer. We develop a multicast extension of IEEE 802.11 protocol and evaluate its performance. We have implemented our protocol in the popular ns-2 simulator and have performed experiments with multicast routing protocol.1. Our approach demonstrates superior performance in terms of packet deliveryfraction as well as delay compared to the IEEE 802.11 protocol.
---
paper_title: Reliable MAC layer multicast in IEEE 802.11 wireless networks

paper_content:

Multicast/broadcast is an important service primitive in networks. The IEEE 802.11 multicast/broadcast protocol is based on the basic access procedure of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). This protocol does not provide any media access control (MAC) layer recovery on multicast/broadcast frames. As a result, the reliability of the multicast/broadcast service is reduced due to the increased probability of lost frames resulting from interference or collisions. In this paper, we propose a reliable Batch Mode Multicast MAC protocol, BMMM, which substentially reduces the number of contention phases, thus considerably reduces the time required for a multicast/broadcast. We then propose a Location Aware Multicast MAC protocol, LAMM, that uses station location information to further improve upon BMMM. Extensive analysis and simulation results validate the reliability and efficiency of our multicast MAC protocols.
---
paper_title: Random access MAC for efficient broadcast support in ad hoc networks

paper_content:

Wireless communications are becoming an important part of our everyday lifestyle. One major area that will have an enormous impact on the performance of wireless ad hoc networks is the medium access control (MAC) layer. Current random access MAC protocols for ad hoc networks support reliable unicast but not reliable broadcast. We propose a random access MAC protocol, broadcast support multiple access (BSMA), which improves the broadcast reliability in ad hoc networks.
---
paper_title: HIMAC: High Throughput MAC Layer Multicasting in Wireless Networks

paper_content:

Efficient, scalable and robust multicasting support from the MAC layer is needed for meeting the demands of multicast based applications over WiFi and mesh networks. However, the IEEE 802.11 protocol has no specific mechanism for multicasting. It implements multicasting using broadcasting at the base transmission rate. We identify two fundamental reasons for performance limitations of this approach: (a) Channel-state Indifference: irrespective of the current quality of the channel to the receivers, the transmission always uses the base transmission rate; (b) Demand Ignorance: packets are transmitted by a node even if children in the multicast tree have received those packets by virtue of overhearing. We propose a solution for MAC layer multicasting called HIMAC that uses the following two mechanisms: Unary Channel Feedback (UCF) and Unary Negative Feedback (UNF) to respectively address the shortcomings of 802.11. Our study is supported by measurements in a testbed, and simulations. We observe that the end-to-end throughput of multicast sessions using MAODV can be increased by up to 74% while reducing the end-to-end latency by up to a factor of 56.
---
paper_title: Congestion control multicast in wireless ad hoc networks

paper_content:

In this paper, the interaction of the Medium Access Control (MAC) and routing layer is used to address the congestion control multicast routing problem in wireless ad hoc networks. We first introduce the Broadcast Medium Window (BMW) MAC protocol, which provides robust delivery to broadcast packets at the MAC layer. In doing so, we show that although BMW is able to provide high reliability under low to medium network load, reliability dramatically degrades under high network load. We then extend the wireless On-Demand Multicast Routing Protocol (ODMRP) to facilitate congestion control in ad hoc networks using BMW to combat the poor performance under highly congested network conditions. Through simulation, we show that ODMRP with congestion control adapts well to multicast sources that are aggressive in data transmissions.
---
paper_title: Reliable MAC layer multicast in IEEE 802.11 wireless networks

paper_content:

Multicast/broadcast is an important service primitive in networks. The IEEE 802.11 multicast/broadcast protocol is based on the basic access procedure of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). This protocol does not provide any media access control (MAC) layer recovery on multicast/broadcast frames. As a result, the reliability of the multicast/broadcast service is reduced due to the increased probability of lost frames resulting from interference or collisions. In this paper, we propose a reliable Batch Mode Multicast MAC protocol, BMMM, which substentially reduces the number of contention phases, thus considerably reduces the time required for a multicast/broadcast. We then propose a Location Aware Multicast MAC protocol, LAMM, that uses station location information to further improve upon BMMM. Extensive analysis and simulation results validate the reliability and efficiency of our multicast MAC protocols.
---
paper_title: Multicast medium access control in wireless ad hoc network

paper_content:

The basic carrier sense multiaccess control scheme for multicast communications in wireless ad hoc network suffers from the well know hidden terminal problem. The data packet collision probability is relatively high, and the packet delivery ratio is sensitive to the network topology, nodes distribution and traffic load. This paper generalizes the virtual earner sense collision avoidance approach to reduce packet collisions. The sender and receivers exchange RTS and CTS packets to reserve the channel. When more than one receivers reply with CTS packets, the sender will detect an "expected" collision which may be interpreted as a valid "clear-to-send" signal provided the collision satisfies the given timing requirements. Together with a receiver-initiated local recovery mechanism, the reliability of multicast communications can be improved to almost 100%.
---
paper_title: MAC reliable broadcast in ad hoc networks

paper_content:

Traditional wireless ad hoc medium access control (MAC) protocols often utilize control frames such as request-to-send (RTS), clear-to-send (CTS) and acknowledgement (ACK) to reliably deliver unicast data. However, little effort has been given to improve the reliable delivery of broadcast data. Often, broadcast data are transmitted blindly without any consideration of hidden terminals. In this paper, we proposed a novel MAC protocol, broadcast medium window (BMW) that reliably delivers broadcast data.
---
paper_title: RMAC: a reliable multicast MAC protocol for wireless ad hoc networks

paper_content:

This work presents a new MAC protocol called RMAC that supports reliable multicast for wireless ad hoc networks. By utilizing the busy tone mechanism to realize multicast reliability, RMAC has the following three novelties: (1) it uses a variable-length control frame to stipulate an order for the receivers to respond, such that the problem of feedback collision is solved; (2) it extends the traditional usage of busy tone for preventing data frame collisions into the multicast scenario; and (3) it introduces a new usage of busy tone for acknowledging data frames. In addition, we also generalize RMAC into a comprehensive MAC protocol that provides both reliable and unreliable services for all the three modes of communications: unicast, multicast, and broadcast. Our evaluation shows that RMAC achieves high reliability with very limited overhead. We also compare RMAC with other reliable multicast MAC protocols, showing that RMAC not only provides higher reliability but also involves lower cost.
---
paper_title: Supporting MAC layer multicast in IEEE 802.11 based MANETs: issues and solutions

paper_content:

In IEEE 802.11 based mobile ad hoc networks (MANET) multicast packets are generally forwarded as one hop broadcast; mainly to reach all the multicast members in the neighborhood in a single transmission. Because of the broadcast property of the forwarding, packets suffer from increased instances of the hidden terminal problem. Mobility of nodes makes things more difficult, and unlike unicast transmissions where MAC can detect the movement of a nexthop by making several retries, it is not possible in case of multicast forwarding. To address these issues, we propose a multicast aware MAC protocol (MMP) for MANET. The basic objective of MMP is to provide a MAC layer support for multicast traffic. This is done by attaching an extended multicast header (EMH) by the multicast agent, which provides the address of the nexthop nodes that are supposed to receive the multicast packet. The MAC layer in MMP uses the EMH field to support an ACK based data delivery. After sending the data packet, the transmitter waits for the ACK from each of its destinations in a strictly sequential order. A retransmission of the multicast packet is performed only if the ACK from any of the nodes in EMH is missing. We compare MMP with IEEE 802.11 and results show that MMP substantially improves the performance of multicast packet delivery in MANET without creating much MAC overhead. In addition, MMP provides a better mechanism to detect the movement of its nexthop members.
---
paper_title: Rate-adaptive multicast in mobile ad-hoc networks

paper_content:

A current trend in wireless communications is to enable wireless devices to transmit at different rates. That multirate capability has been defined in many standards such as 802.11a, 802.11b, 802.11g, and HiperLAN2. We propose a rate-adaptive multicast (RAM) protocol that is multirate-aware. During the process of path discovery, the quality of wireless links is estimated to suggest optimal transmission rates, which are then used to calculate the total transmission time incurred by the mobile nodes on a path. Among several considered paths from a source to a destination, RAM selects the path with the lowest total transmission time. Our work is the first that proposes the use of the multirate capability in multicast. The proposed RAM protocol works with any multirate standards, and does not require any modifications to the standards. Our simulation results show that RAM outperforms single-rate multicast in terms of packet delivery ratio, packet end-to-end delay, and throughput of the multicast group.
---
paper_title: Ad hoc Multicast Routing Algorithm with Swarm Intelligence

paper_content:

Swarm intelligence refers to complex behaviors that arise from very simple individual behaviors and interactions, which is often observed in nature, especially among social insects such as ants. Although each individual (an ant) has little intelligence and simply follows basic rules using local information obtained from the environment, such as ant's pheromone trail laying and following behavior, globally optimized behaviors, such as finding a shortest path, emerge when they work collectively as a group. In this paper, we apply this biologically inspired metaphor to the multicast routing problem in mobile ad hoc networks. Our proposed multicast protocol adapts a core-based approach which establishes multicast connectivity among members through a designated node (core). An initial multicast connection can be rapidly setup by having the core flood the network with an announcement so that nodes on the reverse paths to the core will be requested by group members to serve as forwarding nodes. In addition, each member who is not the core periodically deploys a small packet that behaves like an ant to opportunistically explore different paths to the core. This exploration mechanism enables the protocol to discover new forwarding nodes that yield lower total forwarding costs, where cost is abstract and can be used to represent any metric to suit the application. Simulations have been conducted to demonstrate the performance of the proposed approach and to compare it with certain existing multicast protocols.
---
paper_title: A performance comparison study of ad hoc wireless multicast protocols

paper_content:

In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multihop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. However, systematic performance evaluations and comparative analysis of these protocols in a common realistic environment has not yet been performed. In this study, we simulate a set of representative wireless ad hoc multicast protocols and evaluate them in various network scenarios. The relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations are studied and discussed.
---
paper_title: Application versus network layer multicasting in ad hoc networks: The ALMA routing protocol. Ad Hoc Networks Journal

paper_content:

Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting.
---
paper_title: Multipoint communication by hierarchically encoded data

paper_content:

A novel multipoint communication paradigm, in which each destination receives a subset of the source's signal that corresponds to that destination's terminal and access bandwidth constraints, is presented. The approach to realizing this paradigm is based on integration of layered coding of the source's signal, routing based on bandwidth demand, optimization of signal parameters, and layered error control. The author gives an overview of several hierarchical signal coding techniques; presents methods for finding maximum bandwidth available to destination, establishing maximum-bandwidth routes; and optimally assigns bandwidth to the signal layers to maximize overall reception quality. Error control procedures whereby the network, source, and destinations cooperate to maintain layered-based data integrity, using erasure recovery coding and prioritized packet detection are also presented. >
---
paper_title: Multiple Description Coding: Compression Meets the Network

paper_content:

This article focuses on the compressed representations of pictures. The representation does not affect how many bits get from the Web server to the laptop, but it determines the usefulness of the bits that arrive. Many different representations are possible, and there is more involved in their choice than merely selecting a compression ratio. The techniques presented represent a single information source with several chunks of data ("descriptions") so that the source can be approximated from any subset of the chunks. By allowing image reconstruction to continue even after a packet is lost, this type of representation can prevent a Web browser from becoming dormant.
---

Title: Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy

Section 1: Introduction
Description 1: This section provides an overview of Mobile Ad Hoc Networks (MANETs) and the significance of multicast routing in these networks. It also outlines the benefits and complexities associated with multicasting in MANETs and provides a brief summary of the paper's organization.

Section 2: Multicast Routing Protocol Design: Issues and Challenges
Description 2: This section discusses the unique features of MANETs that make designing multicast routing protocols challenging. It details the major issues and challenges, including dynamic topology, limited capacity, energy consumption, QoS, security, reliability, and scalability.

Section 3: Taxonomy of Multicast Routing Protocols
Description 3: This section proposes a classification for existing multicast routing protocols into three categories based on their operational layer—network layer, application layer, and MAC layer. It also provides a comprehensive discussion of their features, advantages, and limitations.

Section 4: Network Layer Multicasting versus Application Layer Multicasting versus MAC Layer Multicasting
Description 4: This section compares multicast protocols implemented at different layers of the protocol stack, outlining specific functionalities, benefits, and drawbacks of each approach.

Section 5: Multicast Session Life Cycle
Description 5: This section describes the different stages of a multicast session, including initialization, maintenance, and termination. It discusses various events that can affect the session's performance and the strategies deployed by existing protocols to handle these events.

Section 6: Multicast Routing Protocols in MANETs
Description 6: This section presents detailed descriptions of some existing multicast routing protocols categorized by their operational layers. It includes the design, operation, and discussion of protocols such as ABAM, DDM, BEMRP, WBM, MZRP, MCEDAR, among others.

Section 7: Multicast Evaluation Criteria
Description 7: This section outlines the criteria for evaluating multicast routing protocols, including packet delivery ratio, total overhead, control overhead, average latency, delivery efficiency, reachability, average throughput, and stress.

Section 8: Comparison and Summary
Description 8: This section provides a comparative and qualitative evaluation of the described multicast routing protocols based on various characteristics like routing approach, route acquisition latency, multicast control overhead, and QoS support.

Section 9: Conclusion and Future Work
Description 9: This section summarizes the survey, stating the major issues and challenges in designing multicast routing protocols for MANETs. It also outlines potential future research areas open for exploration, such as interoperability, interaction, heterogeneity, integration, mobility, congestion control, power efficiency, and network coding.