DETECTING FAULT NODES IN THE SENSOR NETWORKS

DETECTING FAULT NODES IN THE SENSOR

NETWORKS

Rajya Lakshmi Jaggavarapu

, Ch B V Durga

, Betam Suresh

1

M.Tech Scholar (CSE), Vikas Group of Institutions, Nunna, Vijayawada, A.P, (India)

2

Assistant Professor, Department of CSE at Vikas Group of Institutions, Nunna, Vijayawada, (India)

3

HOD ,Vikas Group of Institutions, Nunna, Vijayawada, A.P, (India)

ABSTRACT

This paper presented to enhance the wireless sensor life time when some sensors nodes are suddenly shut down

conditions by using the fault detection mode recovery algorithm technique. The proposed recovery algorithm

worked based on the combination of genetic algorithm and the diffusion algorithm techniques are included. The

algorithm generates the proper sensing nodes by replace some sensor nodes and some existed reused routing

paths. In our suggested paper the simulation process algorithm enhances the active nodes up to the range of 8.7

times and the recovery algorithm is minimizes the rate of loss of data by nearly 98.8% and decreases the rate of

change of decrement by nearly up to the range of 31.1%.

Keywords: - Grade Diffusion Technique, Genetic Algorithm, Wireless Sensor Networks (WSN),

and Gradient Diffusion Algorithm.

I. INTRODUCTION

A wireless sensor network (WSN) is a wireless system arrangement including of spatially disseminated in

dependent devices with sensors to observe physical or ecological circumstances. Recent generations in micro

processing strategy, wireless and battery knowledge, and elegant sensors have improved data dispensation

wireless announcement, and discoverability. A wireless sensor network arrangement (WSN) often includes

sensor nodes many more approximately like as hundreds or thousands of prepared with sensing, processing and

announcement elements such as limited statement devices over wireless functioning devices. These nodes might

be dispersed over a huge area; e.g., WSNs be able to do area controlling for some process of attention. In such

an application features, the main target of the WSN is to gather information from the surroundings and drive it

to a sink node. While Wireless WSN Networks are essentially dissimilar from the well-known energetic

networks, it is an completely new structural design. Thus some targets creates rise from the two key challenges:

self association and wireless transportation of information of data. First of all, given that the nodes are placed in

a Wireless WSN arrangement are free to move randomly at any instant. So the networks technology of WSN

may transform randomly and speedily at changeable times. This makes direction-finding complex since the

technology is continuously altering and nodes may not be unspecified to have importunate data storage element.

In the most horrible case, we do not maintain even know either the node will motion less wait up to next minute,

since the node will go away from the network at any moment of time. New technologies are developed in micro

processing systems, wireless and battery methodologies are developing, and elegant sensors have enhanced the

superiority of data processing commitment, wireless announcement and recognition ability. In the WSN many

information to the base position in the system. Consequently, WSN consisted many sensor nodes to improve the

sensor area and the broadcast region. Each sensor node in WSNs is prepared with batteries for their energy

source requirements, however it is problematic to recharge or restore batteries since of the unexpected giving off

energy.

II. RELATED WORK

Many strategies have been implemented till at the present for fault identification and improvement. The

proposed a Recovery Algorithm depended on least Distance Redundant Nodes arrangement. By applying

unnecessary nodes suspiciously, the recovery algorithm is employed on the sink node with abandoned energy

amalgamation which propagates the locations of all lively nodes and unneeded nodes in the WSNs. Simulation

consequences displayed that, by selecting suitable number of unneeded nodes, this algorithm may have great

recuperation accuracy and reporting excellence, also accomplish the purpose of belonging the lifetime of WSNs.

The comprehensive the cellular technique and projected a new fault organization mechanism to agreement with

fault recognition and recovery of wsn. They projected a difficult schematic structure to appropriately give out

fault supervision responsibilities among sensor nodes by producing more „self management‟ functions. The

expected failure discovery and improvement algorithm has been checked with some obtainable related work and

established to be more energy competent. It explains that a wireless sensor network collected of many sensor

nodes which are used to observe engaged and harsh environment. Since these nodes are too less and battery

controlled which have restricted energy, faults may happened. Fault acceptance is one of the majority significant

problems in wireless sensor arrangements and must be enlarged as much as potential to neglect faults. In

wireless sensor arrangements which use changing architecture, the process of cluster head is very imperative

and dangerous and fault acceptance in cluster head should be enlarged. Different arrangement sareraising fault

acceptance and fault supervision accessible that have merits and demerits. A method for fault organization in

cluster head is to get better members of faulty come together with identifying new cluster head for them. In this

suggested paper proposed a new recovery algorithm depended on inheritor assortment is proposed. Preceding

algorithms do cluster head assortment. When the fault presented the implemented algorithm does this assortment

once and can choose cluster head quickly and with no too much computation. Simulations results demonstrate

that the projected algorithm has improved presentation in contrast to earlier algorithms. The discussion about

already examined algorithms and accessible process of network fault administration and checked with their

features for a successful one. An energy competent node dependability analysis and recovery for wireless sensor

network arrangements preferred as fault liberal multipath direction-finding process for energy competent

wireless sensor arrangement. The FTMRS is depended on multipath information routing system. One shortest

trail is use for major data routing in FTMRS procedure and other two support paths are used as substitute path

for defective network and to touch the overfull traffic on main control channel. Straight path data routing

generates energy competent data steering. The presentation examination of FTMRS show better consequences

compared to other accepted fault understanding apparoachment in wireless sensor networks.

III. PROPOSED SYSTEM

This paper implemented an algorithm for WSNs depended on the ladder dispersion algorithm collective with the

Fig: Ladder Diffusion Algorithm

The flow chart is exposed in Fig. 1.T he proposed algorithm is engaged to route paths for information relay and

conduction in wireless sensor arrangements, decreasing both power absorption and processing time to construct

the direction-finding table and concurrently avoid the creation of circle routes. Furthermore, to make sure the

security and consistency of data processing, ladder controlling algorithm gives backup routes to pass up wasted

power and generating time when transformation the direction-finding table in case fraction of sensor nodes are

absent. In the future algorithm, the number of non working sensor nodes is premeditated throughout the wireless

sensor arrangements process, and the constraint is calculated consequently.

3.1 Cluster Formation

The sensor nodes are discrete over topography and are unspecified to be energetic nodes throughout clustering.

3.2 Problem Definition

The clustering control limits the allowable degree, D and the number of nodes in each bunch, S. The clustering

aims to connect every joint with one cluster. Each node does not abuse the permissible degree restraint, D and

every cluster do not disobey the size constraint, S although forming the cluster. The number of clusters(C) in the

arrangement is controlled to a less number of N/S, N < C < N/S, where N is the quantity of nodes in the

topography.

3.3 Sensor Network Model

A deposit of sensors isemployed in a square environment. The nodes acquired the following requirements. i)The

sensor has the provided nodes are motionless. Ii). the sensor nodes has the capability of sensing assortment and

a processing range. The operating range can be connected to the sensing limited range, Rt> 2rs. iii.) Two nodes

correspond with each other straight if they are inside the controlling period iv). The sensor nodes are understood

to be standardized i.e. they maintain the same dispensation power and preliminary energy’s) The sensor nodes

are understood to use dissimilar power stages to corresponded within and across bunching elements. vi. The

sensor nodes are implicit to know their position and the restrictions S and D.

3.4 Description of the Clustering Algorithm

At first a group of sensor nodes are isolated in the topography. If suppose that sensor nodes recognize their

location and the restrictions S and D. Algorithms for finding geographic or logical consequences have been

Fig:1 Technology Of The Proposed Paper

In our algorithm, the first step is to estimate Eth and Eic for every node i, N < 1. Eth is the power spent to

correspond with the furthermost next hop fellow citizen. Eic is the total powere xhausted on each link of it

subsequently hop neighbors. Every node i has an original energy, unit. A flag bit generated “enclosed flag” is

second-hand to indicate whether the lump is a member of any come together or not. It is set to 0 for each node

firstly.

Calculation of Eth and Eic: i. Nodes send an announcement hello_msgbeside with their coordinate which are conventional by nodes within the processing range. For pattern in figure (2) nodes a, b, c, d, w, x, yis inside

processing arrangement of v. ii. Behind in unloading of the hello_msg, the node v measures the detachment

flanked by them self and investigated nodes a, b, c, d, w, x, yby means of the coordinates from hello_msg. It

stores the distance di and the places in the dist_bench. iii. Nodes contained by the processing range are the

