(IJCSIS) International Journal of Computer Science and Information Security,Vol. 10, No. 1, 201
2
0)(
=
nT
The threshold is set at:If
Gn
∈
(1)otherwisewhere P is the cluster-head probability, r the number of the current round and G the set of nodes thathave not been cluster-heads in the last 1/P rounds.Several disadvantages are there for selecting thecluster-head using only the local information in thenodes. Firstly, since each node probabilistically decides whether or not to becomethe cluster-head, there might be cases when twocluster-heads are selected in close vicinity of eachother increasing the overall energy depleted in thenetwork. Secondly, the number of cluster-head nodesgenerated is not fixed so in some rounds it may bemore or less than the preferred value. Thirdly, thenode selected can be located near the edges of thenetwork; wherein the other nodes will expend moreenergy to transmit data to that cluster-head.Fourthly, each node has to calculate the thresholdand generate the random numbers in each round,consuming CPU cycles. LEACH-C [2] uses acentralized algorithm and provides another approachto form clusters as well as selecting the cluster-headsusing the simulated annealing technique. In [3] eachnode calculates its distance to the area centroidwhich will recommend nodes close to the areacentroid and not the nodes that is central to a particular cluster, cluster centroid.
3. SYSTEM MODEL
In this paper the cluster-heads are elected by the base station in each round by calculating the chanceeach node has to become the cluster-head byconsidering three fuzzy descriptors, nodeconcentration, energy level in each node and itscentrality with respect to the entire cluster. In our opinion a central control algorithm in the base stationwill produce better cluster-heads since the basestation has the global knowledge about the network.Moreover, base stations are many times more powerful than the sensor nodes, having sufficientmemory, power and storage. In this approachenergy is spent to transmit the location informationof all the nodes to the base station (possibly using aGPS receiver). The operation of this fuzzy cluster-head election scheme is divided into two rounds eachconsisting of a setup and steady state phase similar to LEACH. During the setup phase the cluster-headsare determined by using fuzzy knowledge processingand then the cluster is organized. In the steady state phase the cluster-heads collect the aggregated dataand performs signal processing functions to compressthe data into a single signal. The energy expendedduring transmission and reception for a k bit messageto a distance d between transmitter and receiver nodeis given by:E
Tx
(k, d) = E
elec
* k +
ε
amp
*k * d
λ
(2)E
Rx
(k) = E
elec
* k (3)where,
λ
is the path loss exponent and
λ
≥
2 .
3.1. Fuzzy Logic Control
The model of fuzzy logic control consists of afuzzifier, fuzzy rules, fuzzy inference engine, and adefuzzifier. We have used the most commonly usedfuzzy inference technique called Mamdani Method[8] due to its simplicity. The process is performed infour steps:• Fuzzification of the input variables energy,concentration and centrality - taking the crisp inputsfrom each of these and determining the degree towhich these inputs belong to each of the appropriatefuzzy sets.• Rule evaluation - taking the fuzzified inputs, andapplying them to the antecedents of the fuzzy rules. Itis then applied to the consequent membershipfunction (Table 1).• Aggregation of the rule outputs - the process of unification of the outputs of all rules.• Defuzzification - the input for the defuzzification process is the aggregate output fuzzy set chance andthe output is a single crisp number.During defuzzification, it finds the point where avertical line would slice the aggregate set chance intotwo equal masses. In practice, the COG (Center of Gravity) is calculated and estimated over a sample of points on the aggregate output membership function,using the following formula:COG = (
Σμ
A
(x) * x) /
Σμ
A(x)
(4)where,
μ
A
is the membership function of set A.
3.2. Expert Knowledge Representation
Expert knowledge is represented based on thefollowing three descriptors:• Node Energy - energy level available in eachnode, designated by the fuzzy variable energy,• Node Concentration - number of nodes presentin the vicinity, designated by the fuzzy variableconcentration,• Node Centrality - a value which classifies thenodes based on how central the node is to thecluster, designated by the fuzzy variablecentrality.To find the node centrality, the base station selectseach node and calculates the sum of the squareddistances of other nodes from the selected node.Since transmission energy is proportional to d
2
(2),the lower the value of the centrality, the lower the
)1mod(1)(
Pr PPnT
−=
81http://sites.google.com/site/ijcsis/ISSN 1947-5500