scholarly journals Management of Low-density Sensor-Actuator Network in a Virtual Architecture

2018 ◽  
Vol Volume 27 - 2017 - Special... ◽  
Author(s):  
Vianney Kengne Tchendji ◽  
Blaise Paho Nana
Keyword(s):  
Detection Algorithm ◽  
Base Station ◽  
Mobile Sensors ◽  
Wireless Sensor ◽  
Low Density ◽  
Nous Proposons ◽  
Virtual Architecture ◽  
Sensor Actuator ◽  
Area Of Interest ◽  
International Audience

International audience Wireless sensor networks (WSN) face many implementation’s problems such as connectivity, security, energy saving, fault tolerance, interference, collision, routing problems, etc. In this paper, we consider a low-density WSN where the distribution of the sensors is poor, and the virtual architecture introduced by Wadaa and al which provides a powerful and fast partitioning of the network into a set of clusters. In order to effectively route the information collected by each sensor node to the base station (sink node, located at the center of the network), we propose a technique based on multiple communication frequencies in order to avoid interferences during the communications. Secondly, we propose an empty clusters detection algorithm, allowing to know the area actually covered by the sensors after the deployment, and therefore, giving the possibility to react accordingly. Finally, we also propose a strategy to allow mobile sensors (actuators) to move in order to: save the WSN’s connectivity, improve the routing of collected data, save the sensors’ energy, improve the coverage of the area of interest, etc. Les réseaux de capteurs sans fil (RCSF) font face à de nombreux problèmes dans leur mise en oeuvre, notamment aux problèmes de connectivité des noeuds, de sécurité, d'économie d'énergie, de tolérance aux pannes, d'interférence, de collision, de routage, etc. Dans ce document, nous considérons un RCSF peu dense, caractérisé par une mauvaise couverture de la zone d'inté-rêt, et l'architecture virtuel introduite par Wadaa et al qui permet de partitionner efficacement ce type de réseau en clusters. Dans l'optique de router optimalement les informations collectés par chaque capteur jusqu'à une station de base (noeud sink, supposé au centre du réseau), nous proposons une technique d'utilisation des fréquences multiples pour limiter les interférences lors des communications. Ensuite, nous proposons un algorithme de détection de clusters vides permettant d'avoir une vue globale de la répartition réelle des capteurs dans la zone d'intérêt, et ainsi donner la possibilité de réagir en conséquence. Nous proposons également une stratégie de déplacement des capteurs mobiles (actuators) afin de: sauvegarder la connectivité du RCSF, optimiser le routage, économiser l'énergie des capteurs, améliorer la couverture de la zone d'intérêt, etc.

scholarly journals Robust Wireless Sensor Network Deployment

2016 ◽  
Vol Vol. 17 no. 3 (Distributed Computing and...) ◽  
Author(s):  
Milan Erdelj ◽  
Nathalie Mitton ◽  
Tahiry Razafindralambo
Keyword(s):  
Hexagonal Lattice ◽  
Mobile Sensors ◽  
Sensor Failures ◽  
Area Of Interest ◽  
Covered Area ◽  
International Audience ◽  
Available Information ◽  
Connectivity Maintenance ◽  
Wireless Mobile

International audience In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment. The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid. Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures. We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid. We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time.

Self-Powered Wireless Sensor Balls for Homeland Security

2007 ◽  
Author(s):  
Jaewook Yu ◽  
Woohyung Chun ◽  
Goldie Nejat ◽  
Eric Noel ◽  
K. Wendy Tang
Keyword(s):  
Energy Harvesting ◽  
Homeland Security ◽  
Sensory Information ◽  
Base Station ◽  
Wireless Sensor ◽  
Smart Power ◽  
Shortest Path Routing ◽  
Area Of Interest ◽  
Harvesting Technique ◽  
Self Powered

In this paper, the development of affordable self-powered wireless sensor balls is proposed for environmental monitoring. Depending on the area of interest, multiple balls can be either thrown or rolled from a distance into the surrounding area of interest or placed beside the object of interest, and send sensory information back to a central base station, i.e., a laptop, for sensor fusion and processing. In order to achieve fast and robust deployment, reliable data delivery, and smart power management, the paper focuses on the potential wireless network and energy harvesting scheme of the balls. In particular, to support a large number of sensor balls, we show that shortest path routing is essential in minimizing network latency and guarantee timely delivery of critical and emergency information. Furthermore, a vibration-based electromagnetic energy harvesting technique is investigated to capture the energy from the motion of the balls. Experimental results demonstrate the potential development of a network of autonomous self-powered wireless sensor balls.

Intelligent Water Drop Based Coverage-Connectivity and Lifespan Maximization Protocol for Wireless Sensor Networks

2019 ◽  
Vol 13 (3) ◽  
pp. 261-273
Author(s):  
R. Sharma ◽  
D.K. Lobiyal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Water Drop ◽  
Relay Node ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Coverage Ratio ◽  
Area Of Interest

