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

Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead

PAMPA in the wild:a real-life evaluation of a lightweight ad-hoc broadcasting family

Broadcast is one of the core building blocks of many services deployed on ad-hoc wireless networks, such as Mobile Ad-Hoc Networks (MANETs) or Wireless Sensor Networks (WSNs). Most broadcast protocols are however only ever evaluated using simulations, which have repeatedly been shown to be unreliable, and potentially misleading. In this paper, we seek to go beyond simulations, and consider the particular case of PAMPA, a promising family of wireless broadcast algorithms for ad-hoc and wireless networks. We report on our efforts to further our experimental understanding of PAMPA, and present the first ever characterisation of the PAMPA family on a real deployment. Here it has to deal with real network problems such as node, message and sending failure. Our experiments show that the standard PAMPA algorithm out-performs all other protocols in the family, with a delivery ratio consistently around 75%, and a retransmission ratio as low as 44%, for a failure-free run. We use this opportunity to reflect on our findings and lessons learnt when moving from simulations to actual experimentsab

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper

Optimal Schedules for Asynchronous Transmission of Discrete Packets

In this paper we study the distribution of dynamic data over a broadcast channel to a large number of passive clients. Clients obtain the information by accessing the channel and listening for the next available packet. This scenario, referred to as packet-based or discrete broadcast, has many practical applications such as the distribution of weather and traffic updates to wireless mobile devices, reconfiguration and reprogramming of wireless sensors and downloading dynamic task information in battlefield networks. The optimal broadcast protocols require a high degree of synchronization between the server and the wireless clients. However, in typical wireless settings such degree of synchronization is difficult to achieve due to the inaccuracy of internal clocks. Moreover, in some settings, such as military applications, synchronized transmission is not desirable due to jamming. The lack of synchronization leads to large delays and excessive power consumption. Accordingly, in this work we focus on the design of optimal broadcast schedules that are robust to clock inaccuracy. We present universal schedules for delivery of up-to-date information with minimum waiting time in asynchronous settings

Disseminating data using broadcast when topology is unknown

Consider the problem of disseminating data from an arbitrary source node to all other nodes in a distributed computer system, like Wireless Sensor Networks (WSNs). We assume that wireless broadcast is used and nodes do not know the topology. We propose new protocols which disseminate data faster and use fewer broadcasts than the simple broadcast protocol

Broadcasting Scenario under Different Protocols in MANET: A Survey

A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed