Efficient Clustering Protocol Based on Stochastic Matrix & MCL and Data Routing for Mobile Wireless Sensors Network

In this paper, we have already presented a new approach for data routing dedicated to mobile Wireless Sensors Network (WSN) based on clustering. The proposed method is based on stochastic matrix and on the Markov Chain Cluster (MCL) algorithm to organize a large number of mobile sensors into clusters without defining the required clusters number in advance. It is based on mobile sensors connectivity to determinethe optimal number of clusters and to form compact and well separated clusters. Our proposed approach is a distributed method using nodes locations, degrees and theirs residual energies during the cluster head election. Simulation results showed that the proposed approach reduced the loss packets rate by 80%, the energy consumption by 30% and improved the data delivery rate by 70% compared to LEACH-M protocol. Moreover, it outperforms the E-MBC protocol and reduced the average energy consumption and loss packets rate by 60%; as well as it improved the success packets delivery rate by 40%

Intelligent detection of black hole attacks for secure communication in autonomous and connected vehicles

Detection of Black Hole attacks is one of the most challenging and critical routing security issues in vehicular ad hoc networks (VANETs) and autonomous and connected vehicles (ACVs). Malicious vehicles or nodes may exist in the cyber-physical path on which the data and control packets have to be routed converting a secure and reliable route into a compromised one. However, instead of passing packets to a neighbouring node, malicious nodes bypass them and drop any data packets that could contain emergency alarms. We introduce an intelligent black hole attack detection scheme (IDBA) tailored to ACV. We consider four key parameters in the design of the scheme, namely, Hop Count, Destination Sequence Number, Packet Delivery Ratio (PDR), and End-to-End delay (E2E). We tested the performance of our IDBA against AODV with Black Hole (BAODV), Intrusion Detection System (IdsAODV), and EAODV algorithms. Extensive simulation results show that our IDBA outperforms existing approaches in terms of PDR, E2E, Routing Overhead, Packet Loss Rate, and Throughput

Réseaux ad hoc : système d'adressage et méthodes d'accessibilité aux données

RÉSUMÉ Au cours de la dernière décennie, un nouveau type de réseaux sans fil a suscité un grand intérêt dans la communauté scientifique: ce sont les réseaux ad hoc. Ils existent sous la variante des réseaux mobiles ad hoc (MANET), et des réseaux de capteurs sans fil (RCSF). Les réseaux mobiles ad hoc sont constitués de noeuds mobiles qui communiquent les uns avec les autres sans l‘aide d‘une d'infrastructure centralisée. Les noeuds se déplacent librement et sont soumis à des déconnexions fréquentes en raison de l'instabilité des liens. Cela a pour conséquence de diminuer l'accessibilité aux données, et de modifier la façon dont les données sont partagées dans le réseau. Comparable aux réseaux MANET, un RCSF est composé d'un ensemble d'unités de traitements embarquées, appelées capteurs, communiquant via des liens sans fil et dont la fonction principale est la collecte de paramètres relatifs à l'environnement qui les entoure, telles que la température, la pression, ou la présence d'objets. Les RCSF diffèrent des MANET de par le déploiement à grande échelle des noeuds, et trouvent leur application dans diverses activités de la société, tels les processus industriels, les applications militaires de surveillance, l'observation et le suivi d'habitat, etc. Lorsqu‘un grand nombre de capteurs sont déployés avec des dispositifs d'actionnement appelés acteurs, le RCSF devient un réseau de capteurs et d‘acteurs sans fil (RCASF). Dans une telle situation, les capteurs collaborent pour la détection des phénomènes physiques et rapportent les données afférentes aux acteurs qui les traitent et initient les actions appropriées. De nombreux travaux dans les RCSF supposent l'existence d'adresses et d'infrastructures de routage pour valider leurs propositions. Cependant, l‘allocation d‘adresses et le routage des données liées aux événements détectés dans ces réseaux restent des défis entiers, en particulier à cause du nombre élevé de capteurs et des ressources limitées dont ils disposent. Dans cette thèse, nous abordons le problème de l'accessibilité aux données dans les MANET, et les mécanismes d‘adressage et de routage dans les RCSF de grande taille.----------ABSTRACT During the last decade, a new type of wireless networks has stirred up great interest within the scientific community: there are ad hoc networks. They exist as mobile ad hoc networks (MANET), and wireless sensor (WSN). The mobile ad hoc networks consist of mobile nodes that communicate with each other without using a centralized infrastructure. The nodes move freely and are subject to frequent disconnections due to links instability. This has the effect of reducing data accessibility, and change the way data are shared across the network. Similar MANET networks, a WSN consists of a set of embedded processing units called sensors that communicate with each other via wireless links. Their main function is the collection of parameters relating to the environment around them, such as temperature, pressure, motion, video, etc. WSNs differ from the MANETs due to the large scale deployment of nodes, and are expected to have many applications in various fields, such as industrial processes, military surveillance, observation and monitoring of habitat, etc. When a large number of sensors which are resource-impoverished nodes are deployed with powerful actuation devices, the WSN becomes a Wireless Sensor and Actor Network (WSAN). In such a situation, the collaborative operation of sensors enables the distributed sensing of a physical phenomenon, while actors collect and process sensor data to perform appropriate action. Numerous works in WSN assumes the existence of addresses and routing infrastructure to validate their proposals. However, assigning addresses and delivering detected events remains highly challenging, specifically due to the sheer number of nodes. In this thesis, we address the problem of data accessibility in MANET, and that of addressing and routing in large scale WSN. This involves techniques such as data caching and replication to prevent the deterioration of data accessibility. The addressing system in WSN includes a distributed address allocation scheme and a routing infrastructure for both actors and sensors. Moreover, with the birth of the multimedia sensors, the traffic may be mixed with time sensitive packets and reliability-demanding packets. For that purpose, we also address the problem of providing quality of service (QoS) in the routing infrastructure for WSN

