Fatemeh Najafi* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 6, Issue No.

2, 256 - 260

Formatting A novel Clustering protocol based on Artificial Immune System algorithm for Wireless Sensor Networks
Fatemeh Najafi
Department of Computer, Science and Research Branch, Islamic Azad University Khouzestan, Iran Najafi_un@yahoo.com

Mashaalah Abbasi Dezfouli

Department of Computer, Science and Research Branch, Islamic Azad University Khouzestan, Iran Abbasi_masha@yahoo.com

Habib Rostami
Electrical Engineering Department, School of Engineering, Persian Gulf University of Bushehr, Bushehr 75168, Iran habib@pgu.ac.ir

Keywords-

Artificial Immune System; networks; clustering; energy consumption.

I.

Wireless sensor networks are developing quickly and have been widely used in both military and civilian applications such as target tracking, surveillance, and security management. Since a sensor is a small, lightweight, un-tethered, batterypowered device, it has limited energy. Therefore, energy consumption is a critical issue in sensor networks. Clustering a network for keeping the total distance to a minimum is the NP-hard problem [5]. In this paper, we propose a clustering protocol based on Artificial Immune System algorithm called AISCP. We have simulated proposed protocol and compared it with LEACH protocol. The results of simulation show the superiority of the proposed mechanism. Here, we suggest an Artificial Immune System algorithm for clustering sensor nodes and selection of the minimum of clusters. In this way the total of connecting distances and the use of energy will decrease effectively and the longevity of network will increase.

IJ
ISSN: 2230-7818

A
INTRODUCTION

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
II.
Wireless sensor

Abstract Wireless sensor networks find applications in various fields varying from environment monitoring, military applications to monitoring patients in hospitals. Long communication distances between sensors and a sink in a sensor network can greatly drain the energy of sensors and reduce the lifetime of a network. In proposed method, the total transmission distance is the main factor we try to minimize. In addition, the number of cluster heads can factor into the function. By clustering a sensor network into a number of independent clusters using an AIS algorithm, we can greatly minimize the total communication distance, thus prolonging the network lifetime. Simulation results show that our algorithm can quickly find a good solution.

The remaining of this paper is organized as follow: original RELATED WORK is explained in section 2. LEACH protocol in section 3. Artificial Immune System models are discussed in section 4. Proposed mechanism is explained in section 5. Simulation results are shown in section 6. Section 7 is the conclusion. RELATED WORK

A number of clustering algorithms have been proposed in this regard during the pat recent years [1]-[17] most of which are heuristic and are aimed at minimizing the number of clusters. Some algorithms organize the sensors into clusters until minimizing energy use for collecting data and relating data in the main station is required. Perhaps the first Approach to clustering heuristic algorithm is indicator-based One which is called Linked Cluster Algorithm (LCA) [3]. If a sensor is the highest number of identification among all neighboring sensors with one hop, it is then chosen as the cluster-head or branchhead. Heuristic link oriented algorithms [8], [9] choose those sensors with the utmost number of one-hop neighbors as cluster-heads. Weighted Clustering Algorithms (WCA) [5] applies the number of neighbors, transmission power, mobility, and battery use in choosing clusters. This would limit the number of sensors in one branch so that the sensors can handle the load not decreasing their performance. These Clustering approaches depend on synchronized operation of data exchange among sensors and, for instance, these algorithms get limited as compared to smaller networks [21]. Low-energy adaptive clustering hierarchy (LEACH) [10] uses randomized rotation of cluster heads to keep energy load among sensors in equilibrium in order to adjust scaling and strength and hence provide the use of cluster-head. LEACH-C (centralized) uses a centralized controller. The major shortcomings of these algorithms are the necessities and choice of non-automatic cluster-heads in a way that the position of all sensors must be determined. Ad-hoc algorithms portrayed in source no [12] enjoy a specified choice of cluster-head.

Page 256

Fatemeh Najafi* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 6, Issue No. 2, 256 - 260

III.

A
LEACH PROTOCOL

All of the above algorithms assume a fixed number of clusters. We would like to solve a much harder problem where we do not know the number of clusters in advance. Our approach uses a AIS to determine both the number and location of the cluster-heads that minimizes the communication distance in a sensor network.

This work is motivated by Heinzelman ET all's paper [22] Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks which describes a clustering-based protocol called LEACH. They compare the performance of LEACH with direct communication and MTE. They use a predetermined optimal number of clusters in their simulations. LEACH [23] is one important well known hierarchical routing protocol. The operation of LEACH is broken up into rounds, where each round begins with a set-up phase, when the clusters are organized, followed by a steady-state phase, when data transfers to the base station occur. Initially, each node chooses a random number between 0 and 1. If the number is less than a threshold which is obtained by (1), the node becomes a cluster head for the current round. Cluster head for the current round broadcasts an advertisement message to the

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
V. A. Problem statement

Simulation results suggested that extending the life of network compared to that of original LEACH protocol was possible. In source [13] clustering via minimizing energy use in wireless sensor networks has been applied. The authors adopted the energy model in source [10] and used subtractive clustering algorithm and Fuzzy C Algorithm (FCM) to form cluster heads. The authors in source [17] proposed a cluster hierarchy (when used energy in connecting data with the source station is minimized). They use the obtained results in source [18] to arrive at the optimal parameters of algorithm and analyze the number of cluster heads in each level of clustering. Most of these design approaches are special protocols with this explanation that each sensor must protect and preserve a complete set of minor sensors with cluster-heads in order to imagine the network through mental approaches [1]-[9]. Algorithms proposed in sources [10]-[13] focus on reducing energy use not declaring the number of gathered cluster-heads by protocols so that sources [1] and [5] specify the average number of cluster-heads through simulation. As for most of these algorithms, there exists no analysis of the number clusters. The method used in the present paper is basically a distributed algorithm in which each sensor uses an Ad-hoc deadline timer and setting criterion in order to determine whether it can become a cluster-head or not. This algorithm operates without any centralizing controller and there is no need to recognize the place of sensors. Based on simplified models, an estimate of the number of cluster heads is made and a simple prediction formula is formed to estimate and explain the performance of the proposed algorithm. In order to maximize energy use of the algorithm, the results presented in source [20] were utilized to investigate the situations (that is, where transition range at least makes sure that the network enjoys a high connection power). The performance of the algorithm is then investigated using both simulation and analysis instances.

rest of the nodes. The non-cluster head nodes must keep their receivers on during this phase of set-up to hear the advertisements of all the cluster head nodes and decides the cluster to which it will belong for this round. The cluster-head node creates a TDMA schedule telling each node when it can transmit and broadcast back to the nodes in the cluster. Once the clusters are created and the TDMA schedules fixed, data transmission can begin. If n G T (n) = P / (1 P*(r mod (1/P))) Otherwise (1) T (n) = 0 The rounds and time slots in LEACH protocol are shown in Fig.1. The time slots are assigned to cluster members based on TDMA mechanism. At each time slot, cluster head communicates with one of its members and receives the information from it. After some time slots, the cluster head sends the received information to the sink node. For distributing the load among different nodes, at the end of each round the cluster heads are changed based on mentioned mechanism. IV.

AIS are distributed adaptive systems for problem solving using models and principles derived from the Human Immune System [24]. The capabilities of the NIS is mainly the inner working and cooperation between the mature T-Cells and BCells that is responsible for the secretion of antibodies as an immune response to antigens. The various theories with regards to the functioning and organizational behavior of the natural immune system (NIS), is discussed. These theories inspired the modeling of the NIS into an artificial immune system (AIS) for application in non-biological environments. Many different AIS algorithm models have been built, including Classical View Models, Clonal Selection Theory Models, Network Theory Models and Danger Theory Models. Artificial Immune Systems have been successfully applied to many problem domains. Some of these domains range from network intrusion and anomaly detection, to data classification models, virus detection, concept learning, data clustering, robotics, pattern recognition and data mining [25]. PROPOSED METHOD

