A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Structured Peer-to-Peer Overlay Deployment on MANET: A Survey

There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems

Supporting Protocols for Structuring and Intelligent Information Dissemination in Vehicular Ad Hoc Networks

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for creating stable cluster structures in VANETs, and to minimize this associated overhead. Further a hybrid overlay-based geocast protocol for VANETs is presented. The protocol utilizes a backbone overlay virtual infrastructure on top of the physical network to provide geocast support, which is crucial for intervehicle communications since many applications provide group-oriented and location-oriented services. The final contribution is a structureless information dissemination scheme which creates a layered view of road conditions with a diminishing resolution as the viewing distance increases. Namely, the scheme first provides a high-detail local view of a given vehicle\u27s neighbors and its immediate neighbors, which is further extended when information dissemination is employed. Each vehicle gets aggregated information for road conditions beyond this extended local view. The scheme allows for the preservation of unique reports within aggregated frames, such that safety critical notifications are kept in high detail, all for the benefit of the driver\u27s improved decision making during emergency scenarios

Mesh based and Hybrid Multicast routing protocols for MANETs: Current State of the art

This paper discusses various multicast routing protocols which are proposed in the recent past each having its own unique characteristic, with a motive of providing a complete understanding of these multicast routing protocols and present the scope of future research in this field. Further, the paper specifically discusses the current development in the development of mesh based and hybrid multicasting routing protocols. The study of this paper addresses the solution of most difficult task in Multicast routing protocols for MANETs under host mobility which causes multi-hop routing which is even more severe with bandwidth limitations. The Multicast routing plays a substantial part in MANETs

Adaptive Multicast on Mobile Ad Hoc Networks Using Tree-Based Meshes With Variable Density of Redundant Paths

Multicasting has been extensively studied for mobile ad hoc networks (MANETs) because it is fundamental to many ad hoc network applications requiring close collaboration of multiple nodes in a group. A general approach is to construct an overlay structure such as multicast tree or mesh and to deliver a multicast packet to multiple receivers over the overlay structure. However, it either incurs a lot of overhead (multicast mesh) or performs poorly in terms of delivery ratio (multicast tree). This paper proposes an adaptive multicast scheme, called tree-based mesh with k-hop redundant paths (TBM k ), which constructs a multicast tree and adds some additional links/nodes to the multicast structure as needed to support redundancy. It is designed to make a prudent tradeoff between the overhead and the delivery efficiency by adaptively controlling the path redundancy depending on network traffic and mobility. In other words, when the network is unstable with high traffic and high mobility, a large k is chosen to provide more robust delivery of multicast packets. On the other hand, when the network traffic and the mobility are low, a small k is chosen to reduce the overhead. It is observed via simulation that TBM k improves the packet delivery ratio as much as 35% compared to the multicast tree approach. On the other hand, it reduces control overhead by 23–87% depending on the value of k compared to the multicast mesh approach. In general, TBM k with the small value of k offers more robust delivery mechanism but demands less overhead than multicast trees and multicast meshes, respectively

Adaptive Multicast on Mobile Ad Hoc Networks Using Tree-Based Meshes With Variable Density of Redundant Paths

Multicasting has been extensively studied for mobile ad hoc networks (MANETs) because it is fundamental to many ad hoc network applications requiring close collaboration of multiple nodes in a group. A general approach is to construct an overlay structure such as multicast tree or mesh and to deliver a multicast packet to multiple receivers over the overlay structure. However, it either incurs a lot of overhead (multicast mesh) or performs poorly in terms of delivery ratio (multicast tree). This paper proposes an adaptive multicast scheme, called tree-based mesh with k-hop redundant paths (TBM k ), which constructs a multicast tree and adds some additional links/nodes to the multicast structure as needed to support redundancy. It is designed to make a prudent tradeoff between the overhead and the delivery efficiency by adaptively controlling the path redundancy depending on network traffic and mobility. In other words, when the network is unstable with high traffic and high mobility, a large k is chosen to provide more robust delivery of multicast packets. On the other hand, when the network traffic and the mobility are low, a small k is chosen to reduce the overhead. It is observed via simulation that TBM k improves the packet delivery ratio as much as 35% compared to the multicast tree approach. On the other hand, it reduces control overhead by 23–87% depending on the value of k compared to the multicast mesh approach. In general, TBM k with the small value of k offers more robust delivery mechanism but demands less overhead than multicast trees and multicast meshes, respectively