A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks

Flooding is an essential and critical service in computer networks that is used by many routing protocols to send packets from a source to all nodes in the network. As the packets are forwarded once by each receiving node, many copies of the same packet traverse the network which leads to high redundancy and unnecessary usage of the sparse capacity of the transmission medium. Gossip routing is a well-known approach to improve the flooding in wireless multi-hop networks. Each node has a forwarding probability p that is either statically per-configured or determined by information that is available at runtime, e.g, the node degree. When a packet is received, the node selects a random number r. If the number r is below p, the packet is forwarded and otherwise, in the most simple gossip routing protocol, dropped. With this approach the redundancy can be reduced while at the same time the reachability is preserved if the value of the parameter p (and others) is chosen with consideration of the network topology. This technical report gives an overview of the relevant publications in the research domain of gossip routing and gives an insight in the improvements that can be achieved. We discuss the simulation setups and results of gossip routing protocols as well as further improved flooding schemes. The three most important metrics in this application domain are elaborated: reachability, redundancy, and management overhead. The published studies used simulation environments for their research and thus the assumptions, models, and parameters of the simulations are discussed and the feasibility of an application for real world wireless networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the focus of this survey but publications about other network types and technologies are also included. As percolation theory, epidemiological models, and delay tolerant networks are often referred as foundation, inspiration, or application of gossip routing in wireless networks, a brief introduction to each research domain is included and the applicability of the particular models for the gossip routing is discussed

Coordinated Robot Navigation via Hierarchical Clustering

We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots. Traditionally an unsupervised learning method, hierarchical clustering offers a formalism for identifying and representing spatially cohesive and segregated robot groups at different resolutions by relating the continuous space of configurations to the combinatorial space of trees. We formalize and exploit this relation, developing computationally effective reactive algorithms for navigating through the combinatorial space in concert with geometric realizations for a particular choice of hierarchical clustering method. These constructions yield computationally effective vector field planners for both hierarchically invariant as well as transitional navigation in the configuration space. We apply these methods to the centralized coordination and control of $n$ perfectly sensed and actuated Euclidean spheres in a $d$-dimensional ambient space (for arbitrary $n$ and $d$). Given a desired configuration supporting a desired hierarchy, we construct a hybrid controller which is quadratic in $n$ and algebraic in $d$ and prove that its execution brings all but a measure zero set of initial configurations to the desired goal with the guarantee of no collisions along the way.Comment: 29 pages, 13 figures, 8 tables, extended version of a paper in preparation for submission to a journa