Energy Efficient Approach for Surveillance Applications Based on Self Organized Wireless Sensor Networks

AbstractSurveillance applications based on Wireless Sensor Networks (WSNs) are energy consumption sensitive. Such applications require low energy consumption in order to extend network lifetime. In this paper, we are interested in event detection around strategic sites (e.g., oil or military sites). We propose energy efficient approach which consists of identifying and using network boundary nodes as sentries, i.e., they are always in active mode and are responsible of detecting events, sending and relaying alert messages to the sink. Remaining nodes are used as relay nodes only. They alternate between active and sleep modes in order to reduce energy consumption. Simulation results show that our approach increases significantly network lifetime and provides an acceptable percentage of alerts delivered to the sink

Optimization of the Deployment of Wireless Sensor Networks Dedicated to Fire Detection in Smart Car Parks using Chaos Whale Optimization Algorithm

Smart Car Parks (SCPs) based on Wireless Sensor Networks (WSNs) are one of the most interesting Internet of Things applications. This paper addresses the deployment optimization problem of two-tiered WSNs dedicated to fire monitoring in SCPs. Networks deployed inside the SCP consist of three types of nodes: Sensor Nodes (SNs) which cover the spots within the parking area, Relay Nodes (RNs) which forward alert messages generated by SNs, and the Sink node which is connected to the outside world (e.g, firefighters), through a high bandwidth connection. We propose an algorithm based on chaos theory and Whale Optimization Algorithm (WOA), which minimizes simultaneously the deployed number of SNs, RNs, and network diameter while ensuring coverage and connectivity. To evaluate the effectiveness of our proposal, we have conducted extensive tests. The results show that the Chaos WOA (CWOA) outperforms the original WOA in terms of solution quality and computation time and by comparison with an exact method, CWOA provides results very close to the optimal in terms of fitness value and is efficient in terms of computational time when the problem becomes more complex

Finding the polygon hull of a network without conditions on the starting vertex

Many real‐life problems arising within the fields of wireless communication, image processing, combinatorial optimization, etc, can be modeled by means of Euclidean graphs. In the case of wireless sensor networks, the overall topology of the graph is not known because sensor nodes are often randomly deployed. One of the significant problems in this field is the search for boundary nodes. This problem is important in cases such as the surveillance of an area of interest, image contour reconstruction, graph matching problems, routing or clustering data, etc. In the literature, many algorithms are proposed to solve this problem, a recent one of which is the least polar‐angle connected node (LPCN) algorithm and its distributed version D‐LPCN, which are both based on the concept of a polar angle visit. An inconvenience of these algorithms is the determination of the starting vertex. In effect, the point with the minimum x ‐coordinate is a possible starting point, but it has to be known at the beginning, which considerably increases the algorithms' complexity. In this article, we propose a new method called RRLPCN (reset and restart with least polar‐angle connected node), which is based on the LPCN algorithm to find the boundary vertices of a Euclidean graph. The main idea is to start the LPCN algorithm from an arbitrary vertex, and whenever it finds a vertex with an x ‐coordinate smaller than that of the starting one, LPCN is reset and restarted from this new vertex. The algorithm stops as soon as it visits the same edge for the second time in the same direction. In addition to finding the boundary vertices, RRLPCN also finds the vertex with minimum x ‐coordinate, which is the last starting point of our algorithm. The distributed version of the proposed algorithm, called D‐RRLPCN, is then applied to boundary node detection in the wireless sensor network. It has been implemented using real sensor nodes (Arduino/XBee and TelosB). The simulation results have shown our algorithm to be very effective in comparison to other algorithms

Surveillance of sensitive fenced areas using duty-cycled wireless sensor networks with asymmetrical links

