Fuzzy Logic Technique to Select Redundant Nodes and form Fault Free Node in Wireless Sensor Networks

Download Full-Text PDF Cite this Publication

Text Only Version


Fuzzy Logic Technique to Select Redundant Nodes and form Fault Free Node in Wireless Sensor Networks

Shradha V. Hulamani School of Electronics and Communication

KLE Technological University Hubballi-580031(India)

Kiran M. R School of Electronics and Communication

KLE Technological University Hubballi-580031(India)

Hemantaraj M. Kelagadi School of Electronics and Communication

KLE Technological University Hubballi-580031(India)

Abstract In Wireless sensor networks, energy dissipation occurs due to high degree of compactness in nodes.Sensor nodes contain less energy and memory ,therefore it is necessary to maintain energy level of nodes.It can be achieved by using Fuzzy logic which groups the data based on similarity and put nodes to sleep mode to balance the energy.After Transmission of data in various rounds their may be node failure and link failure which need to be replaced early for maintaining the performance in network.This can be achieved by making use of Markov model and Fuzzy logic to detect the nodes and replace them quickly.The simulation results show the overall improvement in performance of nodes.

Index TermsFuzzy logic, TDMA, Markov model.


    Wireless Sensor Network are low cost and low power small device extensively used for sensing the environment .It can be defined as network of sensor devices that gather information from the environment and forward it to Base Station. Network is made up of number of sensing nodes which monitor environmental factors like temperature, sound pressure and pass the information by single hop or multiple hop. It is used in variety of applications like military surveillance and health monitoring etc. A large amount of energy consumption happens in data collection and transmission; hence selection of routing protocol is very important to optimize the energy consumption. In this paper, Hierarchical clustering topology gather information more efficiently. In such scenario, Network is split into few groups called Clusters .Each cluster has a Cluster-Head(CH) which collects the information and transfer to Base-Station. By periodically changing the CH the energy consumption can be balanced. To reduce the energy consumption radius is computed where nodes are divided into cluster .Based on similarity of data the nodes , few nodes are put to sleep mode using fuzzy logic. Data transmission in Wireless sensor network is done using TDMA scheduling. The Objective of TDMA is to maximize the time-slot when redundant nodes are in sleep mode by this the nodes which have high information can use the time-slot of sleepy node. In Wireless sensor network there are cases when there is node fault and link fault due to energy depletion. In addition the fault nodes cause network coverage and overall network paralyze. Therefore in order to have good quality service, it is must to identify the nodes and link fault and design for recovery of those faults. Fault detection helps in isolating fault sensors

    and can respond to unpredicted failure. In this paper, Markov model is used to detect the faults and by defining the probability condition the recovery of fault is described.

    Thus the main contribution of this paper is:

    • By gathering the data from the environment and by using the fuzzy logic we select certain redundant nodes based on data similarity and Nodes with high energy level are selected for transmission and other nodes are put into sleep mode to save the energy.
    • Dynamic TDMA Scheduling provide time-slot for every node at every level for data transmission. TDMA used here is dynamic .The advantage of using dynamic TDMA is the time-slots are flexible therefore no information is lost if the nodes have large amount of data.
    • Fault-tolerant is used to detect number of fault nodes. Strong fault-tolerant node and Weak fault- tolerant node. Strong fault nodes manage to transfer the information whereas weak fault cannot and they need to be replaced by other sensor depending on the energy levels of the sensor. Using Markov model we check the reliability of every node and link and then develop fault free network.

    Clustering is most efficient technique in Wireless Sensor Networks. In[1] it has been shown that to increase the stability and lifetime of the system design of energy efficient routing protocol is necessary. Selection of Cluster Head is done by monitoring the energy levels , Heterogeneous clustering scheme based on weight election probability

    .In[2]design and analysis of LEACH protocol for sensor network is done for data aggregation using concept of energy-efficient clustering protocol and media access together to achieve good lifetime, latency and quality of service

    .In[3]discussion of two major issues is done .First parameters optimization for WSN and consistency checking is done, Second to increase the lifetime framework of cross layer is incorporated. In[4] scheduling of sleep/wake for low-duty cycle sensor is discussed. In order to decrease the energy consumption and to provide high message delivery performance, formula is optimized to cut down energy consumption with limitation on the message delivery performance.In[5]improvement of unbalanced energy consumption among cluster head is seen.To solve the

    problem energy-efficient unequal clustering algorithm is proposed based on the distance from the Base Station.In[6]Sleep Scheduling and tree-based clustering for energy efficient is proposed. This algorithm saves energy by putting nodes in sleep mode. Minimum spanning tree further reduction of energy consumption is observed. In[7]Sleep Scheduling(SS)tree is proposed which help to reduce the energy consumption by monitoring the sensor capabilities, this paper aims to reduce various issues and provide solution to increase coverage and the operational life time of mesh based sensor network engaged in various surveillance application. In[8]optimized discharge curve based coverage protocol(ODCP) is proposed which help to determines the redundant nodes by using the information of neighbor nodes like battery discharge ,overlap coverage information etc. In[9]Redundancy aware Topology Control Protocol(RTCP) is proposed which exploits the redundant nodes in the same region by dividing into groups which help to maintain the backbone connected by keeping few nodes working and few sleep. It helps to identify equivalent nodes communication based on information ,it allows to keep one sensor node active from every group. In[10]discussion on how to ensure fault tolerance in WSN is seen, In this paper how to detect and recover the fault detected node is seen called as proactive node. Analysis show that analysis of up to fault nodes recovers depends on the threshold node redundancy. In[11] estimation of redundancy nodes is based on comprehensive calculation as dynamic matter, nodes with low redundancy weight force look at high redundancy weights and relocate .In[12]Markov model is developed to characterize Mean time to failure(MTTF) which helps to develop design for various applications .MTTF model could help WSN designers to better meet application necessity by determining MTTF in pre-deployment phase.In[13]To check failures, schemes have been proposed that perform task before a failure happens. Recovery approach have been proposed for single and multi nodes and the results are compared. In[14]routing algorithm in WSN for fuzzy logic is presented,In this paper capability to send data based on different energy levels, distance and load is determined. FL helps to determine and select packets for transmission. In[15] to reduce energy cnsumption novel based distribution approach has been demonstrated which for fuzzy numbers and weight average operators to perform aggregation which is energy efficient .In proposed algorithm it is shown that number of received and sent data can be reduced without effect the quality of services.In[16]BA model describes the distribution of the power law in networks which are complex in terms of dynamic and growing and develop scale free network . The discovery of scale-free properties paves a new way to enhance the invulnerability of network topology. In scale-free WSNs, the small proportion of sensor nodes possesses most connections of the network, and most of the sensor nodes are low-degree, hence it has high resistance.In[17]Model 1 is based upon scale-free and small complex theory and by taking into account characterstics of WSN ,a topology model with small and scall-free concept for heterogenous network is presented.In[18]Model 2 order-free topology for fault-tolerance and intrusion tolerance has been shown.The mathematical expression is derived .


