# Energy Efficient Secure Trust Based Clustering Algorithm for Mobile Wireless Sensor Network

Authors: Eid Rehman; Muhammad Sher; Syed Hussnain Abbas Naqvi; Khan Badar Khan; Kamran Ullah
Journal: Journal of Computer Networks and Communications
 (2017)

---

## Abstract

The main benefit of selecting a suitable node as cluster head (CH) in clustering for wireless mobile sensor networks (MWSNs) is to prolong the network lifetime. But the safe selection of CH is a challenging task by taking security into account. Mostly CH selection algorithms in MWSN do not consider security when selecting CH. We have proposed secure CH selection algorithm by calculating weight of each node to deal with secure selection using minimum energy consumption. The weight of node is a combination of different metrics including trust metric (behaviors of sensor node) which promotes a secure decision of a CH selection; in terms of this, the node will never be a malicious one. The trust metric is definitive and permits the proposed clustering algorithm to keep away from any malignant node in the area to select a CH, even if the rest of the parameters are in its favor. Other metrics of node include waiting time, connectivity degree, and distance among nodes. The selection of CHs is completed utilizing weights of member nodes. The preparatory outcomes acquired through simulation exhibit the adequacy of our proposed scheme as far as average rate of avoiding malicious node as a CH, energy efficiency, and some other performance parameters are concerned.


---

## Body

## 1. Introduction

With the rapid and historic advancement in communication technologies over the last two decades, the wireless sensor networks are matured enough as a capable tool for monitoring the physical world [1]. These networks consist of hundreds or even thousands of autonomous microdevices called motes or simply sensor nodes with sensing, processing, and communication capabilities. A typical wireless sensor network consists of a collection of static, mobile, or a mixture of static and mobile sensor nodes which can communicate with each other for exchanging data efficiently. The wireless sensor networks whose all or some sensors have the capability of movement around the deployed area are called Wireless Mobile Sensor networks (WMSN) [2].The sensor networks are ideally used in commercial, civil, and military applications for continuous event detection and location sensing. WMSN has vast variety of applications including environmental monitoring, observing industry production, oil exploration, acoustic information processing patient monitoring, monitoring of natural or man-made crises like severe weather, earthquakes, volcanic activities, and battle field monitoring [3]. The nodes are limited in the sense of computational power, buffer storage space, and most importantly the energy resources. Grouping sensor into gathering of comparative nature to shape a cluster and select one node as lead to oversee group called cluster head (CH). The CH is dependable to gather information from member nodes and send to the base station for further processing. But due to mobility and frequently change in network topology, the selection of CH is a challenging task. This is because of the way that CHs complete additional work and thus devour more energy contrasted with member nodes during the system operations and this will prompt less than ideal demise causing network partition and in this way disappointment in communication [4].Similarly because of wireless nature, sensor nodes are more vulnerable to attacks. The typical attacks in MWSNs include replay attack, data forwarding attack, and sinkhole attacks. Unfortunately, the current complex security algorithms are inadmissible for MWSN in view of the limited capacities of minimal power of node. Trust administration is central to recognize danger, selfish, and unauthorized nodes. Trust in MWSN is the level of a conviction about the behavior of different nodes. Nodes communication with each other, that is, data and control data stream, is the source of getting the proof of trust in a large portion of trust management algorithms [4].Numerous CH selection algorithms have been proposed for MWSN [5–10]. Most of these CH selection algorithms focus only on energy efficient CH selection. The security aspect of CH nodes is not considered when designing CH selection algorithm. So these algorithms should be designed in such a way which safely chooses CHs by perceiving the bargained hubs and denying them of their CH candidacy in MWSN.This paper presents energy efficient and secure CH selection algorithm based on member nodes trust and some other metrics. The trust metric is unequivocal and permits the proposed CH selection algorithm to maintain a strategic distance from any danger or compromised nodes in the member node to end up noticeably a CH, regardless of the possibility that the rest of the parameters are to support it. Through trust, nodes behavior can be monitored. Remaining metrics include waiting time, connectivity degree of node, and relative mobility of nodes. The waiting time enables all nodes to hold up before transmitting CH declaration messages to stay away from extreme impact and conflict among the nodes. The connectivity of node degree is the amount of nodes in their communication range and relative mobility shows the nodes relative movement with CH. The CH is selected on the basis of weights of member nodes which are calculated based on these parameters. So this strategy ensures the selection of legitimate CHs with high weights.We can enumerate the contributions of our paper as follows:(i)
Safely choosing CHs in cluster by perceiving the malicious node and denying them of their CH nomination(ii)
Energy efficient CH selection which maximizes the lifetime of the global network(iii)
Selecting stable CH in cluster which decreases frequency of CH role of changeThe rest of the paper is organized as follows. Section2 provides the literature review of some well-known cluster head selection algorithms for MWSNs. Section 3 describes the proposed scheme. Section 4 presents the energy consumption model and Section 5 discusses mobility model of our scheme. Section 6 describes the simulation results of our proposed scheme.


