A geometrical sink-based cooperative coverage hole recovery strategy for WSNs

© 2015 IEEE. Unlike sporadic node failures, coverage holes emerging from multiple temporally-correlated node failures can severely affect quality of service in a network and put the integrity of entire wireless sensor networks at risk. Conventional topology control schemes addressing such undesirable topological changes have usually overlooked the status of participating nodes in the recovery process with respect to the deployed sink node(s) in the network. In this paper, a cooperative coverage hole recovery model is proposed which utilises the simple geometrical procedure of circle inversion. In this model, autonomous nodes consider their distances to the deployed sink node(s) in addition to their local status, while relocating towards the coverage holes. By defining suitable metrics, the performance of our proposed model performance is compared with a force-based approach

Resilient wireless sensor networks

University of Technology Sydney. Faculty of Engineering and Information Technology.With the increase in wireless sensor networks’ (WSN) applications as the result of enhancements in sensors’ size, battery-life and mobility, sensor nodes have become one of the most ubiquitous and relied-upon electrical appliances in recent years. In harsh and hostile environments, in the absence of centralised supervision, the effects of faults, damages and unbalanced node deployments should be taken into account as they may disturb the operation and quality of service of networks. Coverage holes (CHs) due to the correlated failures and unbalanced deployment of nodes should be considered seriously in a timely manner; otherwise, cascaded failures on the rest of the proximate sensor nodes can jeopardise networks’ integrity. Although different distributed topology control (TC) schemes have been devised to address the challenges of node failures and their dynamic behaviours, little work has been directed towards recovering CHs and/or alleviating their undesirable effects especially in Large Scale CHs (LSCH). Thus, devising CH recovery strategies for the swift detection, notification, repair and avoidance of damage events are important to increase the lifetime and resiliency of WSNs and to improve the efficacy and reliability of error-prone and energy-restricted nodes for many applications. In this research, the concepts of resiliency, fault management, network holes, CHs, TC schemes and stages of CH recovery are reviewed. By devising new TC techniques, CHs recovery strategies that partially or wholly repair LSCHs and increase the coverage of WSNs are presented such that a global pattern emerges as a result of nodes’ local interactions. In this study, we propose (1) CH detection and boundary node (B-node) selection algorithms, which B-nodes around the damaged area self-select solely based on available 1-hop information extracted from their simple geometrical and statistical features. (2) A constraint node movement algorithm based on the idea of virtual chord (v-chords) formed by B-nodes and their neighbours to partially repair CHs. By changing each B-node’s v-chord, its movement and connectivity to the rest of network can be controlled in a distributed manner. (3) Fuzzy node relocation models based on force-based movement algorithms are suitable to consider the uncertainty governed by nodes’ distributed and local interactions and the indefinite choices of movements. (4) A model of cooperative CHs recovery in which nodes move towards damaged areas in the form of disjoint spanned trees, which is inspired by nature. Based on nodes’ local interactions with their neighbours and their distances to CHs, a set of disjoint trees around the CH spans. (5) A hybrid CH recovery strategy that combines sensing power control and physical node relocation using a game theoretic approach for mobile WSNs. (6) A sink-based CH recovery via node relocation where moving nodes consider the status of sink nodes. The proposed node relocation algorithm aims to reduce the distances of moving nodes to the deployed sink nodes while repairing the CHs. The results show that proposed distributed algorithms (1)-(6) either outperform or match their counterparts within acceptable ranges. The significances of proposed algorithms are as follow: Although they are mainly designed base on the available 1-hop knowledge and local interactions of (autonomous) nodes, they result in global behaviours. They can be implemented in harsh and hostile environments in the absence of centralised operators. They are suitable for time-sensitive applications and scenarios with the security concerns that limit the amount of information exchange between nodes. The burden of decision making is spread among nodes

Cooperative Medium Access Mechanisms and Service-oriented Routing in Multi-hop Wireless Networks