considerations of a node. In stature nodes w, x, y, bare neighbors of v.

Choosing cluster members: i. the cluster head choose the contiguous D neighbors as after that hop andtransfers them the communication comes together join msg. The bunch join msg concluded of cluster ID, Sa, D, S, with

this flag. Sa is (S- 1) number of after that hop arrangements ii. power is finished when messages are sent. This

energy, Eic is intended and summary from the collect head’s energy. iii. The huddle head’s remaining energy Er

= Einit – Eic. Einit is the original energy when thecome together is shaped by the come mutually head. iv. After

in receipt of the cluster join msg, the nodes throw a message, cluster join refused the msgto the cluster skull if

they are discovered; else they drive a message, cluster join decline msg

IV. CONCLUSION

In existent wireless sensor arrangements, the sensor nodes employ battery power supplies and accordingly have

slight energy resources. In adding to the routing, it is significant to research the controlling and maintenance of

sensor node substitute, plummeting the substitute cost, and reusing the most routing ways when some antenna

nodes are non workable. This paper implemented a fault node revival algorithm for WSN depended on the grade

dispersal algorithm mutual by means ofa genetic algorithm. The FNR algorithm necessitates working fewer

sensor nodes and reuses the most routing paths, growing the WSN life span and reducing the substitute cost. In

the reproduction, the projected algorithm enhances the number of energetic nodes up to 8.7 times. The integer of

dynamic nodes is improved 3.16 times on standard after changing an average of 32 feeler nodes for each

computation. In our suggested paper the simulation process algorithm enhances the active nodes up to the range

of 8.7 times and the recovery algorithm is minimizes the rate of loss of data by nearly 98.8% and decreases the

rate of change of decrement by nearly up to the range of 31.1%. This paper maintains and controlling the faulted

conditions of the nodes of the suddenly shut down the systems and reused nodes conditions they functioned to

control the faults of the nodes.

REFERENCES

[1] Authors AshwiniYenegur1 ,Basawaraj.S.Mathpati “AN ALGORITHM FOR FAULT NODE RECOVERY

OF WIRELESS SENSOR NETWORK” on IJRET: International Journal of Research in Engineering and

Technology eISSN: 2319-1163 | pISSN: 2321-7308.

[2] Pavithra B Raj 1, R Srinivasan “Fault Node Identification and Route Recovery in Distributed Sensor

Networks”on International Journal of Advanced Research in Computer and Communication Engineering

Vol. 3, Issue 5, May 2014

[3] Authors Abolfazl Akbari1 , Arash Dana2 , Ahmad Khademzadeh3 and Neda Beikmahdavi4 on “Fault

Detection and Recovery in Wireless Sensor Network Using Clustering” on International Journal of Wireless

& Mobile Networks (IJWMN) Vol. 3, No. 1, February 2011

[4] J. A. Carballido, I. Ponzoni, and N. B. Brignole, “CGD-GA: A graphbased genetic algorithm for sensor

network design,” Inf. Sci., vol. 177, no. 22, pp. 5091–5102, 2007.

[5] F. C. Chang and H. C. Huang, “A refactoring method for cache-efficient swarm intelligence algorithms,”

Inf. Sci., vol. 192, no. 1, pp. 39–49, Jun. 2012.

[6] S. Corson and J. Macker, Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and

valuation Considerations. New York, NY, USA: ACM, 1999.

[7] M. Gen and R. Cheng, Genetic Algorithms and ngineering Design.New York, NY, USA: Wiley, 1997.

[8] Z. He, B. S. Lee, and X. S. Wang, “Aggregation in sensor networkswith a user-provided quality of service

goal,” Inf. Sci., vol. 178, no. 9,pp. 2128–2149, 2008.

AUTHORS PROFILE

Rajya Lakshmi Jaggavarapu, pursuing M.Tech(CSE) from Vikas Group of Institutions (Formerly known as Mother Theresa Educational Society Group of Institutions), Nunna,

Vijayawada. Affiliated to JNTU- Kakinada, A.P, India

Ch B V Durga, working as an Assistant Professor, CSE department at Vikas College of Engineering and Technology, Nunna, Vijayawada, Affiliated to JNTU-Kakinada, A.P.,

India

Betam Suresh, is working as an HOD, Department of Computer science Engineering at Vikas Group of Institutions (Formerly Mother Teresa Educational society Group of