scholarly journals Distributed partition detection and recovery using UAV in wireless sensor and actor networks

2021 ◽  
Vol 48 (4) ◽  
Author(s):  
Aditi Zear ◽  
◽  
Virender Ranga ◽  
Keyword(s):  
Network Performance ◽  
Optimal Solution ◽  
Network Connectivity ◽  
Recovery Process ◽  
Wireless Sensor ◽  
Sink Node ◽  
Real Time Control ◽  
Network Nodes ◽  
Actor Networks ◽  
Message Overhead

Wireless Sensor and Actor Networks (WSANs) have been extensively employed in various domains ranging from elementary data collection to real-time control and monitoring for critical applications. Network connectivity is a vital robustness measure for overall network performance. Different network functions such as routing, scheduling, and QoS provisioning depends on network connectivity. The failure of articulation points in the network disassociates the network into disjoint segments. We proposed Distributed Partition Detection and Recovery using Unmanned Aerial Vehicle (UAV) (DPDRU) algorithm, as an optimal solution to recover the partitioned network. It consists of three steps: Initialization, Operational and Detection, and Recovery. In the Initialization phase sink node collects all the information about the network. In the Operational and Detection phase, network nodes communicate regularly by exchanging HEARTBEATS, detects failure if some nodes do not get a message from the neighbor node and send failure reports, and sink node identifies network partition. In the recovery phase, the sink node sends UAV at the positional coordinates of the failed node and examines network recovery after UAV reaches the desired location. Our approach primarily focuses on reducing message overhead by sending few update messages to sink node and energy consumption by engaging network nodes only for communication. The requirements of the recovery process (physical movement and communication) are fulfilled by UAV. The algorithm is tested according to the following parameters: Detection Time, Recovery Time, message overhead, and distance traveled by UAV. Simulation results validate the efficacy of the proposed algorithm based on these parameters to provide reliable results. The minimum and the maximum number of messages transmitted are 11 for 10 nodes and 24 for 100 nodes respectively. Hence these results demonstrate that the message overhead in our proposed solution is less as compared to other techniques when the number of nodes increases.

A Self-Healing Connectivity Recovery Algorithm in Wireless Sensor-Actor Networks

2014 ◽  
Vol 668-669 ◽  
pp. 1219-1222
Author(s):  
Lei Yao ◽  
Dong Dong Xu ◽  
Jie Zhou ◽  
Jing Lin Du
Keyword(s):  
Search Algorithm ◽  
Network Connectivity ◽  
Recovery Process ◽  
Wireless Sensor ◽  
Self Healing ◽  
Recovery Algorithm ◽  
Best Response ◽  
Actor Networks ◽  
The Individual ◽  
Minimal Block

Wireless sensor and actor networks (WSANs) additionally employ actor nodes within the wireless sensor network (WSN) which can process the sensed data and perform certain actions based on this collected data. In most applications, inter-actor coordination is required to provide the best response. One actor failure may lead to partitioning the inter-actor networks, tolerating the actor failure and restoring the lost connectivity need to be performed while imposing the least overhead on the individual actors autonomously. In this paper, we present a Self-healing Connectivity Recovery Algorithm (SCRA) which is to recover the failure actor. SCRA proactively identifies actors whether is a cut vertex or not to the network connectivity based on the depth-first search algorithm (DFS), and designates a minimal CDS backup nodes. If an actor node suddenly fails, the minimal block backup nodes move and initiate a recovery process until the network is reconnected. Through simulated experiments, the results show that the algorithm is more effective than present algorithms in terms of total travel distance, and total number of messages.

Fault Tolerance Model for Efficient Actor Recovery Paradigm in WSAN

2021 ◽  
pp. 486-503
Author(s):  
Reem Khalid Mahjoub ◽  
Khaled Elleithy
Keyword(s):  
Fault Tolerance ◽  
Network Performance ◽  
Wireless Sensor ◽  
Network Integration ◽  
Node Failure ◽  
Failure Avoidance ◽  
Tolerance Model ◽  
Actor Networks ◽  
Selection Algorithms ◽  
Critical Node Detection