## 2. Literature Review

Abbasi and Younis [11] exhibited scientific categorization and order of common bunching plans, then outlined distinctive grouping calculations for WSNs in light of arrangement of variable converge time conventions and consistent converge time, and highlighted their objective, components, complexity, and so forth. LEACH-Mobile (low energy adaptive clustering hierarchy for mobile), in short LEACH-M [6], is a variation of LEACH (low energy adaptive clustering hierarchy), which support node mobility. In LEACH-M, clusters are progressively framed each time the sensor moves, offering high risk of overhead in the cluster setup, but it does not consider the trustworthiness of nodes when clustering.Wang et al. [12] have proposed LEACH-TM (low energy adaptive clustering hierarchy trust transmission). The authors have formed LEACH-TM tradition by utilizing trust diagrams in which CH sets up multiroute with interchange CHs which are going about as switches. The performance of this scheme was discovered to be superior to LEACH as for energy utilization and number of nodes alive in the network but has no concern about node mobility. Watfa et al. [13] have proposed Battery Aware Reliable Clustering (BARC) protocol. This scheme utilizes trust variable and battery recuperation plan for the determination of CH which makes the system more reliable but does not consider the node mobility of node.The author [14] proposed a distributed clustering algorithm for mobile wireless sensor networks shortly called ALM, improving the network stability and saving the energy consumption while keeping the network connectivity, but the security of CH gains no attention. Koucheryavy and Salim [15] exhibited the distributed clustering algorithm (DCA) calculation which utilizes satisfactory basis for CH determination in conjunction with heuristic indicators to create unfaltering and adjusted cluster, but clustering the nodes without the trust of nodes.Trust management system based on neighbor monitoring is proposed [16] for MWNW. In the trust management framework, the trust quality is computed by the neighbor monitoring mechanism and the immediate trust esteem and the roundabout trust quality are consolidated to set up the appropriated trust model to recognize the malevolent nodes. This scheme does not focus on node clustering and CH selection.Dahane et al. [17] presented an algorithm shortly called TCM, which is completely decentralized and goes for making a virtual topology with the reason to minimize regular reelection of the CH and evade by and large rebuilding of the whole network. This scheme chooses the most powerful and safe CHs with the obligation of checking the node in their cluster and maintaining clusters locally. In spite of the fact that the CH selection algorithms utilizing diverse methodology permit guaranteeing the determination of a CHs construct just in light of their high weights registered from the distinctive metrics, lamentably they do not guarantee that the chosen CHs are legitimated node, which is to say if the decision procedure of CHs is protected or not. The execution of this scheme was discovered superior to the LEACH convention concerning the measurements, for example, percentage of node alive, load balancing, and lifetime of the system. Table 1 shows the comparative analysis of these described schemes.Table 1
Comparative analysis of different schemes.
Scheme
CH selection parameter
Trust
Mobility
CH security
LEACH-M [6]
Random number and remoteness
No
Yes
No
LEACH-TM [12]
Random number and trust value
Yes
No
No
[13]
Battery awareness
Yes
No
No
ALM [14]
Weight
No
Yes
No
DCA [15]
Multiparameters
Yes
Yes
No
[16]
No
Yes
Yes
No
TCM [17]
Weight
Yes
Yes
NoIn this paper, our point is to build up a completely disseminated clustering algorithm with a specific end goal to enhance the energy efficiency, stability in cluster, and safe CH selection in a versatile domain. The most important is the secure CH selection by observing the behavior of node using node trust management. The trust metric is decisive and allows the proposed CH selection algorithm to avoid any malicious node in the neighborhood to become a CH, even if the remaining metrics are in its favor.


