Wireless industrial monitoring and control networks: the journey so far and the road ahead

While traditional wired communication technologies have played a crucial role in industrial monitoring and control networks over the past few decades, they are increasingly proving to be inadequate to meet the highly dynamic and stringent demands of today’s industrial applications, primarily due to the very rigid nature of wired infrastructures. Wireless technology, however, through its increased pervasiveness, has the potential to revolutionize the industry, not only by mitigating the problems faced by wired solutions, but also by introducing a completely new class of applications. While present day wireless technologies made some preliminary inroads in the monitoring domain, they still have severe limitations especially when real-time, reliable distributed control operations are concerned. This article provides the reader with an overview of existing wireless technologies commonly used in the monitoring and control industry. It highlights the pros and cons of each technology and assesses the degree to which each technology is able to meet the stringent demands of industrial monitoring and control networks. Additionally, it summarizes mechanisms proposed by academia, especially serving critical applications by addressing the real-time and reliability requirements of industrial process automation. The article also describes certain key research problems from the physical layer communication for sensor networks and the wireless networking perspective that have yet to be addressed to allow the successful use of wireless technologies in industrial monitoring and control networks

Fast Neighbor Discovery for Wireless Ad Hoc Network with Successive Interference Cancellation

Neighbor discovery (ND) is a key step in wireless ad hoc network, which directly affects the efficiency of wireless networking. Improving the speed of ND has always been the goal of ND algorithms. The classical ND algorithms lose packets due to the collision of multiple packets, which greatly affects the speed of the ND algorithms. Traditional methods detect packet collision and implement retransmission when encountering packet loss. However, they does not solve the packet collision problem and the performance improvement of ND algorithms is limited. In this paper, the successive interference cancellation (SIC) technology is introduced into the ND algorithms to unpack multiple collision packets by distinguishing multiple packets in the power domain. Besides, the multi-packet reception (MPR) is further applied to reduce the probability of packet collision by distinguishing multiple received packets, thus further improving the speed of ND algorithms. Six ND algorithms, namely completely random algorithm (CRA), CRA based on SIC (CRA-SIC), CRA based on SIC and MPR (CRA-SIC-MPR), scan-based algorithm (SBA), SBA based on SIC (SBA-SIC), and SBA based on SIC and MPR (SBA-SIC-MPR), are theoretically analyzed and verified by simulation. The simulation results show that SIC and MPR reduce the ND time of SBA by 69.02% and CRA by 66.03% averagely.Comment: 16 pages, 16 figure

Information collection algorithm for vehicular ad-hoc networks (application domain: Urban Traffic Wireless Vehicular Ad-Hoc Networks (VANETs))

Vehicle to vehicle communication (V2VC) is one of the modern approaches for exchanging and generating traffic information with (yet to be realized) potential to improve road safety, driving comfort and traffic control. In this research, we present a novel algorithm which is based on V2V communication, uses in-vehicle sensor information and in collaboration with the other vehicles' sensor information can detect road conditions and determine the geographical area where this road condition exists – e.g. geographical area where there is traffic density, unusual traffic behaviour, a range of weather conditions (raining), etc. The algorithms' built-in automatic geographical restriction of the data collection, aggregation and dissemination mechanisms allows warning messages to be received by any car, not necessarily sharing the identified road condition, which may then be used to identify the optimum route taken by the vehicle e.g. avoid bottlenecks or dangerous areas including accidents or congestions on their current routes. This research covers the middle ground between MANET [1] and collaborative data generation based on knowledge granularity (aggregation). It investigates the possibility of designing, implementing and modelling of the functionality of an algorithm (as part of the design of an intelligent node in an Intelligent Transportation System - ITS) that ensures active participation in the formation, routing and general network support of MANETs and also helps in-car traffic information and real-time control generation and distribution. The work is natural extension of the efforts of several large EU projects like DRIVE [2], GST [3] and SAFESPOT [4]

Routing, Localization And Positioning Protocols For Wireless Sensor And Actor Networks

Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events. This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication. We also present a multi-hop localization approach for enriching the information collected from the river with the estimated locations of mobile sensor nodes without using positioning adapters. As an extension to this application, we model the movements of sensor nodes by a subsurface meandering current mobility model with random surface motion. Then we adapt the introduced routing and network organization methods to model a complete primate monitoring system. A novel spatial cut-off preferential attachment model and iii center of mass concept are developed according to the characteristics of the primate groups. We also present a role determination algorithm for primates, which uses the collection of spatial-temporal relationships. We apply a similar approach to human social networks to tackle the problem of automatic generation and organization of social networks by analyzing and assessing interaction data. The introduced routing and localization protocols in this dissertation are also extended with a novel three dimensional actor positioning strategy inspired by the molecular geometry. Extensive simulations are conducted in OPNET simulation tool for the performance evaluation of the proposed protocol

