A GA based Optimized Stable Election Routing Protocol for Hierarchical Clustering in WSN
Mandeep Kaur and Kanwaljit Singh. Article: A GA based Optimized Stable Election Routing Protocol for Hierarchical Clustering in WSN. IJCA Proceedings on National Conference on Innovations and Recent Trends in Engineering and Technology NCIRET(2):20-23, November 2014. Full text available. BibTeX
@article{key:article,
author = {Mandeep Kaur and Kanwaljit Singh},
title = {Article: A GA based Optimized Stable Election Routing Protocol for Hierarchical Clustering in WSN},
journal = {IJCA Proceedings on National Conference on Innovations and Recent Trends in Engineering and Technology},
year = {2014},
volume = {NCIRET},
number = {2},
pages = {20-23},
month = {November},
note = {Full text available}
}
Abstract
Recent advancements in technology have enabled the development of low-cost, low-power sensor devices used in wireless communication. A WSN consist of large number of wireless devices, the sensor nodes, able to take environmental measurements and route these measurements to the base station. These senor nodes are very small in size and are powered by battery. In a WSN, the sensor nodes are deployed randomly in the area of interest. Being battery powered, these sensor nodes lose their energy every time they collect or transmit any information and become inactive. The WSN becomes unstable as the first sensor node dies. Thus the routing protocol should be energy efficient should help in increasing the stability period and so the network lifetime of the WSN. In this paper, the genetic algorithm is used as an optimizing tool for the improvement of lifetime & stability period of the network. For the purpose of optimization the GA is applied on SEP. The proposed protocol, when compared with SEP and LEACH shows better outcomes.
References
- Akkaya, K. & Younis, M. (2005). "A survey on routing protocols for wireless sensor networks", Journal of Ad Hoc Networks 3, pp. 325–349
- Ahn, Chang Wook, and Rudrapatna S. Ramakrishna (2002). "A genetic algorithm for shortest path routing problem and the sizing of populations",Evolutionary Computation, IEEE Transactions on 6. 6 pp. 566-579.
- Banimelhem, O. , Mowafi, M. , & Aljoby, W. (2013). "Genetic Algorithm Based Node Deployment in Hybrid Wireless Sensor Networks". Journal of Communications and Network , pp. 273-279.
- Heinzelman, W. R. , et al. (2000). "Energy-efficient communication protocol for wireless microsensor networks" System Sciences. Proceedings of the 33rd Annual Hawaii International Conference on. IEEE.
- Khalil, E. A. , & Attea, B. A. (2011). "Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks". Journal of Swarm and Evolutionary Computation1 , pp. 195-203.
- Khanna, R. et al. (2006). "Self-organisation of sensor networks using genetic algorithms". International Journal of sensor network , 1, pp. 241-252.
- Kumar, R. , & Jyotishree. (2012). "Blending Roulette Wheel Selection & Rank Selection in Genetic Algorithms". International Journal of Machine Learning and Computing , 2, pp. 365-370.
- Peiravi, A. , et al. (2013). "An optimal energy-efficient clustering method in wireless sensor networks using multi-objective genetic algorithm". International journal of communication systems , 26, pp. 114-126.
- Smaragdakis, Georgios, Ibrahim Matta, and Azer Bestavros (2004) " SEP: A stable election protocol for clustered heterogeneous wireless sensor networks". Boston University Computer Science Department.
- Turgut, Damla, et al. (2002). "Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach" Global Telecommunications Conferenc