Wireless sensor and actor networks (WSAN) is an area where sensors and actors collaborate to sense, handle and perform tasks in real-time. Thus, reliability is an important factor. Due to the natural of WSAN, actor nodes are open to failure. Failure of actor nodes degrades the network performance and may lead to network disjoint. Thus, fault tolerance techniques should be applied to insure the efficiency of the network. In an earlier work, the authors proposed an efficient actor recovery paradigm (EAR) for WSAN which handles the critical actor node failure and recovery while maintaining QoS. EAR is supported with node monitoring and critical node detection (NMCND), network integration and message forwarding (NIMF), priority-based routing for node failure avoidance (PRNFA) and backup selection algorithms. In this article, the authors extend the work by adding a fault tolerance mathematical model. By evaluating the model, EAR shows to manage fault tolerance in deferent levels. To evaluate the effectiveness, the EAR fault tolerance is evaluated by simulation using OMNET++ Simulation. In addition, EAR reliability is measured and compared with RNF, DPCRA, ACR, and ACRA.

scholarly journals Swarm-Intelligence-Centric Routing Algorithm for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5164
Author(s):  
Changsun Shin ◽  
Meonghun Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Performance ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Link Quality ◽  
Wireless Sensor ◽  
Control Message

The swarm intelligence (SI)-based bio-inspired algorithm demonstrates features of heterogeneous individual agents, such as stability, scalability, and adaptability, in distributed and autonomous environments. The said algorithm will be applied to the communication network environment to overcome the limitations of wireless sensor networks (WSNs). Herein, the swarm-intelligence-centric routing algorithm (SICROA) is presented for use in WSNs that aim to leverage the advantages of the ant colony optimization (ACO) algorithm. The proposed routing protocol addresses the problems of the ad hoc on-demand distance vector (AODV) and improves routing performance via collision avoidance, link-quality prediction, and maintenance methods. The proposed method was found to improve network performance by replacing the periodic “Hello” message with an interrupt that facilitates the prediction and detection of link disconnections. Consequently, the overall network performance can be further improved by prescribing appropriate procedures for processing each control message. Therefore, it is inferred that the proposed SI-based approach provides an optimal solution to problems encountered in a complex environment, while operating in a distributed manner and adhering to simple rules of behavior.

Performance Estimation of a Wireless Sensor Network with a Mobile Sink Moving in Different Trajectories at Different Velocities

2019 ◽  
Vol 13 ◽  
Author(s):  
Vikas Raina ◽  
Ranjana Thalore ◽  
Jeetu Sharma
Keyword(s):  
Network Lifetime ◽  
Duty Cycle ◽  
Network Performance ◽  
Mobile Sink ◽  
Mac Protocols ◽  
Wireless Sensor ◽  
Sink Node ◽  
Circular Trajectory ◽  
Optimum Performance ◽  
Lawn Mower

Background: Throughout the past few years numerous Medium Access Control (MAC) protocols, routing protocols, node deployment mechanisms and duty cycle variation schemes have been designed for achieving high throughput, low delay and jitter, and long network lifetime in Wireless Sensor Networks (WSNs). In a WSN with static sink, voluminous sensors transmit their sensed data to the sink node. The coordinators mutually present in the range of sensors and sink have to forward the plentiful of packets which causes rapid depletion of their battery. These coordinators become dead too early resulting in the breakage of communication channel and formation of energy holes. However, to save energy with static sink the duty cycle should be short. A mobile sink is a better option than a static sink if the duty cycle is long, as it balances energy consumption among the sensors. It is well observed that mobile sink is capable of acquiring homogeneous energy depletion leading to stretched lifetime enhancing network performance. Method: The vital benefaction of this paper is to present a simulation based analysis of the network performance with a mobile sink having different trajectories of path traversed at different velocities. The intent is to find out the most appropriate and efficient trajectory and a particular velocity for a specific WSN with 100 nodes. The terrain area of the network is 210×210 m2 with the communication range of 20 m. The routing, network and MAC protocols implemented are Ad hoc On-Demand Distance Vector (AODV), Internet Protocol version 4 (IPv4) and Institute of Electrical and Electronics Engineers (IEEE) 802.15.4 respectively. This paper has evaluated and analyzed the influence of lawn mower, elliptical and circular trajectories of a mobile sink moving at the different velocities of 0.5, 1 and 2 m/s. The optimum performance is achieved at the velocity of 2 m/s for circular trajectory of the mobile sink. It is observed that performance has significantly varied with the variation of trajectories and velocities. The notion of precise utilization of sink mobility improves the performance than a static sink. It is equally important to determine the most effective mechanism to implement mobile sinks and to find out the most appropriate scheme out of them. Results: The attainment parameters just as total messages received, average end to end delay (seconds), jitter (seconds), throughput (bits per second), number of packets dropped, number of packets dropped due to channel access failure, residual battery (mAh) and network lifetime (hours) for different trajectories such as lawn mower, elliptical and circular at different speeds of 0.5, 1 and 2 m/s of the sink node are evaluated and compared. The simulation results present that the circular trajectory and the velocity of 2 m/s has provided the optimum performance. Conclusion: The objective is to precisely analyze and evaluate the influence of different trajectories of a mobile sink moving at different velocities in a WSN of 100 nodes to determine the most effective and appropriate trajectory and velocity to optimize the attainments. The intent is to uniform the power exhaustion amidst the sensors. The purpose is to gain the attention of researchers to this field to significantly contribute in novel research.

scholarly journals A Network Topology Control Algorithm Based on Mobile Nodes

2016 ◽  
Vol 12 (10) ◽  
pp. 76
Author(s):  
Huarui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Network Topology ◽  
Topology Control ◽  
Control Algorithm ◽  
Network Performance ◽  
Network Connectivity ◽  
Node Degree ◽  
Mobile Nodes ◽  
Network Nodes ◽  
Local Topology

<p style="margin: 0in 0in 10pt;"><span style="font-family: Times New Roman; font-size: small;">Topology control is of great significance to reduce energy consumption of wireless sensor network nodes and prolong network lifetime. Different tasks taken by nodes may lead to node failures and fractures of data transmission links, hence undermining the overall network performance. In response to such problems, this paper presents a network topology control algorithm based on mobile nodes that fully considers node energy, node degree and network connectivity. Furthermore, a topology control model is established to analyze weak network topology areas and carry out local topology refactoring. Finally, a simulation experiment demonstrates that the presented algorithm is advantageous in balanced network energy consumption and network connectivity.</span></p>

scholarly journals Secure Hash Authentication And Cryptography Based Geographical Routing (SHAC-GR) For Wireless Sensor Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 2238-2247
Keyword(s):  
Network Performance ◽  
Trust Model ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Matlab Simulation ◽  
Neighboring Node ◽  
Geographical Routing ◽  
Security Issues

The expeditious growth in manufacturing anvils industries has lead towards the development of tiny devices. This growth has motivated to develop small and battery-operated sensor nodes that are widely adopted for establishing the reliable wireless communication. The wireless sensor based communication is generally divided into hierarchal and geographical deployment. Hierarchical system based approaches are widely studied in this field, limited work is present in the field of geographical WSN. In this work, we focus on the geographical WSN. Generally, these networks suffer from energy efficiency and security related issues. Hence, in this work we preset a combined approach to address these challenges. In order to mitigate the energy sparsity issue, we develop geographical routing scheme which selects the neighboring node based on residual energy of the node and distance from the sink node i.e. the maximum residual energy node from the neighboring node which is having less distance from the sink node is selected as next-hop. Due to this approach, the path computation and other network parameters computation is not required hence it reduces the power consumption. Further, we address the security issues where we present Hash modeling to secure the location, Key Exchange model for authentication by using ECDH approach , later we present ECIS based encapsulation method for data security and finally, a trust model based security system is developed. The trust computation of node helps to the routing whether to select the node for next hop or not. This multistage security approach is called as Secure Hash, Authentication and Cryptography based geographical routing (SHAC-GR) protocol. The proposed approach is simulated using MATLAB simulation tool and the performance of proposed approach is compared with existing technique that shows that the proposed approach improves the network performance in terms of network lifetime, energy and packet delivery rate.

scholarly journals WSN Optimization Algorithm for Traffic Environmental Monitoring

2018 ◽  
Vol 14 (12) ◽  
pp. 72 ◽  
Author(s):  
Li Zhu ◽  
Jianwu Li
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Optimization Algorithm ◽  
Network Performance ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Traffic Information ◽  
Network Coverage ◽  
Remote Supervision ◽  
Traffic Environment

