Efficient Actor Recovery Paradigm For Wireless Sensor And Actor Networks

Wireless sensor networks (WSNs) are becoming widely used worldwide. Wireless Sensor and Actor Networks (WSANs) represent a special category of WSNs wherein actors and sensors collaborate to perform specific tasks. WSANs have become one of the most preeminent emerging type of WSNs. Sensors with nodes having limited power resources are responsible for sensing and transmitting events to actor nodes. Actors are high-performance nodes equipped with rich resources that have the ability to collect, process, transmit data and perform various actions. WSANs have a unique architecture that distinguishes them from WSNs. Due to the characteristics of WSANs, numerous challenges arise. Determining the importance of factors usually depends on the application requirements. The actor nodes are the spine of WSANs that collaborate to perform the specific tasks in an unsubstantiated and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power fatigue of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. It is essential to keep inter-actor connectivity in order to insure network connectivity. Thus, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). For network recovery process from actor node failure, optimal re-localization and coordination techniques should take place. In this work, we propose an efficient actor recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balances the network performance. The packet is handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets (Either from actor or sensor). This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, we compare the performance of our proposed work with state-of the art localization algorithms. Our experimental results show superior performance in regards to network life, residual energy, reliability, sensor/ actor recovery time and data recovery

Event Classification and Intensity Discrimination for Forest Fire Inference With IoT

Simultaneously occurring random events are often reported by multiple nodes. However, the accuracy of the event detection at every node is dependent on the node’s relative position from the event, and hence, not reliable. Moreover, the factors influencing the event inference are so many, that the accuracy of such an event detection is compromised. Targeting the problem of accurate event inference in the detection of priority events, such as forest fire, a fuzzy rule-based method is proposed. Four parameters are identified for which fuzzified values are obtained by a membership function for every variable. A set of 256 rules are used to generate different permutations of the fire index with respect to the identified variables. Extensive analysis of the results proves the efficacy of the proposed scheme with a significantly reduced error rate of 2.01% for humidity and an error rate of 1.94% for temperature

Wireless Sensor Networks

The aim of this book is to present few important issues of WSNs, from the application, design and technology points of view. The book highlights power efficient design issues related to wireless sensor networks, the existing WSN applications, and discusses the research efforts being undertaken in this field which put the reader in good pace to be able to understand more advanced research and make a contribution in this field for themselves. It is believed that this book serves as a comprehensive reference for graduate and undergraduate senior students who seek to learn latest development in wireless sensor networks

A Survey and Future Directions on Clustering: From WSNs to IoT and Modern Networking Paradigms

Many Internet of Things (IoT) networks are created as an overlay over traditional ad-hoc networks such as Zigbee. Moreover, IoT networks can resemble ad-hoc networks over networks that support device-to-device (D2D) communication, e.g., D2D-enabled cellular networks and WiFi-Direct. In these ad-hoc types of IoT networks, efficient topology management is a crucial requirement, and in particular in massive scale deployments. Traditionally, clustering has been recognized as a common approach for topology management in ad-hoc networks, e.g., in Wireless Sensor Networks (WSNs). Topology management in WSNs and ad-hoc IoT networks has many design commonalities as both need to transfer data to the destination hop by hop. Thus, WSN clustering techniques can presumably be applied for topology management in ad-hoc IoT networks. This requires a comprehensive study on WSN clustering techniques and investigating their applicability to ad-hoc IoT networks. In this article, we conduct a survey of this field based on the objectives for clustering, such as reducing energy consumption and load balancing, as well as the network properties relevant for efficient clustering in IoT, such as network heterogeneity and mobility. Beyond that, we investigate the advantages and challenges of clustering when IoT is integrated with modern computing and communication technologies such as Blockchain, Fog/Edge computing, and 5G. This survey provides useful insights into research on IoT clustering, allows broader understanding of its design challenges for IoT networks, and sheds light on its future applications in modern technologies integrated with IoT.acceptedVersio

Location based services in wireless ad hoc networks