The base station uses an Artificial Immune System to create energy-efficient clusters for a given number of transmissions. The node is represented as a bit of a cell. The head and member nodes are represented as 1s and 0s, respectively. A cell consists of several ids. The best id is selected as memory cell.

The Artificial Immune System algorithm outcome identifies suitable clusters for the network. The base station broadcasts the complete network details to the sensor nodes. These broadcast messages include: the query execution plan, the number of cluster heads, the members associated with each cluster head, and the

ARTIFICIAL IMMUNE SYSTEM MODELS

Page 257

Fatemeh Najafi* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 6, Issue No. 2, 256 - 260

number of transmissions for this configuration. All the sensor nodes receive the packets broadcasted by the base station and clusters are created accordingly; thus the cluster formation phase will be completed. This is followed by the data transfer phase. B. Mutation and Memory Cell used in this article Mutation The only operation in Artificial Immune System algorithm is mutation. We suppose that the mutation rate of each cell (cell) has reverse impact on its affinity rate. Node is calculated for each node according to (2). Node = / (affinity cell +) (2) Where is a constant number that is calculated in the way that mutation rate doesnt become less than the determined level. Also is a constant number that should be selected properly in order that mutation rate doesnt exceed the determined level.

C. Affinity parameters The total transmission distance is the main factor we need to minimize. In addition, the number of cluster heads can factor into the function. Given the same distance, fewer cluster heads result in greater energy efficiency. The total transmission distance (total distance) to sink: The total transmission distance, TD, to sink is the sum of all distances from sensor nodes to the Sink (see Fig. 3).

Figure 3. The all distances from sensor nodes to the Sink

Figure 1. A binary number with four different mutation rates

When we have more mutation rate, then the change will be greater. Also, the nodes with less affinity have more mutation and vice versa. The mutation operator is applied to each bit of an individual with a probability of mutation rate. According to (1), when applied, a bit whose value is 0 is mutated into 1 with probability CH/N and vice versa (Fig. 2). x = random number between [0,1] if x < ((CH / N)) ai = complement of ai (01 & 10) else leave ai without any change (1)

The Artificial Immune System algorithm outcome identifies suitable clusters for the network. The base station broadcasts the complete network details to the sensor nodes. These broadcast messages include: the query execution plan, the number of cluster heads, the members associated with each cluster head, and the number of transmissions for this configuration. All the sensor nodes receive the packets broadcasted by the base station and clusters are created accordingly; thus the cluster formation phase will be completed. This is followed by the data transfer phase.

IJ
Figure 2. An example of mutation
ISSN: 2230-7818

ES

Figure 4. The sum of the distances from the nodes to the cluster head and the distance from the head to the sink.

Cluster distance (regular nodes to cluster head, cluster head to sink distance): The cluster distance, RCSD, is the

sum of the distances from the nodes to the cluster head and the distance from the head to the sink. (see Fig. 4)
Transfer energy (E): Transfer energy, E, represents the energy consumed to transfer the aggregated message from the cluster to the sink. For a cluster with m member nodes, cluster transfer energy is defined as follows:

E = i = 1 to m TECHi + ((m-1)*ER) + TECHs

(3)

The first term of Equation 1(TE) shows the energy consumed to transmit messages from m member nodes to the cluster head. The second term ((m-1)*ER) shows the energy consumed by the cluster head to receive m messages from the member nodes. Finally, the third term (TE) represents the energy needed to transmit from the cluster head to the sink. We represent the number of cluster-heads with TCH and the total number of nodes with N.

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

Page 258

Fatemeh Najafi* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 6, Issue No. 2, 256 - 260

D. Affinity function The used energy for conveying the message from cluster to sink and the sending distance are the main factors that we need to minimum them. In addition to these, we can insert the decreasing number of clusters in our function that it can affect the energy function like the decreased sending distance, because the clusters use more energy in spite of other nodes. So affinity function of all the above affinity parameters that we define it like (4).
Affinity cell= (100/E) + (TD - RCSD) / TD+ (10*(N - TCH)) / N (4)

Through observing figure 5 in which the number of alive sensor in each round is shown. This shows the good management in energy consumption which leads to load balancing energy. To evaluate the performance of our protocol, we begin our simulation using 100 nodes distributed randomly across a plain area. The BS is located at position (50, 50) in a 100m*100m field. Each node is equipped with the same initial energy level whose total amount of energy accounts for 0.1Jat the beginning of the simulation. The cluster-head probability P is set to 0.15. Proposed algorithm first node death time as a significant increase compared with leach. Using artificial immune system in selected cluster head and considering the lowest energy difference compared with the affinity level as a function of energy in the node to be uniformly, and this increases the lifetime of sensor network.
Lifetime 100

Affinity threshold=+n*(affinity cell /I =1 to n affinity cell) (5) The cycles of mutation continue until one of these conditions is achieved: The fitness rate of one cell exceeds threshold rate TA. At this condition, this cell is selected for clustering. The numbers of mutation cycles are as threshold rate TM: regarding the affinity of cells, the cell with greater affinity is selected for clustering VI.

ES
20 0 0 50

As we explained here E means the essential energy for sending information from cluster to sink, TD is the total distance of all the nodes to sink, RCSD is the total distance of Regular nodes to clusters and the total distances of all the clusters to sink, N and TCH are the number of all the nodes and clusters. For calculating this function, the amounts of N and TD are fixed, but the amounts of E, TCH and RCSD are changing. The shorter the distance, or the lower the number of clusterheads, the higher the fitness value of an individual is. Our Artificial Immune System tries to maximize the fitness value to find a good solution. The affinity threshold is calculated according to (5).

T
80 Alive Nodes 60 40 100 Time 150

Leach AIS

200

Figure 5. Compression of proposed method with LEACH protocol.

VII. CONCLUSIONS

SIMULATION

To simulate this protocol, a network of hierarchical Wireless sensors in a zone with dimensions of 100100 and the homogeneous (normal) distribution of 100 homogeneous sensors was randomly simulated by MATLAB simulator The Parameters of simulation are listed in table1.

Table 1. Simulation Parameters Value

100 m 100

Parameters

Network size

Node Number(N) E0

0.1 J

E elect fs Do E da L

50 nJ/bit

10 pJ/bit/m2 87 m 5 nJ/bit/signal 4000 bit

In this paper, we presented a new clustering algorithm for minimizing the number of cluster heads. We propose a AISbased method to minimize communication distance in sensor networks via clustering. Our algorithm begins by randomly selecting nodes in a network to be cluster heads. By adjusting cluster-heads based on fitness function, our algorithm is able to find an appropriate number of cluster-heads and their locations. Simulation results show that our approach is an efficient and effective method for solving this problem. In proposed method, the total transmission distance is the main factor we try to minimize. In addition, the number of cluster heads can factor into the function. By clustering a sensor network into a number of independent clusters using an AIS algorithm, we can greatly minimize the total communication distance, thus prolonging the network lifetime. Simulation results show that our algorithm can quickly find a good solution. Camera-ready versions should take into account referees suggested amendments.

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

Page 259

Fatemeh Najafi* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 6, Issue No. 2, 256 - 260

