Performance assessment of real-time data management on wireless sensor networks

Technological advances in recent years have allowed the maturity of Wireless Sensor Networks (WSNs), which aim at performing environmental monitoring and data collection. This sort of network is composed of hundreds, thousands or probably even millions of tiny smart computers known as wireless sensor nodes, which may be battery powered, equipped with sensors, a radio transceiver, a Central Processing Unit (CPU) and some memory. However due to the small size and the requirements of low-cost nodes, these sensor node resources such as processing power, storage and especially energy are very limited. Once the sensors perform their measurements from the environment, the problem of data storing and querying arises. In fact, the sensors have restricted storage capacity and the on-going interaction between sensors and environment results huge amounts of data. Techniques for data storage and query in WSN can be based on either external storage or local storage. The external storage, called warehousing approach, is a centralized system on which the data gathered by the sensors are periodically sent to a central database server where user queries are processed. The local storage, in the other hand called distributed approach, exploits the capabilities of sensors calculation and the sensors act as local databases. The data is stored in a central database server and in the devices themselves, enabling one to query both. The WSNs are used in a wide variety of applications, which may perform certain operations on collected sensor data. However, for certain applications, such as real-time applications, the sensor data must closely reflect the current state of the targeted environment. However, the environment changes constantly and the data is collected in discreet moments of time. As such, the collected data has a temporal validity, and as time advances, it becomes less accurate, until it does not reflect the state of the environment any longer. Thus, these applications must query and analyze the data in a bounded time in order to make decisions and to react efficiently, such as industrial automation, aviation, sensors network, and so on. In this context, the design of efficient real-time data management solutions is necessary to deal with both time constraints and energy consumption. This thesis studies the real-time data management techniques for WSNs. It particularly it focuses on the study of the challenges in handling real-time data storage and query for WSNs and on the efficient real-time data management solutions for WSNs. First, the main specifications of real-time data management are identified and the available real-time data management solutions for WSNs in the literature are presented. Secondly, in order to provide an energy-efficient real-time data management solution, the techniques used to manage data and queries in WSNs based on the distributed paradigm are deeply studied. In fact, many research works argue that the distributed approach is the most energy-efficient way of managing data and queries in WSNs, instead of performing the warehousing. In addition, this approach can provide quasi real-time query processing because the most current data will be retrieved from the network. Thirdly, based on these two studies and considering the complexity of developing, testing, and debugging this kind of complex system, a model for a simulation framework of the real-time databases management on WSN that uses a distributed approach and its implementation are proposed. This will help to explore various solutions of real-time database techniques on WSNs before deployment for economizing money and time. Moreover, one may improve the proposed model by adding the simulation of protocols or place part of this simulator on another available simulator. For validating the model, a case study considering real-time constraints as well as energy constraints is discussed. Fourth, a new architecture that combines statistical modeling techniques with the distributed approach and a query processing algorithm to optimize the real-time user query processing are proposed. This combination allows performing a query processing algorithm based on admission control that uses the error tolerance and the probabilistic confidence interval as admission parameters. The experiments based on real world data sets as well as synthetic data sets demonstrate that the proposed solution optimizes the real-time query processing to save more energy while meeting low latency.Fundação para a Ciência e Tecnologi

Trust-based energy efficient routing protocol for wireless sensor networks

