Survivability Of Wireless Sensor Networks Research Articles

Trust aware oppositional sine cosine based multihop routing protocol for improving survivability of wireless sensor network

Wireless Sensor Network (WSN) plays an important role in digital era due to its applicability in a wide range of applications such as military, smart city, healthcare, etc. Since the nodes in WSN experience power constraints and function via wireless connections, network survivability becomes a major design issue. Energy efficiency and secure data transmission are the most important solutions to be accomplished to enhance WSN survivability. The recent phenomena like Artificial Intelligence (AI) and metaheuristics can be involved in designing effective routing protocols. With this motivation, the current research paper presents a novel Trust Aware Oppositional Sine Cosine-based Multihop Routing (TAOSC-MHR) protocol to improve the survivability of WSNs. The major goal of the proposed TAOSC-MHR protocol is to increase the network's survivability by assuring trust and energy efficiency. Primarily, a weighted clustering scheme is applied to partition the network into clusters after which the Cluster Heads (CHs) are selected. Besides, TAOSC-MHR protocol involves an optimal route selection technique i.e., Oppositional Based Learning (OBL) concept with Sine Cosine Optimization (SCO) algorithm. In order to derive the optimal routes in WSN, the proposed TAOSC-MHR protocol derives an objective function with the inclusion of three parameters namely, residual energy, distance, and trust level of nodes. The design of trust aware routing protocol using OBL with SCO algorithm demonstrates the novelty of the study. A wide range of simulation analyses was conducted under different network scenarios and the obtained results signify the promising performance of the proposed technique over other techniques.

Energy aware fault tolerant clustering with routing protocol for improved survivability in wireless sensor networks

Wireless Sensor Networks (WSN) remain a hot research topic due to its wide range of application areas like environmental monitoring, military surveillance, healthcare, and disaster management. Network survivability is one of the challenging issues in WSN that needs to be maximized for long-run operation of the network. It can be proficiently improved by effective utilization of available energy since the nodes in WSN operate only via in-built batteries. The studies conducted earlier have mainly focused on the design of clustering and routing protocols to reduce energy consumption in the network. With this motivation, the current research paper presents a novel Energy-Aware Fault Tolerant Clustering with Routing for Improved Survivability (EAFTC-RIS) technique in WSN. The proposed EAFTC-RIS technique intends to select the Cluster Heads (CHs) and optimal routes to the destination in an optimal manner with fault tolerant mechanism. The proposed EAFTC-RIS technique primarily designs Moth Flame Optimization (MFO)-based clustering scheme for CH selection and cluster construction. Also, fault tolerant mechanism is considered to further enhance the survivability of the network. In addition, Social Spider Optimization (SSO)-based routing approach is also employed for optimal selection of routes in WSN. Clustering, routing, and fault tolerant mechanism designs, with multiple input variables, result in enhanced network survivability. The proposed EAFTC-RIS technique was validated for its performance and the outcomes were inspected under various aspects. The simulation outcomes demonstrate the superiority of EAFTC-RIS technique over recent approaches namely, EAFTC-RIS, FUCCAR-GWSO, FBECS, MLSLEEP, and Bee Cluster.

Research on the tenacity survivability of wireless sensor networks

Nodes of wireless sensor networks due to environmental influences and deliberate attacks by nodes in the network, nodes of wireless sensor network are prone to death. In this paper, based on the idea of algorithm fusion, this paper proposes a research method for survivability of wireless sensor networks based on tenacity. A hybrid algorithm based on simulated annealing algorithm and particle swarm optimization algorithm is used to calculate the value of the tenacity of the network node. The optimized algorithm reduces the time and complexity of calculating tenacity. In this paper, the wireless sensor network is simulated and verified. The experimental results demonstrate the feasibility of evaluating the survivability of wireless sensor networks. The proposed method can effectively improve network lifetime and data transmission capability.

A novel SMP-based survivability evaluation metric and approach in wireless sensor network