## 3. Proposed Scheme

The proposed scheme is based on different parameters. So the below following subsections describe these parameters definition and calculation.


### 3.1. Trust Evaluation

In order to detect misbehaving nodes, each node monitors one or more behavioral aspects of its neighbor nodes. Each behavioral aspect is mapped to define trust metric, while trust metrics are combined into aggregated value called trust value. The value which is based only on nodes self-observations is called direct trust. Nodes may rely on recommendations provided by the neighbors to form an opinion on other nodes trustworthiness, which is called indirect trust. Then, both direct and indirect trust values are combined into the total trust value. The trust calculation is done in specific time interval which is called rounds. In particular, nodei will compute total trust of node j as follows in the given equation.The direct trust of nodej is evaluated by node i at time t if these nodes are one-hope neighbor. The proposed cluster scheme is one hope, so node i uses its direct observation toward node j during the periodic trust evaluation round. The following specific detection mechanism has been applied by node i to collect direct observation to evaluate node j, while nodes i and j are one-hop neighbor at time t.A node’s trust worthiness can be evaluated by making qualitative and quantitative analysis of various factor which effect direct trust values. In the proposed scheme, sender is acknowledged (ACK) for sending packets. These factors include the following:(1)
if nodei monitors node j, then ratio of received packets is the confirmed amount of acknowledgments (ACK) sent by node j. This ratio will never be larger than node j ratio. According to the change of the ratio, node I can know whether node j has response forging behavior. If the received packets ratio changes in the consecutive time interval ti,ti-1 and does not have big difference, then node j works normally [18]. Equation (1) calculates the received packet rate ratio.(1)RPi,jt=RPijt-RPijt-1RPijt+RPijt-1.This factor protects from replay ACK attack by monitoring receiving node acknowledged at specific time.(2)
Sending successfully packets rate (SPFi,jt): because of wireless nature, it is possible that the same packets are received from different sources, that is, one time directly from sender, and the same packet is also received from another node for further forwarding. Its realized that each packet transmit by node contains a period stamp and can be recognized efficiently regardless of the possibility that the packets have a similar substance. Equation (2) [18] calculates successful sending of packet rate of node j by node i.(2)SPFi,jt=SPijtSPijt+SFijt,whereSFijt is the requiring number of sent packets and SFijt is the redundant number of sent packets. This factor effects data forward attack by observing the packets of neighbor nodes.(3)
Rate of data forwarding (PFi,jt): it is possible that node j forwards data packets of another node, that is, k, and broadcasts 4 ACK. At that point, node i can gather these ACK packets of node j to acquire the quantity of sending packets. Equation (3) [18] calculates the number of data transmission packets. (3)SFi,jt=SFijt-SFijt-1SFijt+SFijt-1.The change rate ofSFi,jt effectively protects from Sinkhole attack and additionally determine malicious activity of node.(4)
Factor of availability (FAVi,jt): node i transmits HELLO packet for the recognition whether this packet can be gotten by j. On the chance that i gets the ACK-HELLO from j, it is demonstrated that j is accessible. Equation (4) calculates factor availability of neighboring nodes. Equation (4) calculates factor availability of neighboring nodes.(4)FAVi,jt=PAVijtPAVijt+NFAVijt,wherePAVijt is the quantity of packets that has been acknowledged and NFAVijt show the number of packets which has not been acknowledged.Direct trustDTi,jt of node i for node j is calculated as in (5) by combining these trust factors.(5)DTi,jt=w1∗1-RPi,jt+w2∗SPFi,jt+w3∗1-PFi,jt+w4∗FAVi,jt.After the trust calculation, nodei classified the behavior of node j based on the trust value. Equation (6) classified the behavior level (BL) of node as normal and malicious node. When node behavior is greater than or equal to  .8, then the node is declared as malicious and does not take part in CH selection process.(6)Blj=1DTi,jt.It is a normal node if0≤Blj≤0.7.It is a malicious node if0.8≤Blj≤1.


