A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Energy consumption in Wireless Sensor Networks(WSN’s) is of paramount importance, which is demonstrated by the large number of algorithms, techniques, and protocols that have been developed to save energy, and thereby extend the lifetime of the network. However, in the context of WSN’s routing and dissemination, Connected Dominating Set (CDS) principle has emerged as the most popular method for energy-efficient topology control (TC) in WSN’s. In a CDS-based topology control technique, a virtual backbone is formed which allows communication between any arbitrary pair of nodes in the network. In this paper, we present a CDS based topology control protocol – A1 – which forms an energy efficient virtual backbone. In our simulations, we compare the performance of A1 with three prominent CDS-based protocols namely Energy-efficient CDS (EECDS), CDS Rule K and A3. The results demonstrate that A1 performs consistently better in terms of message overhead and other selected metrics. Moreover, the A1 protocol not only achieves better connectivity under topology maintenance but also provides better sensing coverage when compared with the other protocols

Graph-theoretic channel modeling and topology control protocols for wireless sensor networks

This report addresses two different research problems: (i) It presents a wireless channel model that reduces the complexity associated with high order Markov chains; and (ii) presents energy efficient topology control protocols which provide reliability while maintaining the topology in an energy efficient manner. For the above problems, real wireless sensor network traces were collected and extensive simulations were performed for evaluating the proposed protocols. Accurate simulation and analysis of wireless networks are inherently dependent on accurate models which are able to provide real-time channel characterization. High-order Markov chains are typically used to model errors and losses over wireless channels. However, complexity (i.e., the number of states) of a high-order Markov model increases exponentially with the memory-length of the underlying channel. In this report, a novel graph-theoretic methodology that uses Hamiltonian circuits to reduce the complexity of a high-order Markov model to a desired state budget is presented. The implication of unused states in complexity reduction of higher order Markov model is also explained. The trace-driven performance evaluations for real wireless local area network (WLAN) and wireless sensor network (WSN) channels demonstrate that the proposed Hamiltonian Model, while providing orders of magnitude reduction in complexity, renders an accuracy that is comparable to the Markov model and better than the existing reduced state models. Furthermore, a methodology to preserve energy is presented to increase the network lifetime by reducing the node degree forming an active backbone while considering network connectivity. However, in energy stringent wireless sensor networks, it is of utmost importance to construct the reduced topology with the minimal control overhead. Moreover, most wireless links in practice are lossy links with connectivity probability which desires that a routing protocol provides routing flexibility and reliability at a minimum energy consumption cost. For this purpose, distributed and semi-distributed novel graph-theoretic topology construction protocols are presented that exploit cliques and polygons in a WSN to achieve energy efficiency and reliability. The proposed protocols also facilitate load rotation under topology maintenance, thereby extending the network lifetime. In addition to the above, the report also evaluates why the backbone construction using connected dominating set (CDS) in certain cases remains unable to provide connected sensing coverage in the area covered. For this purpose, a novel protocol that reduces the topology while considering sensing area coverage is presented

Connected Dominating Set Based Topology Control in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network. Moreover, Minimum-sized Connected Dominating Set (MCDS) has become a well-known approach for constructing a Virtual Backbone (VB) to alleviate the broadcasting storm for efficient routing in WSNs extensively. However, no work considers the load-balance factor of CDSsin WSNs. In this dissertation, we first propose a new concept — the Load-Balanced CDS (LBCDS) and a new problem — the Load-Balanced Allocate Dominatee (LBAD) problem. Consequently, we propose a two-phase method to solve LBCDS and LBAD one by one and a one-phase Genetic Algorithm (GA) to solve the problems simultaneously. Secondly, since there is no performance ratio analysis in previously mentioned work, three problems are investigated and analyzed later. To be specific, the MinMax Degree Maximal Independent Set (MDMIS) problem, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-Degree non Backbone node Allocation (MVBA) problem. Approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the dissertation. On the other hand, in the current related literature, networks are deterministic where two nodes are assumed either connected or disconnected. In most real applications, however, there are many intermittently connected wireless links called lossy links, which only provide probabilistic connectivity. For WSNs with lossy links, we propose a Stochastic Network Model (SNM). Under this model, we measure the quality of CDSs using CDS reliability. In this dissertation, we construct an MCDS while its reliability is above a preset applicationspecified threshold, called Reliable MCDS (RMCDS). We propose a novel Genetic Algorithm (GA) with immigrant schemes called RMCDS-GA to solve the RMCDS problem. Finally, we apply the constructed LBCDS to a practical application under the realistic SNM model, namely data aggregation. To be specific, a new problem, Load-Balanced Data Aggregation Tree (LBDAT), is introduced finally. Our simulation results show that the proposed algorithms outperform the existing state-of-the-art approaches significantly

