A Comprehensive Evaluation of Nature Inspired Routing Algorithm for Mobile Ad Hoc Network : DEA and BCA

This paper discussed about the comprehensive evaluation of nature inspired routing algorithms such as Dolphin Echolocation Algorithm (DEA) and Bee colony Algorithm (BCA) use for distance optimization. The influence of DEA and BCA algorithms on Quality of Service (QoS) performance matrices for Mobile Ad hoc Network (MANET) is analyzed. Ultimately with the help of DEA it is possible to achieve optimized routing path between source and destination nodes. Further this paper have the analysis of various results which gives the comprehensive evaluation of DEA algorithm and it is suitable for MANET for achieving good Throughput, packet delivery ratio, delay and overhand

Based on Pause Time Comparative Analysis made among Bee-Ant Colony Optimized Routing (BACOR) Vs Existing Routing Protocols for Scalable Mobile Ad Hoc Networks (MANETs)

In this paper based on swarm intelligence a new approach for an on demand ad-hoc routing algorithm is proposed. The foraging behavior of Ant colony optimization and Bee colony optimization, which are the subset of swarm intelligence and considering the ability of simple ants to solve complex problems by cooperation. Several algorithms which are based on ant colony problems were introduced in the literatures to solve different problems, e.g., optimization problems. The proposed algorithm is compared and proven by results that the approach has the potential to become an appropriate routing tactics for mobile ad-hoc networks. The results were presented based on the simulations made with the implementation in ns-2. Keywords:BACOR, Bee Routing, Ant Routing, Bee-Ant Routin

Recent Multicast Routing Protocols in VANET: Classification and Comparison

الشبكة المخصصة للسيارات (VANET) صنفت باعتبارها واحدة من أهم فئات شبكات الجيل التالي التي طورت في السنوات الأخيرة بسرعة بالنسبة للمركبات وعمليات نقل الطرق. هذه الشبكه يمكن أن تساعد في تنفيذ مجموعة كبيرة من التطبيقات المتعلقة بالمركبات، اشارة المرور، ازدحام المرور، السائقين، الركاب، الإسعاف، الشرطة، سيارات الإطفاء وحتى المشاة. التوجيه هو المشكلة الأبرز في نقل المعلومات في الـ VANET وهناك العديد من وسائط النشر: البث الاحادي، البث المتعدد و البحث في منطقه جغرافيه معينه (geocast). في هذه المقاله سوف نركز فقط على الإرسال المتعدد الذي يشير إلى عملية إرسال معلومات من عقدة واحدة (تسمى المركبة المصدر) إلى مجموعة من العقد الموجودة في مواقع مختلفة (تسمى المركبات الهدف). والغرض من هذه المقالة هو دراسة بروتوكولات توجيه الإرسال المتعدد الموجودة في الـ VANET وإنتاج دراسه جيد عنها وتحديد مزايا وعيوب كل منها وكذلك تصنيفها إلى فئات مختلفة استنادا إلى بعض العوامل المؤثرة مثل نوعية الخدمة، مسار المركبة وما إلى ذلك. وبعد تحليل بروتوكولات التوجيه هذه وجدنا أن هناك حاجة ملحة لإنتاج بروتوكول توجيه متعدد الإرسال فعال لهذه الشبكة لتقليل استهلاك الموارد وتحسين الأداء العام.Vehicular Ad Hoc Network (VANET) classified as one of the most important classes of next generation networks that developed in recent years rapidly for vehicles and road transmissions. It can help in implementing a large set of applications related to vehicles, traffic light, traffic jam, drivers, passengers, ambulance, police, fire trucks and even pedestrians. Routing is the most prominent problem in the transmission of information in VANETs and there are many modes of dissemination: unicast, broadcast, multicast and geocast. In this paper, we will focus only on the multicast that is referring to a process of sending information from one node (called source vehicle) to a group of nodes that found in different locations (called destination vehicles). The purpose of this paper is to study the existing multicast routing protocols in VANET and produce good survey about them and determine the advantages and disadvantages of each one as well as classify them into different categories based on some effected parameters such as quality of service, vehicle trajectory and etc. After analyzing these routing protocols we concluded that there is persistent need to produce efficient multicast routing protocol in this network to decrease the resource consumption and improve the overall performance

Spread Spectrum based QoS aware Energy Efficient Clustering Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of small, resource-constrained sensor nodes that form self-organizing, infrastructure-less, and ad-hoc networks. Many energy-efficient protocols have been developed in the network layer to extend the lifetime and scalability of these networks, but they often do not consider the Quality of Service (QoS) requirements of the data flow, such as delay, data rate, reliability, and throughput. In clustering, the probabilistic and randomized approach for cluster head selection can lead to varying numbers of cluster heads in different rounds of data gathering. This paper presents a new algorithm called "Spread Spectrum based QoS aware Energy Efficient Clustering for Wireless sensor Networks" that uses spread spectrum to limit the formation of clusters and optimize the number of cluster heads in WSNs, improving energy efficiency and QoS for diverse data flows. Simulation results show that the proposed algorithm outperforms classical algorithms in terms of energy efficiency and QoS

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

Reliable and efficient data dissemination schemein VANET: a review

Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET