Hierarchical Fault Detection and Recovery Framework For Self-Healing WSN

Author(s):  
R. Anitha ◽  
Tapas Bapu B R ◽  
V. Nagaraju ◽  
Pradeep. S

Abstract Wireless Sensor Network (WSN) contains several sensor nodules that are linked to each other wirelessly. Errors in WSN may perhaps be because of several causes which bring about hardware damage, power thwarts, incorrect sensor impression, faulty communication, sensor deficiencies, etc. This damages the network process. In this paper, we propose to develop a Hierarchical Fault Detection and Recovery Framework (HDFR) for Self-Healing WSN. This framework consists of three modules: Fault detection, fault confirmation and fault recovery. In fault detection module, Particle Swarm Optimization (PSO) algorithm is applied for estimating the discrete Round Trip Paths (RTPs). Along the established RTPs, round trip delay (RTD) time values are estimated. Then based on the RTD, the suspected nodes are identified. In fault confirmation module, the nodes are confirmed to be either in FAULTY or ACTIVE state. In fault recovery module, the primary controller (PC) will establish an alternate route via the secondary controllers (SC) by excluding the faulty nodes. Then, it will resend the stored packets to the sink via the newly established route. By experimental results, it is shown that the HDFR framework achieves better detection accuracy and packet delivery ratio.

2021 ◽  
pp. 2150004
Author(s):  
ANKUR GOYAL ◽  
VIVEK KUMAR SHARMA ◽  
SANDEEP KUMAR ◽  
RAMESH CHANDRA POONIA

A MANET is a category of ad hoc protocol that could vary positions and track itself on the flutter. It utilizes wireless connections that are attached to several networks. They include wirelessly in a self-configured, self-healing network while not having permanent communication linked in a collection of mobile networks. The network topology of nodes typically varies in MANET, and nodes are free to stir errantly and independently as a router as they accelerate traffic to more nodes within the network. Ad hoc on-demand distance vector (AODV) was employed for node selection to attain the shortest path strategy in existing techniques. In the proposed system, the hybrid AODV (HAODV) technique incorporates the MFR (Most Forward within Radius) technique to detect the shortest path routing algorithm. The MFR method was deployed for selecting the neighbor node, while HAODV was deployed to find the shortest path. To find the shortest path based on the updating equation, the Firefly algorithm is also implemented into the Hybrid AODV. The proposed work’s performance is calculated by different network parameters like the end to end delay, average routing overhead, throughput, and packet delivery ratio. After comparing AODV and DSR algorithms, the proposed algorithm (HAODV) shows improvement in packet delivery ratio, end-to-end delay, Routing overhead, and throughput.


Author(s):  
Nitin Chouhan ◽  
Uma Rathore Bhatt ◽  
Raksha Upadhyay

: Fiber Wireless Access Network is the blend of passive optical network and wireless access network. This network provides higher capacity, better flexibility, more stability and improved reliability to the users at lower cost. Network component (such as Optical Network Unit (ONU)) placement is one of the major research issues which affects the network design, performance and cost. Considering all these concerns, we implement customized Whale Optimization Algorithm (WOA) for ONU placement. Initially whale optimization algorithm is applied to get optimized position of ONUs, which is followed by reduction of number of ONUs in the network. Reduction of ONUs is done such that with fewer number of ONUs all routers present in the network can communicate. In order to ensure the performance of the network we compute the network parameters such as Packet Delivery Ratio (PDR), Total Time for Delivering the Packets in the Network (TTDPN) and percentage reduction in power consumption for the proposed algorithm. The performance of the proposed work is compared with existing algorithms (deterministic and centrally placed ONUs with predefined hops) and has been analyzed through extensive simulation. The result shows that the proposed algorithm is superior to the other algorithms in terms of minimum required ONUs and reduced power consumption in the network with almost same packet delivery ratio and total time for delivering the packets in the network. Therefore, present work is suitable for developing cost-effective FiWi network with maintained network performance.


2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.


Author(s):  
Rajnesh Singh ◽  
Neeta Singh ◽  
Aarti Gautam Dinker

TCP is the most reliable transport layer protocol that provides reliable data delivery from source to destination node. TCP works well in wired networks but it is assumed that TCP is less preferred for ad-hoc networks. However, for application in ad-hoc networks, TCP can be modified to improve its performance. Various researchers have proposed improvised variants of TCP by only one or two measures. These one or two measures do not seem to be sufficient for proper analysis of improvised version of TCP. So, in this paper, the performance of different TCP versions is investigated with DSDV and AODV routing Protocols. We analyzed various performance measures such as throughput, delay, packet drop, packet delivery ratio and number of acknowledgements. The simulation results are carried out by varying number of nodes in network simulator tool NS2. It is observed that TCP Newreno achieved higher throughput and packet delivery ratio with both AODV and DSDV routing protocols.Whereas TCP Vegas achieved minimum delay and packet loss with both DSDV and AODV protocol. However TCP sack achieved minimum acknowledgment with both AODV and DSDV routing protocols. In this paper the comparison of all these TCP variants shows that TCP Newreno provides better performance with both AODV and DSDV protocols.


Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zafar Iqbal ◽  
Heung-No Lee ◽  
Saeid Nooshabadi

Cooperation among sensors in a wireless sensor network, deployed for industrial monitoring in an indoor scenario, is a topic of interest in the smart factory and smart city research. The indoor wireless communication channel is very harsh and the observations of all the sensors cannot be sent reliably to the base station. Failure to transmit correct sensing results to the base station may result in false alarms or missed detection of events. Therefore, we propose a cooperation scheme for the wireless sensors to send the data reliably to the base station. Our aim is to increase the reliability of the received information, reduce the probability of error, lower the overall power consumption, and keep the latency to an acceptable low level. We propose a reliability factor feedback algorithm to adjust the weight of unreliable sensors in the decision-making process. The proposed scheme is analyzed based on its latency, power consumption, and packet delivery ratio. Our results show significant improvement in the reliability of the received data, improved packet delivery, and reduced false alarm ratio for full repetition and cluster head-based cooperation. The power consumption and latency in data transmission are also kept to an acceptable low level.


Sign in / Sign up

Export Citation Format

Share Document