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

HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks

In this paper we propose HYMAD, a Hybrid DTN-MANET routing protocol which uses DTN between disjoint groups of nodes while using MANET routing within these groups. HYMAD is fully decentralized and only makes use of topological information exchanges between the nodes. We evaluate the scheme in simulation by replaying real life traces which exhibit this highly dynamic connectivity. The results show that HYMAD outperforms the multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of delivery ratio and delay, for any number of message copies. Our conclusion is that such a Hybrid DTN-MANET approach offers a promising venue for the delivery of elastic data in mobile ad-hoc networks as it retains the resilience of a pure DTN protocol while significantly improving performance.Comment: 7 pages, 6 figure

On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks

We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journeys that maximize the space-time information propagation capacity, in bit-meters per second. More specifically, we provide theoretical lower and upper bounds on the information propagation speed, as a function of the journey capacity. In the particular case of random way-point-like models (i.e., when nodes move for a distance of the order of the network domain size before changing direction), we show that, for relatively large journey capacities, the information propagation speed is of the same order as the mobile node speed. This implies that, surprisingly, in sparse but large-scale mobile DTNs, the space-time information propagation capacity in bit-meters per second remains proportional to the mobile node speed and to the size of the transported data bundles, when the bundles are relatively large. We also verify that all our analytical bounds are accurate in several simulation scenarios.Comment: Part of this work will be presented in "On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks", P. Jacquet, B. Mans and G. Rodolakis, IEEE Infocom, 201

Encounter gossip: a high coverage broadcast protocol for MANET

PhD ThesisMobile Ad-hoc Networks (MANETs) allow deployment of mobile wireless devices or nodes in a range of environments without any fixed infrastructure and hence at a minimal setup cost. Broadcast support that assures a high coverage (i.e., a large fraction of nodes receiving a broadcast) is essential for hosting user applications, and is also non-trivial to achieve due to the nature of devices and mobility. We propose Encounter Gossip, a novel broadcast protocol, which holds minimal state and is unaware of network topology. Coverage obtained can be made arbitrarily close to 1 at a moderate cost of extra message tra c, even in partition-prone networks. Under certain simplifying assumptions, it is shown that a high coverage is achieved by making a total of O(n ln n) broadcasts, where n is the number of nodes, and the time to propagate a message is O(ln n). The e ect of various network parameters on the protocol performance is examined. We then propose modifications to minimise the number of redundant transmissions without compromising the achieved coverage. Two approaches are pursued: timer based and history based. The e ectiveness of each of these approaches is assessed through an extensive set of simulation experiments in the context of two mobility models. Specifically, we introduce a new heuristic alpha policy which achieves significant reduction in redundancy with negligible reduction in coverage. A generalisation to multiple broadcasts proceeding in parallel is proposed and the protocol is refined to reduce problems that can occur due to the effects of high mobility when transmitting a large number of messages. Finally, we implement and validate Encounter Gossip in the context of a real-life mobile ad-hoc network. All these investigations suggest that the protocol, together with the proposed modifications and re nements, is suited to MANETs of varying degrees of node densities and speeds