Critical node identification for accessing network vulnerability: a necessary consideration

Timely identification of critical nodes is crucial for assessing network vulnerability and survivability. This thesis presents two new approaches for the identification of critical nodes in a network with the first being an intuition based approach and the second being build on a mathematical framework. The first approach which is referred to as the Combined Banzhaf & Diversity Index (CBDI) uses a newly devised diversity metric, that uses the variability of a node’s attributes relative to its neighbours and the Banzhaf power index which characterizes the degree of participation of a node in forming the shortest path route. The Banzhaf power index is inspired from the theory of voting games in game theory whereas, the diversity index is inspired from the analysis and understanding of the influence of the average path length of a network on its performance. This thesis also presents a new approach for evaluating this average path length metric of a network with reduced computational complexity and proposes a new mechanism for reducing the average path length of a network for relatively larger network structures. The proposed average path length reduction mechanism is tested for a wireless sensor network and the results compared for multiple existing approaches. It has been observed using simulations that, the proposed average path length reduction mechanism outperforms existing approaches by reducing the average path length to a greater extent and with a simpler hardware requirement. The second approach proposed in this thesis for the identification of critical nodes is build on a mathematical framework and it is based on suboptimal solutions of two optimization problems, namely the algebraic connectivity minimization problem and a min-max network utility problem. The former attempts to address the topological aspect of node criticality whereas, the latter attempts to address its connection-oriented nature. The suboptimal solution of the algebraic connectivity minimization problem is obtained through spectral partitioning considerations. This approach leads to a distributed solution which is computationally less expensive than other approaches that exist in the literature and is near optimal, in the sense that it is shown through simulations to approximate a lower bound which is obtained analytically. Despite the generality of the proposed approaches, this thesis evaluates their performance on a wireless ad hoc network and demonstrates through extensive simulations that the proposed solutions are able to choose more critical nodes relative to other approaches, as it is observed that when these nodes are removed they lead to the highest degradation in network performance in terms of the achieved network throughput, the averagenet work delay, the average network jitter and the number of dropped packets

Interference Reduction in Mobile Ad Hoc and Sensor Networks

There are still a lot of open questions in the field of MANETs and sensor networks. If a topology incurs a large interference, either many communication signals sent by nodes will collide, or the network may experience a serious delay at delivering the data for some nodes, and even consume more energy. So, we reach to the conclusion that interference imposes a potential negative impact on the performance of wireless networks. In the last few years, researchers actively explored topology control approaches for such networks. The motivation of topology control (TC) is to maintain the connectivity of the network, reduce the node degree and thereby reduce the interference, and reduce power consumption in the sensor nodes. Some literatures have pointed out that a node can interfere with another node even if it is beyond its communication range. To improve the network performance, designing topology control algorithms with consideration of interference is imminent and necessary. Since, it leads to fewer collisions and packet retransmissions, which indirectly reduces the power consumption and extends the lifetime of the network. In this thesis, we propose a new interference-aware connected dominating set-based topology construction algorithm, namely, IACDS algorithm, a simple, distributed, interference-aware and energy-efficient topology construction mechanism that finds a sub-optimal Connected Dominating Set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage with minimum interference. IACDS algorithm utilizes a weighted (distance-energy-interference)-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the topology (energy and interference)

Virtual backbone formation in wireless ad hoc networks