© 2018 Elsevier Ltd. This paper presents a cross-layer communication protocol for Wireless Sensor Network (WSN) enabled surveillance system for sensitive fenced areas, e.g., nuclear/oil site. Initially, the proposed protocol identifies the boundary nodes of the deployed WSN to be used as sentinel nodes, i.e., nodes that are always in active state. The remaining nodes are used as duty-cycled relay nodes during the data communication phase. The boundary nodes identification process and data routing are both performed using an enhanced version of the Greedy Perimeter Stateless Routing (GPSR) protocol, which relies on a Non Unit Disk Graph (N-UDG) and referred to as GPSR over Symmetrical Links (GPSR-SL). Both greedy and perimeter modes of GPSR-SL forward data through symmetrical links only. Moreover, we apply the Mutual Witness (MW) fix to the Gabriel Graph (GG) planarization, to enable a correct perimeter routing on a N-UDG. Simulation results show that the proposed protocol achieves higher packet delive ry ratio by up to 3.63%, energy efficiency and satisfactory latency when compared to the same protocol based on the original GPSR

Cross-layer approach for energy efficiency and reliability in Wireless Sensor Networks dedicated to Critical Applications of Surveillance

Les Réseaux de Capteurs Sans Fil (RCSFs) constituent une classe particulière des réseaux Ad hoc, faisant l'objet de recherches intensives. Ils sont considérés comme un outil très puissant pour connecter le monde physique et le monde numérique. Ils se composent d'un grand nombre de noeuds capteurs dotés de ressources limitées en termes d'énergie, de portée de capture et de communication, de vitesse de traitement et de capacité de stockage. Ils sont déployés dans un environnement intérieur ou extérieur, et ce dans de nombreux domaines d'application tels que l'armée, l'environnement, la santé, la maison et l'agriculture. La rareté des ressources des noeuds capteurs et la non fiabilité des liaisons sans fil motivent la plupart des problématiques dans le domaine des RCSFs, à savoir l'énergie, la couverture, la connectivité, le routage, la tolérance aux pannes et la sécurité. L'objectif de cette thèse est de proposer un protocole de surveillance inter-couches, à efficacité énergétique et fiable, pour la surveillance des zones sensibles clôturées, tel qu'un site pétrolier ou nucléaire, utilisant les réseaux de capteurs sans fil avec un cycle d'activité, et avec prise en compte des liens asymétriques dus au phénomène de l'irrégularité de la radio. Initialement, le protocole proposé identifie les noeuds de bordure du RCSF pour les utiliser comme nœuds sentinelles, c.-à-d., des noeuds qui sont toujours dans un état actif. Les noeuds restants sont utilisés en tant que noeuds relais avec un cycle d'activité, pendant la phase de routage des alertes vers le noeud puits. Le processus d'identification des noeuds de bordure ainsi que le routage des alertes, sont assurés par le protocole Greedy Perimeter Stateless Routing through Symmetrical Links (GPSR-SL) qui est une version améliorée du protocole GPSR, reposant sur un graphe de connectivité représenté sous forme de disques non-unité (N-UDG). Le protocole de surveillance inter-couches proposé a été implémenté et ses performances ont été évaluées en utilisant l'environnement de simulation OMNeT++/Castalia. Les résultats de performance montrent que ce protocole permet d'obtenir un ratio de livraison de paquets plus élevé d'environ 3.63%, une efficacité énergétique et une latence satisfaisante par rapport au même protocole basé sur le GPSR original.Wireless Sensor Networks (WSNs) are a special class of Ad hoc networks, which are under intensive research.They are considered as a very powerful tool to connect the physical and the digital worlds. They consist of a largenumber of sensor nodes that are characterized with limited resources in terms of energy, range of sensing and communication, processing speed and storage capacity.They are deployed in an indoor or outdoor environment in many application domains such as army, environment, health, home and agriculture. The scarcity of sensor node resources and the unreliability of wireless links drive most of the research issues in the field of WSNs, namely energy, coverage, connectivity, routing, fault tolerance and security. The aim of this thesis is to propose an energyefficient and reliable cross-layer surveillance protocol for sensitive fenced areas, such as oil or nuclear sites, using duty-cycled WSNs with asymmetrical links due to the radio irregularity phenomenon. Initially, the proposed protocol identifies the boundary nodes of the deployedWSN, to be used as sentinel nodes, i.e., nodes that are always in an active state. The remaining nodes are usedas duty-cycled relay nodes during the routing phase to relay alerts towards the sink. The boundary nodes identification process and alert routing are both performed using an enhanced version of the Greedy Perimeter Stateless Routing (GPSR) protocol, referred to as GPSR over Symmetrical Links (GPSR-SL) and which relies on a Non Unit Disk Graph (N-UDG). The proposed cross-layer surveillance protocol has been implemented and its performance has been evaluated under the OMNeT++/Castalia simulation environment. Performance results show that this protocol achieves higher Packet Delivery Ratio by up to 3.63%, energy .efficiency and satisfactory latency when compared to the same protocol based on the original GPSR