Wireless Sensor Networks (WSNs) consist of a number of distributed sensor nodes that are connected within a specified area. Generally, WSN is used for monitoring purposes and can be applied in many fields including health, environmental and habitat monitoring, weather forecasting, home automation, and in the military. Similar, to traditional wired networks, WSNs require security measures to ensure a trustworthy environment for communication. However, due to deployment scenarios nodes are exposed to physical capture and inclusion of malicious node led to internal network attacks hence providing the reliable delivery of data and trustworthy communication environment is a real challenge. Also, malicious nodes intentionally dropping data packets, spreading false reporting, and degrading the network performance. Trust based security solutions are regarded as a significant measure to improve the sensor network security, integrity, and identification of malicious nodes. Another extremely important issue for WSNs is energy conversation and efficiency, as energy sources and battery capacity are often limited, meaning that the implementation of efficient, reliable data delivery is an equally important consideration that is made more challenging due to the unpredictable behaviour of sensor nodes. Thus, this research aims to develop a trust and energy efficient routing protocol that ensures a trustworthy environment for communication and reliable delivery of data. Firstly, a Belief based Trust Evaluation Scheme (BTES) is proposed that identifies malicious nodes and maintains a trustworthy environment among sensor nodes while reducing the impact of false reporting. Secondly, a State based Energy Calculation Scheme (SECS) is proposed which periodically evaluates node energy levels, leading to increased network lifetime. Finally, as an integrated outcome of these two schemes, a Trust and Energy Efficient Path Selection (TEEPS) protocol has been proposed. The proposed protocol is benchmarked with A Trust-based Neighbour selection system using activation function (AF-TNS), and with A Novel Trust of dynamic optimization (Trust-Doe). The experimental results show that the proposed protocol performs better as compared to existing schemes in terms of throughput (by 40.14%), packet delivery ratio (by 28.91%), and end-to-end delay (by 41.86%). In conclusion, the proposed routing protocol able to identify malicious nodes provides a trustworthy environment and improves network energy efficiency and lifetime

Tuft: Tree Based Heuristic Data Dissemination for Mobile Sink Wireless Sensor Networks

Wireless sensor networks (WSNs) with a static sink suffer from concentrated data traffic in the vicinity of the sink, which increases the burden on the nodes surrounding the sink, and impels them to deplete their batteries faster than other nodes in the network. Mobile sinks solve this corollary by providing a more balanced traffic dispersion, by shifting the traffic concentration with the mobility of the sink. However, it brings about a new expenditure to the network, where prior to delivering data, nodes are obligated to procure the sink’s current position. This paper proposes Tuft, a novel hierarchical tree structure that is able to avert the overhead cost from delivering the fresh sink’s position while maintaining a uniform dispersion of data traffic concentration. Tuft appropriates the mobility of the sink to its advantage, to increase the uniformity of energy consumption throughout the network. Moreover, we propose Tuft-Cells, a distributed dissemination protocol that models data routing as a Multi-Criteria Decision Making (MCDM) in three steps. To begin with, each criterion constitutes a random variable defined by a mass function. Each of these cirterion serves a proportionately distinguishable alternative, and hence, may conflict. Therefore, the Analytic Hierarchy Process (AHP) quantifies the relationship between criteria. Finally, the final forwarding decision is derived by a weighted aggregation. Tuft is compared with state-of-the-art protocols, and the performance evaluation illustrates that our protocol adheres to the requirements of WSNs, in terms of energy consumption, and success ratio, considering the additional overhead cost brought by the mobility of the sink

Swarm intelligence techniques for optimization and management tasks insensor networks

