Real-Time Wireless Sensor-Actuator Networks for Cyber-Physical Systems

A cyber-physical system (CPS) employs tight integration of, and coordination between computational, networking, and physical elements. Wireless sensor-actuator networks provide a new communication technology for a broad range of CPS applications such as process control, smart manufacturing, and data center management. Sensing and control in these systems need to meet stringent real-time performance requirements on communication latency in challenging environments. There have been limited results on real-time scheduling theory for wireless sensor-actuator networks. Real-time transmission scheduling and analysis for wireless sensor-actuator networks requires new methodologies to deal with unique characteristics of wireless communication. Furthermore, the performance of a wireless control involves intricate interactions between real-time communication and control. This thesis research tackles these challenges and make a series of contributions to the theory and system for wireless CPS. (1) We establish a new real-time scheduling theory for wireless sensor-actuator networks. (2) We develop a scheduling-control co-design approach for holistic optimization of control performance in a wireless control system. (3) We design and implement a wireless sensor-actuator network for CPS in data center power management. (4) We expand our research to develop scheduling algorithms and analyses for real-time parallel computing to support computation-intensive CPS

A cross-layer approach for optimizing the efficiency of wireless sensor and actor networks

Recent development has lead to the emergence of distributed Wireless Sensor and Actor Networks (WSAN), which are capable of observing the physical environment, processing the data, making decisions based on the observations and performing appropriate actions. WSANs represent an important extension of Wireless Sensor Networks (WSNs) and may comprise a large number of sensor nodes and a smaller number of actor nodes. The sensor nodes are low-cost, low energy, battery powered devices with restricted sensing, computational and wireless communication capabilities. Actor nodes are resource richer with superior processing capabilities, higher transmission powers and a longer battery life. A basic operational scenario of a typical WSAN application follows the following sequence of events. The physical environment is periodically sensed and evaluated by the sensor nodes. The sensed data is then routed towards an actor node. Upon receiving sensed data, an actor node performs an action upon the physical environment if necessary, i.e. if the occurrence of a disturbance or critical event has been detected. The specific characteristics of sensor and actor nodes combined with some stringent application constraints impose unique requirements for WSANs. The fundamental challenges for WSANs are to achieve low latency, high energy efficiency and high reliability. The latency and energy efficiency requirements are in a trade-off relationship. The communication and coordination inside WSANs is managed via a Communication Protocol Stack (CPS) situated on every node. The requirements of low latency and energy efficiency have to be addressed at every layer of the CPS to ensure overall feasibility of the WSAN. Therefore, careful design of protocol layers in the CPS is crucial in attempting to meet the unique requirements and handle the abovementioned trade-off relationship in WSANs. The traditional CPS, comprising the application, network, medium access control and physical layer, is a layered protocol stack with every layer, a predefined functional entity. However, it has been found that for similar types of networks with similar stringent network requirements, the strictly layered protocol stack approach performs at a sub-optimal level with regards to network efficiency. A modern cross-layer paradigm, which proposes the employment of interactions between layers in the CPS, has recently attracted a lot of attention. The cross-layer approach promotes network efficiency optimization and promises considerable performance gains. It is found that in literature, the adoption of this cross-layer paradigm has not yet been considered for WSANs. In this dissertation, a complete cross-layer enabled WSAN CPS is developed that features the adoption of the cross-layer paradigm towards promoting optimization of the network efficiency. The newly proposed cross-layer enabled CPS entails protocols that incorporate information from other layers into their local decisions. Every protocol layer provides information identified as beneficial to another layer(s) in the CPS via a newly proposed Simple Cross-Layer Framework (SCLF) for WSANs. The proposed complete cross-layer enabled WSAN CPS comprises a Cross-Layer enabled Network-Centric Actuation Control with Data Prioritization (CL-NCAC-DP) application layer (APPL) protocol, a Cross-Layer enabled Cluster-based Hierarchical Energy/Latency-Aware Geographic Routing (CL-CHELAGR) network layer (NETL) protocol and a Cross-Layer enabled Carrier Sense Multiple Access with Minimum Preamble Sampling and Duty Cycle Doubling (CL-CSMA-MPS-DCD) medium access control layer (MACL) protocol. Each of these protocols builds on an existing simple layered protocol that was chosen as a basis for development of the cross-layer enabled protocols. It was found that existing protocols focus primarily on energy efficiency to ensure maximum network lifetime. However, most WSAN applications require latency minimization to be considered with the same importance. The cross-layer paradigm provides means of facilitating the optimization of both latency and energy efficiency. Specifically, a solution to the latency versus energy trade-off is given in this dissertation. The data generated by sensor nodes is prioritised by the APPL and depending on the delay-sensitivity, handled in a specialised manor by every layer of the CPS. Delay-sensitive data packets are handled in order to achieve minimum latency. On the other hand, delay-insensitive non critical data packets are handled in such a way as to achieve the highest energy efficiency. In effect, either latency minimization or energy efficiency receives an elevated precedence according to the type of data that is to be handled. Specifically, the cross-layer enabled APPL protocol provides information pertaining to the delay-sensitivity of sensed data packets to the other layers. Consequently, when a data packet is detected as highly delay-sensitive, the cross-layer enabled NETL protocol changes its approach from energy efficient routing along the maximum residual energy path to routing along the fastest path towards the cluster-head actor node for latency minimizing of the specific packet. This is done by considering information (contained in the SCLF neighbourhood table) from the MACL that entails wakeup schedules and channel utilization at neighbour nodes. Among the added criteria, the next-hop node is primarily chosen based on the shortest time to wakeup. The cross-layer enabled MACL in turn employs a priority queue and a temporary duty cycle doubling feature to enable rapid relaying of delay-sensitive data. Duty cycle doubling is employed whenever a sensor node’s APPL state indicates that it is part of a critical event reporting route. When the APPL protocol state (found in the SCLF information pool) indicates that the node is not part of the critical event reporting route anymore, the MACL reverts back to promoting energy efficiency by disengaging duty cycle doubling and re-employing a combination of a very low duty cycle and preamble sampling. The APPL protocol conversely considers the current queue size of the MACL and temporarily halts the creation of data packets (only if the sensed value is non critical) to prevent a queue overflow and ease congestion at the MACL By simulation it was shown that the cross-layer enabled WSAN CPS consistently outperforms the layered CPS for various network conditions. The average end-to-end latency of delay-sensitive critical data packets is decreased substantially. Furthermore, the average end-to-end latency of delay-insensitive data packets is also decreased. Finally, the energy efficiency performance is decreased by a tolerable insignificant minor margin as expected. The trivial increase in energy consumption is overshadowed by the high margin of increase in latency performance for delay-sensitive critical data packets. The newly proposed cross-layer CPS achieves an immense latency performance increase for WSANs, while maintaining excellent energy efficiency. It has hence been shown that the adoption of the cross-layer paradigm by the WSAN CPS proves hugely beneficial with regards to the network efficiency performance. This increases the feasibility of WSANs and promotes its application in more areas.Dissertation (MEng)--University of Pretoria, 2009.Electrical, Electronic and Computer Engineeringunrestricte