In this dissertation, we investigate location based services in wireless ad hoc networks from four different aspects - i) location privacy in wireless sensor networks (privacy), ii) end-to-end secure communication in randomly deployed wireless sensor networks (security), iii) quality versus latency trade-off in content retrieval under ad hoc node mobility (performance) and iv) location clustering based Sybil attack detection in vehicular ad hoc networks (trust). The first contribution of this dissertation is in addressing location privacy in wireless sensor networks. We propose a non-cooperative sensor localization algorithm showing how an external entity can stealthily invade into the location privacy of sensors in a network. We then design a location privacy preserving tracking algorithm for defending against such adversarial localization attacks. Next we investigate secure end-to-end communication in randomly deployed wireless sensor networks. Here, due to lack of control on sensors\u27 locations post deployment, pre-fixing pairwise keys between sensors is not feasible especially under larger scale random deployments. Towards this premise, we propose differentiated key pre-distribution for secure end-to-end secure communication, and show how it improves existing routing algorithms. Our next contribution is in addressing quality versus latency trade-off in content retrieval under ad hoc node mobility. We propose a two-tiered architecture for efficient content retrieval in such environment. Finally we investigate Sybil attack detection in vehicular ad hoc networks. A Sybil attacker can create and use multiple counterfeit identities risking trust of a vehicular ad hoc network, and then easily escape the location of the attack avoiding detection. We propose a location based clustering of nodes leveraging vehicle platoon dispersion for detection of Sybil attacks in vehicular ad hoc networks --Abstract, page iii

A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

Smart Wireless Sensor Networks

The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks

Low-Power Wireless for the Internet of Things: Standards and Applications: Internet of Things, IEEE 802.15.4, Bluetooth, Physical layer, Medium Access Control,coexistence, mesh networking, cyber-physical systems, WSN, M2M

International audienceThe proliferation of embedded systems, wireless technologies, and Internet protocols have enabled the Internet of Things (IoT) to bridge the gap between the virtual and physical world through enabling the monitoring and actuation of the physical world controlled by data processing systems. Wireless technologies, despite their offered convenience, flexibility, low cost, and mobility pose unique challenges such as fading, interference, energy, and security, which must be carefully addressed when using resource-constrained IoT devices. To this end, the efforts of the research community have led to the standardization of several wireless technologies for various types of application domains depending on factors such as reliability, latency, scalability, and energy efficiency. In this paper, we first overview these standard wireless technologies, and we specifically study the MAC and physical layer technologies proposed to address the requirements and challenges of wireless communications. Furthermore, we explain the use of these standards in various application domains, such as smart homes, smart healthcare, industrial automation, and smart cities, and discuss their suitability in satisfying the requirements of these applications. In addition to proposing guidelines to weigh the pros and cons of each standard for an application at hand, we also examine what new strategies can be exploited to overcome existing challenges and support emerging IoT applications

Engineering Self-Adaptive Collective Processes for Cyber-Physical Ecosystems