### 3.2. Waiting Time of Node

All sensor nodes calculate the weighting time to decide whether the node itself should be a cluster head or not for themselves. All nodes need to hold up before broadcasting CH declaration messages to evade extreme crash and conflict among the nodes. The waiting time (WI) [19] for node is calculated as follows: (7)WT=WTmax∗α1-EResidualEinitial∗βAvgvik-vn,where WTmax is a predefined maximum waiting time. EResidual and Einitial mean the amount of residual energy of a node and the amount of initial energy, respectively. Avgvik and vn indicate the average velocity of the surrounding nodes and the velocity of each node. A higher remaining energy node with the littlest deviation is probably going to be a CH since its waiting time is shorter.


### 3.3. The Degree of ConnectivityDv of Node i at Time (t)

Find the neighborhood of each nodev (i.e., nodes communication range) which defines its [20] degree, as in (8)Dv=Ni=nidisti,j<txrang,where i≠j, txrang is the communication rang of node, and dist(i,j) shows the distance between nodes i and j.


### 3.4. Relative Mobility of Node

Relative mobility(Rm) of nodes represents the relative mobility among sensor nodes and CH, not the sum of vector of velocities. Main purpose is to form stable clusters. So we have to select nodes with low relative mobility as CHs. Relative mobility can be calculated as [21] in(9)Rm=maxk=1⋯k⁡∑∀ni∈ckvni2+vck2-2vni2vnk2cos⁡θni-θck2,where vck is the velocity of the CH, vni is the moving velocity of member sensor nodes, θni shows the movement angle of sensor nodes, and θck is the movement angle of the CH.


### 3.5. Cluster Head Selection Algorithm

This section focuses only on the CH selection phase. In order to avoid malicious node selection as a CH that frequently changes its status, it is necessary to select a CH that does not move very quickly and is trusted. The cluster head selection is based on node weight and weight consists of a number of parameters including trust computation, waiting time, degree of connectivity, and relative mobility nodes. Equation (10) has been used for the calculation of node weight.(10)Wi=Bl∗α1+WT∗α2+Dv∗α3+Rv∗α4,where α1+α2+α3+α4=1. The node with the highest weight is selected as a CH in cluster for specific round. The benefit of such an algorithm is to the point that the weight parameters (α1+α2+α3+α4) can be adjusted as per the network requirements. The estimations of coefficients αi ought to be picked relying upon the premise of the significance of every metric in the considered MWSNs applications. The computed weight for every sensor depends on the above parameters (Bl,WT,Dv,RV). For instance, it is conceivable to assign a greater value to the metric BL contrasted to other metrics if we promote the safety aspect in the clustering mechanism. It is additionally conceivable to dole out the same worth for every coefficient αi for the situation where all metrics are considered as having the same significance. Initially, nodes are not associated with any clusters. In order to establish a cluster, each sends “‘Hello’” message to its neighboring nodes. When node receives this message, it updates the information which includes the value of its weight metric. Then receiving node compares its metric with others; if its values are smaller, then it waits for an “‘INVITE”’ message which is sent by another CH for inviting it to join its cluster.Every node is shown by a state of vector includingNid, weight, and N status. Since the CH has performed different tasks at the same time such as controlling cluster members, data aggregation, and transmission of this data to base station, so CH selection should be periodical after each round because the CH rapidly exhausts their battery. At the beginning of each round, every sensor calculates its weight and broadcasts a hello message to its neighboring nodes. The hello messages consist of two parts weight and node ID and weight and node CH, where node CH is set to zero. A node having the greatest weight has been selected as CH for the current round. The selected CH broadcasts an advertisement message (ADVCH) including its state vector to its neighboring nodes requesting them to join it. Each neighboring sensor node receives this message and if it does not belong to any cluster, then it compares its weight to the CH weight. If weight is less than CH weight, then this node accepts request as a CH. Algorithm 1 shows the CH selection process.Algorithm 1:The proposed CH selection algorithm.
Output: CH is Selected with CH-ID;
Data: Input: Node-id, Weight
Result: CH Selection
Step  1  N Deploy all the nodes;
Step  2  for  i=1→N  do
if  Ei>0  &&  rmod(1/p)≠0  then
Compute Behavior Level (Bl) // given by (6);
if (Bl≥0.8)
then
Declare as Malicious node and not allow then to
take part in CH selection
Else
Compute Waiting Time // given by (7);
Compute Degree of Connectivity // given by (8);
Compute Relative Mobility // given by (9)
end
end
Step  3 Compute Weight Wi for current round // given (10);
Step  4  for  i=1→N  do
If (weighti≥weighti+1) // if weight of ith node is greater
C
H
i
≡
t
r
u
e;
else
C
H
i
≡
f
a
l
s
e // node ith not be a CH
end
Step  5  if  CHi≡true  then
B
C
(
A
D
V
)
← broadcast an advertisement message
//non-CH node i join into the closest CH;
end