In Industrial Internet of Things (IIoT) device and network, wireless sensor network (WSN) is an important component. Routing protocol is the critical component of WSN. As the WSN may be attacked by all kinds of intruders, the survivability of WSN is important to IIoT security. To precisely evaluate the systematic survivability ability under external attack and internal security mechanism, a novel survivability entropy-based quantitative evaluation metric is proposed to calculate the systematic survivability ability of WSN routing protocol. Numerical analysis and simulation experiments are combined to precisely calculate the survivability entropy metric. To validate the evaluation approach, NS2 (Network simulator) is used to simulate the DoS attack and security mechanism in WSN. Experimental results show that the novel survivability evaluation metric and method can precisely evaluate the systematic survivability ability of WSN.

SECURE AND AUTHENTICATED KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORK

Information security in frame less wireless sensor networks (WSNs) is one of the most significant research challenges. Encryption and key distribution are significant primitives to build secure Wireless Sensor Networks (WSN). A large amount of dissimilar key distribution schemes were implemented, targeting different types of WSNs. In these networks, sensor nodes are typically speckled liberally in the field in order to monitor, gather, disseminate, and deliver the sensed data to the control node. Various studies have listening carefully on key establishment schemes in homogeneous WSNs. However, recent investigation has shown that achieving survivability in WSNs requires a hierarchy and heterogeneous substructure. In this research, to address security issues in the assorted WSNs, propose a secure clustering scheme called Attribute based Encryption (ABE) along with a deterministic pair-wise key administration scheme based on public key cryptography and attribute based encryption algorithm. The proposed security device guarantee that any two sensor nodes positioned in the same cluster and routing path can directly establish a pair-wise key without disclosing any material to other nodes. Through safekeeping performance evaluation, it is shown that the proposed scheme guarantee node-to-node validation, high resiliency against node capture, and minimum remembrance space requirement.

Opportunistic Cooperative Sensing for Indoor Complex Environment Monitoring

ensor nodes vulnerable becomes a major bottleneck restricting the wide application of wireless sensor networks WSNs (Wireless Sensor Networks). In order to satisfy the needs of industrial production and daily living environment monitoring, it is important to improve the survivability of wireless sensor networks in environmental monitoring application. In order to have a reliable environment monitoring system, this paper analyzed the damage types and causes of WSNs and the measurement methods of WSNs survivability. Then, we studied the fault detection method and finally realized the design can improve the survivability of the scheme. The robust guarantee scheme through hardware design and algorithm model, realized the remote wireless communication services and prolonged the network life cycle, so as to improve the survivability of the environmental monitoring system.

Distributed Data Storage Systems for Data Survivability in Wireless Sensor Networks using Decentralized Erasure Codes

Achieving reliability in Wireless Sensor Networks (WSNs) is challenging due to the limited resources available. In this study, we investigate the design of data survivability schemes using decentralized storage systems in WSNs. We propose a data storage system design based on Decentralized Erasure Codes (DEC) that features a simple and decentralized construction of the target code. The proposed framework allows sensor nodes to cooperate to build an erasure code-based storage that can tolerate a given failure/erasure rate. Code construction and decoding can both be performed randomly allowing for a distributed operation with no prior setup or coordination between source nodes. Further, we present two approaches that utilize Random Linear Network Coding (RLNC) to enhance the proposed scheme in order to achieve energy efficiency. We present the theoretical basis of the schemes then validate and evaluate their performance through simulations.

Passive Distributed Clustering Scheme in Wireless Sensor Networks

Energy efficiency is especially important for the cluster of the wireless sensor network (WSN). This paper studies how to increase availability and survivability of WSN by selecting a suitable cluster head. For this purpose, we propose a passive distributed clustering scheme (PDCS), to promote the efficiency of energy utilization. In PDCS, both the relative distance and the residual energy are taken into consideration for cluster head selection. Simulation results present that PDCS has better performance than the well-known LEACH scheme.

A survivability model in wireless sensor networks

In this paper, we present a survivability evaluation model and analyze the performance of Wireless Sensor Networks (WSNs) under attack and key compromise. First, we present a survivability evaluation model of WSNs by representing the states of WSNs under attack. Here, the survivability of WSNs is expressed as a continuous time Markov Chain to describe the status of real WSNs. We propose a threshold condition to trigger the transition between the states of WSNs in the face of DoS attack. According to the threshold conditions, the survivability model is capable of taking action(s) and enables the formalization of the effect of action(s). We present an analytical model and numerical analysis to show the feasibility of our work in terms of availability, survivability, and cost.Second, we present a survivability model and evaluation of WSNs under key compromise. Sensor nodes in a network can be captured by an adversary. The compromised node can be identified by one of the intrusion detection mechanisms. After detecting the compromised node, the key in the node has to be revoked. In this paper, we present the effect of key compromise and key revocation in WSNs. We additionally present a survivability evaluation model using the SHARPE simulation tool in terms of availability.

Scale-free topology evolution for wireless sensor networks with reconstruction mechanism

How to improve survivability of wireless sensor networks (WSNs) is an important issue which has attracted much attention over recent years. In this paper, by resorting to complex network theories, we propose two models, namely, a linear growth evolution model (LGEM) and an accelerated growth evolution model (AGEM). In the model evolution processes, the following factors: node addition, node deletion, and link reconstruction that naturally arise from practical WSNs applications are considered. In addition, accelerated growth is introduced into the evolving processes of AGEM. Theoretical analysis shows that AGEM is an extension of the LGEM model, and AGEM is generally more flexible and accommodating in practice. Simulation results show that the degree distributions of two models have scale-free characteristics and the topologies generated by the two models show a good survivability under random and deliberate attacks.

Zone Based Routing Protocol for Homogeneous Wireless Sensor Network

Wireless Sensor Networks, are made of low-cost, low-power, small in size, and multifunctional sensor nodes. The efficient energy utilization is one of the important performance factors for wireless sensor networks survivability be-cause nodes operate with limited battery power. In this paper we propose and analyze a new approach of zone based clustering head selection algorithm for wireless sensor network of homogeneous nodes. Nodes in the network are uniformly distributed. In this clustering algorithm, network performance is improved by selecting cluster heads on the basis of the residual energy of existing cluster heads, and nearest hop distance of the node. In this paper we evaluate various performance metrics like energy consumption, network life time, number of channel heads metrics in each round and compare these with respect to random algorithm i.e. LEACH. We conclude that proposed protocol effectively extends the network lifetime without degrading the other critical overheads and perform-ance metrics.

Secure Clustering and Symmetric Key Establishment in Heterogeneous Wireless Sensor Networks

Information security in infrastructureless wireless sensor networks (WSNs) is one of the most important research challenges. In these networks, sensor nodes are typically sprinkled liberally in the field in order to monitor, gather, disseminate, and provide the sensed data to the command node. Various studies have focused on key establishment schemes in homogeneous WSNs. However, recent research has shown that achieving survivability in WSNs requires a hierarchy and heterogeneous infrastructure. In this paper, to address security issues in the heterogeneous WSNs, we propose a secure clustering scheme along with a deterministic pairwise key management scheme based on public key cryptography. The proposed security mechanism guarantees that any two sensor nodes located in the same cluster and routing path can directly establish a pairwise key without disclosing any information to other nodes. Through security performance evaluation, it is shown that the proposed scheme guarantees node-to-node authentication, high resiliency against node capture, and minimum memory space requirement.

Lifetime Analysis of Reliable Wireless Sensor Networks

A wireless sensor network is comprised of a large number of battery-limited sensor nodes communicating with unreliable radio links. The nodes are deployed in an ad hoc fashion and a reverse multicast tree is formed in the target domain. The sink node disseminates a query and collects responses from the sensors over pre-established links. Survivability in wireless sensor networks reflects the ability of the network to continue to detect events in the case of individual node failures. We present a sender initiated path switching algorithm that enables the immediate sender to change the packet's route dynamically when its parent on the reverse path is down. The overall effect of path switching on the survivability is analyzed as a measure of reliable event delivery. Using independent battery capacities, an analytical model of a multihop network is derived. The model is used to predict the maximum network lifetime in terms of total transmitted messages; which is in turn used to verify the correctness of our simulations. The results have revealed that dynamic path switching has a better performance than static multipath routing and salvaging schemes. It has also been shown that the proposed approach enhances reliability up to 30% in some topologies.