The pervasiveness of computing and networking is creating significant opportunities for building valuable socio-technical systems. However, the scale, density, heterogeneity, interdependence, and QoS constraints of many target systems pose severe operational and engineering challenges. Beyond individual smart devices, cyber-physical collectives can provide services or solve complex problems by leveraging a “system effect” while coordinating and adapting to context or environment change. Understanding and building systems exhibiting collective intelligence and autonomic capabilities represent a prominent research goal, partly covered, e.g., by the field of collective adaptive systems. Therefore, drawing inspiration from and building on the long-time research activity on coordination, multi-agent systems, autonomic/self-* systems, spatial computing, and especially on the recent aggregate computing paradigm, this thesis investigates concepts, methods, and tools for the engineering of possibly large-scale, heterogeneous ensembles of situated components that should be able to operate, adapt and self-organise in a decentralised fashion. The primary contribution of this thesis consists of four main parts. First, we define and implement an aggregate programming language (ScaFi), internal to the mainstream Scala programming language, for describing collective adaptive behaviour, based on field calculi. Second, we conceive of a “dynamic collective computation” abstraction, also called aggregate process, formalised by an extension to the field calculus, and implemented in ScaFi. Third, we characterise and provide a proof-of-concept implementation of a middleware for aggregate computing that enables the development of aggregate systems according to multiple architectural styles. Fourth, we apply and evaluate aggregate computing techniques to edge computing scenarios, and characterise a design pattern, called Self-organising Coordination Regions (SCR), that supports adjustable, decentralised decision-making and activity in dynamic environments.Con lo sviluppo di informatica e intelligenza artificiale, la diffusione pervasiva di device computazionali e la crescente interconnessione tra elementi fisici e digitali, emergono innumerevoli opportunità per la costruzione di sistemi socio-tecnici di nuova generazione. Tuttavia, l'ingegneria di tali sistemi presenta notevoli sfide, data la loro complessità—si pensi ai livelli, scale, eterogeneità, e interdipendenze coinvolti. Oltre a dispositivi smart individuali, collettivi cyber-fisici possono fornire servizi o risolvere problemi complessi con un “effetto sistema” che emerge dalla coordinazione e l'adattamento di componenti fra loro, l'ambiente e il contesto. Comprendere e costruire sistemi in grado di esibire intelligenza collettiva e capacità autonomiche è un importante problema di ricerca studiato, ad esempio, nel campo dei sistemi collettivi adattativi. Perciò, traendo ispirazione e partendo dall'attività di ricerca su coordinazione, sistemi multiagente e self-*, modelli di computazione spazio-temporali e, specialmente, sul recente paradigma di programmazione aggregata, questa tesi tratta concetti, metodi, e strumenti per l'ingegneria di ensemble di elementi situati eterogenei che devono essere in grado di lavorare, adattarsi, e auto-organizzarsi in modo decentralizzato. Il contributo di questa tesi consiste in quattro parti principali. In primo luogo, viene definito e implementato un linguaggio di programmazione aggregata (ScaFi), interno al linguaggio Scala, per descrivere comportamenti collettivi e adattativi secondo l'approccio dei campi computazionali. In secondo luogo, si propone e caratterizza l'astrazione di processo aggregato per rappresentare computazioni collettive dinamiche concorrenti, formalizzata come estensione al field calculus e implementata in ScaFi. Inoltre, si analizza e implementa un prototipo di middleware per sistemi aggregati, in grado di supportare più stili architetturali. Infine, si applicano e valutano tecniche di programmazione aggregata in scenari di edge computing, e si propone un pattern, Self-Organising Coordination Regions, per supportare, in modo decentralizzato, attività decisionali e di regolazione in ambienti dinamici

Advance in optimal design and deployment of ambient intelligence systems