Exploiting and optimizing mobility in wireless sensor networks

Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2016.Nos últimos anos, as chamadas Redes de Sensores Sem Fio (RSSF) tem sido usadas numa grande variedade de aplicações, tais como monitoramento (p.ex. poluição do ar e água, vulcões, estruturas, sinais vitais), detecção de eventos (p.ex. vigilância, incêndios, inundações, terremotos), e monitoramento de alvos (p.ex. segurança, animais silvestres, etc). RSSF são constituídas tipicamente por dezenas, as vez centenas de pequenos dispositivos alimentados por baterias, capazes de realizar medições e de transmitir tais dados para uma estação base através de um canal sem fio. Uma das formas mais promissoras para melhorar o desempenho das RSSF em termos de conectividade, tempo de vida da rede, e latência na transmissão dos dados é através de técnicas que exploram a mobilidade em um ou mais componentes da rede. A mobilidade na RSSF pode ser tanto controlável como aleatória, sendo que em ambos os casos os protocolos devem ser devidamente ajustados para responder adequadamente aos cenários em questão. No caso de mobilidade aleatória, os nodos sensores podem ser capazes de aprender os padrões de mobilidade dos nodos para poderem otimizar a operação da rede. Por outro lado, sendo os padrões de mobilidade conhecidos, é possível fazer escolhas para melhor sintonizar o desempenho da rede de acordo com os critérios estabelecidos pelo projetista. A presente tese de doutorado procura explorar as vantagens associadas com o uso de mobilidade controlada em RSSF. É possível definir mobilidade controlada como sendo a capacidade de se alterar propositalmente o posicionamento de determinados nodos da RSSF. Com isso se torna possível explorar, controlar, ou mesmo otimizar a trajetória e a velocidade dos nodos móveis da RSSF a fim de maximizar o desempenho da rede como um todo. Definitivamente, o uso de nodos que permitam o ajuste de trajetória e velocidade oferece um alto grau de flexibilidade para se explorar aspectos de mobilidade e projetar protocolos de coleta de dados otimizados. Ao se utilizar mobilidade controlada, algumas das operações realizadas pela RSSF podem ser significativamente melhoradas, de modo a tornar possível ajustar o padrão de desempenho da rede de acordo com os níveis desejados. Por exemplo, o processo de descoberta de nodos pode ser melhorado e mesmo simplificado com o controle dos nodos móveis, de modo que ele possa se aproximar dos nodos estáticos em instantes pré-determinados. Da mesma forma, o processo de coleta de dados pode ser otimizado se os nodos móveis se moverem mais rapidamente nos locais onde eles precisam coletar menos dados. Entretanto, diversos desafios aparecem neste tipo de contexto. Por exemplo, como se deve escalonar a chegada do(s) nodo(s) móvel(is) e como se deve controlar e otimizar a movimentação em termos de velocidade sem afetar a qualidade de serviço. Nesse contexto, o segundo capítulo da teseapresenta um esquema de estimação de localização de nodos estáticos espalhados ao longo de uma área predeterminada, utilizando-se para tanto de um nodo móvel com mobilidade controlada. Tal informação de posicionamento é muito importante para a organização de uma RSSF. Com isso é possível definir a sua cobertura, os protocolos de roteamento, a forma de coleta de dados e também auxiliar em aplicações de rastreamento e detecção de eventos. O esquema proposto consiste de uma técnica de localização para estimar a posição dos nodos sensor de forma eficiente, usando apenas um nodo móvel e técnicas geométricas simples. O esquema não requer hardware adicional ou mesmo comunicação entre nodos sensores, evitando assim maiores gastos de baterias. A estimativa de posição obtida é precisa e capaz de tolerar um certo grau de obstáculos. Os resultados obtidos ao longo da tese demostram que a precisão de localização pode ser bem ajustada selecionando corretamente a velocidade, o intervalo de transmissão de beacons e o padrão de varredura da área de interesse pelo nodo móvel.Já o terceiro capítulo apresentada uma técnica de otimização para fins de controle da mobilidade do nodo coletor de dados (MDC). Com isso torna-se possível desenvolver um esquema inteligente de coleta de dados na RSSF. Em primeiro lugar, são destacados os fatores que afetam o processo de coleta de dados usando um MDC. Em seguida é apresentado um algoritmo adaptativo que permite ajustar os parâmetros de controlenecessários para modificar os parâmetros de movimentação do MDC. Estes parâmetros permitem que a velocidade do MDC seja ajustada em tempo de execução para otimizaro processo de coleta de dados. Com isso o MDC pode se adaptar às diferentes taxas de coletas de dados impostas por um conjunto de nodos heterogêneos. O esquema proposto apresenta vantagens significativas para RSSF de grande escala e também heterogêneas (onde os sensores possuem taxas de amostragem variáveis). Os resultados obtidos mostram um aumento significativo na taxa de coleta de dados e a redução no tempo total de deslocamento e no número de voltas que o MDC gasta para coletar os dados dos sensores.Por fim, o capítulo 4 propõe um mecanismo de controle de acesso (MAC) adaptado ao cenário de mobilidade, que se ajusta automaticamente de acordo com o padrão de mobilidade do MDC. O mesmo foca umaredução no consumo de energia e na melhoria da coleta de dados, suportando mobilidade e evitando colisões de mensagens. Este protocolo destina-se a aplicações de coleta de dados nas quais os nós sensores têm de reportar periodicamente a um nó receptor ou estação base. O conceito básico é baseado em acesso múltiplo de divisão de tempo, onde a duração do padrão de sono-vigília é definida de acordo com o padrão de mobilidade do MDC. O esquema proposto é capaz de atender tanto mobilidade aleatória quanto controlada por parte do MDC, desde que as RSSF sejam organizadas em cluster. Uma análise de simulação detalhada é realizada para avaliar seu desempenho em cenários mais gerais e sob diferentes condições operacionais. Os resultados obtidos mostram que o nosso esquema proposto supera amplamente oprotocolo 802.15.4 com sinais (beacons) em termos de eficiência energética, tempo de deslocamento do MDC e taxas de coleta de dados.Abstract : One of the promising techniques for improving the performance of a wireless sensor network (WSN), in terms of connectivity, network lifetime, and data latency, is to introduce and exploit mobility in some of the network components. Mobility in WSN can be either uncontrollable or controllable and needs to be optimized in both cases. In the case of uncontrolled mobility, sensor nodes can learn the mobility patterns of mobile nodes to improve network performance. On the other hand, if the mobility is controllable in terms of trajectory and speed, it can be best tuned to enhance the performance of the network to the desired level. This thesis considers the problem of exploiting and optimizing mobility in wireless sensor networks in order to increase the performance and efficiency of the network.First, a location estimation scheme is discussed for static nodes within a given sensor area using a controlled mobile node. Position information of static nodes is very important in WSN. It helps in effective coverage, routing, data collection, target tracking, and event detection. The scheme discusses a localization technique for efficient position estimation of the sensor nodes using a mobile node and simple geometric techniques. The scheme does not require extra hardware or data communication and does not make the ordinary sensor nodes to spend energy on any interaction with neighboring nodes. The position estimation is accurate and efficient enough to tolerate obstacles and only requires broadcasting of beacon messages by the mobile node. Obtained simulation results show that the localization accuracy can be well adjusted by properly selecting the speed, beacon interval, and scan pattern of the mobile node.Second, an optimization technique for controlled mobility of a mobile data collector is presented in order to develop a smart data collection scheme in WSN. In this case, first, the factors affecting the data collection process using an MDC is highlighted. Then, an adaptive algorithm and control parameters that the MDC uses for autonomously controlling its motion is presented. These parameters allow the speed of the MDC to be adjusted at run time in order to adaptively improve the data collection process. Built-in intelligence helps our system adapting to the changing requirements of data collection. Our scheme shows significant advantages for sparsely deployed, large scale sensor networks and heterogeneous networks (where sensors have variable sampling rates). The simulation results show a significant increase in data collection rate and reduction in the overall traverse time and number of laps that the MDC spends for data gathering.Finally, a mobility aware adaptive medium access control (MAC) is proposed for WSNs which automatically adjusts according to the mobility pattern of the MDC, focusing on reducing energy consumption and improving data collection, while supporting mobility and collision avoidance. This protocol is targeted to data collection applications (e.g. monitoring and surveillance), in which sensor nodes have to periodically report to a sink node. The core concept is based on adaptive time division multiple access, where the sleep-wake duration is defined according to the MDC mobility pattern. The proposed scheme is described for random, predictable, and controlled arrival of MDC in cluster-based WSNs. A detailed simulation analysis is carried out to evaluate its performance in more general scenarios and under different operating conditions. The obtained results show that our scheme largely outperforms the commonly used 802.15.4 beacon-enabled and other fixed duty-cycling schemes in terms of energy efficiency, MDC traverse time, and data collection rates