Network-centric methods for heterogeneous multiagent systems

We present tools for a network topology based characterization of heterogeneity in multiagent systems, thereby providing a framework for the analysis and design of heterogeneous multiagent networks from a network structure view-point. In heterogeneous networks, agents with a diverse set of resources coordinate with each other. Coordination among different agents and the structure of the underlying network topology have significant impacts on the overall behavior and functionality of the system. Using constructs from graph theory, a qualitative as well as a quantitative analysis is performed to examine an inter-relationship between the network topology and the distribution of agents with various capabilities in heterogeneous networks. Our goal is to allow agents maximally exploit heterogeneous resources available within the network through local interactions, thus exploring a promise heterogeneous networks hold to accomplish complicated tasks by leveraging upon the assorted capabilities of agents. For a reliable operations of such systems, the issue of security against intrusions and malicious agents is also addressed. We provide a scheme to secure a network against a sequence of intruder attacks through a set of heterogeneous guards. Moreover, robustness of networked systems against noise corruption and structural changes in the underlying network topology is also examined.Ph.D

Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN

International audienceFour new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reported by sensors), the goal is to allocate the task to the most suitable robot to act upon the event, using either distance or the robots' remaining energy as metrics. The proposed algorithms consist of two phases. The first phase of algorithms is based on face routing, and we introduced the parameter called search radius (SR) at the end of this first phase. Routing is considered successful if the found robot is inside SR. After that, the second phase, based on auctions, is initiated by the robot found in SR trying to find a more suitable one. In the simulations, network lifetime and communication costs are measured and used for comparison. We compare our algorithms with similar algorithms from the literature (k-SAAP and BFS) used for the task assignment. RFTA2 and RFTA2GE feature up to a seven-times-longer network lifetime with significant communication overhead reduction compared to k-SAAP and BFS. Among our algorithms, RFTA2GE features the best robot energy utilization

