A hybrid ACO/PSO based algorithm for QoS multicast routing problem

AbstractMany Internet multicast applications such as videoconferencing, distance education, and online simulation require to send information from a source to some selected destinations. These applications have stringent Quality-of-Service (QoS) requirements that include delay, loss rate, bandwidth, and delay jitter. This leads to the problem of routing multicast traffic satisfying QoS requirements. The above mentioned problem is known as the QoS constrained multicast routing problem and is NP Complete. In this paper, we present a swarming agent based intelligent algorithm using a hybrid Ant Colony Optimization (ACO)/Particle Swarm Optimization (PSO) technique to optimize the multicast tree. The algorithm starts with generating a large amount of mobile agents in the search space. The ACO algorithm guides the agents’ movement by pheromones in the shared environment locally, and the global maximum of the attribute values are obtained through the random interaction between the agents using PSO algorithm. The performance of the proposed algorithm is evaluated through simulation. The simulation results reveal that our algorithm performs better than the existing algorithms

A green intelligent routing algorithm supporting flexible QoS for many-to-many multicast

The tremendous energy consumption attributed to the Information and Communication Technology (ICT) field has become a persistent concern during the last few years, attracting significant academic and industrial efforts. Networks have begun to be improved towards being “green”. Considering Quality of Service (QoS) and power consumption for green Internet, a Green Intelligent flexible QoS many-to-many Multicast routing algorithm (GIQM) is presented in this paper. In the proposed algorithm, a Rendezvous Point Confirming Stage (RPCS) is first carried out to obtain a rendezvous point and the candidate Many-to-many Multicast Sharing Tree (M2ST); then an Optimal Solution Identifying Stage (OSIS) is performed to generate a modified M2ST rooted at the rendezvous point, and an optimal M2ST is obtained by comparing the original M2ST and the modified M2ST. The network topology of Cernet2, GéANT and Internet2 were considered for the simulation of GIQM. The results from a series of experiments demonstrate the good performance and outstanding power-saving potential of the proposed GIQM with QoS satisfied

A new QoS Routing Architecture in NGI

After a thorough understanding of the relevant research knowledge and the key theory of NGN, I describe the research objectives and the recent development of the QoS routing in this thesis. QoS routing is regarded as the key part in the problem of the next generation of integrated-service network. A new routing algorithm is put forward in this thesis, which is better than OSPF in some aspects. As for the experiment, NS2 is chosen as the simulation environment, and some other experimental results are also included to manifest its strongpoint. The development and requirement of NGN is described in Chapter One; The definition and types of routing and the basic theories of QoS routing are described in Chapter Two; The development and research method of QoS are focused in Chapter Three. The new routing algorithm and simulation is proposed in Chapter Four

An efficient Particle Swarm Optimization technique for identification of shortest path in Distributed Network

No Abstrac

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

A load-sensitive multicast routing protocol.

Wong Kar Yiu.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.Includes bibliographical references (leaves 109-111).Abstracts in English and Chinese.Abstract --- p.iiAcknowledgement --- p.ivTable of Contents --- p.vList of Figure --- p.viiChapter Chapter 1. --- Introduction --- p.9Chapter 1.1 --- Introduction --- p.9Chapter 1.2 --- Background --- p.11Chapter 1.3 --- Ant Colony Optimization (ACO) --- p.15Chapter 1.4 --- Main contribution --- p.16Chapter 1.5 --- Thesis organization --- p.18Chapter Chapter 2. --- Related Work --- p.19Chapter 2.1 --- Multicast routing in general --- p.19Chapter 2.2 --- Multicast routing techniques --- p.22Chapter 2.3 --- Best-effort multicast routing --- p.25Chapter 2.4 --- Quality-of-Service (QoS) multicast routing --- p.30Chapter 2.5 --- Adaptive multicast routing --- p.34Chapter Chapter 3. --- Load-Sensitive Multicast Routing Protocol (LSMRP) --- p.37Chapter 3.1 --- Overview --- p.37Chapter 3.2 --- Problem Formulation --- p.37Chapter 3.3 --- Types of ant in LSMRP --- p.39Chapter 3.3.1 --- Forward Ants --- p.39Chapter 3.3.2 --- Random Ants --- p.41Chapter 3.3.3 --- Backward Ants --- p.42Chapter 3.3.4 --- Multicast Ants --- p.44Chapter 3.3.5 --- Multicast Backward Ants --- p.44Chapter 3.4 --- Global Algorithm --- p.47Chapter 3.4.1 --- Pheromone trails stage --- p.50Chapter 3.4.2 --- Multicast tree stage --- p.53Chapter 3.4.3 --- Routing table --- p.56Chapter 3.4.4 --- Messages Exchange and Mechanisms --- p.57Chapter 3.4.5 --- mapping --- p.58Chapter 3.4.6 --- Members join --- p.59Chapter 3.4.7 --- Members update --- p.59Chapter 3.4.8 --- Members leave --- p.61Chapter Chapter 4. --- Analysis of LSMRP --- p.63Chapter 4.1 --- Analysis of pheromone trail values --- p.63Chapter Chapter 5. --- Evaluation and Experimental Results --- p.80Chapter 5.1 --- System model --- p.80Chapter 5.2 --- Result --- p.84Chapter 5.2.1 --- Packets received --- p.84Chapter 5.2.2 --- Throughput --- p.86Chapter 5.2.3 --- Packet Loss --- p.98Chapter Chapter 6. --- Conclusion --- p.107Chapter 6.1 --- Future work/ open question --- p.107References --- p.10