## 3.1. Trust Evaluation

In order to detect misbehaving nodes, each node monitors one or more behavioral aspects of its neighbor nodes. Each behavioral aspect is mapped to define trust metric, while trust metrics are combined into aggregated value called trust value. The value which is based only on nodes self-observations is called direct trust. Nodes may rely on recommendations provided by the neighbors to form an opinion on other nodes trustworthiness, which is called indirect trust. Then, both direct and indirect trust values are combined into the total trust value. The trust calculation is done in specific time interval which is called rounds. In particular, nodei will compute total trust of node j as follows in the given equation.The direct trust of nodej is evaluated by node i at time t if these nodes are one-hope neighbor. The proposed cluster scheme is one hope, so node i uses its direct observation toward node j during the periodic trust evaluation round. The following specific detection mechanism has been applied by node i to collect direct observation to evaluate node j, while nodes i and j are one-hop neighbor at time t.A node’s trust worthiness can be evaluated by making qualitative and quantitative analysis of various factor which effect direct trust values. In the proposed scheme, sender is acknowledged (ACK) for sending packets. These factors include the following:(1)
if nodei monitors node j, then ratio of received packets is the confirmed amount of acknowledgments (ACK) sent by node j. This ratio will never be larger than node j ratio. According to the change of the ratio, node I can know whether node j has response forging behavior. If the received packets ratio changes in the consecutive time interval ti,ti-1 and does not have big difference, then node j works normally [18]. Equation (1) calculates the received packet rate ratio.(1)RPi,jt=RPijt-RPijt-1RPijt+RPijt-1.This factor protects from replay ACK attack by monitoring receiving node acknowledged at specific time.(2)
Sending successfully packets rate (SPFi,jt): because of wireless nature, it is possible that the same packets are received from different sources, that is, one time directly from sender, and the same packet is also received from another node for further forwarding. Its realized that each packet transmit by node contains a period stamp and can be recognized efficiently regardless of the possibility that the packets have a similar substance. Equation (2) [18] calculates successful sending of packet rate of node j by node i.(2)SPFi,jt=SPijtSPijt+SFijt,whereSFijt is the requiring number of sent packets and SFijt is the redundant number of sent packets. This factor effects data forward attack by observing the packets of neighbor nodes.(3)
Rate of data forwarding (PFi,jt): it is possible that node j forwards data packets of another node, that is, k, and broadcasts 4 ACK. At that point, node i can gather these ACK packets of node j to acquire the quantity of sending packets. Equation (3) [18] calculates the number of data transmission packets. (3)SFi,jt=SFijt-SFijt-1SFijt+SFijt-1.The change rate ofSFi,jt effectively protects from Sinkhole attack and additionally determine malicious activity of node.(4)
Factor of availability (FAVi,jt): node i transmits HELLO packet for the recognition whether this packet can be gotten by j. On the chance that i gets the ACK-HELLO from j, it is demonstrated that j is accessible. Equation (4) calculates factor availability of neighboring nodes. Equation (4) calculates factor availability of neighboring nodes.(4)FAVi,jt=PAVijtPAVijt+NFAVijt,wherePAVijt is the quantity of packets that has been acknowledged and NFAVijt show the number of packets which has not been acknowledged.Direct trustDTi,jt of node i for node j is calculated as in (5) by combining these trust factors.(5)DTi,jt=w1∗1-RPi,jt+w2∗SPFi,jt+w3∗1-PFi,jt+w4∗FAVi,jt.After the trust calculation, nodei classified the behavior of node j based on the trust value. Equation (6) classified the behavior level (BL) of node as normal and malicious node. When node behavior is greater than or equal to  .8, then the node is declared as malicious and does not take part in CH selection process.(6)Blj=1DTi,jt.It is a normal node if0≤Blj≤0.7.It is a malicious node if0.8≤Blj≤1.