We study the problem of virtual backbone formation in wireless ad hoc networks. A virtual backbone provides a hierarchical infrastructure that can be used to address important challenges in ad hoc networking such as efficient routing, multicasting/broadcasting, activity-scheduling, and energy efficiency. Given a wireless ad hoc network with symmetric links represented by a unit disk graph G = (V, E ), one way to construct this backbone is by finding a Connected Dominating Set (CDS) in G , which is a subset V' ✹ V such that for every node u, u is either in V' or has a neighbor in V' and the subgraph induced by V' is connected. In a wireless ad hoc network with asymmetric links represented by a directed graph G = (V, E ), finding such a backbone translates to constructing a Strongly Connected Dominating and Absorbent Set (SCDAS) in G . An SCDAS is a subset of nodes V' ✹ V such that every node u is either in V' or has an outgoing and an incoming neighbor in V' , and the subgraph induced by V' is strongly connected. Based on most of its applications, minimizing the size of the virtual backbone is an important objective. Therefore, we are interested in constructing CDSs and SCDASs of minimal size. We give efficient distributed algorithms with linear time and message complexities for the construction of the CDS in ad hoc networks with symmetric links. Since topology changes are quite frequent in most ad hoc networks, we propose schemes to locally maintain the CDS in the face of such changes. We also give a distributed algorithm for the construction of the SCDAS in ad hoc networks with asymmetric links. Extensive simulations show that our algorithms outperform all previously known algorithms in terms of the size of the constructed sets

Remote aerial data acquisition and capture project (RADAC)

The RADAC Project encompasses the design and prototype implementation of a system for low-cost aerial data sensor acquisition. It includes a Ground Transponder Unit (GTU), and Aerial Interrogation System (AIS) mounted under an aircraft. The GTU captures and transmits water-meter readings; the AIS initiates’ measurements and processes and displays the results. The proposed system is based on RF devices in association with a small low-cost single chip camera and microcontrollers. During a consultancy to a large Queensland government authority which has approximately 8000 water meters in regional and remote parts of the state. It was realised that considerable savings could be made in the management of water resources and human resources needed to read these at three month intervals. This project will calculate the RF subsystem performance in terms of gain, beamwidth, return loss, bandwidth, and matching of the antenna into the RF transceiver device Design Executive Data Acquisition System and Design and implement Interrogation Microcontrollerand Design PCB for RF Transceiver and Design and calculate power usage and Power Supply design and calculate High-Gain Helical Antenna. The solution based on using RF devices based on IEEE802.15.4 (IEEE 2006) in association with a small low cost single chip camera andmicrocontroller. Figure 1 shows the Block Diagram of the Ground Transponder Unit and symbolic AIS. The potential saving in maintenance costs to industry by remotely taking measurements is significant enough to warrant furtherinvestigation with industry. There is the potential for its adaption in other resource sector

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

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Recent Advances on Nanocomposite Resists With Design Functionality for Lithographic Microfabrication

Nanocomposites formed by a phase-dispersed nanomaterial and a polymeric host matrix are highly attractive for nano- and micro-fabrication. The combination of nanoscale and bulk materials aims at achieving an effective interplay between extensive and intensive physical properties. Nanofillers display size-dependent effects, paving the way for the design of tunable functional composites. The matrix, on the other hand, can facilitate or even enhance the applicability of nanomaterials by allowing their easy processing for device manufacturing. In this article, we review the field of polymer-based nanocomposites acting as resist materials, i.e. being patternable through radiation-based lithographic methods. A comprehensive explanation of the synthesis of nanofillers, their functionalization and the physicochemical concepts behind the formulation of nanocomposites resists will be given. We will consider nanocomposites containing different types of fillers, such as metallic, magnetic, ceramic, luminescent and carbon-based nanomaterials. We will outline the role of nanofillers in modifying various properties of the polymer matrix, such as the mechanical strength, the refractive index and their performance during lithography. Also, we will discuss the lithographic techniques employed for transferring 2D patterns and 3D shapes with high spatial resolution. The capabilities of nanocomposites to act as structural and functional materials in novel devices and selected applications in photonics, electronics, magnetism and bioscience will be presented. Finally, we will conclude with a discussion of the current trends in this field and perspectives for its development in the near future.Fil: Martínez, Eduardo David. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Prado, A.. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Gonzalez, M.. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Anguiano, S.. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Tosi, Leandro. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Salazar Alarcón, Leonardo. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; ArgentinaFil: Pastoriza, Hernan. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Oficina de Coordinacion Administrativa Ciudad Universitaria. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche | Comision Nacional de Energia Atomica. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia. Unidad Ejecutora Instituto de Nanociencia y Nanotecnologia - Nodo Bariloche.; Argentin