The edge-disjoint path problem on random graphs by message-passing

We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an exponential computational cost in the number of paths. To overcome this obstacle we propose an efficient implementation by mapping the equations onto a weighted combinatorial matching problem over an auxiliary graph. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behaviour of both the number of paths to be accommodated and their minimum total length.Comment: 14 pages, 8 figure

Performance Assessment of Routing Protocols for IoT/6LoWPAN Networks

The Internet of Things (IoT) proposes a disruptive communication paradigm that allows smart objects to exchange data among themselves to reach a common goal. IoT application scenarios are multiple and can range from a simple smart home lighting system to fully controlled automated manufacturing chains. In the majority of IoT deployments, things are equipped with small devices that can suffer from severe hardware and energy restrictions that are responsible for performing data processing and wireless communication tasks. Thus, due to their features, communication networks that are used by these devices are generally categorized as Low Power and Lossy Networks (LLNs). The considerable variation in IoT applications represents a critical issue to LLN networks, which should offer support to different requirements as well as keeping reasonable quality-of-service (QoS) levels. Based on this challenge, routing protocols represent a key issue in IoT scenarios deployment. Routing protocols are responsible for creating paths among devices and their interactions. Hence, network performance and features are highly dependent on protocol behavior. Also, based on the adopted protocol, the support for some specific requirements of IoT applications may or may not be provided. Thus, a routing protocol should be projected to attend the needs of the applications considering the limitations of the device that will execute them. Looking to attend the demand of routing protocols for LLNs and, consequently, for IoT networks, the Internet Engineering Task Force (IETF) has designed and standardized the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). This protocol, although being robust and offering features to fulfill the need of several applications, still presents several faults and weaknesses (mainly related to its high complexity and memory requirement), which limits its adoption in IoT scenarios. An alternative to RPL, the Lightweight On-demand Ad Hoc Distancevector Routing Protocol – Next Generation (LOADng) has emerged as a less complicated routing solution for LLNs. However, the cost of its simplicity is paid for with the absence of adequate support for a critical set of features required for many IoT environments. Thus, based on the challenging open issues related to routing in IoT networks, this thesis aims to study and propose contributions to better attend the network requirements of IoT scenarios. A comprehensive survey, reviewing state-of-the-art routing protocols adopted for IoT, identified the strengths and weaknesses of current solutions available in the literature. Based on the identified limitations, a set of improvements is designed to overcome these issues and enhance IoT network performance. The novel solutions are proposed to include reliable and efficient support to attend the needs of IoT applications, such as mobility, heterogeneity, and different traffic patterns. Moreover, mechanisms to improve the network performance in IoT scenarios, which integrate devices with different communication technologies, are introduced. The studies conducted to assess the performance of the proposed solutions showed the high potential of the proposed solutions. When the approaches presented in this thesis were compared with others available in the literature, they presented very promising results considering the metrics related to the Quality of Service (QoS), network and energy efficiency, and memory usage as well as adding new features to the base protocols. Hence, it is believed that the proposed improvements contribute to the state-of-the-art of routing solutions for IoT networks, increasing the performance and adoption of enhanced protocols.A Internet das Coisas, do inglês Internet of Things (IoT), propõe um paradigma de comunicação disruptivo para possibilitar que dispositivos, que podem ser dotados de comportamentos autónomos ou inteligentes, troquem dados entre eles buscando alcançar um objetivo comum. Os cenários de aplicação do IoT são muito variados e podem abranger desde um simples sistema de iluminação para casa até o controle total de uma linha de produção industrial. Na maioria das instalações IoT, as “coisas” são equipadas com um pequeno dispositivo, responsável por realizar as tarefas de comunicação e processamento de dados, que pode sofrer com severas restrições de hardware e energia. Assim, devido às suas características, a rede de comunicação criada por esses dispositivos é geralmente categorizada como uma Low Power and Lossy Network (LLN). A grande variedade de cenários IoT representam uma questão crucial para as LLNs, que devem oferecer suporte aos diferentes requisitos das aplicações, além de manter níveis de qualidade de serviço, do inglês Quality of Service (QoS), adequados. Baseado neste desafio, os protocolos de encaminhamento constituem um aspecto chave na implementação de cenários IoT. Os protocolos de encaminhamento são responsáveis por criar os caminhos entre os dispositivos e permitir suas interações. Assim, o desempenho e as características da rede são altamente dependentes do comportamento destes protocolos. Adicionalmente, com base no protocolo adotado, o suporte a alguns requisitos específicos das aplicações de IoT podem ou não ser fornecidos. Portanto, estes protocolos devem ser projetados para atender as necessidades das aplicações assim como considerando as limitações do hardware no qual serão executados. Procurando atender às necessidades dos protocolos de encaminhamento em LLNs e, consequentemente, das redes IoT, a Internet Engineering Task Force (IETF) desenvolveu e padronizou o IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). O protocolo, embora seja robusto e ofereça recursos para atender às necessidades de diferentes aplicações, apresenta algumas falhas e fraquezas (principalmente relacionadas com a sua alta complexidade e necessidade de memória) que limitam sua adoção em cenários IoT. Em alternativa ao RPL, o Lightweight On-demand Ad hoc Distance-vector Routing Protocol – Next Generation (LOADng) emergiu como uma solução de encaminhamento menos complexa para as LLNs. Contudo, o preço da simplicidade é pago com a falta de suporte adequado para um conjunto de recursos essenciais necessários em muitos ambientes IoT. Assim, inspirado pelas desafiadoras questões ainda em aberto relacionadas com o encaminhamento em redes IoT, esta tese tem como objetivo estudar e propor contribuições para melhor atender os requisitos de rede em cenários IoT. Uma profunda e abrangente revisão do estado da arte sobre os protocolos de encaminhamento adotados em IoT identificou os pontos fortes e limitações das soluções atuais. Com base nas debilidades encontradas, um conjunto de soluções de melhoria é proposto para superar carências existentes e melhorar o desempenho das redes IoT. As novas soluções são propostas para incluir um suporte confiável e eficiente capaz atender às necessidades das aplicações IoT relacionadas com suporte à mobilidade, heterogeneidade dos dispositivos e diferentes padrões de tráfego. Além disso, são introduzidos mecanismos para melhorar o desempenho da rede em cenários IoT que integram dispositivos com diferentes tecnologias de comunicação. Os vários estudos realizados para mensurar o desempenho das soluções propostas mostraram o grande potencial do conjunto de melhorias introduzidas. Quando comparadas com outras abordagens existentes na literatura, as soluções propostas nesta tese demonstraram um aumento do desempenho consistente para métricas relacionadas a qualidade de serviço, uso de memória, eficiência energética e de rede, além de adicionar novas funcionalidades aos protocolos base. Portanto, acredita-se que as melhorias propostas contribuiem para o avanço do estado da arte em soluções de encaminhamento para redes IoT e aumentar a adoção e utilização dos protocolos estudados

A comprehensive review of energy efficient routing protocols for query driven wireless sensor networks [version 3; peer review: 2 approved]

In this current era of communications and networking, The Internet of things plays the main role in the making of smart communication and networking. In this article, we have focused on the literature survey on wireless sensor networks which are energy efficient. Various standard protocols are reviewed along with some enhanced protocols which makes the network energy efficient. The comparison of the standard and enhanced protocols with respect to various applications in wireless sensor networks is thoroughly done in this article. The outcomes of the enhanced protocols are also briefly discussed. For easier analysis to future researchers, a comparative table which lists the enhanced protocols which are compared with standard counterparts along with the factors for energy efficiency of the protocols. This article also comments on the issues and challenges of the protocols which can be further analyzed for making the wireless sensor network more energy efficient