Routing protocol optimization in challenged multihop wireless networks

Durant ces dernières années, de nombreux travaux de recherches ont été menés dans le domaine des réseaux multi-sauts sans fil à contraintes (MWNs: Multihop Wireless Networks). Grâce à l'évolution de la technologie des systèmes mico-electro-méchaniques (MEMS) et, depuis peu, les nanotechnologies, les MWNs sont une solution de choix pour une variété de problèmes. Le principal avantage de ces réseaux est leur faible coût de production qui permet de développer des applications ayant un unique cycle de vie. Cependant, si le coût de fabrication des nœuds constituant ce type de réseaux est assez faible, ces nœuds sont aussi limités en capacité en termes de: rayon de transmission radio, bande passante, puissance de calcul, mémoire, énergie, etc. Ainsi, les applications qui visent l'utilisation des MWNs doivent être conçues avec une grande précaution, et plus spécialement la conception de la fonction de routage, vu que les communications radio constituent la tâche la plus consommatrice d'énergie.Le but de cette thèse est d'analyser les différents défis et contraintes qui régissent la conception d'applications utilisant les MWNs. Ces contraintes se répartissent tout le long de la pile protocolaire. On trouve au niveau application des contraintes comme: la qualité de service, la tolérance aux pannes, le modèle de livraison de données au niveau application, etc. Au niveau réseau, on peut citer les problèmes de la dynamicité de la topologie réseau, la présence de trous, la mobilité, etc. Nos contributions dans cette thèse sont centrées sur l'optimisation de la fonction de routage en considérant les besoins de l'application et les contraintes du réseau. Premièrement, nous avons proposé un protocole de routage multi-chemin "en ligne" pour les applications orientées QoS utilisant des réseaux de capteurs multimédia. Ce protocole repose sur la construction de multiples chemins durant la transmission des paquets vers leur destination, c'est-à-dire sans découverte et construction des routes préalables. En permettant des transmissions parallèles, ce protocole améliore la transmission de bout-en-bout en maximisant la bande passante du chemin agrégé et en minimisant les délais. Ainsi, il permet de répondre aux exigences des applications orientées QoS.Deuxièmement, nous avons traité le problème du routage dans les réseaux mobiles tolérants aux délais. Nous avons commencé par étudier la connectivité intermittente entre les différents et nous avons extrait un modèle pour les contacts dans le but pouvoir prédire les future contacts entre les nœuds. En se basant sur ce modèle, nous avons proposé un protocole de routage, qui met à profit la position géographique des nœuds, leurs trajectoires, et la prédiction des futurs contacts dans le but d'améliorer les décisions de routage. Le protocole proposé permet la réduction des délais de bout-en-bout tout en utilisant d'une manière efficace les ressources limitées des nœuds que ce soit en termes de mémoire (pour le stockage des messages dans les files d'attentes) ou la puissance de calcul (pour l'exécution de l'algorithme de prédiction).Finalement, nous avons proposé un mécanisme de contrôle de la topologie avec un algorithme de routage des paquets pour les applications orientés évènement et qui utilisent des réseaux de capteurs sans fil statiques. Le contrôle de la topologie est réalisé à travers l'utilisation d'un algorithme distribué pour l'ordonnancement du cycle de service (sleep/awake). Les paramètres de l'algorithme proposé peuvent être réglés et ajustés en fonction de la taille du voisinage actif désiré (le nombre moyen de voisin actifs pour chaque nœud). Le mécanisme proposé assure un compromis entre le délai pour la notification d'un événement et la consommation d'énergie globale dans le réseau.Great research efforts have been carried out in the field of challenged multihop wireless networks (MWNs). Thanks to the evolution of the Micro-Electro-Mechanical Systems (MEMS) technology and nanotechnologies, multihop wireless networks have been the solution of choice for a plethora of problems. The main advantage of these networks is their low manufacturing cost that permits one-time application lifecycle. However, if nodes are low-costly to produce, they are also less capable in terms of radio range, bandwidth, processing power, memory, energy, etc. Thus, applications need to be carefully designed and especially the routing task because radio communication is the most energy-consuming functionality and energy is the main issue for challenged multihop wireless networks.The aim of this thesis is to analyse the different challenges that govern the design of challenged multihop wireless networks such as applications challenges in terms of quality of service (QoS), fault-tolerance, data delivery model, etc., but also networking challenges in terms of dynamic network topology, topology voids, etc. Our contributions in this thesis focus on the optimization of routing under different application requirements and network constraints. First, we propose an online multipath routing protocol for QoS-based applications using wireless multimedia sensor networks. The proposed protocol relies on the construction of multiple paths while transmitting data packets to their destination, i.e. without prior topology discovery and path establishment. This protocol achieves parallel transmissions and enhances the end-to-end transmission by maximizing path bandwidth and minimizing the delays, and thus meets the requirements of QoS-based applications. Second, we tackle the problem of routing in mobile delay-tolerant networks by studying the intermittent connectivity of nodes and deriving a contact model in order to forecast future nodes' contacts. Based upon this contact model, we propose a routing protocol that makes use of nodes' locations, nodes' trajectories, and inter-node contact prediction in order to perform forwarding decisions. The proposed routing protocol achieves low end-to-end delays while using efficiently constrained nodes' resources in terms of memory (packet queue occupancy) and processing power (forecasting algorithm). Finally, we present a topology control mechanism along a packet forwarding algorithm for event-driven applications using stationary wireless sensor networks. Topology control is achieved by using a distributed duty-cycle scheduling algorithm. Algorithm parameters can be tuned according to the desired node's awake neighbourhood size. The proposed topology control mechanism ensures trade-off between event-reporting delay and energy consumption.BORDEAUX1-Bib.electronique (335229901) / SudocSudocFranceF

Localisation en intérieur et gestion de la mobilité dans les réseaux sans fils hétérogènes émergents

Au cours des dernières décennies, nous avons été témoins d'une évolution considérable dans l'informatique mobile, réseau sans fil et des appareils portatifs. Dans les réseaux de communication à venir, les utilisateurs devraient être encore plus mobiles exigeant une connectivité omniprésente à différentes applications qui seront de préférence au courant de leur contexte. Certes, les informations de localisation dans le cadre de leur contexte est d'une importance primordiale à la fois la demande et les perspectives du réseau. Depuis l'application ou de point de vue utilisateur, la fourniture de services peut mettre à jour si l'adaptation au contexte de l'utilisateur est activée. Du point de vue du réseau, des fonctionnalités telles que le routage, la gestion de transfert, l'allocation des ressources et d'autres peuvent également bénéficier si l'emplacement de l'utilisateur peuvent être suivis ou même prédit. Dans ce contexte, nous nous concentrons notre attention sur la localisation à l'intérieur et de la prévision transfert qui sont des composants indispensables à la réussite ultime de l'ère de la communication omniprésente envisagé. Alors que les systèmes de positionnement en plein air ont déjà prouvé leur potentiel dans un large éventail d'applications commerciales, le chemin vers un système de localisation à l'intérieur de succès est reconnu pour être beaucoup plus difficile, principalement en raison des caractéristiques difficiles à l'intérieur et l'exigence d'une plus grande précision. De même, la gestion de transfert dans le futur des réseaux hétérogènes sans fil est beaucoup plus difficile que dans les réseaux traditionnels homogènes. Régimes de procédure de transfert doit être sans faille pour la réunion strictes de qualité de service (QoS) des applications futures et fonctionnel malgré la diversité des caractéristiques de fonctionnement des différentes technologies. En outre, les décisions transfert devraient être suffisamment souples pour tenir compte des préférences utilisateur d'un large éventail de critères proposés par toutes les technologies. L'objectif principal de cette thèse est de mettre au point précis, l'heure et l'emplacement de puissance et de systèmes efficaces de gestion de transfert afin de mieux satisfaire applications sensibles au contexte et mobiles. Pour obtenir une localisation à l'intérieur, le potentiel de réseau local sans fil (WLAN) et Radio Frequency Identification (RFID) que l'emplacement autonome technologies de détection sont d'abord étudiés par des essais plusieurs algorithmes et paramètres dans un banc d'essai expérimental réel ou par de nombreuses simulations, alors que leurs lacunes sont également été identifiés. Leur intégration dans une architecture commune est alors proposée afin de combiner leurs principaux avantages et surmonter leurs limitations. La supériorité des performances du système de synergie sur le stand alone homologues est validée par une analyse approfondie. En ce qui concerne la tâche de gestion transfert, nous repérer que la sensibilité au contexte peut aussi améliorer la fonctionnalité du réseau. En conséquence, deux de tels systèmes qui utilisent l'information obtenue à partir des systèmes de localisation sont proposées. Le premier schéma repose sur un déploiement tag RFID, comme notre architecture de positionnement RFID, et en suivant la scène WLAN analyse du concept de positionnement, prédit l'emplacement réseau de la prochaine couche, c'est à dire le prochain point de fixation sur le réseau. Le second régime repose sur une approche intégrée RFID et sans fil de capteur / actionneur Network (WSAN) de déploiement pour la localisation des utilisateurs physiques et par la suite pour prédire la prochaine leur point de transfert à deux couches de liaison et le réseau. Etre indépendant de la technologie d'accès sans fil principe sous-jacent, les deux régimes peuvent être facilement mises en œuvre dans des réseaux hétérogènes [...]Over the last few decades, we have been witnessing a tremendous evolution in mobile computing, wireless networking and hand-held devices. In the future communication networks, users are anticipated to become even more mobile demanding for ubiquitous connectivity to different applications which will be preferably aware of their context. Admittedly, location information as part of their context is of paramount importance from both application and network perspectives. From application or user point of view, service provision can upgrade if adaptation to the user's context is enabled. From network point of view, functionalities such as routing, handoff management, resource allocation and others can also benefit if user's location can be tracked or even predicted. Within this context, we focus our attention on indoor localization and handoff prediction which are indispensable components towards the ultimate success of the envisioned pervasive communication era. While outdoor positioning systems have already proven their potential in a wide range of commercial applications, the path towards a successful indoor location system is recognized to be much more difficult, mainly due to the harsh indoor characteristics and requirement for higher accuracy. Similarly, handoff management in the future heterogeneous wireless networks is much more challenging than in traditional homogeneous networks. Handoff schemes must be seamless for meeting strict Quality of Service (QoS) requirements of the future applications and functional despite the diversity of operation features of the different technologies. In addition, handoff decisions should be flexible enough to accommodate user preferences from a wide range of criteria offered by all technologies. The main objective of this thesis is to devise accurate, time and power efficient location and handoff management systems in order to satisfy better context-aware and mobile applications. For indoor localization, the potential of Wireless Local Area Network (WLAN) and Radio Frequency Identification (RFID) technologies as standalone location sensing technologies are first studied by testing several algorithms and metrics in a real experimental testbed or by extensive simulations, while their shortcomings are also identified. Their integration in a common architecture is then proposed in order to combine their key benefits and overcome their limitations. The performance superiority of the synergetic system over the stand alone counterparts is validated via extensive analysis. Regarding the handoff management task, we pinpoint that context awareness can also enhance the network functionality. Consequently, two such schemes which utilize information obtained from localization systems are proposed. The first scheme relies on a RFID tag deployment, alike our RFID positioning architecture, and by following the WLAN scene analysis positioning concept, predicts the next network layer location, i.e. the next point of attachment to the network. The second scheme relies on an integrated RFID and Wireless Sensor/Actuator Network (WSAN) deployment for tracking the users' physical location and subsequently for predicting next their handoff point at both link and network layers. Being independent of the underlying principle wireless access technology, both schemes can be easily implemented in heterogeneous networks. Performance evaluation results demonstrate the advantages of the proposed schemes over the standard protocols regarding prediction accuracy, time latency and energy savingsEVRY-INT (912282302) / SudocSudocFranceF

Journal of Telecommunications and Information Technology, 2018, nr 3

kwartalni

Modeling and Implementation of Wireless Sensor Networks for Logistics Applications

Logistics has experienced a long time of developments and improvements based on the advanced vehicle technologies, transportation systems, traffic network extension and logistics processes. In the last decades, the complexity has increased significantly and this has created complex logistics networks over multiple continents. Because of the close cooperation, these logistics networks are highly dependent on each other in sharing and processing the logistics information. Every customer has many suppliers and vice versa. The conventional centralized control continues but reaches some limitations such as the different distribution of suppliers, the complexity and flexibility of processing orders or the dynamics of the logistic objects. In order to overcome these disadvantages, the paradigm of autonomous logistics is proposed and promises a better technical solution for current logistics systems. In autonomous logistics, the decision making is shifted toward the logistic objects which are defined as material items (e.g., vehicles, containers) or immaterial items (e.g., customer orders) of a networked logistics system. These objects have the ability to interact with each other and make decisions according to their own objectives. In the technical aspect, with the rapid development of innovative sensor technology, namely Wireless Sensor Networks (WSNs), each element in the network can self-organize and interact with other elements for information transmission. The attachment of an electronic sensor element into a logistic object will create an autonomous environment in both the communication and the logistic domain. With this idea, the requirements of logistics can be fulfilled; for example, the monitoring data can be precise, comprehensive and timely. In addition, the goods flow management can be transferred to the information logistic object management, which is easier by the help of information technologies. However, in order to transmit information between these logistic objects, one requirement is that a routing protocol is necessary. The Opportunistic relative Distance-Enabled Uni-cast Routing (ODEUR ) protocol which is proposed and investigated in this thesis shows that it can be used in autonomous environments like autonomous logistics. Moreover, the support of mobility, multiple sinks and auto-connection in this protocol enhances the dynamics of logistic objects. With a general model which covers a range from low-level issues to high-level protocols, many services such as real time monitoring of environmental conditions, context-aware applications and localization make the logistic objects (embedded with sensor equipment) more advanced in information communication and data processing. The distributed management service in each sensor node allows the flexible configuration of logistic items at any time during the transportation. All of these integrated features introduce a new technical solution for smart logistic items and intelligent transportation systems. In parallel, a management system, WSN data Collection and Management System (WiSeCoMaSys), is designed to interact with the deployed Wireless Sensor Networks. This tool allows the user to easily manipulate the sensor networks remotely. With its rich set of features such as real time data monitoring, data analysis and visualization, per-node management, and alerts, this tool helps both developers and users in the design and deployment of a sensor network. In addition, an analytical model is developed for comparison with the results from simulations and experiments. Focusing on the use of probability theory to model the network links, this model considers several important factors such as packet reception rate and network traffic which are used in the simulation and experiment parts. Moreover, the comparison between simulation, experiment and analytical results is also carried out to estimate the accuracy of the design and make several improvements of the simulation accuracy. Finally, all of the above parts are integrated in one unique system. This system is verified by both simulations in logistic scenarios (e.g., harbors, warehouses and containers) and experiments. The results show that the proposed model and protocol have a good packet delivery rate, little memory requirements and low delay. Accordingly, this system design is practical and applicable in logistics