Approche inter-couches pour l'économie d'énergie et la fiabilité dans les Réseaux de Capteurs Sans Fil dédiés aux Applications Critiques de Surveillance

Wireless Sensor Networks (WSNs) are a special class of Ad hoc networks, which are under intensive research.They are considered as a very powerful tool to connect the physical and the digital worlds. They consist of a largenumber of sensor nodes that are characterized with limited resources in terms of energy, range of sensing and communication, processing speed and storage capacity.They are deployed in an indoor or outdoor environment in many application domains such as army, environment, health, home and agriculture. The scarcity of sensor node resources and the unreliability of wireless links drive most of the research issues in the field of WSNs, namely energy, coverage, connectivity, routing, fault tolerance and security. The aim of this thesis is to propose an energyefficient and reliable cross-layer surveillance protocol for sensitive fenced areas, such as oil or nuclear sites, using duty-cycled WSNs with asymmetrical links due to the radio irregularity phenomenon. Initially, the proposed protocol identifies the boundary nodes of the deployedWSN, to be used as sentinel nodes, i.e., nodes that are always in an active state. The remaining nodes are usedas duty-cycled relay nodes during the routing phase to relay alerts towards the sink. The boundary nodes identification process and alert routing are both performed using an enhanced version of the Greedy Perimeter Stateless Routing (GPSR) protocol, referred to as GPSR over Symmetrical Links (GPSR-SL) and which relies on a Non Unit Disk Graph (N-UDG). The proposed cross-layer surveillance protocol has been implemented and its performance has been evaluated under the OMNeT++/Castalia simulation environment. Performance results show that this protocol achieves higher Packet Delivery Ratio by up to 3.63%, energy .efficiency and satisfactory latency when compared to the same protocol based on the original GPSR.Les Réseaux de Capteurs Sans Fil (RCSFs) constituent une classe particulière des réseaux Ad hoc, faisant l'objet de recherches intensives. Ils sont considérés comme un outil très puissant pour connecter le monde physique et le monde numérique. Ils se composent d'un grand nombre de noeuds capteurs dotés de ressources limitées en termes d'énergie, de portée de capture et de communication, de vitesse de traitement et de capacité de stockage. Ils sont déployés dans un environnement intérieur ou extérieur, et ce dans de nombreux domaines d'application tels que l'armée, l'environnement, la santé, la maison et l'agriculture. La rareté des ressources des noeuds capteurs et la non fiabilité des liaisons sans fil motivent la plupart des problématiques dans le domaine des RCSFs, à savoir l'énergie, la couverture, la connectivité, le routage, la tolérance aux pannes et la sécurité. L'objectif de cette thèse est de proposer un protocole de surveillance inter-couches, à efficacité énergétique et fiable, pour la surveillance des zones sensibles clôturées, tel qu'un site pétrolier ou nucléaire, utilisant les réseaux de capteurs sans fil avec un cycle d'activité, et avec prise en compte des liens asymétriques dus au phénomène de l'irrégularité de la radio. Initialement, le protocole proposé identifie les noeuds de bordure du RCSF pour les utiliser comme nœuds sentinelles, c.-à-d., des noeuds qui sont toujours dans un état actif. Les noeuds restants sont utilisés en tant que noeuds relais avec un cycle d'activité, pendant la phase de routage des alertes vers le noeud puits. Le processus d'identification des noeuds de bordure ainsi que le routage des alertes, sont assurés par le protocole Greedy Perimeter Stateless Routing through Symmetrical Links (GPSR-SL) qui est une version améliorée du protocole GPSR, reposant sur un graphe de connectivité représenté sous forme de disques non-unité (N-UDG). Le protocole de surveillance inter-couches proposé a été implémenté et ses performances ont été évaluées en utilisant l'environnement de simulation OMNeT++/Castalia. Les résultats de performance montrent que ce protocole permet d'obtenir un ratio de livraison de paquets plus élevé d'environ 3.63%, une efficacité énergétique et une latence satisfaisante par rapport au même protocole basé sur le GPSR original