## 3.2. Waiting Time of Node

All sensor nodes calculate the weighting time to decide whether the node itself should be a cluster head or not for themselves. All nodes need to hold up before broadcasting CH declaration messages to evade extreme crash and conflict among the nodes. The waiting time (WI) [19] for node is calculated as follows: (7)WT=WTmax∗α1-EResidualEinitial∗βAvgvik-vn,where WTmax is a predefined maximum waiting time. EResidual and Einitial mean the amount of residual energy of a node and the amount of initial energy, respectively. Avgvik and vn indicate the average velocity of the surrounding nodes and the velocity of each node. A higher remaining energy node with the littlest deviation is probably going to be a CH since its waiting time is shorter.


## 3.3. The Degree of ConnectivityDv of Node i at Time (t)

Find the neighborhood of each nodev (i.e., nodes communication range) which defines its [20] degree, as in (8)Dv=Ni=nidisti,j<txrang,where i≠j, txrang is the communication rang of node, and dist(i,j) shows the distance between nodes i and j.


## 3.4. Relative Mobility of Node

Relative mobility(Rm) of nodes represents the relative mobility among sensor nodes and CH, not the sum of vector of velocities. Main purpose is to form stable clusters. So we have to select nodes with low relative mobility as CHs. Relative mobility can be calculated as [21] in(9)Rm=maxk=1⋯k⁡∑∀ni∈ckvni2+vck2-2vni2vnk2cos⁡θni-θck2,where vck is the velocity of the CH, vni is the moving velocity of member sensor nodes, θni shows the movement angle of sensor nodes, and θck is the movement angle of the CH.


## 3.5. Cluster Head Selection Algorithm

This section focuses only on the CH selection phase. In order to avoid malicious node selection as a CH that frequently changes its status, it is necessary to select a CH that does not move very quickly and is trusted. The cluster head selection is based on node weight and weight consists of a number of parameters including trust computation, waiting time, degree of connectivity, and relative mobility nodes. Equation (10) has been used for the calculation of node weight.(10)Wi=Bl∗α1+WT∗α2+Dv∗α3+Rv∗α4,where α1+α2+α3+α4=1. The node with the highest weight is selected as a CH in cluster for specific round. The benefit of such an algorithm is to the point that the weight parameters (α1+α2+α3+α4) can be adjusted as per the network requirements. The estimations of coefficients αi ought to be picked relying upon the premise of the significance of every metric in the considered MWSNs applications. The computed weight for every sensor depends on the above parameters (Bl,WT,Dv,RV). For instance, it is conceivable to assign a greater value to the metric BL contrasted to other metrics if we promote the safety aspect in the clustering mechanism. It is additionally conceivable to dole out the same worth for every coefficient αi for the situation where all metrics are considered as having the same significance. Initially, nodes are not associated with any clusters. In order to establish a cluster, each sends “‘Hello’” message to its neighboring nodes. When node receives this message, it updates the information which includes the value of its weight metric. Then receiving node compares its metric with others; if its values are smaller, then it waits for an “‘INVITE”’ message which is sent by another CH for inviting it to join its cluster.Every node is shown by a state of vector includingNid, weight, and N status. Since the CH has performed different tasks at the same time such as controlling cluster members, data aggregation, and transmission of this data to base station, so CH selection should be periodical after each round because the CH rapidly exhausts their battery. At the beginning of each round, every sensor calculates its weight and broadcasts a hello message to its neighboring nodes. The hello messages consist of two parts weight and node ID and weight and node CH, where node CH is set to zero. A node having the greatest weight has been selected as CH for the current round. The selected CH broadcasts an advertisement message (ADVCH) including its state vector to its neighboring nodes requesting them to join it. Each neighboring sensor node receives this message and if it does not belong to any cluster, then it compares its weight to the CH weight. If weight is less than CH weight, then this node accepts request as a CH. Algorithm 1 shows the CH selection process.Algorithm 1:The proposed CH selection algorithm.
Output: CH is Selected with CH-ID;
Data: Input: Node-id, Weight
Result: CH Selection
Step  1  N Deploy all the nodes;
Step  2  for  i=1→N  do
if  Ei>0  &&  rmod(1/p)≠0  then
Compute Behavior Level (Bl) // given by (6);
if (Bl≥0.8)
then
Declare as Malicious node and not allow then to
take part in CH selection
Else
Compute Waiting Time // given by (7);
Compute Degree of Connectivity // given by (8);
Compute Relative Mobility // given by (9)
end
end
Step  3 Compute Weight Wi for current round // given (10);
Step  4  for  i=1→N  do
If (weighti≥weighti+1) // if weight of ith node is greater
C
H
i
≡
t
r
u
e;
else
C
H
i
≡
f
a
l
s
e // node ith not be a CH
end
Step  5  if  CHi≡true  then
B
C
(
A
D
V
)
← broadcast an advertisement message
//non-CH node i join into the closest CH;
end


## 4. Energy Consumption Model

Transmission and receiving cost for a distance ofd for k-bit can be calculated as follows: transmitting cost for k-bit as(11)Et=CicEn∗NB+AmpEN+Dist2RE=CicEn∗NBnAgrEN=CicEn∗NB∗n,where Et is the transmitting cost and CirEn is the energy consumption to run the transmitter circuit. AmpEN is the energy dissipation for the transmission amplifier. The cost of data aggregation is AgrEN and NB denotes the number of transmitted data bits


## 5. Performance Analysis