The main contributions of this thesis are located in the domain of wireless sensor netorks. More in detail, we introduce energyaware algorithms and protocols in the context of the following topics: self-synchronized duty-cycling in networks with energy harvesting capabilities, distributed graph coloring and minimum energy broadcasting with realistic antennas. In the following, we review the research conducted in each case. We propose a self-synchronized duty-cycling mechanism for sensor networks. This mechanism is based on the working and resting phases of natural ant colonies, which show self-synchronized activity phases. The main goal of duty-cycling methods is to save energy by efficiently alternating between different states. In the case at hand, we considered two different states: the sleep state, where communications are not possible and energy consumption is low; and the active state, where communication result in a higher energy consumption. In order to test the model, we conducted an extensive experimentation with synchronous simulations on mobile networks and static networks, and also considering asynchronous networks. Later, we extended this work by assuming a broader point of view and including a comprehensive study of the parameters. In addition, thanks to a collaboration with the Technical University of Braunschweig, we were able to test our algorithm in the real sensor network simulator Shawn (http://shawn.sf.net). The second part of this thesis is devoted to the desynchronization of wireless sensor nodes and its application to the distributed graph coloring problem. In particular, our research is inspired by the calling behavior of Japanese tree frogs, whose males use their calls to attract females. Interestingly, as female frogs are only able to correctly localize the male frogs when their calls are not too close in time, groups of males that are located nearby each other desynchronize their calls. Based on a model of this behavior from the literature, we propose a novel algorithm with applications to the field of sensor networks. More in detail, we analyzed the ability of the algorithm to desynchronize neighboring nodes. Furthermore, we considered extensions of the original model, hereby improving its desynchronization capabilities.To illustrate the potential benefits of desynchronized networks, we then focused on distributed graph coloring. Later, we analyzed the algorithm more extensively and show its performance on a larger set of benchmark instances. The classical minimum energy broadcast (MEB) problem in wireless ad hoc networks, which is well-studied in the scientific literature, considers an antenna model that allows the adjustment of the transmission power to any desired real value from zero up to the maximum transmission power level. However, when specifically considering sensor networks, a look at the currently available hardware shows that this antenna model is not very realistic. In this work we re-formulate the MEB problem for an antenna model that is realistic for sensor networks. In this antenna model transmission power levels are chosen from a finite set of possible ones. A further contribution concerns the adaptation of an ant colony optimization algorithm --currently being the state of the art for the classical MEB problem-- to the more realistic problem version, the so-called minimum energy broadcast problem with realistic antennas (MEBRA). The obtained results show that the advantage of ant colony optimization over classical heuristics even grows when the number of possible transmission power levels decreases. Finally we build a distributed version of the algorithm, which also compares quite favorably against centralized heuristics from the literature.Las principles contribuciones de esta tesis se encuentran en el domino de las redes de sensores inalámbricas. Más en detalle, introducimos algoritmos y protocolos que intentan minimizar el consumo energético para los siguientes problemas: gestión autosincronizada de encendido y apagado de sensores con capacidad para obtener energía del ambiente, coloreado de grafos distribuido y broadcasting de consumo mínimo en entornos con antenas reales. En primer lugar, proponemos un sistema capaz de autosincronizar los ciclos de encendido y apagado de los nodos de una red de sensores. El mecanismo está basado en las fases de trabajo y reposo de las colonias de hormigas tal y como estas pueden observarse en la naturaleza, es decir, con fases de actividad autosincronizadas. El principal objectivo de este tipo de técnicas es ahorrar energía gracias a alternar estados de forma eficiente. En este caso en concreto, consideramos dos estados diferentes: el estado dormido, en el que los nodos no pueden comunicarse y el consumo energético es bajo; y el estado activo, en el que las comunicaciones propician un consumo energético elevado. Con el objetivo de probar el modelo, se ha llevado a cabo una extensa experimentación que incluye tanto simulaciones síncronas en redes móviles y estáticas, como simulaciones en redes asíncronas. Además, este trabajo se extendió asumiendo un punto de vista más amplio e incluyendo un detallado estudio de los parámetros del algoritmo. Finalmente, gracias a la colaboración con la Technical University of Braunschweig, tuvimos la oportunidad de probar el mecanismo en el simulador realista de redes de sensores, Shawn (http://shawn.sf.net). La segunda parte de esta tesis está dedicada a la desincronización de nodos en redes de sensores y a su aplicación al problema del coloreado de grafos de forma distribuida. En particular, nuestra investigación está inspirada por el canto de las ranas de árbol japonesas, cuyos machos utilizan su canto para atraer a las hembras. Resulta interesante que debido a que las hembras solo son capaces de localizar las ranas macho cuando sus cantos no están demasiado cerca en el tiempo, los grupos de machos que se hallan en una misma región desincronizan sus cantos. Basado en un modelo de este comportamiento que se encuentra en la literatura, proponemos un nuevo algoritmo con aplicaciones al campo de las redes de sensores. Más en detalle, analizamos la habilidad del algoritmo para desincronizar nodos vecinos. Además, consideramos extensiones del modelo original, mejorando su capacidad de desincronización. Para ilustrar los potenciales beneficios de las redes desincronizadas, nos centramos en el problema del coloreado de grafos distribuido que tiene relación con diferentes tareas habituales en redes de sensores. El clásico problema del broadcasting de consumo mínimo en redes ad hoc ha sido bien estudiado en la literatura. El problema considera un modelo de antena que permite transmitir a cualquier potencia elegida (hasta un máximo establecido por el dispositivo). Sin embargo, cuando se trabaja de forma específica con redes de sensores, un vistazo al hardware actualmente disponible muestra que este modelo de antena no es demasiado realista. En este trabajo reformulamos el problema para el modelo de antena más habitual en redes de sensores. En este modelo, los niveles de potencia de transmisión se eligen de un conjunto finito de posibilidades. La siguiente contribución consiste en en la adaptación de un algoritmo de optimización por colonias de hormigas a la versión más realista del problema, también conocida como broadcasting de consumo mínimo con antenas realistas. Los resultados obtenidos muestran que la ventaja de este método sobre heurísticas clásicas incluso crece cuando el número de posibles potencias de transmisión decrece. Además, se ha presentado una versión distribuida del algoritmo, que también se compara de forma bastante favorable contra las heurísticas centralizadas conocidas

Privacy-preserving energy management techniques and delay-sensitive transmission strategies for smart grids

The smart grid (SG) is the enhancement of the traditional electricity grid that allows bidirectional flow of electricity and information through the integration of advanced monitoring, communication and control technologies. In this thesis, we focus on important design problems affecting particularly two critical enabling components of the SG infrastructure : smart meters (SMs) and wireless sensor networks (WSNs). SMs measure the energy consumption of the users and transmit their readings to the utility provider in almost real-time. SM readings enable real-time optimization of load management. However, possible misuse of SM readings raises serious privacy concerns for the users. The challenge is thus to design techniques that can increase the privacy of the users while maintaining the monitoring capabilities SMs provide. Demand-side energy management (EM), achieved thanks to the utilization of storage units and alternative energy sources, has emerged as a potential technique to tackle this challenge. WSNs consist of a large number of low power sensors, which monitor physical parameters and transmit their measurements to control centers (CCs) over wireless links. CCs utilize these measurements to reconstruct the system state. For the reliable management of the SG, near real-time and accurate reconstruction of the system state at the CC is crucial. Thus, low complexity delay-constrained transmission strategies, which enable sensors to accurately transmit their measurements to CCs, should be investigated rigorously. To address these challenges, this dissertation investigates and designs privacy-preserving EM techniques for SMs and delay-constrained transmission strategies for WSNs. The proposed EM techniques provide privacy to SM users while maintaining the operational benefits SMs provide. On the other hand, the proposed transmission strategies enable WSNs to meet low latency transmission requirements, which in turn, facilitate real-time and accurate state reconstruction; and hence, the efficient and robust management of the SG. First, we consider an SM system with energy harvesting and storage units. Representing the system with a discrete-time finite state model, we study stochastic EM policies from a privacy-energy efficiency trade-off perspective, where privacy is measured by information leakage rate and energy efficiency is measured by wasted energy rate. We propose EM policies that take stochastic output load decisions based on the harvested energy, the input load and the state of the battery. For the proposed policies, we characterize the fundamental trade-off between user's privacy and energy efficiency. Second, we consider an SM system with a storage unit. Considering a discrete-time power consumption and pricing model, we study EM policies from a privacy-cost trade-off perspective, where privacy is measured by the load variance as well as mutual information. Assuming non-causal knowledge of the power demand profile and prices, we characterize the optimal EM policy based on the solution of an optimization problem. Then, assuming that the power demand profile is known only causally, we obtain the optimal EM policy based on dynamic programming, and also propose a low complexity heuristic policy. For the proposed policies, we characterize the trade-off between user's privacy and energy cost. Finally, we study the delay-constrained linear transmission (LT) of composite Gaussian measurements from a sensor to a CC over a point-to-point fading channel. Assuming that the channel state information (CSI) is known by both the encoder and decoder, we propose the optimal LT strategy in terms of the average mean-square error (MSE) distortion under a strict delay constraint, and two LT strategies under general delay constraints. Assuming that the CSI is known only by the decoder, we propose the optimal LT strategy in terms of the average MSE distortion under a strict delay constraint.La red de energía inteligente (SG) es la mejora de la red eléctrica tradicional. En esta tesis, nos enfocamos en las problemáticas asociadas al diseño de dos de los componentes más críticos de la infraestructura de la SG : los medidores inteligentes (SMs) y las redes de sensores inalámbricos (WSNs). Los SMs miden el consumo de energía de los usuarios y transmiten sus medidas al proveedor de servicio casi en tiempo real. Las medidas de SM permiten la optimización en tiempo real de la gestión de carga en la red. Sin embargo, el posible mal uso de estas medidas plantea preocupaciones graves en cuanto a la privacidad de los usuarios. El desafío es, por lo tanto, diseñar técnicas que puedan aumentar la privacidad de los usuarios manteniendo las capacidades de supervisión que proveen los SMs. Una solución tecnológica es el diseño de sistemas de gestión de energía (EM) inteligentes compuestos por dispositivos de almacenamiento y generación alternativa de energía. Las WSNs se componen de un gran número de sensores, que miden parámetros físicos y transmiten sus mediciones a los centros de control (CCs) mediante enlaces inalámbricos. Los CCs utilizan estas mediciones para estimar el estado del sistema. Para una gestión fiable de la SG, una buena reconstrucción del estado del sistema en tiempo real es crucial. Por ello, es preciso investigar estrategias de transmisión con estrictos requisitos de complejidad y limitaciones de latencia. Para afrontar estos desafíos, esta tesis investiga y diseña técnicas de EM para preservar la privacidad de los usuarios de SM y estrategias de transmisión para WSNs con limitaciones de latencia. Las técnicas de EM propuestas proporcionan privacidad a los consumidores de energía manteniendo los beneficios operacionales para la SG. Las estrategias de transmisión propuestas permiten a las WSNs satisfacer los requisitos de baja latencia necesarios para la reconstrucción precisa del estado en tiempo real; y por lo tanto, la gestión eficiente y robusta de la SG. En primer lugar, consideramos el diseño de un sistema de SM con una unidad de almacenamiento y generación de energía renovable. Representando el sistema con un modelo de estados finitos y de tiempo discreto, proponemos políticas estocásticas de EM. Para las políticas propuestas, caracterizamos la relación fundamental existente entre la privacidad y la eficiencia de energía del usuario, donde la privacidad se mide mediante la tasa de fuga de información y la eficiencia de energía se mide mediante la tasa de energía perdida. En segundo lugar, consideramos el diseño de un sistema de SM con una unidad de almacenamiento. Considerando un modelo de tiempo discreto, estudiamos la relación existente entre la privacidad y el coste de la energía, donde la privacidad se mide por la variación de la carga, así como la información mutua. Suponiendo que el perfil de la demanda de energía y los precios son conocidos de antemano, caracterizamos la política de EM óptima. Suponiendo que la demanda de energía es conocida sólo para el tiempo actual, obtenemos la política de EM óptima mediante programación dinámica, y proponemos una política heurística de baja complejidad. Para las políticas propuestas, caracterizamos la relación existente entre la privacidad y el coste de energía del usuario. Finalmente, consideramos el diseño de estrategias de transmisión lineal (LT) de mediciones Gaussianas compuestas desde un sensor a un CC sobre un canal punto a punto con desvanecimientos. Suponiendo que la información del estado del canal (CSI) es conocida tanto por el trasmisor como por el receptor, proponemos la estrategia de LT óptima en términos de la distorsión de error cuadrático medio (MSE) bajo una restricción de latencia estricta y dos estrategias de LT para restricciones de latencia arbitrarias. Suponiendo que la CSI es conocida sólo en el receptor, proponemos la estrategia de LT óptima en términos de la distorsión de MSE bajo una restricción de latencia estricta.La xarxa d'energia intel·ligent (SG) és la millora de la xarxa elèctrica tradicional. En aquesta tesi, ens enfoquem en les problemàtiques associades al disseny de dos dels components més crítics de la infraestructura de la SG : els mesuradors de consum intel·ligents(SMs) i les xarxes de sensors sense fils (WSNs).Els SMs mesuren el consum d'energia dels usuaris i transmeten les seves mesures al proveïdor de servei gairebé en temps real. Les mesures de SM permeten l'optimització en temps real de la gestió de càrrega a la xarxa. No obstant això, el possible mal ús d'aquestes mesures planteja preocupacions greus en quant a la privacitat dels usuaris. El desafiament és, per tant, dissenyar tècniques que puguin augmentar la privadesa dels usuaris mantenint les capacitats de supervisió que proveeixen els SMs. Una solució tecnològica és el disseny de sistemes de gestió d'energia (EM) intel·ligents compostos per dispositius d'emmagatzematge i generació alternativa d'energia.Les WSNs es componen d'un gran nombre de sensors, que mesuren paràmetres físics i transmeten les seves mesures als centres de control (CCs) mitjançant enllaços sense fils. Els CCs utilitzen aquestes mesures per estimar l'estat del sistema. Per a una gestió fiable de la SG, una bona reconstrucció de l'estat del sistema en temps real és crucial. Per això, cal investigar estratègies de transmissió amb estrictes requisits de complexitat i limitacions de latència. Per d'afrontar aquests desafiaments, aquesta tesi investiga i dissenya tècniques d'EM per preservar la privacitat dels usuaris de SM i estratègies de transmissió per WSNs amb limitacions de latència. Les tècniques d'EM propostes proporcionen privacitats als consumidors d'energia mantenint els beneficis operacionals per la SG. Les estratègies de transmissió proposades permeten a les WSNs satisfer els requisits de baixa latència necessaris per a la reconstrucció precisa de l'estat en temps real; i per tant, la gestió eficient i robusta de la SG.En primer lloc, considerem el disseny d'un sistema de SM amb una unitat d'emmagatzematge i generació d'energia renovable. Representant el sistema amb un model d'estats finits i de temps discret, proposem polítiques estocàstiques d'EM. Per a les polítiques propostes, caracteritzem la relació fonamental existent entre la privadesa i l'eficiència d'energia de l'usuari, on la privacitat es mesura mitjançant la taxa de fugida d'informació i l'eficiència d'energia es mesura mitjançant la taxa d'energia perduda.En segon lloc, considerem el disseny d'un sistema de SM amb una unitat d'emmagatzematge. Considerant un model de temps discret, estudiem la relació existent entre la privacitat el cost de l'energia, on la privacitat es mesura per la variació de la càrrega, així com mitjançant la informació mútua. Suposant que la corba de la demanda d'energia i els preus són coneguts per endavant, caracteritzem la política d'EM òptima. Suposant que la demanda d'energia és coneguda només per al temps actual, obtenim la política d'EM òptima mitjançant programació dinàmica, i proposem una política heurística de baixa complexitat. Per a les polítiques propostes, caracteritzem la relació existent entre la privacitat i el cost d'energia de l'usuari.Finalment, considerem el disseny d'estratègies de transmissió lineal (LT) de mesures Gaussianes compostes des d'un sensor a un CC sobre un canal punt a punt amb esvaïments. Suposant que la informació de l'estat del canal (CSI) és coneguda tant pel transmissor com pel receptor, proposem l'estratègia de LT òptima en termes de la distorsió d'error quadràtic mitjà (MSE) sota una restricció de latència estricta. A més, proposem dues estratègies de LT per a restriccions de latència arbitràries. Finalment, suposant que la CSI és coneguda només en el receptor, proposem l'estratègia de LT òptima en termes de la distorsió de MSE sota una restricció de latència estricta

Energy Efficiency inWireless Sensor Networks: Transmission Protocols and Performance Evaluation

Doktorgradsavhandling, Fakultet for teknologi og realfag, Universitetet i Agder, 2016Energy efficiency is one of the major goals for achieving green wireless communications. The recent growth in ubiquitous wireless connections and multimedia applications demands higher energy efficiency for wireless communications. As a part of this picture, wireless sensor networks (WSNs) need to be more energy efficient since the battery capacity of nodes in such networks is limited in the absence of energy harvesting sources. In general, an energy efficient protocol should perform as few as possible operations when delivering user information successfully across the network. Energy efficient data transmission schemes could utilize network resources more effectively to lower down the energy consumption level. In this dissertation research, we focus on improving energy efficiency for data transmission and medium access control (MAC) protocols in WSNs. While energy consumption is inevitable for transmitting and receiving data in a WSN, the other typical and dominant energy consumption activities are idle listening, overhearing, and retransmissions due to unsuccessful transmission attempts. An energy efficient MAC protocol conserves energy by minimizing all these auxiliary operations in order to prolong network lifetime. On the other hand, balanced energy consumption among nodes which mitigates energy hole across a WSN also helps to extend network lifetime. In this context, we propose two cooperative transmission (CT) based energy balancingMAC protocols for the purpose of WSN lifetime prolongation. The first one is an asynchronous cooperative transmission MAC protocol, in which nodes generate their own wakeup schedules based on their level number in a WSN topology. The second one is a receiver initiated cooperative transmission MAC protocol in which the CT is initiated by a relay node. It is demonstrated that both proposed CT MAC protocols are able to achieve significantly extended network lifetime. In addition, an energy conserving sleeping mechanism for synchronous duty cycling MAC protocols is also proposed in this thesis. It is an eventtriggered sleeping (ETS) mechanism, which triggers the sleep mode of a node based on the incoming traffic pattern to that node. The ETS mechanism eliminates overhearing in a WSN and achieves higher energy efficiency. Furthermore, we apply packet aggregation at the MAC layer in WSNs for achieving more energy efficient data transmission. In aggregated packet transmission (APT), multiple packets are transmitted as a batch in a frame within a single duty cycle instead of transmitting merely one packet per cycle. Numerical results demonstrate that APT achieves higher throughput and shorter delay, in addition to higher energy efficiency. To evaluate the performance of the proposed MAC protocols and transmission schemes, we develop discrete time Markov chain (DTMC) models and verify them by comparing the results obtained from both analysis and discrete-event based simulations. The analytical and simulation results match precisely with each other, confirming the effectiveness of the proposed protocols and schemes as well as the accuracy of the developed models

Intrusion detection in IPv6-enabled sensor networks.

In this research, we study efficient and lightweight Intrusion Detection Systems (IDS) for ad-hoc networks through the lens of IPv6-enabled Wireless Sensor Actuator Networks. These networks consist of highly constrained devices able to communicate wirelessly in an ad-hoc fashion, thus following the architecture of ad-hoc networks. Current state of the art IDS in IoT and WSNs have been developed considering the architecture of conventional computer networks, and as such they do not efficiently address the paradigm of ad-hoc networks, which is highly relevant in emerging network paradigms, such as the Internet of Things (IoT). In this context, the network properties of resilience and redundancy have not been extensively studied. In this thesis, we first identify a trade-off between the communication and energy overheads of an IDS (as captured by the number of active IDS agents in the network) and the performance of the system in terms of successfully identifying attacks. In order to fine-tune this trade-off, we model networks as Random Geometric Graphs; these are a rigorous approach that allows us to capture underlying structural properties of the network. We then introduce a novel IDS architectural approach that consists of a central IDS agent and set of distributed IDS agents deployed uniformly at random over the network area. These nodes are able to efficiently detect attacks at the networking layer in a collaborative manner by monitoring locally available network information provided by IoT routing protocols, such as RPL. The detailed experimental evaluation conducted in this research demonstrates significant performance gains in terms of communication overhead and energy dissipation while maintaining high detection rates. We also show that the performance of our IDS in ad-hoc networks does not rely on the size of the network but on fundamental underling network properties, such as the network topology and the average degree of the nodes. The experiments show that our proposed IDS architecture is resilient against frequent topology changes due to node failures