In accordance with the features of variety and disparity of traffic information, using wireless sensor network to monitor traffic environment, this paper proposes an optimization algorithm of applying wireless sensor to monitor traffic environment. In this paper, to optimize the coverage, we analyze the irregularity of network sensing areas based on environmental factors and propose a wireless sensor network optimization algorithm. According to the irregularity of network node sensing areas, we build an irregular network coverage model, divide the node monitoring area to improve the network coverage and make corrections to the coverage according to the network coverage connectivity and other features. The simulation test proves that the method proposed in this paper can avoid too many redundant nodes - it only requires a reasonable number of network nodes. This will reduce network energy costs and increase network connectivity without affecting the coverage, thus improving the network performance. the algorithm can satisfy the requirements of real-time acquisition, processing and remote supervision of traffic information.

scholarly journals SIMULATION OF ENERGY CONSUMPTION IN MULTI CLUSTER WIRELESS SENSOR NETWORKS

2018 ◽  
pp. 22-26
Author(s):  
S. I. Pella
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Performance ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Cluster Network ◽  
Cluster Networks ◽  
Energy Conserving ◽  
Single Cluster

Energy conserving protocols in wireless sensor networks (WSNs), such as S-MAC, introduce multi-cluster network. The border nodes in multi cluster WSNs have more active time than the other nodes in the network; hence have more energy depletion rate. Since battery replacement in most networks is considered difficult, one or more nodes running out of energy prematurely will affect the network connectivity and decrease the overall network performance severely. This paper aims to (1) analyze the energy consumption in a multi-cluster sensor network and compare it to the single cluster scenario (2) investigate the merging time in a single cluster network. The result shows that, in average the energy needed to deliver a packet in the multi cluster networks is about 150% more than the energy needed in the single cluster networks. Moreover, the merging time in the single cluster network using schedule offset as the merging criteria in average is slightly smaller than one in the network using schedule ID as the merging criteria.

Voting Median Base Algorithm for Measurement Approximation of Wireless Sensor Network Performance

2014 ◽  
pp. 360-382
Author(s):  
Nazar Elfadil ◽  
Yaqoob J. Al-Raisi
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Performance Monitoring ◽  
High Reliability ◽  
Wireless Sensor ◽  
Network Nodes ◽  
External Conditions ◽  
Processing And Storage ◽  
Network Functionality

The success of Wireless Sensor Network application monitoring relies on the accuracy and reliability of its nodes operation. Unfortunately, operation deviations of these nodes appear as regular occurrences not isolated events as in traditional networks. This is due to their special characteristics that reduce network manufacturing and deployment costs and maintain the nodes immunity against internal and external conditions. The goal of this chapter is to propose a real-time, distributed, passive, and low resources usage performance-monitoring algorithm that monitors Wireless Sensor Network functionality and isolates the detected deviated nodes from norm operation. Simulation and empirical experiments showed that the proposed algorithm has a slight processing and storage overhead. It is important to mention that these experiments showed that the proposed algorithm has a high reliability in tracking and isolating network nodes problems.

scholarly journals Application-Oriented Fault Detection and Recovery Algorithm for Wireless Sensor and Actor Networks

2012 ◽  
Vol 8 (10) ◽  
pp. 273792 ◽  
Author(s):  
Jinglin Du ◽  
Li Xie ◽  
Xiaoyan Sun ◽  
Ruoqin Zheng
Keyword(s):  
Fault Detection ◽  
Recovery Process ◽  
Wireless Sensor ◽  
Node Failure ◽  
Optimal Position ◽  
Recovery Algorithm ◽  
Critical Node ◽  
Actor Networks ◽  
Application Requirements ◽  
The Impact

Recent years have witnessed a growing interest in applications of wireless sensor and actor networks (WSANs). In WSANs, maintaining interactor connectivity is of vital concern in order to reach application level. Failure of a critical actor may partition the inter-actor network into disjoint segments. This paper proposed an application-oriented fault detection and recovery algorithm (AFDR), a novel distributed algorithm to reestablish connectivity. AFDR identifies critical actors and designates backups for them. A backup actor detects the critical node failure and initiates a recovery process via moving to the optimal position. The purpose of AFDR is to satisfy application requirements, reduce recovery overhead, and limit the impact of critical node failure on coverage and connectivity to the utmost. The effectiveness of AFDR is validated through simulation experiments.

Sign in / Sign up

Export Citation Format

Share Document