Doktorgradsavhandling i informasjons- og kommunikasjonsteknologi, Universitetet i Agder, Grimstad, 2011Multi-hop wireless networks have been regarded as a promising path towards future wireless communication landscape. In the past decade, most related work has been performed in the context of mobile ad hoc networks. In very recent years, however, much effort has been shifted to more static networks such as wireless mesh networks and wireless sensor networks. While significant progress has been achieved through these years, both theoretically and experimentally, challenges still exist in various aspects of these networks. For instance, how to use multi-hop networks as a means for providing broadband Internet services with reliability and balanced load remains as a challenging task. As the number of end-users is increasing rapidly and more and more users are enjoying multimedia services, how to provide Quality of Service (QoS) with user satisfaction in such networks remains also as a hot topic. Meanwhile, another direction which has recently attracted lots of efforts in the international research community is the introduction of cooperative communications. Cooperative communications based on relaying nodes are capable of improving network performance in terms of increased spectral and power efficiency, extended network coverage, balanced QoS, infrastructure-less deployment, etc. Cooperation may happen at different communication layers, at the physical layer where the received signal is retransmitted and at the MAC and routing layers where a packet is forwarded to the next hop in a coordinated manner towards the destination, respectively. However, without joint consideration and design of physical layer, MAC layer and network layer, the benefit of cooperative communication cannot be exploited to the maximum extent. In addition, how to extend one-hop cooperative communication into multi-hop wireless network scenarios remains as an almost un-chartered research frontier. In this dissertation, we enhance the state of the art technologies in the field of multi-hop wireless networks from a layered perspective. While efficient scheduling mechanisms are proposed at the MAC layer, elaborate routing protocols are devised at the network layer. More specifically, by taking into account of cross layer design we cope with network congestion problems in wireless mesh networks mainly at the network layer. In order to further improve the performance of cooperative wireless networks, we propose a contention-based cooperative MAC protocol in the presence of multiple relay nodes. Since a large majority of existing cooperative MAC protocols are designed based on widely-used IEEE 802.11 MAC protocol which exhibits inherent design constraint when applied in multi-hop wireless networks, it is imperative to develop a novel cooperative MAC protocol which is appropriate for multi-hop network scenarios. Next, we propose a TDMA-based MAC protocol supporting cooperative communications in static multi-hop wireless networks. Furthermore, a cooperative lifetime maximization MAC protocol is proposed to cope with the energy hole problem in wireless sensor networks

Intelligent Sensor Networks

In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts

Distributed spatial analysis in wireless sensor networks

Wireless sensor networks (WSNs) allow us to instrument the physical world in novel ways, providing detailed insight that has not been possible hitherto. Since WSNs provide an interface to the physical world, each sensor node has a location in physical space, thereby enabling us to associate spatial properties with data. Since WSNs can perform periodic sensing tasks, we can also associate temporal markers with data. In the environmental sciences, in particular, WSNs are on the way to becoming an important tool for the modelling of spatially and temporally extended physical phenomena. However, support for high-level and expressive spatial-analytic tasks that can be executed inside WSNs is still incipient. By spatial analysis we mean the ability to explore relationships between spatially-referenced entities (e.g., a vineyard, or a weather front) and to derive representations grounded on such relationships (e.g., the geometrical extent of that part of a vineyard that is covered by mist as the intersection of the geometries that characterize the vineyard and the weather front, respectively). The motivation for this endeavour stems primarily from applications where important decisions hinge on the detection of an event of interest (e.g., the presence, and spatio-temporal progression, of mist over a cultivated field may trigger a particular action) that can be characterized by an event-defining predicate (e.g., humidity greater than 98 and temperature less than 10). At present, in-network spatial analysis in WSN is not catered for by a comprehensive, expressive, well-founded framework. While there has been work on WSN event boundary detection and, in particular, on detecting topological change of WSN-represented spatial entities, this work has tended to be comparatively narrow in scope and aims. The contributions made in this research are constrained to WSNs where every node is tethered to one location in physical space. The research contributions reported here include (a) the definition of a framework for representing geometries; (b) the detailed characterization of an algebra of spatial operators closely inspired, in its scope and structure, by the Schneider-Guting ROSE algebra (i.e., one that is based on a discrete underlying geometry) over the geometries representable by the framework above; (c) distributed in-network algorithms for the operations in the spatial algebra over the representable geometries, thereby enabling (i) new geometries to be derived from induced and asserted ones, and (ii)topological relationships between geometries to be identified; (d) an algorithmic strategy for the evaluation of complex algebraic expressions that is divided into logically-cohesive components; (e) the development of a task processing system that each node is equipped with, thereby with allowing users to evaluate tasks on nodes; and (f) an empirical performance study of the resulting system.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges

Copyright protection of scalar and multimedia sensor network data using digital watermarking

This thesis records the research on watermarking techniques to address the issue of copyright protection of the scalar data in WSNs and image data in WMSNs, in order to ensure that the proprietary information remains safe between the sensor nodes in both. The first objective is to develop LKR watermarking technique for the copyright protection of scalar data in WSNs. The second objective is to develop GPKR watermarking technique for copyright protection of image data in WMSN

State-of-the-Art Sensors Technology in Spain 2015: Volume 1

This book provides a comprehensive overview of state-of-the-art sensors technology in specific leading areas. Industrial researchers, engineers and professionals can find information on the most advanced technologies and developments, together with data processing. Further research covers specific devices and technologies that capture and distribute data to be processed by applying dedicated techniques or procedures, which is where sensors play the most important role. The book provides insights and solutions for different problems covering a broad spectrum of possibilities, thanks to a set of applications and solutions based on sensory technologies. Topics include: • Signal analysis for spectral power • 3D precise measurements • Electromagnetic propagation • Drugs detection • e-health environments based on social sensor networks • Robots in wireless environments, navigation, teleoperation, object grasping, demining • Wireless sensor networks • Industrial IoT • Insights in smart cities • Voice recognition • FPGA interfaces • Flight mill device for measurements on insects • Optical systems: UV, LEDs, lasers, fiber optics • Machine vision • Power dissipation • Liquid level in fuel tanks • Parabolic solar tracker • Force sensors • Control for a twin roto

Étude d'un réseau de capteur UWB pour la localisation et la communication dans un environnement minier

Le jour n'est peut-être pas très loin où une mine pourra compter sur un système de communication sans fil pour échanger des données, transmettre des informations ou localiser des travailleurs dans le cas d'une activité normale ou en cas d'urgence. Au point de vue de la sécurité, un système de communications sans fil aurait l'avantage de localiser en temps réel un travailleur ou un engin. Les travailleurs se déplacent sans cesse dans une mine. Avec une technologie sans fil permanente, on pourrait localiser les personnes de manière relativement précise. Même en cas d'éboulement, avec une technologie adaptée, il serait possible de savoir où se trouve la personne en détresse. Notre travail de recherche s'inscrit dans la perspective du développement d'un réseau de capteurs ultra large bande (UWB) pour deux applications : l'aide à la radiolocalisation et l'extension du réseau de capteurs sans fil dans la mine. Cette étude est focalisée sur trois aspects. La première partie de notre étude consiste à étudier tous les problèmes reliés à la radiolocalisation dans la mine. Vue l'importance de cette application, nous avons mis en oeuvre un réseau de capteurs en tenant compte d'un futur déploiement dans la mine. La technologie utilisée repose sur la technologie ultra large bande. Comme il n'existe pas de travaux qui traitent ce genre de problèmes, nous avons commencé notre étude par une caractérisation du canal UWB dans les mines souterraines. Pour atteindre ces objectifs, plusieurs campagnes de mesure sur site (mine expérimentale) ont été menées. Nous sommes parvenus à une modélisation du canal de propagation et à avancer des recommandations pour aider au dimensionnement d'un réseau de capteurs dans ce type d'environnement. Dans la première partie, le but est d'étudier le problème de radiolocalisation avec les réseaux de capteurs. Notre scénario proposé serait de placer des capteurs sur chaque agent (mineur, engin). On suppose que chaque noeud (agent) qui circule à travers un réseau d'ancre maillé (déjà déployé), va extraire des informations de distance (en utilisant le critère de temps d'arrivée), ensuite il va utiliser un algorithme de positionnement distribué afin de déterminer sa propre position. Lors de cette partie nous avons aussi étudié quelques estimateurs cohérents et non-cohérents du temps d'arrivée. La caractérisation de l'erreur de mesure utilisant le temps d'arrivée dans un environnement minier a été aussi évaluée. Enfin, dans la dernière partie, nous avons analysé par simulations un déploiement d'un réseau de capteurs UWB ad hoc dans la mine. Nous avons choisi d'adopter une approche théorique afin d'évaluer les performances de cette configuration. Une conception intercouche pour un routage optimal a été étudiée. Nous avons utilisé la couche physique/réseau afin de minimiser l'énergie consommée lors de l'acheminement du données