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

Quality of service aware data dissemination in vehicular Ad Hoc networks

Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché. Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route. Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

Energy Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary Affirmation of Benchmarking Models in Recent Literature

The Mobile Ad hoc Networks playing critical role in network aided communication requirements The features such as ad hoc and open architecture based connectivity and node mobility are elevating the mobile ad hoc networks as much as feasible to deploy and use The direct communication between any of two nodes in this network is possible if target node is in the range of source node If not the indirect communication took place which is usually referred as multi hop routing The multi hop routing occurs as either a unicast model one source node to one destination node multicast model one source node to multiple destination nodes or multiple casting manifold unicast routing In these routing strategies provision of service quality in multi hop routing is a challenging task The optimal quality of service in routing magnifies the delivery ratio transmission rate network life span and other expected characteristics of the ad hoc routing Among the quality service provision factors minimal energy conservation is prime factor which is since the nodes involved in routing are self-energized and if discharged early then the route will be destructed that causes discontinued routing The energy consumption is more specific in multicast routing hence it is grabbing the more attention of the current research contribution

QoS Routing solution based on Genetic Algorithm for MANETs

Qos routing protocol design for mobile ad-hoc networks is more challenging than wire lane network. Mainly due to node mobility, multi hop communications, contention for channel access and lack of central ordination.QoS guarantees are required by the most of the applications. Most optimal route has to be selected from source to destination by using QoS routing protocol. Many routing protocols are designed for single QoS metric. If it requires to design routing protocol for multi constrained routing path, normal algorithms can be failed. In this paper we proposed genetic algorithm based route selection protocol to solve the multi constrained QoS route. Genetic algorithm finds the optimal route with population initialization, cross over, mutation and fitness function calculation. QoS constraints consists of end to end delay, band width, packet loss rate, node connectivity index (Ni) and dynamic resource availability. Simulations have been performed in ns-2. Performance of genetic algorithm is compared with AOMDV and results shows that genetic algorithm is giving efficient results for different metrics (delay, throughput and Delivery ratio)

Minimum power multicasting with delay bound constraints in Ad Hoc wireless networks

In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks. Assuming that each transmission takes a fixed amount of time, we impose constraints on the number of hops allowed to reach the destination nodes in the multicasting application. This setting would be applicable in time critical or real time applications, and the relative importance of the nodes may be indicated by these delay bounds. We design a filtered beam search procedure for solving this problem. The performance of our algorithm is demonstrated on numerous test cases by benchmarking it against an optimal algorithm in small problem instances, and against a modified version of the well-known Broadcast Incremental Power (BIP) algorithm 20 for relatively large problems

Multicast outing protocols and architectures in mobile ad-hoc wireless networks

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 adhoc networks have been an area of active research for the past few years. In this dissertation, protocols and architectures for supporting multicast services are proposed, analyzed and evaluated in mobile ad-hoc wireless networks. In the first chapter, the activities and recent advances are summarized 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. a classification of the current multicast protocols is presented, the functionality of the individual existing protocols is discussed, and a qualitative comparison of their characteristics is provided according to several distinct features and performance parameters. In the second chapter, a novel mobility-based clustering strategy that facilitates the support of multicast routing and mobility management is presented in mobile ad-hoc networks. In the proposed structure, mobile nodes are organized into nonoverlapping clusters which have adaptive variable-sizes according to their respective mobility. The mobility-based clustering (MBC) approach which is proposed uses combination of both physical and logical partitions of the network (i.e. geographic proximity and functional relation between nodes, such as mobility pattern etc.). In the third chapter, an entropy-based modeling framework for supporting and evaluating the stability is proposed in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. In the fourth chapter, a Mobility-based Hybrid Multicast Routing (MHMR) protocol suitable for mobile ad-hoc networks is proposed. The MHMR uses the MBC algorithm as the underlying structure. The main features that the proposed protocol introduces are the following: a) mobility based clustering and group based hierarchical structure, in order to effectively support the stability and scalability, b) group based (limited) mesh structure and forwarding tree concepts, in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide the low route acquisition delay of proactive techniques and the low overhead of reactive methods. In the fifth chapter, an architecture for supporting geomulticast services with high message delivery accuracy is presented in mobile ad-hoc wireless networks. Geomulticast is a specialized location-dependent multicasting technique, where messages are multicast to some specific user groups within a specific zone. An analytical framework which is used to evaluate the various geomulticast architectures and protocols is also developed and presented. The last chapter concludes the dissertation

Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing

This is the post-print version of the article - Copyright @ 2008 Springer-VerlagThis paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1