[SPA]Se ha pronosticado un futuro excepcional para los sistemas de Inteligencia Ambiental (AmI). Dichos sistemas comprenden aquellos entornos capaces de anticiparse a las necesidades de la gente, y reaccionar inteligentemente en su ayuda. La inteligencia de estos sistemas proviene de los procesos de toma de decisión, cuyo funcionamiento resulta transparente al usuario. Algunos de estos entornos previstos pertenecen al ámbito de los hogares inteligentes, monitorización de la salud, educación, lugares de trabajo, deportes, soporte en actividades cotidianas, etc. La creciente complejidad de estos entornos hace cada vez más difícil la labor de tomar las decisiones correctas que sirvan de ayuda a los usuarios. Por tanto, la toma de decisiones resulta una parte esencial de estos sistemas. Diversas técnicas pueden utilizarse de forma eficaz en los sistemas AmI para resolver los problemas derivados de la toma de decisiones. Entre ellas están las técnicas de clasificación, y las herramientas matemáticas de programación. En la primera parte de este trabajo presentamos dos entornos AmI donde la toma de decisiones juega un papel fundamental: • Un sistema AmI para el entrenamiento de atletas. Este sistema monitoriza variables ambientales y biométricas de los atletas, tomando decisiones durante la sesión de entrenamiento, que al atleta le ayudan a conseguir un determinado objetivo. Varias técnicas han sido utilizadas para probar diferentes generadores de decisión: interpolación mediante (m, s)-splines, k-Nearest-Neighbors, y programación dinámica mediante Procesos de Decisión de Markov. • Un sistema AmI para detección de caza furtiva. En este caso, el objetivo consiste en localizar el origen de un disparo utilizando, para ello, una red de sensores acústicos. La localización se realiza utilizando el método de multilateración hiperbólica. Además, la calidad de las decisiones generadas está directamente relacionada con la calidad de la información disponible. Por lo tanto, es necesario que los nodos de la infraestructura AmI encargados de la obtención de datos relevantes del usuario y del ambiente, estén en red y situados correctamente. De hecho, el problema de posicionamiento tiene dos partes: los nodos deben ubicarse cerca de los lugares donde ocurren sucesos de interés, y deben estar conectados para que los datos capturados sean transmitidos y tengan utilidad. Adicionalmente, pueden considerarse otras restricciones, tales como el coste de despliegue de red. Por tanto, en el posicionamiento de los nodos es habitual que existan compromisos entre las capacidades de sensorización y de comunicación. Son posibles dos tipos de posicionamiento. Posicionamiento determinista donde puede seleccionarse de forma precisa la posición de cada nodo, y, aleatorio donde debido a la gran cantidad de nodos o a lo inaccesible del terreno de depliegue, sólo resulta posible la distribución aleatoria de los nodos. Esta tesis aborda tres problemas de posicionamiento de red. Los dos primeros problemas se han planteado de forma general, siendo de aplicación a cualquier tipo de escenario AmI. El objetivo es seleccionar las mejores posiciones para los nodos y mantener los nodos de la red conectados. Las opciones estudiadas son un posicionamiento determinista resuelto mediante el metaheurístico Ant Colony Optimization para dominios continuos, y un posicionamiento aleatorio, donde se realiza un despliegue cuasi-controlado mediante varios clusters de red. En cada clúster podemos determinar tanto el punto objetivo de despliegue, como la dispersión de los nodos alrededor de dicho punto. En este caso, el problema planteado tiene naturaleza estocástica y se resuelve descomponiéndolo en fases de despliegue, una por clúster. Finalmente, el tercer escenario de despliegue de red está estrechamente ligado al entorno AmI para la detección de caza furtiva. En este caso, utilizamos el método matemático de descenso sin derivadas. El objetivo consiste en maximizar la cobertura, minimizando a la vez el coste de despliegue. Debido a que los dos objetivos son opuestos, se utiliza un frente Pareto para que el diseñador seleccione un punto de operación. [ENG] A brilliant future is forecasted for Ambient Intelligence (AmI) systems. These comprise sensitive environments able to anticipate people’s actions, and to react intelligently supporting them. AmI relies on decision-making processes, which are usually hidden to the users, giving rise to the so-called smart environments. Some of those envisioned environments include smart homes, health monitoring, education, workspaces, sports, assisted living, and so forth. Moreover, the complexity of these environments is continuously growing, thereby increasing the difficulty of making suitable decisions in support of human activity. Therefore, decision-making is one of the critical parts of these systems. Several techniques can be efficiently combined with AmI environments and may help to alleviate decisionmaking issues. These include classification techniques, as well as mathematical programming tools. In the first part of this work we introduce two AmI environments where decisionmaking plays a primary role: • An AmI system for athletes’ training. This system is in charge of monitoring ambient variables, as well as athletes’ biometry and making decisions during a training session to meet the training goals. Several techniques have been used to test different decision engines: interpolation by means of (m, s)-splines, k-Nearest-Neighbors and dynamic programming based on Markov Decision Processes. • An AmI system for furtive hunting detection. In this case, the aim is to locate gunshots using a network of acoustic sensors. The location is performed by means of a hyperbolic multilateration method. Moreover, the quality of the decisions is directly related to the quality of the information available. Therefore, is necessary that nodes in charge of sensing and networking tasks of the AmI infrastructure must be placed correctly. In fact, the placement problem is twofold: nodes must be near important places, where valuable events occur, and network connectivity is also mandatory. In addition, some other constraints, such as network deployment cost could be considered. Therefore, there are usually tradeoffs between sensing capacity and communication capabilities. Two kinds of placement options are possible. Deterministic placements, where the position for each node can be precisely selected, and random deployments where, due to the large number of nodes, or the inaccessibility of the terrain, the only suitable option for deployment is a random scattering of the nodes. This thesis addresses three problems of network placement. The first two problems are not tied to a particular case, but are applicable to a general AmI scenario. The goal is to select the best positions for the nodes, while connectivity constraints are met. The options examined are a deterministic placement, which is solved by means of an Ant Colony Optimization metaheuristic for continuous domains, and a random placement, where partially controlled deployments of clustered networks take place. For each cluster, both the target point and dispersion can be selected, leading to a stochastic problem, which is solved by decomposing it in several steps, one per cluster. Finally, the third network placement scenario is tightly related to the furtive hunting detection AmI environment. Using a derivate-free descent methodology, the goal is to select the placement with maximal sensing coverage and minimal cost. Since both goals are contrary, the Pareto front is constructed to enable the designer to select the desired operational point.Universidad Politécnica de Cartagen