Energy Efficient Approach for Wireless Sensor Networks Dedicated to Surveillance

International audienc

Finding the polygon hull in wireless sensor networks

EURO 2015 - 27th European Conference on Operational Research, University of Strathclyde, Glasgow, Scotland, 12-15 July 2015Finding the border of a wireless sensor network (WSN) is one of the most important issues today. This border can be used, for example, to monitor a frontier or a secured place of sensitive sites of a country. One of the methods that can be useful for this kind of problems is Jarvis algorithm which has to be adapted to take account of connected nodes in a Euclidean graph. For this kind of networks, the complexity is reduced from O(nh) to O(kh2), where n is the number of sensors, k is the maximum number of neighbors of a sensor in the network and h is the number of sensors of the envelope. The application of this algorithm to WSNs allows in each iteration to determine the next boundary neighbor of the current node. The advantage of this procedure is that each node knows its neighbor in a single operation. Then, each boundary node will periodically send a message to its neighbor, which should respond. If a response is not received, a situation of failure or intrusion will be triggered and network restructuring will be launched to find a new border. In this work, we have shown that the application of this algorithm in the presence of sub-absorbent graphs can lead to an infinite loop situation. We have also shown how to overcome this situation and how the algorithm can be applied to the case of WSNs.Science Foundation IrelandInsight Research Centr

Multi-objective Optimisation of Wireless Sensor Networks Deployment: Application to fire surveillance in smart car parks

International audience<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtThe exponential growth of the Internet-of-Things&nbsp;</span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gt(IoT) technology paradigm has resulted in new applications a</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtnd on-line services. Smart car park is one interesting example&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtamong others that can take advantage of applications based&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gton wireless sensor networks (WSNs) Which constitute the core&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtof IoT. This paper focuses on the deployment optimization&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtproblem of WSNs dedicated to the fire detection in a smart&nbsp;</span&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtcar park. In such networks, the nodes are classified into two&nbsp;</span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtcategories: Sensor Nodes (SNs) deployed within the smart car&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtpark for targets coverage and Relay Nodes (RNs) whose task&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtis to relay alert messages generated by the sensor nodes up&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtto the sink node. In this study, we propose a Multi-Objective&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtBinary Integer Linear Programming (MOBILP) which minimizes&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtsimultaneously the number of sensor nodes, relay nodes and&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtthe maximum distance from sensor nodes to the sink node,&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtwhile ensuring coverage and connectivity. We have conducted</span&gt</div&gt<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtextensive tests in order to evaluate the performance of our&nbsp;</span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtproposal. The results demonstrate that the MOBILP outperforms&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtthe existing approaches in terms of quality of solutions compared&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtto a sequential deployment method, which consists to deploy&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtSNs then RNs, and in terms of the ability to find other efficient&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtsolutions compared to a simultaneous deployment method using&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gta mono-objective function, which consists to deploy SNs and RNs&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtsimultaneously.</span&gt</div&g

Minimal Node Deployment in Wireless Sensor Networks Under Coverage and Connectivity Constraints

International audienceMinimal Node Deployment in Wireless Sensor Networks Under Coverage and Connectivity Constraint