Frequency hopping in wireless sensor networks

Wireless sensor networks (WSNs) are nowadays being used to collectively gather and spread information in different kinds of applications, for military, civilian, environmental as well as commercial purposes. Therefore the proper functioning of WSNs under different kinds of environmental conditions, especially hostile environments, is a must and a lot of research currently ongoing. The problems related to the initialization and deployment of WSNs under harsh and resource limited conditions are investigated in this thesis. Frequency hopping (FH) is a spread spectrum technique in which multiple channels are used, or hoped, for communications across the network. This mitigates the worst effects of interference with frequency agile communication systems rather than by brute force approaches. FH is a promising technique for achieving the coexistence of sensor networks with other currently existing wireless systems, and it is successful within the somewhat limited computational capabilities of the sensor nodes hardware radios. In this thesis, a FH scheme for WSNs is implemented for a pair of nodes on an application layer. The merits and demerits of the scheme are studied for different kinds of WSN environments. The implementation has been done using a Sensinode NanoStack, a communication stack for internet protocol (IP) based wireless sensor networks and a Sensinode Devkit, for an IPv6 over low power wireless personal area network (6LoWPAN). The measurements are taken from the developed test bed and channel simulator for different kinds of scenarios. The detailed analysis of the FH scheme is done to determine its usefulness against interference from other wireless systems, especially wireless local area networks (WLANs), and the robustness of the scheme to combat fading or frequency selective fading

Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks

A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing