Full Text

Abstract

This study proposes a genetic algorithm-based (GA-based) adaptive clustering protocol with an optimal probability prediction to achieve good performance in terms of lifetime of network in wireless sensor networks. The proposed GA-based protocol is based on LEACH, called LEACH-GA herein, which basically has set-up and steady-state phases for each round in the protocol and an additional preparation phase before the beginning of the first round. In the period of preparation phase, all nodes initially perform cluster head selection process and then send their messages with statuses of being a candidate cluster head or not, node IDs, and geographical positions to the base station. As the base station received the messages from all nodes, it then searches for an optimal probability of nodes being cluster heads via a genetic algorithm by minimizing the total energy consumption required for completing one round in the sensor field. Thereafter, the base station broadcasts an advertisement message with the optimal value of probability to the all nodes in order to form clusters in the following set-up phase. The preparation phase is performed only once before the set-up phase of the first round. The processes of following set-up and steady-state phases in every round are the same as LEACH. Simulation results show that the proposed genetic-algorithm-based adaptive clustering protocol effectively produces optimal energy consumption for the wireless sensor network.

References

1. K. P. Ferentinos, T. A. Tsiligiridis, and K. G. Arvanitis, “Energy optimizationof wirless sensor networks for environmental measurements,”in Proceedings of the International Conference on Computational Intelligencefor Measurment Systems and Applicatons (CIMSA), July 2005.International Conference

2. S. Jin, M. Zhou, and A. S. Wu, “Sensor network optimization using agenetic algorithm,” in Proceedings of the 7th World Multiconference onSystemics, Cybernetics and Informatics, 2003.

3. S. Hussain and A. W. Matin, “Base station assisted hierarchical clusterbasedrouting,” in Proceedings of the International Conference onWireless and Mobile Communications (ICWMC). IEEE ComputerSociety, July 2006.

4. A. W. Matin and S. Hussain, “Intelligent hierarchical cluster-basedrouting,” in Proceedings of the International Workshop on Mobility andScalability in Wireless Sensor Networks (MSWSN) in IEEE InternationalConference on Distributed Computing in Sensor Networks (DCOSS),June 2006, pp. 165–172.

5. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energyefficientcommunication protocol for wireless microsensor networks,” inProceedings of the Hawaii International Conference on System Sciences,January 2000.

6. S. Bandyopadhyay and E. J. Coyle, “An energy efficient hierarchicalclustering algorithm for wireless sensor networks.” in Proceedings of theIEEE Conference on Computer Communications (INFOCOM), 2003.

7. N. Trigoni, Y. Yao, A. Demers, J. Gehrke, and R. Rajaramany,“Wavescheduling: Energy-efficient data dissemination for sensor networks,”in Proceedings of the International Workshop on Data Managementfor Sensor Networks (DMSN), in conjunction with the InternationalConfernece on Very Large Data Bases (VLDB), August 2004.

8. V. Mhatre, C. Rosenberg, D. Koffman, R. Mazumdar, and N. Shroff, “Aminimum cost heterogeneous sensor network with a lifetime constraint,”IEEE Transactions on Mobile Computing (TMC), vol. 4, no. 1, pp. 4 –15, 2005.

9. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wirelesssensor networks: A survey,” Computer Networks, vol. 38, no. 4, pp. 393–422, March 2002.

10. D. Estrin, D. Culler, K. Pister, and G. Sukhatme, “Connecting thephysical world with pervasive networks,” IEEE Pervasive Computing,pp. 59 – 69, January-March 2002.

Keywords

genetic algorithm, optimal probability, lifetime, WSN, LEACH.