Background: A significant issue of consideration in wireless sensor networks is to reduce the energy utilization while preserving the required coverage and connectivity of an area of interest. We have revised all patents relating to preserving of energy in sensor motes of the wireless sensor networks. Methods: We proposed a novel; Intelligent Water Drop based coverage-connectivity and lifespan protocol which minimizes energy consumption of the network. In this routing protocol, sensors are partitioned into the connected first layer and connected successive layer sets and a scheduling mechanism has been used to activate and deactivate sensors. Multi-hoping is used to transmit packets from sensors to the Base Station and sensor with maximum residual energy has been selected as the next hop. Power wastage has been avoided by removing duplicate information through a common relay node. Results: We have derived the expected number of sensors required to cover an area of interest and our protocol gives a long life to the network. A theorem has been provided to validate the results for different communication ranges of sensors. Conclusion: The protocol has been compared with other protocols and it proved better than other protocols in terms of the lifespan and the coverage ratio of the area. Results approve that our protocol reduces the problem of energy holes and maintains the connectivity of the network.

An Energy-Efficient Routing Mechanism (EERM) for Wireless Sensor and Actor Networks

2021 ◽  
Author(s):  
Muhammad Kashif Saeed ◽  
Khalid Mahmood ◽  
Mahmood Ul Hassan ◽  
Ansar Munir Shah ◽  
Jahangir Khan ◽  
...  
Keyword(s):  
Energy Efficient ◽  
Data Gathering ◽  
Research Area ◽  
Efficient Solutions ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Area Of Interest ◽  
Routing Mechanism ◽  
Actor Networks

Abstract Wireless Sensor and actor networks (WSANs) are the most vital research area in the wireless communication field. It consists of sensors, actors, and the base station, where actor nodes work as these networks' spine. The network's main objective is to sense the critical information from the area of interest and then send it to the base station. After that, it can make accurate decisions. This project proposes an Energy-Efficient Routing Mechanism (EERM) technique for the effective routing process. It works in three phases, which are Network initialization, data gathering, and routing. Once the node senses the data and tries to forward it to the base station, it chooses the sensor/ actor nodes from its neighbors having more energy and less distance towards the base station, a final node. As a result, there are significantly fewer chances of data loss due to battery depletion. Moreover, it confirms that there is no data duplication. After successful data transmission, the node will be set as in sleeping mode to save energy. EERM evaluates with other gossiping routing techniques like FELGossiping, ELGossiping, and LGossiping. It notices that there is less data packet loss in it. More nodes are alive in additional iterations due to energy-efficient solutions, which increases the network lifetime.

scholarly journals Majority Decision Aggregation with Binarized Data in Wireless Sensor Networks

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1671
Author(s):  
Fanpyn Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Contact Tracing ◽  
Redundant Data ◽  
Area Of Interest ◽  
Majority Decision ◽  
Rotation Scheme

Wireless sensor networks (WSNs) are the cornerstone of the current Internet of Things era. They have limited resources and features, a smaller packet size than other types of networks, and dynamic multi-hop transmission. WSNs can monitor a particular area of interest and are used in many different applications. For example, during the COVID-19 pandemic, WSNs have been used to measure social distancing/contact tracing among people. However, the major challenge faced by WSN protocols is limited battery energy. Therefore, the whole WSN area is divided into odd clusters using k-means++ clustering to make a majority rule decision to reduce the amount of additional data sent to the base station (or sink) and achieve node energy-saving efficiency. This study proposes an energy-efficient binarized data aggregation (EEBDA) scheme, by which, through a threshold value, the collected sensing data are asserted with binary values. Subsequently, the corresponding cluster head (CH), according to the Hamming weight and the final majority decision, is calculated and sent to the base station (BS). The EEBDA is based on each cluster and divides the entire WSN area into four quadrants. All CHs construct a data-relay transmission link in the same quadrant; the binary value is transferred from the CHs to the sink. The EEBDA adopts a CH rotation scheme to aggregate the data based on the majority results in the cluster. The simulation results demonstrate that the EEBDA can reduce redundant data transmissions, average the energy consumption of nodes in the cluster, and obtain a better network lifetime when compared to the LEACH, LEACH-C, and DEEC algorithms.

A Secure and Energy-Aware Routing Protocol for Optimal Routing in Mobile Wireless Sensor Networks (MWSNs)

2019 ◽  
Vol 9 (4) ◽  
pp. 507-520 ◽  
Author(s):  
Olakanmi Oladayo ◽  
Abbas Ashraf
Keyword(s):  
Routing Protocol ◽  
Communication Systems ◽  
Computational Cost ◽  
Base Station ◽  
Mobile Sensors ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Computational Power ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor

Background and Objective: Mobile Wireless Sensor Network (MWSN) is a specialized wireless network made up of large number of mobile sensors, where each sensor is capable of changing its location, relaying data to either the base station or neighbouring nodes. MWSN has emerged as a useful integral part of modern communication systems; however, its major performance challenges are lack of data delivery assurance due to mobility of its sensors, low computational power of its nodes, and some security related issues. Methods: Most of the existing WSN routing protocols are for non-mobile sensors and require considerably high computational power. Thus, not suitable for energy-constraint WSN with mobile sensors. Therefore, there is need for a secure protocol for MWSN with mechanisms that take into account the limited resources of the nodes and dynamism of its nodes’ locations. Results: In this paper, an efficient routing protocol for MWSN is proposed, not to only improve data delivery but to ensure reliability. This protocol is capable of selecting optimal multi-hop route among available routes for the source node and securely hops the data to the destination nodes through intermediary nodes. Formal and informal security analysis of the routing protocol is done to ascertain the required security level of the protocol. In addition, computational cost analysis is done to evaluate the computational cost of the protocol. Conclusion: The analysis results showed that the proposed protocol was secure and required low computational cost.

scholarly journals A2CDC: Area Coverage, Connectivity and Data Collection in Wireless Sensor Networks

2019 ◽  
Vol 10 (4) ◽  
pp. 20 ◽  
Author(s):  
Alain Bertrand Bomgni ◽  
Garrik Brel Jagho Mdemaya
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Information Need ◽  
Quality Of Data ◽  
Area Of Interest

Wireless sensor networks are increasingly being deployed in areas where several types of information need to be harvested. Monitoring a given area is one of the main goals of this technology. This consists in deploying sensor nodes in the Area of Interest (AoI) in order to detect any event occurring in this area, collect information and send them to the base station. However, in this type of configuration, the quantity and the quality of data collected are important factors in making better decisions by the end user. It therefore becomes crucial to deploy sensors in the AoI so that the latters can cover as much as possible the AoI, and propose mechanism to collect and send data to the base station while minimizing the energy consumption of the sensors. In this paper, we bring into focus a solution (A2CDC) to resolve this problem which performs in two main stages: in the first stage, we propose an algorithm that guarantees a maximal coverage of the AoI after a random deployment of static sensors and mobile sensors; and in the second stage, we propose a node activity scheduling that minimizes energy consumption of both static and mobile nodes while sending collected data to the base station. Compared to many other algorithms in the literature, our solution is better in term of coverage percentage of the AoI, data received by the base station and in term of energy minimization.

scholarly journals Spatial Correlation Based Clustering with dynamic CH Selection Scheme towards Enhanced QoS Metrics in Wireless Sensor Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 4264-4271
Keyword(s):  
Clustering Algorithms ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Selection Scheme ◽  
Data Routing ◽  
Area Of Interest ◽  
Efficient Data ◽  
Energy Efficient Clustering

Resource constrained wireless sensor nodes are generally randomly distributed in a given area of interest to sense required information and the sensed data is transmitted to the sink station or Base Station (BS) through various clustering and data routing algorithms. The standard clustering algorithms that are aimed at efficient data routing techniques are Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm , Distributed Energy Efficient Clustering (DEEC) algorithm, Stable Election Protocol (SEP) and various others. Most of these algorithms are the various variants of LEACH. Our proposed scheme of data gathering and routing is based on a two hop structure wherein the Cluster Leader (CL) forwards the aggregated received data from the Cluster members to the Sink directly. The Chance-value that determines the Cluster Leader in a round is decided by a combination of parameters specific to the Sensor nodes in the cluster. In our simulation approach we have also tried to analyze the effect of changing density of sensor nodes in the select area. Thus in our proposed scheme, we embark on a fixed Clustering scheme where the CL is selected dynamically so as to extend the network’s lifetime and achieve enhanced throughput in comparison to the standard algorithms like DEEC, SEP and LEACH.

scholarly journals Intrusion Detection Algorithm for Packet Loss Minimization in Wireless Sensor Networks

2019 ◽  
Vol 8 (6) ◽  
pp. 69-74
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Packet Loss ◽  
Detection System ◽  
Detection Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Abnormal Node

Wireless Sensor Network consists of a greater number of sensor nodes and recent advance is in wireless communications and it serves a backbone for controlling the real time applications. It consists of group of sensor nodes and that is sense the information from the event area and it is passes through the base station and which it reacts according to environment and to provide a large-scale monitoring and sensor measurement in a high temporal and the spatial resolution. The researcher uses a different algorithm in that they use a distributed energy fuzzy logic to reduce a packet loss. Wireless Sensor Networks are unprotected to many kinds of the security threats which can decrease the performance of network and cause the sensors to send wrong data to destination. The hostile node in the network is working as an attacker node and it takes all the information packets which is delivered through them. In this paper we propose an intrusion detection system algorithm against the packet dropping. Intrusion detection algorithm solves the problem by analyzing the network by detecting the abnormal node. Then the abnormal node is corrected into normal node with the help of intrusion detection algorithm.

Sign in / Sign up

Export Citation Format

Share Document