REFERENCES
[1] A. D. Amis, R. Prakash, T. H. P. Vuong, D. T. Huynh, Max-Mim DCluster Formation in Wireless AdHoc Networks in Proceedings of IEEE INFOCOM, March 2000. A.D. Amis, R. Prakash, Load-Balancing Clusters in Wireless Ad Hoc Networks in Proceedings of ASSET 2000 Richardson,Texas, March 2000. D. J. Baker, A. Ephremides, The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm IEEETransactions on Communication, Vol. 29, No. 11, pp. 1694-1701,November 1981. S. Basagni, Distributed Clustering For Ad Hoc Networks, inProceedings of International Symposium on Parallel Architectures,Algorithms and Networks pp. 310-315, June 1999. M. Chatterjee, S. K. Das, D. Turgut, WCA: A Weighted Clustering Algorithm For Mobile Ad hoc Networks, Journal of Cluster Computing, Special issue on Mobile Ad hoc Networking, No. 5, pp. 193-204, 2002. B. Das, V. Bharghavan, Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets in Proceedings of ICC,1997. A. Ephremides, J.E. Wieselthier, D.J. Baker, A Design concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling, Proceeding of IEEE, Vol. 73, No, 1, pp. 56-73, 1987. M. Gerla, J. T. C. Tsai, Multicluster, Mobile, Multimedia Radio Networks Wireless Networks Vol. 1, No. 3, pp. 255-265,1995. A. K. Parekh, Selecting Routers in Ad-Hoc Wireless Networks, in Proceedings of ITS, 1994. C. Y. WEN, ''Distributed Algorithms For Localization And Management in Wireless Ad-Hoc sensor networks, 2005. W. R. Heinzelman, A. Chandrakasan, H. Balakrishnan, An application specific protocol architecture for wireless microsensor network, in press: IEEE Transection on Wireless Networking 2002. M. J. Handy, M. Haase, D. Timmermann, Low energy adaptive clustering hierarchy with deterministic cluster-head selection, 4th International Workshop on Mobile and Wireless Communications Network, pp. 9-11, Sept. 2002. M. N. Halgamuge, S. M. Guru, and A. Jennings, Energy efficient cluster formation in wireless sensor networks, 10th International Conference on Telecommunications, vol.2, pp. 1511-1576, 2003.

[2]

[3]

[4]

[5]

[6] [7]

[8] [9] [10] [11]

[12]

[13]

IJ
ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 260

ES

[14] C. R. Lin, M, Gerla, Adaptive Clustering for Mobile Wireless Networks, IEEE Journal on Selected Areas in Communication,Vol. 16 pp. 1265-1275, September 1997. [15] A. B. McDonald, T. Znati, A Mobility Based Framework for Adaptive Clustering in Wireless Ad-Hoc Networks, IEEE Journal on Selected Areas in Communications. Vol. 17, No. 8, pp. 1466-1487, Aug. 1999. [16] S. Bandyopadhyay, E. J. Coyle, An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks, IEEE-INFOCOM 2003. [17] S.G.Foss, S.A. Zuyev, On a Voronoi Aggregative Process Related to a Bivariate Poisson Process, Advances in Applied Probability, Vol. 28, no. 4, pp. 965-981,1996. [18] ] P. Billlngsley, Probability and Measure John-Wiley & Sons, Inc 1979. [19] Paolo Santi, Douglas M. Blough, Feodor Vainstein, Aprobabilistic analysis for the range assignment problem in ad hocnetworks, Proceedings of the 2nd ACM international symposiumon Mobile ad hoc networking and computing, pps: 212-220, 2001, Long Beach, CA. [20] J. Lundelius, N. Lynch. An Upper and Lower Bound for Clock Synchronization. Information and Control, Vol. 62 1984. [21] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. EnergyEfficient Communication Protocol for Wireless Microsensor Networks. In Proceedings of the Hawaii International Conference on System Science, Maui, Hawaii, 2000. [22] W. R. Heinzelman, A.P. Chandrakasan. An Application-Specific Protocol Architecture for Wireless Micro-sensor Network. IEEE Transactions on Wireless Communications, Vol.1, No.4, 2002. [23] Amir Massoud Bidgoli, Abdol Karim Javanmardi, Amir Masoud Rahmani,Application of AIS algorithm for optimization of TORA protocol in ad hoc network, 2010. [24] Andries P. Engel Brecht, Computational Intelligence An Introduction, second edition, Wiley 2007. [25] Huynh, T. T., and Hong, C. S. Prolonging network lifetimevia intracluster routing in wireless sensor networks. Proceedings of ICMU 2005, April, 162-167. 2005. [26] I. S. Jacobs and C. P. Bean, Fine particles, thin films and exchange anisotropy, in Magnetism, vol. III, G. T. Rado and H. Suhl, Eds. New York: Academic, 1963, pp. 271350.