Energy efficient clustering is important technique. Clusters consist of sensor nodes which are grouped in the cluster based on the coverage area. Data-transmission inside the cluster is known as intra-cluster and transmission between the clusters is known as inter-cluster. The cluster members sense the environment value and send to the Cluster Head (CH) by multi-hoping i.e from Secondary parent node to Primary parent node. Figure 1. shown below depicts the network which is divided into several clusters for data transmission.

. indicate the Cluster Head

Figure 1: Clusters in Wireless Sensor Network.

  1. Tree Topology

    We consider a tree topology with Parent Child relation. The basic idea of clustering method is categorize the cluster based on the coverage area .Further the clusters are split into sectors based on the similarity of data as shown in Figure2. For example, single cluster is used to demonstrate the working. For a given tree, the policy that maximize the network lifetime is such that certain group of nodes become energy expended, while the other nodes have still sufficient energy unused. By proper selection of the tree so that each has a different group of expended nodes we obtain a scheduling algorithm which performs very well .In tree topology, the Child node(CN) sense the environment data and sends to the Secondary parent node(SPN),SPN further aggregate the data and depending on the energy levels of primary parent node(PPN) it sends the data to the node which has high level of energy. The PPN sends the collected data to the CH in our example CH1 , CH1 collects the data from various primary parent nodes and send to the sink , sink sends to the BS which is placed far away from the nodes sensing environment. TDMA scheduling is used at various levels of nodes to send the information.

    The advantages of using Tree Topology are as follows:

    1. The Parent nodes always keep tracking the status of the child node, and the connection status is aggregated. Therefore the connection status can be easily understood.
    2. Other hierarchical networks are not affected if one of them is damaged.
    3. Easier maintenance and easy fault detection.

      Fuzzy logic is made use in Tree Topology for splitting of nodes based on similarity and Radius is computed to divide the Network into numerous clusters in order to maintain balanced energy levels in the network.

      Figure 2: Single Cluster divided into Sectors

  2. Fuzzy logic

    Fuzzy logic is used for decision making which helps to reduce energy consumption. Data from the multiple resources are combined and grouped in order to get the conclusion by data fusion. This approach is more systematic and capable mean of achieving more specific data. The main motivation of data fusion is to get greater quality of service for reliability and for specific decisions. Fused data focuses on quality of service and energy consumption as it helps to eliminate redundant nodes in network. Fuzzy logic performs fuzzification, inference and defuzzification as shown in Figure 3. The fuzzification is process which transforms the crisp values to fuzzy linguistic variables. Crisp input data are put down together and converted to a fuzzy set of member functions, terms and linguistic variables . Afterwards, Inference computes the output corresponding to the rules. Eventually, the output is mapped to output using the membership functions in defuzzification [].

    Figure 3. Fuzzy logic Block Diagram

    For every crisp values taken it is converted into Member function which define certainty ,for example for temperature detection the linguistic value for -3 degree can be 30% frozen and 60%cold. fuzzy decision is made using certain rules which consists of rules having all possible combinations for linguistic values that constitute the surroundings. Defuzzification using the Maximum method the output value can be selected by considering the highest value of the Member function. Therefore by performing there different steps we select the redundant nodes which reduce the energy consumption[19].

  3. System Model
    1. Network model:

      Let us consider N number of clusters consisting of nodes which are being distributed irregularly in the field area. The nodes overlook the area continuously and send the information to the BS periodically. Here, symbolizes the i- th sensor node, and set of sensor node is given by S={s1,s2,.sN},|S|=N.

      To decide the specifications(parameters) for our model, following speculations are made:

      1. The position unaware sensors are split uniformly in network.
      2. The BS is distant from the sensing field, located outside the sensing region.
      3. The sensor node can calculate the rough distance from the sender by detecting the signal strength.

        The energy utilization of the nodes in each round can be calculated.

        The Energy First Order Radio model is drawn on to measure the energy consumption [20].The energy spent for sending of k-bit packet from the source to the next destination at a distance (d) can be defined as:

        ETX = kEelec+kfsd2 ,d < d0


        kEelec+kmpd4,d d0

        Eelec is dissipated energy, d is transmission distance. fs is free space factor and mp is multiple factor.d0 is distance threshold.

        The distance threshold can be given as

        d0=/ (2)

        The depleted energy for receiving k-bit of the data is: ERX(k,d)=kEelec (3)

        The depleted energy for data aggregation is given as: Eaggr(k,d)=Eda (4)

        Where Eda is data fusion factor.

    2. Computing Radius:

      The distance should be limited within the threshold d0 for inter-cluster communication to reduce the energy consumption. The CH can send the data directly if transmission is single hop,If the BS is distant from the CH it needs to obtain several multi-path and this will increase the energy consumption of the CH causing quick death of the node and the lifetime of the entire node will reduce .It is must to calculate and set the radius of nodes and form uniformly distributed radius to stabilize the energy consumption.

      The energy consumption of nodes at different level is formularized below .


      The energy utilization by the child nodes in the given range to transmit information to the Parent node is given by :

      The average energy consumed by node is given by: Eavg= Ecluster/ 2 (10)


      Therefore the radius is given by:


      dCH =4 2 dBS (11)

      When a candidate CH broadcasts the message, the nodes within that range can receive the message from the respective CH. The spatial distribution can be restricted within the limited radius during CH selection. Calculation of radius is important as it will directly relate to network lifetime. If number of clusters is few and radius is large it will result in mre energy utilization due to high signal power which is used for transmission at longer distance. Thus computing of radius is important to reduce overhead and maintain balanced energy in network.

    3. Selection of Cluster Head:

      Choosing of CH rely on the radius and probability. Initially, all nodes are treated as ordinary node , based on the remaining energy and distance (with respect to the Base station) CH is selected. Nodes which are close by to the BS have higher probability of getting selected as CH compared to nodes which are at far distance[21-22].

      ET= 0

      2 x x (kEelec +k


      Every node has chance of becoming Cluster Head based on their energy level at various rounds. The probability function is given by

      =k x (Eelec 2 +1

      4 ) (5)


      E (i)

      CHs(i)= x () + (1 )x re


      Here 2x x x dx is amount of nodes in circular area,


      =N/V2 is area density, = 1 percentage of active nodes.


      Where dmax is maximum distance, is the constant

      For monitoring the data received from the nodes the energy consumption by each PN and CH is given by:


      EM=k x (2-1) x Eelec (6) Where ri is circular area radius

      The energy consumption by each PN and CH for data aggregation is given by:


      Eag = k x 2 xEDA (7)

      The energy consumption to forward the data to base station is given by:


      EBS= kEelec x kmp4 (8)

      Ri is the radius distance

      Therefore total energy utilization in cluster is given by: ECluster= ET+ EM+ Eag+ EBS (9)

      parameter, Ere is residual energy, Eini is initial energy.

      The selected CH should have information of the neighbor nodes which are in defined communication range. The selected node modify their information once they are selected.

      The CH node collects information like ID, energy levels of the adjacent nodes after which it broadcast the message to nodes. The nodes which are near by depending on the distance and strength of signal join the respective CH. This reduces the energy consumption by the nodes and energy level is balanced in the entire network. Similarly the PPN and SPN are selected in the same manner.

      After selection is done, sensor nodes send the information and data aggregation is done at different levels .

    4. Selection of Redundant nodes:

      Few sensor nodes are put to sleep mode, to reduce the energy consumption. The member nodes are often located in the adjacent region. Redundant node selection can be determined by using the Fuzzy logic by using optimization strategy[2]. Using fuzzy logic we can group the data with high similarity into the same classification.

      A finite number of sensor nodes will be put to sleep mode from all the section during the scheduling process. The data received by CH from sensor nodes is gathered to an extent, then construction of fuzzy logic is done to form clusters. The data combining accuracy is high and some nodes will be put to sleep mode from all the category. Finally, scheduling mechanism is applied to those redundant node to reduce traffic dispute and communication cost.

      The nodes si and sj are defined as Distance called Confidence, which is indicated as Dis(i , j). The measurement value of the pair of sensor node is close ,if the value is small .For different

      The information contains the CH-ID and the residual energy after receiving the message the other cluster heads copy the candidate CH-table. While CH receives all the information from the member nodes it will store the information and apply fuzz logic to select the redundant nodes.

      Dynamic TDMA is used for scheduling ,TDMA is divided into several slots for transmission of the data which is discussed in the next section.

      Algorithm to determine the sleep nodes

      confidence levels results obtained are different based on the

      classification and then clustering diagram can be formed. Assuming S={s1,s2sn} which denotes the sensor nodes in cluster and n is the defined as number ocluster.

      The TDMA scheduling which determine scheduling time for nodes can be split into m intervals and aij describes the data collected from the nodes sj at time j. A=(aij)nxm defines the original data.

      After standardization, A is transformed to fuzzy logic.

      For each CH

      1. Put up raw logic A
      2. After the data is standardized, it is transformed into a fuzzy logic R.
      3. The nodes are divided into k categories.
      4. for each category v
      5. for each node j,k s(v)
      6. Calculate Del(()()) between the data from node

        Primarily, the shift and standard deviation transformation is

        (), ();

        carried out and the element in the normalized data can be

        given as

        7. ()=arg min{

        ( ()())

        = , (i=1,2,.n, j=1,2,m) (13)

        1. end for
        2. end for


        3. Obtain the redundant nodes set

          Where j=1

          , = 1 ()2


  4. TDMA Scheduling



Flow model:

The transmission are organized into data flow.Each data flow

For the unified dimension it is defined as

1( )

consists parent node(sink node) from each cluster which collects data from the child nodes using fuzzy logic ,the child


(j=1,2.m) (14)

node i.e the source node periodically sense the data from the

1( )1( )

surrounding and transmit it to the secondary parent node, the

primary parent node which has high energy level receives the


Thus the fuzzy logic R=( )nxm can be achieved.

There should be minimum information loss according to the principle of redundant node selection.

The objective function for selecting redundant nodes can be given as:

data and send to the CH1.

Figure 4 below shows the TDMA schedule. Every sensor node of tree topology are assigned with time slots and each node can deliver k-packets. In TDMA scheduling the time-slot is fixed for fixed number of packets. Therefore, dynamic TDMA scheduling is used for 2 main reasons.

  1. If there are few packets in the buffer to that of the

    = arg min

    ((), ())


    time-slot ,the sensor node will remain active till the


    end of time slot, this will lead to energy drain.

  2. If there are packets with greater size to that of fixed

where denote the redundant nodes in v and () denotes i-

time-slot, the data may be lost.

th sensor node in v category.

  1. Scheduling Algorithm

    Energy Efficient Sleep Scheduling Mechanism(EESM) is dispersed mechanism for unequal clusters, it makes decisions for calculating radius and selecting the CH. In order to calculate the radius for selection of cluster heads, EESM considers both residual energy and distance to the BS parameters. In addition, it takes help of fuzzy logic method to determine the radius based on a probabilistic model, which is employed for competition between candidate clusterheads.

    The (CH) broadcasts their information to the adjacent in the competition range(radius) along with the transmission power.

    Figure 4. TDMA scheduling

    In dynamic TDMA if the particular child-nodes energy is reduced the neighboring node which has greater energy level get hold of the data and send in its time-slot i.e TDMA is flexible[23-24].

    Frame consists of time slots and each slot can deliver k packets. If buffer has q-packet the time-slot may vary with that of time slot, The number of packets may be:

    1. Equal to time-slot(q=time-slot)/p>
    2. Less than the time-slot( q < time-slot)
    3. Greater than the time-slot(q > time-slot)

The time-slot can be increased or decreased accordingly.

Cluster Head with maximum energy level is selected as new Cluster Head. The resignation message is sent by the old Cluster Head to its members and it continues as normal node . The message contains the ID of the old Cluster Head and new Cluster Head, the members of the cluster join the new Cluster Head and update their information to it.Further the new active Cluster Head starts functioning.

I. Fault tolerant Sensor Node:

In fault tolerant sensor node model, redundant nodes are assumed to be in standby mode. The redundant node become active only when the active node are detected with fault. For redundant node to be active parameters like Coverage factor , sensor failure rate and link failure rate are considered for Markov model

  1. Coverage factor:The probability that active node is detected correctly if found faulty and replaced is defined by the Coverage factor c.

    c = ce – cu (17)

    where ce is the accuracy in detection the fault sensors and cu defines the probability failure for replacement of the identified defective sensor nodes. The exactness depends upon the average number of sensor neighbor nodes and the probability of sensor node failure f. Empirical relation for ce: ce 1 is given by:

    The changes in the time slot can be done using the

    c = x(1)



    harmonic equation

    H =

    H =




    e (/(())1/()



    where M(f) is function of f equation that determines the

    Where H is harmonic mean, n is the total number of sensor nodes, xi is amount of packets that did not send in particular time-slot. The rules to be followed are:

    1. If H >1,then the time slot must be increased. Higher value of H greater the stability
    2. If H<1,then the time-slot should be decreased.
    3. If none of the time-slot are free,i.e if the packets are equal to the time-slot then no changes are required.
    4. If H0 there is no variation in time-slot.


      Fault tolerance algorithm solves the energy depletion problem of the Cluster Head node by attaining immediate remedy for energy outage nodes[25-27].

      Whenever the Cluster Head nodes suffer from the energy depletion it will be replaced with another CH node. Every node has a chance to become Cluster Head at once, the probability to become a Cluster Head is 1/CH. However the new node which is substitute to the Cluster Head do not effect the overall cluster and execute within the specified time-slot.

      fault detection accuracy.

  2. Sensor Failure rate: It can be characterized by the exponential distribution with a failure rate ft over ts period. Exponential distribution portion in the all-around approximation specifies failure i.e constant failure rate over a small time.

    The exponential failure rate is given by:

    Fs(ts; ft) = f =1-exp(-ft ts) (19)


    The fault sensor node consists 2 states:state1(good/strong)and state 0(bad/weak).The differential equation that describe the Markov model is given by:




    ,()= – a P1(t) (20)




    ,()= – a P0(t) (21)

    Where Pi(t) denotes the probability of the sensor node and

    ,() denote the first order probability. denotes the failure


    rate of active sensor.

    By applying initial conditions P1(0)=0 and P0(0)=0 to equation we get

    P1(t) = (21)

    P0(t) =1- (22)

    The reliability of sensor node is given by:

    Ls(t) =1- P0(t)= P1(t)= = (23) The MTTF of sensor node is given by:

    where st denote the average failure rate.




    MTTFs= L




    Figure 5 : A 2 state non-fault sensor Markov model

    Where MTTF is mean time to failure The average failure rate is given by:

    s= 1 MTTFs



    In 2 state node model the inactive sensor node becomes

    active only after node has been detected as fault by the fault detection algorithm. The Markov model as shown below figure represent the number of sensors which are good, for Markov model the differential equation is given by:




    , ()= – a P2(t) (26)




    ,()= – a c P2(t)- a P1(t) (27)




    , ()= – a(1- c) P2(t)+ a P1(t) (28)

    State 1 and state 2 indicate the active state and state 0 indicate the failed state. Where (1-c) is the probability of fault nodes that cannot be recovered. Therefore by solving the above equation by putting the initial condition conditions P2(0)=0 P1(0)=0 and P0(0)=0 we get:

    P2(t) = (29)

    1 a

    1 a


    P (t) =c t (30)

    Figure 6.A Fault tolerant sensor Markov model

    For sensor fault tolerant model the average failure node mainly depends upon the f because the accuracy depends upon the fault detection algorithm. Hence the fault nodes are calculated for various values using the Markov model.


Link failure adversely affects the network performance and reliability.Link failure(path loss) occurs between the sensor nodes and the sink nodes, hence longest path should be selected for transmission and this causes energy consumption and therefore longest transmission delay.




In link failure model by taking into consideration of energy equations fault nodes are given by:

P0(t) =1+ P1(t)+ P2(t) (31)

Fault tolerant node reliability is given by:

P = (1-(+.2))(1 ()) (23)

L =1- P (t) = P (t)+ P (t)= + c t (31)

Where Y=2

, Z= .

st(t) 0 1 2 a

The MTTF of sensor node is given by:

0 st(t)

0 st(t)


MTTFst= L =1/ +c/ (32)

Y and Z are link between the two nodes

In clustering scheme, if cluster meets ttmin all the nodes satisfy the condition cmin c cmax and if the distance between the adjacent nodes satisfy the distance condition then they are meant to meet improvement of link failure dmin d dmax.

The average failure node is given by:

st= 1



According to condition t tmin

  1. Consider randomly deployed sensors


    P (1-(+.2 )


    ) (24)

  2. If(E T and L T );


    Since cmin c cmax and dmin d dmax we get

    1. Node is Active;
    2. else
    3. Node is Dead;
    4. end if

      =(1-1+ ) (1-1+) (1-1+ ) (25)


      = (1-(+.2 )) (1-(+.2)) (1-(+.2 )) (26) After reducing we get


      (1-(+.))(1 1+ ) P


      (1-(+.2 ))(11+) (27)

      Thus we obtain

      P (1-(+.2 ))(1-1+) (28)

      Therefore the above model meets required lifetime and link fault-tolerance.


      To recover sensor and link failure distributed sensor network using Fuzzy logic is proposed [28-30] .Fuzzy inference is used to procure conclusion from environment known or assumed true values. Using Euclidian distance we calculate distance between two nodes

      d=( )2 + ( )2 (29)

      Path loss can be determined by considering following parameters. Let Ci be the discrete time capacity and, B is the bit-rate (Hz) of channel and the signal to noise ratio as SNR. Capacity of channel can be determined as:

      Ci=B log2(1+SNR) (30)

      Link efficiency is defined as:

      LEFF=Ci/E (31)

      Where E is energyof node. Functions:

      1. Fuzzylogic(LEFF,si)
      2. Send(data , si)
      3. Receive(si, sn)

      Algorithm for Distributed Fuzzy Logic

    5. end for
  1. Data transmission and processing of nodes in DSN is as follows:
    1. If((si )=TRUE)
    2. Data=Fuzzylogic(LEFF,si)
    3. else
    4. Select alternate path for better link efficiency
    5. end if

Selection of efficient fault detection in the DSNs number.

TE is threshold energy and TEFF is threshold level of link efficiency.


Comparsion of fault-tolerance model is generated using Poisson distribution.BA model,Model 1,Model2 and Distributed fuzzy logic model are compared to check the fault-tolerance and incursion tolerance.Initally all the network models are same and during the fault tolerance ,failure nodes are removed at every round.

Figure 7:Fault-Tolerance Comparison

From Figure 7 we can observe that BA model is slightly greater than other model at around 3900 round.As time runs the performance of BA model is completely down and our Proposed model DFL has better results compared to other 3 Models. This shows that DFL model is superior then other model for detection and replacement of the nodes.

Figure 8:Incursion tolerance Comparison

In Incursion tolerance model the nodes CH are randomly taken out from range 0 to 0.3.From Figure 8 it can be seen that DFL model is stronger and cautious against attack. The network lifetime in comparison with other model DFL has good and balanced.

Figure 9:End to End delay

Speed ,Power and Bandwidth are necessary parameters in order to forward the small packets of information. For various values of , graph is shown.

is considered as low speed is considered as high speed. Therefore for various values of the end to end delay is calculated to determine the speed and power required to send the packets of data at the receiver side.

Figure 10: Number of sleep nodes in Network

In Figure 10 we can observe that number of sleep nodes in high density is larger than number of sleep nodes in low density. This shows that number of nodes in sleep mode are high .The number of sleep nodes is stable in higher density which indicates there is stability in energy consumption.


This paper presents fuzzy logic technique which is used for selection of redundant nodes after formation of parent-child relation.The TDMA technique used here is dynamic TDMA which has flexible time slots,this make advantages to nodes which have large amount of data.

Also by using Fuzzy logic we can detect the fault nodes and replace them early using distributed fuzzy technique.The above graphs show the better results using DFL.


  1. Dilip Kumar, Trilok C. Aseri , R.B. Patel, EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks , Computer Communications 32 (2009).
  2. Wendi B. Heinzelman,, Anantha P.Chandrakasan, Hari Balakrishnan, An Application-Specific Protocol Architecture for Wireless Microsensor Networks, ieee transactions on wireless communications, vol. 1, no. 4, october 2002 .
  3. Ozlem Karaca · Radosveta Sokullu · Neeli R. Prasad ·Ramjee Prasad ,Application Oriented Multi Criteria Optimization in WSNs Using on AHP ,Wireless Pers Commun (2012) 65.
  4. Yan Wu, Sonia Fahmy, Ness B. Shroff, Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks with QoS Guarantees, ©2006 ieee.
  5. Runze Wan, Jianjun Lei, Qingwei Xu, Ximei Gou, An Energy- efficient Unequal Clustering Algorithm in Wireless SensorNetworks ,Advanced Materials Research Vol. 629 (2013).
  6. Nguyen Duy Tan, Nguyen Dinh Viet ,SSTBC: Sleep Scheduled and Tree-Based Clustering Routing Protocol for Energy-Efficient in Wireless Sensor Networks, The 2015 IEEE RIVF International Conference on Computing & Communication Technologies.
  7. Rick W. Ha a, Pin-Han Ho , X. Sherman Shen , Junshan Zhang, Sleep scheduling for wireless sensor networks via network flow model Computer Communications 29 (2006).
  8. Avinash More a , Vijay Raisinghani , A node failure and battery- aware coverage protocol for wireless sensor networks, Computers and Electrical Engineering (2017).
  9. Bahia Zebbane, Manel Chenait and Nadjib Badache, Exploiting Node Redundancy for Maximizing Wireless Sensor Network Lifetime, ©2013 IEEE.
  10. In`es El Korbi, Yacine Ghamri-Doudaney, Rimel Jazi and Leila Azouz Saidane ,Coverage-Connectivity based Fault Tolerance Procedure in Wireless Sensor Networks ©2013 IEEE.
  11. Nafaâ Jabeura, Ahmed Nait Sidi Mohb, Mohamed Mahdi Barkiaa A Bully Approach for Competitive Redundancy in Heterogeneous Wireless Sensor Network, Procedia, Computer Science 83 ( 2016


  12. arslan munir, joseph antoon, ann gordon-ross, modeling and analysis of fault detection and fault tolerance in wireless sensor networks acm transactions on embedded computing systems, vol.14, no. 1, article 3, publication date: january 2015.
  13. Mohamed Younis, Sookyoung Lee, Izzet Fatih Senturk and Kemal Akkaya, Topology Management Techniques for Tolerating Node Failure, © Springer-Verlag Berlin Heidelberg 2014.
  14. Shu-Yin Chiang and Jing-Long Wang, Routing Analysis Using Fuzzy Logic Systems in Wireless Sensor Networks, © Springer- Verlag Berlin Heidelberg 2008.
  15. Beatrice Lazzerini+, Francesco Marcelloni+, Massimo Vecchio, Silvio Croce+, Emmanuele Monaldi, A Fuzzy Approach to Data Aggregation to Reduce Power Consumption in Wireless Sensor Networks, ©2006 IEEE.
  16. Haixia Peng_y, Shuaizong Si_, Xuemin (Sherman) Sheny, Hai Zhao, Energy-Efficient and Scalable Clustering Scheme for Wireless Sensor Networks, ©2015 IEEE.
  17. Lifang Liu,1 Xiaogang Qi,2,3 Jilong Xue,4 andMande Xie A Topology Construct and Control Model with Small-World and Scale-Free Concepts for Heterogeneous Sensor Networks, Hindawi Publishing CorporationInternational Journal of Distributed Sensor NetworksVolume 2014.
  18. HaoranLiua,RongrongYina,,BinLiua,YaqianLi, Ascale- freetopologymodelwithfault-toleranceandintrusion- toleranceinwirelesssensornetworks, Computers and Electrical Engineering 000 (2016).
  19. K.S.Arikumar Dr.V.Natarajan L.Sushma Clarence, M. Priyanka, Efficient Fuzzy Logic Based Data Fusion in Wireless Sensor Networks, 2016 Online International Conference on Green Engineering and Technologies (IC-GET).
  20. Ashfaq Ahmad1, Nadeem Javaid1, Muhammad Imran2, Mohsen Guizani3, Ahmad A. Alhamed, An advanced energy consumption model for terrestrial wireless sensor networks, ©2016 IEEE.
  21. Jong-Myoung Kim, Seon-Ho Park, Young-Ju Han and Tai- Myoung Chung, CHEF: Cluster Head Election mechanism using Fuzzy logic in Wireless Sensor Networks, Feb. 17-20, 2008 ICACT 2008
  22. Indranil Gupta, Denis Riordan, Srinivas Sampalli, Cluster-head Election using Fuzzy Logic for Wireless Sensor Networks, © 2005 IEEE.
  23. Winnie Louis Lee, Amitava Datta, and Rachel Cardell-Oliver, FlexiMAC: A flexible TDMA-based MAC protocol for fault- tolerant and energy-efficient wireless sensor networks, 2006 IEEE.
  24. Sungrae Cho, Kalyani Kanuri, Jin-Woong Cho, Jang-Yeon Lee, and Sun-Do June, Dynamic Energy Efficient TDMA-based MAC Protocol forWireless Sensor Networks, © 2005 IEEE.
  25. Vinod Kumar Menaria, S.C. Jain, A. Nagaraju, A fault tolerance based route optimisation and data aggregation using artificial intelligence to enhance performance in wireless sensor networks, Int. J. Wireless and Mobile Computing, Vol. 14, No. 2, 2018.
  26. C.Sivaraj, P.J.A.Alphonse, T.N.Janakiraman, An Energy Efficient Fault tolerance Nested Clustering Algorithm for Routing in Wireless SensorNetworks,IEEE.
  27. Mohamed El Fissaoui Abderrahim BeniHssane Mostafa

    Saadi2, Energy efficient and fault tolerant distribued algorithm for data aggregation in wireless sensor networks, © Springer- Verlag GmbH Germany, part of Springer Nature 2018.

  28. Sara Behzadi1, Mohammad Azad, Fault-tolerant in wireless sensor networks using fuzzy logic, International Research Journal of Applied and Basic Sciences © 2014.
  29. Shahab Tohidy, Ali Khaki Sedigh, Fault Tolerant Fuzzy Control Allocation for Overactuated Systems, 2013 13th Iranian Conference on Fuzzy Systems (IFSC).
  30. Shaocheng tong,Yue Wang, Fault tolerance Control method based on Fuzzy logic system,2008 IEEE.

Leave a Reply

Your email address will not be published. Required fields are marked *