The proposed solution has been validated through simulation using Table2 parameters and comparing its performance with the LEACH-M, ALM, and TCM algorithms. The proposed scheme aims to preserve as less energy as possible by selecting secure CH and consumes less energy. The result comparison among proposed schemes and LEACH-M, ALM, and TCM has been carried out using the following simulation parameters shown in Table 1.Table 2
Simulation parameters.
Mobility model
Random way point
Number of sensor nodes
100
Length of data packet
512 bytes
Length of control packet
50 bytes
Initial energy
.1 joule
Interface queue types
Drop tail
Communication model
Bidirection
Simulation area
100∗ 100
Speed
1–10 m/sThe main objective of the proposed scheme is to secure the CH selection process with minimum energy consumption, so that to avoid malicious nodes selection as a CH. Because CH carries the whole member data, the selection of malicious node as a CH will definitely waste the network resources and data. Figure1 shows the avoidance rate of malicious nodes selection as a CH. We have deployed 10 nodes as malicious nodes in the whole network to see the avoidance rate of malicious nodes selection. It is clear from Figure 1 that the proposed scheme avoids the malicious node selection as a CH more efficiently because of node behavior measurement through trust management and also avoidance of unauthorized node to join any cluster.Figure 1
Average avoidance rate of malicious node selection as a CH versus number of nodes.Average rate that a compromised node turns into a CH is figured by excluding the CH from the entire cluster which was a compromised node and independent from anyone else. This metric represents how well a cluster formation scheme expels compromised nodes. LEACH-M and ALM have no defense mechanism against compromised node and that is why the average rate of compromised node to become CH is too high. Figure2 shows how many compromised nodes become a CH when the number of compromised nodes increases. It is clear from Figure 2 that our scheme outperforms ALM in spite of the fact that the segregation rate of compromised node is by all accounts too small, and its performance is fairly great in light of the fact that the majority of bargained separators are detached.Figure 2
Average rate of compromised node become CH versus number of compromised nodes.We define one failure as an anomaly node selected to be CH; failure rate is to compute coordinate influence of one malicious node, likewise called unsuccessful anomaly detection rate. Generally, when anomaly node rate is low(5), failure rate is 0. As rate goes up, failure rate additionally goes higher. LEACH-M and TCM are schemes with no trust and authentication mechanism, so it performs worse than ALM and the proposed schemes. In contrast, the proposed scheme is a converged model (trust supervision) with a strong defense to anomaly nodes, so it shows the highest robustness. Figure 3 shows the percentage of failure rate of anomaly nodes.Figure 3
Percentage of failure rate versus anomaly node in parentage.The network lifetime is the time interval from initial deployment of the network until the death of all the live nodes. It can be, for instance, the moment when the remaining sensors die, a percentage of sensors die, the network is partitioned, or the loss of coverage occurs. In the simulation, the proposed scheme measured the time span of the network in which none of the nodes can perform the designated tasks and compared these results with the other approach. Figure4 shows the comparison of the proposed scheme with other schemes in number of nodes that are alive in network in simulation time. As shown in Figure 4, the lifetime of network increases in the proposed scheme because the reselection of CH cannot occur frequently and is also secure.Figure 4
Alive number of nodes versus time.Figure5 shows that nodes died more slowly in the proposed scheme because of stable and trusted nodes selection as a CH. The proposed scheme extends the stability period by selecting suitable CH on the basis of calculated weight using relative trust, less energy consumption ratio, and high success factor. The slow node death rate of the proposed scheme reflected in Figure 5 is to secure efficient and high stability among member and CH.Figure 5
Number of dead nodes and time.The average energy consumption ratio of the entire topology is the average distinction between the initial energy and the final level of remaining energy of network. This metric is important because the energy level of the network used is proportional to the networks lifetime. The lower the energy consumption ratio, the longer the networks lifespan. Figure6 shows energy consumption ratio comparison of the proposed scheme with other schemes. From this chart, it can be seen that the average energy consumption ratio of the proposed scheme is less than LEACH-M, ALM, and TCM, because the proposed scheme first selects most stable and secure CH in cluster.Figure 6
Average energy consumption ratio and time.


## 6. Conclusion

This paper presented secure CH selection algorithm for minimizing the energy consumption ratio. Most of the CH selection algorithms in MWSN do not consider security when selecting CH. We have proposed secure CH selection algorithm by calculating weight of each node to deal with secure selection using minimum energy consumption. The weight of node is combination of different metrics including trust metric (behaviors of sensor nodes) which allowed a secure CH decision of a CH in the sense where this last node will never be a malicious one. The trust metric is decisive and secure and allows the proposed clustering algorithm to avoid any danger malicious node in the neighborhood to become a CH, even if its remaining metrics are in its favor. Other metrics include waiting time of node, node connectivity degree, and distance among nodes. The simulation demonstrates that the proposed scheme is greatly improved when contrasted with LEACH-M, ALM, and TCM as far as various measurements and energy consumption ratio of network are concerned.



---

*Source: 1630673-2017-08-28.xml*